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.r180-tall-171640602500025.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 FlexibleBarrier-PT-06b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640602500025
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 13 08:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Apr 13 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 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 141K 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 FlexibleBarrier-PT-06b-CTLCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2023-12
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2023-13
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2023-14
FORMULA_NAME FlexibleBarrier-PT-06b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716416098120

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 22:14:59] [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 22:14:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:14:59] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2024-05-22 22:14:59] [INFO ] Transformed 542 places.
[2024-05-22 22:14:59] [INFO ] Transformed 621 transitions.
[2024-05-22 22:14:59] [INFO ] Found NUPN structural information;
[2024-05-22 22:14:59] [INFO ] Parsed PT model containing 542 places and 621 transitions and 1533 arcs in 199 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Support contains 106 out of 542 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 542/542 places, 621/621 transitions.
Discarding 143 places :
Symmetric choice reduction at 0 with 143 rule applications. Total rules 143 place count 399 transition count 478
Iterating global reduction 0 with 143 rules applied. Total rules applied 286 place count 399 transition count 478
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 334 place count 351 transition count 430
Iterating global reduction 0 with 48 rules applied. Total rules applied 382 place count 351 transition count 430
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 404 place count 329 transition count 408
Iterating global reduction 0 with 22 rules applied. Total rules applied 426 place count 329 transition count 408
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 429 place count 329 transition count 405
Applied a total of 429 rules in 94 ms. Remains 329 /542 variables (removed 213) and now considering 405/621 (removed 216) transitions.
// Phase 1: matrix 405 rows 329 cols
[2024-05-22 22:14:59] [INFO ] Computed 8 invariants in 14 ms
[2024-05-22 22:14:59] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-22 22:14:59] [INFO ] Invariant cache hit.
[2024-05-22 22:15:00] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2024-05-22 22:15:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (OVERLAPS) 1/329 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:04] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 17 ms to minimize.
[2024-05-22 22:15:04] [INFO ] Deduced a trap composed of 77 places in 179 ms of which 4 ms to minimize.
[2024-05-22 22:15:04] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 13 ms to minimize.
[2024-05-22 22:15:05] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2024-05-22 22:15:05] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2024-05-22 22:15:05] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (OVERLAPS) 405/734 variables, 329/343 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (OVERLAPS) 0/734 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/734 variables, and 343 constraints, problems are : Problem set: 0 solved, 404 unsolved in 23169 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (OVERLAPS) 1/329 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:25] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2024-05-22 22:15:25] [INFO ] Deduced a trap composed of 77 places in 61 ms of which 3 ms to minimize.
[2024-05-22 22:15:25] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 2 ms to minimize.
[2024-05-22 22:15:26] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 2 ms to minimize.
[2024-05-22 22:15:26] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:28] [INFO ] Deduced a trap composed of 80 places in 70 ms of which 2 ms to minimize.
[2024-05-22 22:15:28] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-22 22:15:28] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:15:28] [INFO ] Deduced a trap composed of 79 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:15:28] [INFO ] Deduced a trap composed of 81 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:15:29] [INFO ] Deduced a trap composed of 87 places in 64 ms of which 2 ms to minimize.
[2024-05-22 22:15:29] [INFO ] Deduced a trap composed of 81 places in 70 ms of which 1 ms to minimize.
[2024-05-22 22:15:29] [INFO ] Deduced a trap composed of 81 places in 56 ms of which 2 ms to minimize.
[2024-05-22 22:15:29] [INFO ] Deduced a trap composed of 77 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/329 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (OVERLAPS) 405/734 variables, 329/357 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 404/761 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:35] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:15:35] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 1 ms to minimize.
[2024-05-22 22:15:36] [INFO ] Deduced a trap composed of 180 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:15:36] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 2 ms to minimize.
[2024-05-22 22:15:38] [INFO ] Deduced a trap composed of 79 places in 52 ms of which 1 ms to minimize.
[2024-05-22 22:15:39] [INFO ] Deduced a trap composed of 85 places in 52 ms of which 1 ms to minimize.
[2024-05-22 22:15:40] [INFO ] Deduced a trap composed of 190 places in 96 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/734 variables, 7/768 constraints. Problems are: Problem set: 0 solved, 404 unsolved
[2024-05-22 22:15:44] [INFO ] Deduced a trap composed of 172 places in 84 ms of which 2 ms to minimize.
[2024-05-22 22:15:45] [INFO ] Deduced a trap composed of 105 places in 77 ms of which 1 ms to minimize.
[2024-05-22 22:15:45] [INFO ] Deduced a trap composed of 78 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 3/771 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 734/734 variables, and 771 constraints, problems are : Problem set: 0 solved, 404 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 30/30 constraints]
After SMT, in 53377ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 53400ms
Starting structural reductions in LTL mode, iteration 1 : 329/542 places, 405/621 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54136 ms. Remains : 329/542 places, 405/621 transitions.
Support contains 106 out of 329 places after structural reductions.
[2024-05-22 22:15:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 22:15:53] [INFO ] Flatten gal took : 61 ms
[2024-05-22 22:15:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FlexibleBarrier-PT-06b-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-06b-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:15:53] [INFO ] Flatten gal took : 23 ms
[2024-05-22 22:15:53] [INFO ] Input system was already deterministic with 405 transitions.
Support contains 93 out of 329 places (down from 106) after GAL structural reductions.
RANDOM walk for 40000 steps (770 resets) in 1699 ms. (23 steps per ms) remains 16/56 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 8 ms. (444 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 7 ms. (500 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 7 ms. (500 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (11 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 8 ms. (444 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 7 ms. (500 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 8 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (9 resets) in 16 ms. (235 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (10 resets) in 8 ms. (444 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (11 resets) in 7 ms. (500 steps per ms) remains 14/14 properties
[2024-05-22 22:15:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 300/329 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 405/734 variables, 329/337 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/734 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/734 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 734/734 variables, and 337 constraints, problems are : Problem set: 0 solved, 14 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp25 is UNSAT
At refinement iteration 1 (OVERLAPS) 300/329 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 22:15:55] [INFO ] Deduced a trap composed of 41 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:15:55] [INFO ] Deduced a trap composed of 50 places in 53 ms of which 1 ms to minimize.
[2024-05-22 22:15:55] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:15:55] [INFO ] Deduced a trap composed of 70 places in 87 ms of which 2 ms to minimize.
[2024-05-22 22:15:55] [INFO ] Deduced a trap composed of 91 places in 84 ms of which 4 ms to minimize.
[2024-05-22 22:15:56] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2024-05-22 22:15:56] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:15:56] [INFO ] Deduced a trap composed of 84 places in 64 ms of which 2 ms to minimize.
[2024-05-22 22:15:56] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-22 22:15:56] [INFO ] Deduced a trap composed of 47 places in 63 ms of which 2 ms to minimize.
[2024-05-22 22:15:56] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:15:56] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 12/20 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 405/734 variables, 329/349 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/734 variables, 13/362 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 22:15:56] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-05-22 22:15:56] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:15:56] [INFO ] Deduced a trap composed of 86 places in 79 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/734 variables, 3/365 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 22:15:57] [INFO ] Deduced a trap composed of 79 places in 87 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/734 variables, 1/366 constraints. Problems are: Problem set: 1 solved, 13 unsolved
[2024-05-22 22:15:57] [INFO ] Deduced a trap composed of 77 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/734 variables, 1/367 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/734 variables, 0/367 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 10 (OVERLAPS) 0/734 variables, 0/367 constraints. Problems are: Problem set: 1 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 734/734 variables, and 367 constraints, problems are : Problem set: 1 solved, 13 unsolved in 2672 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 329/329 constraints, PredecessorRefiner: 13/14 constraints, Known Traps: 17/17 constraints]
After SMT, in 3337ms problems are : Problem set: 1 solved, 13 unsolved
Parikh walk visited 10 properties in 2356 ms.
Support contains 7 out of 329 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 329/329 places, 405/405 transitions.
Graph (trivial) has 297 edges and 329 vertex of which 38 / 329 are part of one of the 6 SCC in 5 ms
Free SCC test removed 32 places
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 297 transition count 314
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 105 place count 245 transition count 314
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 105 place count 245 transition count 299
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 135 place count 230 transition count 299
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 192 place count 173 transition count 242
Iterating global reduction 2 with 57 rules applied. Total rules applied 249 place count 173 transition count 242
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 252 place count 173 transition count 239
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 252 place count 173 transition count 236
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 258 place count 170 transition count 236
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 268 place count 160 transition count 226
Iterating global reduction 3 with 10 rules applied. Total rules applied 278 place count 160 transition count 226
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 287 place count 160 transition count 217
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 361 place count 123 transition count 180
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 372 place count 123 transition count 169
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 384 place count 111 transition count 157
Iterating global reduction 5 with 12 rules applied. Total rules applied 396 place count 111 transition count 157
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 403 place count 111 transition count 150
Free-agglomeration rule applied 66 times.
Iterating global reduction 6 with 66 rules applied. Total rules applied 469 place count 111 transition count 84
Reduce places removed 66 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 86 rules applied. Total rules applied 555 place count 45 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 556 place count 45 transition count 63
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 557 place count 44 transition count 62
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 41 edges and 42 vertex of which 27 / 42 are part of one of the 6 SCC in 0 ms
Free SCC test removed 21 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 4 rules applied. Total rules applied 561 place count 21 transition count 61
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 35 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 36 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 40 rules applied. Total rules applied 601 place count 18 transition count 24
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 604 place count 17 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 605 place count 16 transition count 22
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 608 place count 16 transition count 19
Free-agglomeration rule applied 3 times.
Iterating global reduction 11 with 3 rules applied. Total rules applied 611 place count 16 transition count 16
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 11 with 3 rules applied. Total rules applied 614 place count 13 transition count 16
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 615 place count 13 transition count 15
Applied a total of 615 rules in 104 ms. Remains 13 /329 variables (removed 316) and now considering 15/405 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 13/329 places, 15/405 transitions.
RANDOM walk for 195 steps (0 resets) in 4 ms. (39 steps per ms) remains 0/3 properties
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-22 22:16:00] [INFO ] Flatten gal took : 17 ms
[2024-05-22 22:16:00] [INFO ] Flatten gal took : 18 ms
[2024-05-22 22:16:00] [INFO ] Input system was already deterministic with 405 transitions.
Computed a total of 13 stabilizing places and 13 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 58 place count 271 transition count 347
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 271 transition count 347
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 119 place count 271 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 143 place count 247 transition count 320
Iterating global reduction 1 with 24 rules applied. Total rules applied 167 place count 247 transition count 320
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 174 place count 247 transition count 313
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 185 place count 236 transition count 302
Iterating global reduction 2 with 11 rules applied. Total rules applied 196 place count 236 transition count 302
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 206 place count 236 transition count 292
Applied a total of 206 rules in 18 ms. Remains 236 /329 variables (removed 93) and now considering 292/405 (removed 113) transitions.
// Phase 1: matrix 292 rows 236 cols
[2024-05-22 22:16:00] [INFO ] Computed 8 invariants in 5 ms
[2024-05-22 22:16:00] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-22 22:16:00] [INFO ] Invariant cache hit.
[2024-05-22 22:16:01] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-05-22 22:16:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-22 22:16:03] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2024-05-22 22:16:03] [INFO ] Deduced a trap composed of 66 places in 36 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 292/528 variables, 236/246 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (OVERLAPS) 0/528 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 528/528 variables, and 246 constraints, problems are : Problem set: 0 solved, 291 unsolved in 11781 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 292/528 variables, 236/246 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/528 variables, 291/537 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-22 22:16:16] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 1 ms to minimize.
[2024-05-22 22:16:16] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:16:16] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:16:16] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-05-22 22:16:16] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:16:17] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2024-05-22 22:16:17] [INFO ] Deduced a trap composed of 63 places in 64 ms of which 2 ms to minimize.
[2024-05-22 22:16:17] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2024-05-22 22:16:18] [INFO ] Deduced a trap composed of 66 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:16:19] [INFO ] Deduced a trap composed of 160 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:16:19] [INFO ] Deduced a trap composed of 140 places in 58 ms of which 2 ms to minimize.
[2024-05-22 22:16:19] [INFO ] Deduced a trap composed of 160 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 12/549 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 8 (OVERLAPS) 0/528 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Int declared 528/528 variables, and 549 constraints, problems are : Problem set: 0 solved, 291 unsolved in 18891 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 14/14 constraints]
After SMT, in 30730ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 30734ms
Starting structural reductions in LTL mode, iteration 1 : 236/329 places, 292/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31076 ms. Remains : 236/329 places, 292/405 transitions.
[2024-05-22 22:16:31] [INFO ] Flatten gal took : 17 ms
[2024-05-22 22:16:31] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:16:31] [INFO ] Input system was already deterministic with 292 transitions.
[2024-05-22 22:16:31] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:16:31] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:16:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality15109437277609290052.gal : 8 ms
[2024-05-22 22:16:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality8826444706655403287.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/CTLCardinality15109437277609290052.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8826444706655403287.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 22:17:01] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:17:01] [INFO ] Applying decomposition
[2024-05-22 22:17:02] [INFO ] Flatten gal took : 14 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/graph15219977737820249133.txt' '-o' '/tmp/graph15219977737820249133.bin' '-w' '/tmp/graph15219977737820249133.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15219977737820249133.bin' '-l' '-1' '-v' '-w' '/tmp/graph15219977737820249133.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:17:02] [INFO ] Decomposing Gal with order
[2024-05-22 22:17:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:17:02] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-22 22:17:02] [INFO ] Flatten gal took : 111 ms
[2024-05-22 22:17:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-22 22:17:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality16569736278214224313.gal : 6 ms
[2024-05-22 22:17:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality15507271541038676111.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/CTLCardinality16569736278214224313.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15507271541038676111.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22248e+11,1.20114,46292,2489,470,84517,9186,721,139744,231,25974,0


Converting to forward existential form...Done !
original formula: A((AG(!(((i12.u61.p460==0) * (AF(((i12.u63.p458==0)||(i12.u62.p510==1))) + !(((i12.u63.p419==0)||(i10.i1.u65.p378==1))))))) + EG(!(AX((i1...205
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U EG(!(E(TRUE U !((i2.u16.p118==1)))))))))) * !(E(!(E(TRUE U EG(!(E(TRUE U !((i2.u16.p11...416
Reverse transition relation is NOT exact ! Due to transitions t1, t55, t70, t71, t99, t100, t128, t129, t157, t187, t241, t242, t243, t244, t245, t288, i0....741
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Graph (trivial) has 301 edges and 329 vertex of which 38 / 329 are part of one of the 6 SCC in 3 ms
Free SCC test removed 32 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 296 transition count 318
Reduce places removed 53 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 243 transition count 317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 242 transition count 317
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 109 place count 242 transition count 299
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 145 place count 224 transition count 299
Discarding 59 places :
Symmetric choice reduction at 3 with 59 rule applications. Total rules 204 place count 165 transition count 240
Iterating global reduction 3 with 59 rules applied. Total rules applied 263 place count 165 transition count 240
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 266 place count 165 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 266 place count 165 transition count 236
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 268 place count 164 transition count 236
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 280 place count 152 transition count 224
Iterating global reduction 4 with 12 rules applied. Total rules applied 292 place count 152 transition count 224
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 304 place count 152 transition count 212
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 342 place count 133 transition count 193
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 348 place count 127 transition count 187
Iterating global reduction 5 with 6 rules applied. Total rules applied 354 place count 127 transition count 187
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 360 place count 127 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 366 place count 127 transition count 175
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 368 place count 125 transition count 173
Applied a total of 368 rules in 72 ms. Remains 125 /329 variables (removed 204) and now considering 173/405 (removed 232) transitions.
[2024-05-22 22:17:32] [INFO ] Flow matrix only has 168 transitions (discarded 5 similar events)
// Phase 1: matrix 168 rows 125 cols
[2024-05-22 22:17:32] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:17:32] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 22:17:32] [INFO ] Flow matrix only has 168 transitions (discarded 5 similar events)
[2024-05-22 22:17:32] [INFO ] Invariant cache hit.
[2024-05-22 22:17:32] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
[2024-05-22 22:17:32] [INFO ] Redundant transitions in 5 ms returned []
Running 104 sub problems to find dead transitions.
[2024-05-22 22:17:32] [INFO ] Flow matrix only has 168 transitions (discarded 5 similar events)
[2024-05-22 22:17:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (OVERLAPS) 6/125 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2024-05-22 22:17:33] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 167/292 variables, 125/134 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/293 variables, and 134 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2394 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (OVERLAPS) 6/125 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 167/292 variables, 125/134 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 104/238 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/292 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/293 variables, and 238 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2153 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 125/125 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 1/1 constraints]
After SMT, in 4566ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 4567ms
Starting structural reductions in SI_CTL mode, iteration 1 : 125/329 places, 173/405 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4794 ms. Remains : 125/329 places, 173/405 transitions.
[2024-05-22 22:17:37] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:17:37] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:17:37] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-22 22:17:37] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:17:37] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:17:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality4336269743827549825.gal : 1 ms
[2024-05-22 22:17:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality2703416449317859135.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/CTLCardinality4336269743827549825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2703416449317859135.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,1.39407e+09,0.461493,22524,2,2346,5,97023,6,0,670,71266,0


Converting to forward existential form...Done !
original formula: (EF((p339==1)) + AG(AF(((p536==0)||(p86==1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(E(TRUE U (p339==1)))),TRUE),!(((p536==0)||(p86==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t6, t8, t19, t21, t31, t33, t44, t46, t56, t58, t69, t71, Intersection with reachable at...224
Detected timeout of ITS tools.
[2024-05-22 22:18:07] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:18:07] [INFO ] Applying decomposition
[2024-05-22 22:18:07] [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/graph3776028745730662300.txt' '-o' '/tmp/graph3776028745730662300.bin' '-w' '/tmp/graph3776028745730662300.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3776028745730662300.bin' '-l' '-1' '-v' '-w' '/tmp/graph3776028745730662300.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:18:07] [INFO ] Decomposing Gal with order
[2024-05-22 22:18:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:18:07] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-22 22:18:07] [INFO ] Flatten gal took : 20 ms
[2024-05-22 22:18:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 4 ms.
[2024-05-22 22:18:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality8892115559174715064.gal : 4 ms
[2024-05-22 22:18:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality4652825558494590561.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/CTLCardinality8892115559174715064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4652825558494590561.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39407e+09,0.038286,4780,78,66,1673,538,360,2772,192,837,0


Converting to forward existential form...Done !
original formula: (EF((i5.i1.u13.p339==1)) + AG(AF(((i1.u21.p536==0)||(i2.u3.p86==1)))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(E(TRUE U (i5.i1.u13.p339==1)))),TRUE),!(((i1.u21.p536==0)||(i2.u3.p86==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t71, i0.u1.t69, i1.u4.t58, i1.u5.t56, i1.u21.t2, i3.u7.t46, i3.u8.t44, i4.u10.t33, i4.u...315
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,1.41689,55200,1,0,75265,12150,2074,212041,889,40084,133126
FORMULA FlexibleBarrier-PT-06b-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 269 transition count 345
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 269 transition count 345
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 123 place count 269 transition count 342
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 151 place count 241 transition count 314
Iterating global reduction 1 with 28 rules applied. Total rules applied 179 place count 241 transition count 314
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 188 place count 241 transition count 305
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 199 place count 230 transition count 294
Iterating global reduction 2 with 11 rules applied. Total rules applied 210 place count 230 transition count 294
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 218 place count 230 transition count 286
Applied a total of 218 rules in 26 ms. Remains 230 /329 variables (removed 99) and now considering 286/405 (removed 119) transitions.
// Phase 1: matrix 286 rows 230 cols
[2024-05-22 22:18:08] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 22:18:08] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 22:18:08] [INFO ] Invariant cache hit.
[2024-05-22 22:18:09] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-22 22:18:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 238 constraints, problems are : Problem set: 0 solved, 285 unsolved in 8343 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 285/523 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-22 22:18:20] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 5 ms to minimize.
[2024-05-22 22:18:20] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-05-22 22:18:21] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:18:21] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-22 22:18:22] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-05-22 22:18:22] [INFO ] Deduced a trap composed of 67 places in 56 ms of which 2 ms to minimize.
[2024-05-22 22:18:22] [INFO ] Deduced a trap composed of 159 places in 58 ms of which 2 ms to minimize.
[2024-05-22 22:18:22] [INFO ] Deduced a trap composed of 160 places in 63 ms of which 1 ms to minimize.
[2024-05-22 22:18:23] [INFO ] Deduced a trap composed of 160 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 9/532 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 0/516 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 532 constraints, problems are : Problem set: 0 solved, 285 unsolved in 16102 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 9/9 constraints]
After SMT, in 24491ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 24493ms
Starting structural reductions in LTL mode, iteration 1 : 230/329 places, 286/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24763 ms. Remains : 230/329 places, 286/405 transitions.
[2024-05-22 22:18:33] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:18:33] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:18:33] [INFO ] Input system was already deterministic with 286 transitions.
[2024-05-22 22:18:33] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:18:33] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:18:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality3545664551071253459.gal : 1 ms
[2024-05-22 22:18:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality14347440522184858908.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/CTLCardinality3545664551071253459.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14347440522184858908.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08097e+11,11.867,330096,2,45462,5,1.3092e+06,6,0,1208,1.8053e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:19:03] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:19:03] [INFO ] Applying decomposition
[2024-05-22 22:19:03] [INFO ] Flatten gal took : 14 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/graph16171960211746427889.txt' '-o' '/tmp/graph16171960211746427889.bin' '-w' '/tmp/graph16171960211746427889.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16171960211746427889.bin' '-l' '-1' '-v' '-w' '/tmp/graph16171960211746427889.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:19:03] [INFO ] Decomposing Gal with order
[2024-05-22 22:19:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:19:03] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-22 22:19:03] [INFO ] Flatten gal took : 15 ms
[2024-05-22 22:19:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-22 22:19:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality2031281124424007497.gal : 4 ms
[2024-05-22 22:19:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality1848192040916735443.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/CTLCardinality2031281124424007497.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1848192040916735443.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08097e+11,2.6079,76448,1940,401,130707,5113,687,246374,222,39305,0


Converting to forward existential form...Done !
original formula: EF((EF((u65.p463==0)) * AX(((u65.p497==0)&&(i1.i1.u5.p18==1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * E(TRUE U (u65.p463==0))) * !(EX(!(((u65.p497==0)&&(i1.i1.u5.p18==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t36, t63, t64, t93, t94, t123, t124, t152, t153, t181, t236, t237, t238, t239, t240, u65....735
(forward)formula 0,1,8.48226,211880,1,0,299311,57265,3783,1.03751e+06,1002,235250,631683
FORMULA FlexibleBarrier-PT-06b-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 270 transition count 346
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 270 transition count 346
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 270 transition count 343
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 147 place count 244 transition count 317
Iterating global reduction 1 with 26 rules applied. Total rules applied 173 place count 244 transition count 317
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 181 place count 244 transition count 309
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 192 place count 233 transition count 298
Iterating global reduction 2 with 11 rules applied. Total rules applied 203 place count 233 transition count 298
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 211 place count 233 transition count 290
Applied a total of 211 rules in 14 ms. Remains 233 /329 variables (removed 96) and now considering 290/405 (removed 115) transitions.
// Phase 1: matrix 290 rows 233 cols
[2024-05-22 22:19:12] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:19:12] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 22:19:12] [INFO ] Invariant cache hit.
[2024-05-22 22:19:12] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 289 sub problems to find dead transitions.
[2024-05-22 22:19:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-22 22:19:14] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-22 22:19:14] [INFO ] Deduced a trap composed of 65 places in 37 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/523 variables, 233/243 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (OVERLAPS) 0/523 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Real declared 523/523 variables, and 243 constraints, problems are : Problem set: 0 solved, 289 unsolved in 11297 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 289 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/232 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 1/233 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/233 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (OVERLAPS) 290/523 variables, 233/243 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/523 variables, 289/532 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-22 22:19:27] [INFO ] Deduced a trap composed of 59 places in 70 ms of which 1 ms to minimize.
[2024-05-22 22:19:27] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:19:28] [INFO ] Deduced a trap composed of 66 places in 49 ms of which 2 ms to minimize.
[2024-05-22 22:19:28] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2024-05-22 22:19:29] [INFO ] Deduced a trap composed of 65 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:19:29] [INFO ] Deduced a trap composed of 162 places in 64 ms of which 1 ms to minimize.
[2024-05-22 22:19:29] [INFO ] Deduced a trap composed of 161 places in 61 ms of which 1 ms to minimize.
[2024-05-22 22:19:29] [INFO ] Deduced a trap composed of 165 places in 63 ms of which 2 ms to minimize.
[2024-05-22 22:19:29] [INFO ] Deduced a trap composed of 161 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 9/541 constraints. Problems are: Problem set: 0 solved, 289 unsolved
[2024-05-22 22:19:34] [INFO ] Deduced a trap composed of 162 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (OVERLAPS) 0/523 variables, 0/542 constraints. Problems are: Problem set: 0 solved, 289 unsolved
No progress, stopping.
After SMT solving in domain Int declared 523/523 variables, and 542 constraints, problems are : Problem set: 0 solved, 289 unsolved in 22504 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 233/233 constraints, PredecessorRefiner: 289/289 constraints, Known Traps: 12/12 constraints]
After SMT, in 33851ms problems are : Problem set: 0 solved, 289 unsolved
Search for dead transitions found 0 dead transitions in 33854ms
Starting structural reductions in LTL mode, iteration 1 : 233/329 places, 290/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34196 ms. Remains : 233/329 places, 290/405 transitions.
[2024-05-22 22:19:46] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:19:46] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:19:46] [INFO ] Input system was already deterministic with 290 transitions.
[2024-05-22 22:19:46] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:19:46] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:19:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality5865418733354054781.gal : 1 ms
[2024-05-22 22:19:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality10368553762700436439.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/CTLCardinality5865418733354054781.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10368553762700436439.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17887e+11,21.8753,560980,2,50087,5,2.03926e+06,6,0,1224,3.25647e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:20:16] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:20:16] [INFO ] Applying decomposition
[2024-05-22 22:20:16] [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/graph15825696835359120365.txt' '-o' '/tmp/graph15825696835359120365.bin' '-w' '/tmp/graph15825696835359120365.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15825696835359120365.bin' '-l' '-1' '-v' '-w' '/tmp/graph15825696835359120365.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:20:16] [INFO ] Decomposing Gal with order
[2024-05-22 22:20:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:20:16] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-22 22:20:16] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:20:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 6 ms.
[2024-05-22 22:20:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality11618403146336903181.gal : 4 ms
[2024-05-22 22:20:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality15848670728452312132.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/CTLCardinality11618403146336903181.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15848670728452312132.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.17887e+11,0.99842,37620,1660,591,64165,8651,674,107702,235,42175,0


Converting to forward existential form...Done !
original formula: (AG((((i4.i0.u26.p182==0)||(i7.i1.u37.p226==0))||(i2.i0.u16.p117==1))) + (EX(AG((i9.i0.u54.p309==0))) * EF(((u64.p469==0)||(i0.i0.u13.p71...163
=> equivalent forward existential formula: [(FwdU((Init * !((EX(!(E(TRUE U !((i9.i0.u54.p309==0))))) * E(TRUE U ((u64.p469==0)||(i0.i0.u13.p71==1)))))),TRU...238
Reverse transition relation is NOT exact ! Due to transitions t1, t49, t63, t64, t94, t95, t126, t127, t155, t185, t238, t239, t240, t241, t242, u64.t6, u6...734
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 269 transition count 345
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 269 transition count 345
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 123 place count 269 transition count 342
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 151 place count 241 transition count 314
Iterating global reduction 1 with 28 rules applied. Total rules applied 179 place count 241 transition count 314
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 188 place count 241 transition count 305
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 199 place count 230 transition count 294
Iterating global reduction 2 with 11 rules applied. Total rules applied 210 place count 230 transition count 294
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 218 place count 230 transition count 286
Applied a total of 218 rules in 17 ms. Remains 230 /329 variables (removed 99) and now considering 286/405 (removed 119) transitions.
// Phase 1: matrix 286 rows 230 cols
[2024-05-22 22:20:46] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:20:46] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 22:20:46] [INFO ] Invariant cache hit.
[2024-05-22 22:20:46] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-22 22:20:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 0/516 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 238 constraints, problems are : Problem set: 0 solved, 285 unsolved in 8593 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/516 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/516 variables, 285/523 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-22 22:20:58] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:20:59] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2024-05-22 22:20:59] [INFO ] Deduced a trap composed of 63 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:21:00] [INFO ] Deduced a trap composed of 66 places in 59 ms of which 1 ms to minimize.
[2024-05-22 22:21:00] [INFO ] Deduced a trap composed of 66 places in 63 ms of which 1 ms to minimize.
[2024-05-22 22:21:00] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-05-22 22:21:01] [INFO ] Deduced a trap composed of 161 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/516 variables, 7/530 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/516 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-22 22:21:07] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/516 variables, 1/531 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-22 22:21:13] [INFO ] Deduced a trap composed of 160 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/516 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/516 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 10 (OVERLAPS) 0/516 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 516/516 variables, and 532 constraints, problems are : Problem set: 0 solved, 285 unsolved in 29792 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 9/9 constraints]
After SMT, in 38431ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 38433ms
Starting structural reductions in LTL mode, iteration 1 : 230/329 places, 286/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38692 ms. Remains : 230/329 places, 286/405 transitions.
[2024-05-22 22:21:25] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:21:25] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:21:25] [INFO ] Input system was already deterministic with 286 transitions.
[2024-05-22 22:21:25] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:21:25] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:21:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality4346898474447020926.gal : 1 ms
[2024-05-22 22:21:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality13571501628581769191.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/CTLCardinality4346898474447020926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13571501628581769191.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09552e+11,18.4827,482672,2,38856,5,1.86248e+06,6,0,1208,2.61709e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:21:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:21:55] [INFO ] Applying decomposition
[2024-05-22 22:21:55] [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/graph7148569467194555694.txt' '-o' '/tmp/graph7148569467194555694.bin' '-w' '/tmp/graph7148569467194555694.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph7148569467194555694.bin' '-l' '-1' '-v' '-w' '/tmp/graph7148569467194555694.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:21:55] [INFO ] Decomposing Gal with order
[2024-05-22 22:21:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:21:55] [INFO ] Removed a total of 114 redundant transitions.
[2024-05-22 22:21:55] [INFO ] Flatten gal took : 20 ms
[2024-05-22 22:21:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 22:21:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality448647304185252476.gal : 4 ms
[2024-05-22 22:21:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality16374924336823456030.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/CTLCardinality448647304185252476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16374924336823456030.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.09552e+11,1.20257,44460,1979,563,75822,8189,657,127044,225,42227,0


Converting to forward existential form...Done !
original formula: (EF((i11.u58.p364==1)) * EG(AG(EX((i5.i0.u25.p148==0)))))
=> equivalent forward existential formula: [FwdG((Init * E(TRUE U (i11.u58.p364==1))),!(E(TRUE U !(EX((i5.i0.u25.p148==0))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t48, t64, t65, t93, t94, t122, t123, t153, t167, t183, t235, t236, t238, t239, t240, u65....733
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 272 transition count 348
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 272 transition count 348
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 117 place count 272 transition count 345
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 142 place count 247 transition count 320
Iterating global reduction 1 with 25 rules applied. Total rules applied 167 place count 247 transition count 320
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 174 place count 247 transition count 313
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 185 place count 236 transition count 302
Iterating global reduction 2 with 11 rules applied. Total rules applied 196 place count 236 transition count 302
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 204 place count 236 transition count 294
Applied a total of 204 rules in 19 ms. Remains 236 /329 variables (removed 93) and now considering 294/405 (removed 111) transitions.
// Phase 1: matrix 294 rows 236 cols
[2024-05-22 22:22:25] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 22:22:25] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 22:22:25] [INFO ] Invariant cache hit.
[2024-05-22 22:22:25] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 293 sub problems to find dead transitions.
[2024-05-22 22:22:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 294/530 variables, 236/244 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 0/530 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 530/530 variables, and 244 constraints, problems are : Problem set: 0 solved, 293 unsolved in 9162 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 294/530 variables, 236/244 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 293/537 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 22:22:38] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
[2024-05-22 22:22:38] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:22:39] [INFO ] Deduced a trap composed of 64 places in 65 ms of which 2 ms to minimize.
[2024-05-22 22:22:40] [INFO ] Deduced a trap composed of 65 places in 54 ms of which 1 ms to minimize.
[2024-05-22 22:22:40] [INFO ] Deduced a trap composed of 163 places in 57 ms of which 1 ms to minimize.
[2024-05-22 22:22:40] [INFO ] Deduced a trap composed of 166 places in 64 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 6/543 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 22:22:44] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 22:22:48] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:22:49] [INFO ] Deduced a trap composed of 162 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 2/546 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (OVERLAPS) 0/530 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Int declared 530/530 variables, and 546 constraints, problems are : Problem set: 0 solved, 293 unsolved in 26783 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 9/9 constraints]
After SMT, in 35997ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 36000ms
Starting structural reductions in LTL mode, iteration 1 : 236/329 places, 294/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36237 ms. Remains : 236/329 places, 294/405 transitions.
[2024-05-22 22:23:01] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:23:01] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:23:01] [INFO ] Input system was already deterministic with 294 transitions.
[2024-05-22 22:23:01] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:23:01] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:23:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality12978222325173288116.gal : 2 ms
[2024-05-22 22:23:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality2807840290195754828.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/CTLCardinality12978222325173288116.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2807840290195754828.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.30068e+11,22.0744,567464,2,59858,5,2.17003e+06,6,0,1240,3.15956e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:23:32] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:23:32] [INFO ] Applying decomposition
[2024-05-22 22:23:32] [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/graph309492404441584285.txt' '-o' '/tmp/graph309492404441584285.bin' '-w' '/tmp/graph309492404441584285.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph309492404441584285.bin' '-l' '-1' '-v' '-w' '/tmp/graph309492404441584285.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:23:32] [INFO ] Decomposing Gal with order
[2024-05-22 22:23:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:23:32] [INFO ] Removed a total of 122 redundant transitions.
[2024-05-22 22:23:32] [INFO ] Flatten gal took : 14 ms
[2024-05-22 22:23:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 22:23:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality12951804488946702377.gal : 3 ms
[2024-05-22 22:23:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality5363124171731092109.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/CTLCardinality12951804488946702377.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5363124171731092109.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,1.30068e+11,1.71159,54552,1942,531,92461,7838,707,156569,240,70820,0


Converting to forward existential form...Done !
original formula: (EF(AG(EX((((i11.u57.p371==0)&&(u65.p468==0))&&(i9.i0.u46.p292==1))))) * EX(EF(EX((((E((i9.i0.u55.p340==1) U (i3.i1.u21.p106==1)) + (i5.i...237
=> equivalent forward existential formula: ((([(FwdU(EY(FwdU(EY((Init * E(TRUE U !(E(TRUE U !(EX((((i11.u57.p371==0)&&(u65.p468==0))&&(i9.i0.u46.p292==1)))...701
Reverse transition relation is NOT exact ! Due to transitions t1, t36, t98, t99, t128, t129, t157, t158, t188, t241, t242, t243, t244, t245, t292, u65.t6, ...767
(forward)formula 0,0,5.06041,148536,1,0,202270,84010,4053,615789,1125,518602,451375
FORMULA FlexibleBarrier-PT-06b-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Graph (trivial) has 303 edges and 329 vertex of which 38 / 329 are part of one of the 6 SCC in 1 ms
Free SCC test removed 32 places
Ensure Unique test removed 33 transitions
Reduce isomorphic transitions removed 33 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 296 transition count 315
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 113 place count 240 transition count 315
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 113 place count 240 transition count 297
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 149 place count 222 transition count 297
Discarding 60 places :
Symmetric choice reduction at 2 with 60 rule applications. Total rules 209 place count 162 transition count 237
Iterating global reduction 2 with 60 rules applied. Total rules applied 269 place count 162 transition count 237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 272 place count 162 transition count 234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 272 place count 162 transition count 232
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 276 place count 160 transition count 232
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 287 place count 149 transition count 221
Iterating global reduction 3 with 11 rules applied. Total rules applied 298 place count 149 transition count 221
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 309 place count 149 transition count 210
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 343 place count 132 transition count 193
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 349 place count 126 transition count 187
Iterating global reduction 4 with 6 rules applied. Total rules applied 355 place count 126 transition count 187
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 361 place count 126 transition count 181
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 367 place count 126 transition count 175
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 369 place count 126 transition count 175
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 371 place count 124 transition count 173
Applied a total of 371 rules in 45 ms. Remains 124 /329 variables (removed 205) and now considering 173/405 (removed 232) transitions.
[2024-05-22 22:23:37] [INFO ] Flow matrix only has 167 transitions (discarded 6 similar events)
// Phase 1: matrix 167 rows 124 cols
[2024-05-22 22:23:37] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:23:37] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-22 22:23:37] [INFO ] Flow matrix only has 167 transitions (discarded 6 similar events)
[2024-05-22 22:23:37] [INFO ] Invariant cache hit.
[2024-05-22 22:23:37] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-22 22:23:37] [INFO ] Redundant transitions in 4 ms returned []
Running 103 sub problems to find dead transitions.
[2024-05-22 22:23:37] [INFO ] Flow matrix only has 167 transitions (discarded 6 similar events)
[2024-05-22 22:23:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 6/124 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 103 unsolved
[2024-05-22 22:23:38] [INFO ] Deduced a trap composed of 49 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:23:38] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 166/290 variables, 124/134 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/291 variables, and 134 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2399 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (OVERLAPS) 6/124 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 166/290 variables, 124/134 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 103/237 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/290 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/291 variables, and 237 constraints, problems are : Problem set: 0 solved, 103 unsolved in 2095 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 124/124 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 2/2 constraints]
After SMT, in 4514ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 4515ms
Starting structural reductions in SI_CTL mode, iteration 1 : 124/329 places, 173/405 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4742 ms. Remains : 124/329 places, 173/405 transitions.
[2024-05-22 22:23:41] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:23:41] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:23:41] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-22 22:23:41] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:23:41] [INFO ] Flatten gal took : 3 ms
[2024-05-22 22:23:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality13000408429213429321.gal : 1 ms
[2024-05-22 22:23:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality4824889675105302799.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/CTLCardinality13000408429213429321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4824889675105302799.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,8.34163e+08,0.219191,12968,2,1498,5,50655,6,0,666,31249,0


Converting to forward existential form...Done !
original formula: EF((!(E(EF(((p30==0)||(p439==1))) U ((p191==0)||(p370==1)))) * (p247==1)))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * (p247==1)) * !(E(E(TRUE U ((p30==0)||(p439==1))) U ((p191==0)||(p370==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t41, t66, t73, t130, t134, t141, Intersection with reachable at each step enabled. (destroye...194
(forward)formula 0,1,10.1512,310760,1,0,255,1.87106e+06,362,106,4123,1.33831e+06,364
FORMULA FlexibleBarrier-PT-06b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 269 transition count 345
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 269 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 122 place count 269 transition count 343
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 148 place count 243 transition count 317
Iterating global reduction 1 with 26 rules applied. Total rules applied 174 place count 243 transition count 317
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 181 place count 243 transition count 310
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 193 place count 231 transition count 298
Iterating global reduction 2 with 12 rules applied. Total rules applied 205 place count 231 transition count 298
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 214 place count 231 transition count 289
Applied a total of 214 rules in 12 ms. Remains 231 /329 variables (removed 98) and now considering 289/405 (removed 116) transitions.
// Phase 1: matrix 289 rows 231 cols
[2024-05-22 22:23:52] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:23:52] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 22:23:52] [INFO ] Invariant cache hit.
[2024-05-22 22:23:52] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 288 sub problems to find dead transitions.
[2024-05-22 22:23:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 22:23:54] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/520 variables, 231/240 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (OVERLAPS) 0/520 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 288 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 240 constraints, problems are : Problem set: 0 solved, 288 unsolved in 11172 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 288 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 4 (OVERLAPS) 289/520 variables, 231/240 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 288/528 constraints. Problems are: Problem set: 0 solved, 288 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 22:24:10] [INFO ] Deduced a trap composed of 37 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:24:10] [INFO ] Deduced a trap composed of 32 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/520 variables, 2/530 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 22:24:14] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:24:15] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 2/532 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 22:24:19] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/520 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 22:24:23] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/520 variables, 1/534 constraints. Problems are: Problem set: 0 solved, 288 unsolved
[2024-05-22 22:24:30] [INFO ] Deduced a trap composed of 161 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:24:31] [INFO ] Deduced a trap composed of 164 places in 65 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/520 variables, 2/536 constraints. Problems are: Problem set: 0 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 520/520 variables, and 536 constraints, problems are : Problem set: 0 solved, 288 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 288/288 constraints, Known Traps: 9/9 constraints]
After SMT, in 41237ms problems are : Problem set: 0 solved, 288 unsolved
Search for dead transitions found 0 dead transitions in 41240ms
Starting structural reductions in LTL mode, iteration 1 : 231/329 places, 289/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41440 ms. Remains : 231/329 places, 289/405 transitions.
[2024-05-22 22:24:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:24:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:24:33] [INFO ] Input system was already deterministic with 289 transitions.
[2024-05-22 22:24:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:24:33] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:24:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality7682840100475981877.gal : 2 ms
[2024-05-22 22:24:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality10228983558501736771.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/CTLCardinality7682840100475981877.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10228983558501736771.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.12605e+11,22.8727,581516,2,49412,5,2.26999e+06,6,0,1215,3.11737e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:25:03] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:25:03] [INFO ] Applying decomposition
[2024-05-22 22:25:03] [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/graph17087589197506764662.txt' '-o' '/tmp/graph17087589197506764662.bin' '-w' '/tmp/graph17087589197506764662.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17087589197506764662.bin' '-l' '-1' '-v' '-w' '/tmp/graph17087589197506764662.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:25:03] [INFO ] Decomposing Gal with order
[2024-05-22 22:25:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:25:03] [INFO ] Removed a total of 124 redundant transitions.
[2024-05-22 22:25:03] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:25:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 4 ms.
[2024-05-22 22:25:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality12971623577210794042.gal : 6 ms
[2024-05-22 22:25:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality9606386124135584315.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/CTLCardinality12971623577210794042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9606386124135584315.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,1.12605e+11,1.71631,58172,2032,606,90439,10091,669,233652,230,67809,0


Converting to forward existential form...Done !
original formula: (E(!((EG(((i4.i1.u29.p198==0)||(i1.i0.u9.p29==1))) * AG(AF((i6.i1.u37.p259==1))))) U A(EF(((i10.u60.p356==0)||(i5.u32.p241==1))) U ((i1.i...225
=> equivalent forward existential formula: [(EY((Init * E(!((EG(((i4.i1.u29.p198==0)||(i1.i0.u9.p29==1))) * !(E(TRUE U !(!(EG(!((i6.i1.u37.p259==1)))))))))...447
Reverse transition relation is NOT exact ! Due to transitions t1, t36, t65, t66, t95, t96, t125, t126, t154, t155, t183, t237, t238, t239, t240, t241, u61....740
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 270 transition count 346
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 270 transition count 346
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 270 transition count 343
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 147 place count 244 transition count 317
Iterating global reduction 1 with 26 rules applied. Total rules applied 173 place count 244 transition count 317
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 181 place count 244 transition count 309
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 193 place count 232 transition count 297
Iterating global reduction 2 with 12 rules applied. Total rules applied 205 place count 232 transition count 297
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 214 place count 232 transition count 288
Applied a total of 214 rules in 8 ms. Remains 232 /329 variables (removed 97) and now considering 288/405 (removed 117) transitions.
// Phase 1: matrix 288 rows 232 cols
[2024-05-22 22:25:33] [INFO ] Computed 8 invariants in 5 ms
[2024-05-22 22:25:33] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-22 22:25:33] [INFO ] Invariant cache hit.
[2024-05-22 22:25:34] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 287 sub problems to find dead transitions.
[2024-05-22 22:25:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/520 variables, 232/240 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 5 (OVERLAPS) 0/520 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 240 constraints, problems are : Problem set: 0 solved, 287 unsolved in 8974 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 287 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 3 (OVERLAPS) 288/520 variables, 232/240 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/520 variables, 287/527 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-22 22:25:46] [INFO ] Deduced a trap composed of 81 places in 60 ms of which 1 ms to minimize.
[2024-05-22 22:25:46] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:25:46] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:25:46] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:25:46] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 2 ms to minimize.
[2024-05-22 22:25:47] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
[2024-05-22 22:25:48] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:25:48] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-05-22 22:25:49] [INFO ] Deduced a trap composed of 160 places in 76 ms of which 2 ms to minimize.
[2024-05-22 22:25:49] [INFO ] Deduced a trap composed of 161 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:25:49] [INFO ] Deduced a trap composed of 159 places in 60 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/520 variables, 11/538 constraints. Problems are: Problem set: 0 solved, 287 unsolved
[2024-05-22 22:25:51] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 1 ms to minimize.
[2024-05-22 22:25:52] [INFO ] Deduced a trap composed of 64 places in 63 ms of which 1 ms to minimize.
[2024-05-22 22:25:53] [INFO ] Deduced a trap composed of 67 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 3/541 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 287 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 287 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 541 constraints, problems are : Problem set: 0 solved, 287 unsolved in 24680 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 287/287 constraints, Known Traps: 14/14 constraints]
After SMT, in 33701ms problems are : Problem set: 0 solved, 287 unsolved
Search for dead transitions found 0 dead transitions in 33703ms
Starting structural reductions in LTL mode, iteration 1 : 232/329 places, 288/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33932 ms. Remains : 232/329 places, 288/405 transitions.
[2024-05-22 22:26:07] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:26:07] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:26:07] [INFO ] Input system was already deterministic with 288 transitions.
[2024-05-22 22:26:07] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:26:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:26:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality13682237946950034628.gal : 2 ms
[2024-05-22 22:26:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality6917546933786374711.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/CTLCardinality13682237946950034628.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6917546933786374711.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.13451e+11,15.5638,418116,2,48687,5,1.57641e+06,6,0,1218,2.38439e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:26:37] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:26:37] [INFO ] Applying decomposition
[2024-05-22 22:26:37] [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/graph890008643595773476.txt' '-o' '/tmp/graph890008643595773476.bin' '-w' '/tmp/graph890008643595773476.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph890008643595773476.bin' '-l' '-1' '-v' '-w' '/tmp/graph890008643595773476.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:26:37] [INFO ] Decomposing Gal with order
[2024-05-22 22:26:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:26:37] [INFO ] Removed a total of 121 redundant transitions.
[2024-05-22 22:26:37] [INFO ] Flatten gal took : 15 ms
[2024-05-22 22:26:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2024-05-22 22:26:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality5645783641379915635.gal : 3 ms
[2024-05-22 22:26:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality15246918348563619033.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/CTLCardinality5645783641379915635.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15246918348563619033.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,1.13451e+11,1.02152,37892,1884,442,61830,7063,760,132639,222,19286,0


Converting to forward existential form...Done !
original formula: ((AX((i11.u64.p406==1)) + EG(((EX((i9.i0.u59.p383==1)) * AG((i0.i1.u6.p65==0))) * AG((i4.i1.u24.p154==0))))) + AG((i4.i0.u32.p175==0)))
=> equivalent forward existential formula: [(FwdU((Init * !((!(EX(!((i11.u64.p406==1)))) + EG(((EX((i9.i0.u59.p383==1)) * !(E(TRUE U !((i0.i1.u6.p65==0))))...240
Reverse transition relation is NOT exact ! Due to transitions t1, t51, t65, t66, t94, t95, t124, t125, t156, t157, t185, t238, t239, t240, t241, t242, i0.i...738
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Graph (trivial) has 279 edges and 329 vertex of which 24 / 329 are part of one of the 4 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 308 transition count 333
Reduce places removed 51 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 55 rules applied. Total rules applied 107 place count 257 transition count 329
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 112 place count 253 transition count 328
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 112 place count 253 transition count 313
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 142 place count 238 transition count 313
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 194 place count 186 transition count 261
Iterating global reduction 3 with 52 rules applied. Total rules applied 246 place count 186 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 248 place count 186 transition count 259
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 248 place count 186 transition count 257
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 252 place count 184 transition count 257
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 265 place count 171 transition count 244
Iterating global reduction 4 with 13 rules applied. Total rules applied 278 place count 171 transition count 244
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 289 place count 171 transition count 233
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 337 place count 147 transition count 209
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 340 place count 144 transition count 206
Iterating global reduction 5 with 3 rules applied. Total rules applied 343 place count 144 transition count 206
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 346 place count 144 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 351 place count 144 transition count 198
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 353 place count 142 transition count 196
Applied a total of 353 rules in 37 ms. Remains 142 /329 variables (removed 187) and now considering 196/405 (removed 209) transitions.
[2024-05-22 22:27:08] [INFO ] Flow matrix only has 193 transitions (discarded 3 similar events)
// Phase 1: matrix 193 rows 142 cols
[2024-05-22 22:27:08] [INFO ] Computed 8 invariants in 1 ms
[2024-05-22 22:27:08] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-22 22:27:08] [INFO ] Flow matrix only has 193 transitions (discarded 3 similar events)
[2024-05-22 22:27:08] [INFO ] Invariant cache hit.
[2024-05-22 22:27:08] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2024-05-22 22:27:08] [INFO ] Redundant transitions in 5 ms returned []
Running 134 sub problems to find dead transitions.
[2024-05-22 22:27:08] [INFO ] Flow matrix only has 193 transitions (discarded 3 similar events)
[2024-05-22 22:27:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 6/142 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 192/334 variables, 142/150 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/335 variables, and 150 constraints, problems are : Problem set: 0 solved, 134 unsolved in 2994 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (OVERLAPS) 6/142 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (OVERLAPS) 192/334 variables, 142/150 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 134/284 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/335 variables, and 284 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3073 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 6090ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 6091ms
Starting structural reductions in SI_CTL mode, iteration 1 : 142/329 places, 196/405 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6297 ms. Remains : 142/329 places, 196/405 transitions.
[2024-05-22 22:27:14] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:27:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:27:14] [INFO ] Input system was already deterministic with 196 transitions.
[2024-05-22 22:27:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:27:14] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:27:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality8604003608827985782.gal : 1 ms
[2024-05-22 22:27:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality4822702298354746410.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/CTLCardinality8604003608827985782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4822702298354746410.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,2.33251e+09,0.197988,11536,2,966,5,42056,6,0,762,27722,0


Converting to forward existential form...Done !
original formula: (EG(((p396==0)&&(p90==1))) + (EF((((p225==0)||(p394==1))&&(((p146==0)||(p131==1))||(p55==1)))) * EG(E((((p173==0)||(p493==1))||(p201==1))...196
=> equivalent forward existential formula: ([FwdG(Init,((p396==0)&&(p90==1)))] != FALSE + [FwdG((Init * E(TRUE U (((p225==0)||(p394==1))&&(((p146==0)||(p13...263
Reverse transition relation is NOT exact ! Due to transitions t139, t150, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/t...173
Detected timeout of ITS tools.
[2024-05-22 22:27:44] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:27:44] [INFO ] Applying decomposition
[2024-05-22 22:27:44] [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/graph16807265060583592849.txt' '-o' '/tmp/graph16807265060583592849.bin' '-w' '/tmp/graph16807265060583592849.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16807265060583592849.bin' '-l' '-1' '-v' '-w' '/tmp/graph16807265060583592849.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:27:44] [INFO ] Decomposing Gal with order
[2024-05-22 22:27:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:27:44] [INFO ] Removed a total of 83 redundant transitions.
[2024-05-22 22:27:44] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:27:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 2 ms.
[2024-05-22 22:27:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality2044242675075949188.gal : 2 ms
[2024-05-22 22:27:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality5456885565152465785.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/CTLCardinality2044242675075949188.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5456885565152465785.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.33251e+09,0.036563,5012,66,60,1661,684,480,2635,213,1160,0


Converting to forward existential form...Done !
original formula: (EG(((i6.i1.u26.p396==0)&&(i1.i1.u3.p90==1))) + (EF((((i4.u16.p225==0)||(i6.i1.u20.p394==1))&&(((i2.u8.p146==0)||(i1.i1.u6.p131==1))||(i0...293
=> equivalent forward existential formula: ([FwdG(Init,((i6.i1.u26.p396==0)&&(i1.i1.u3.p90==1)))] != FALSE + [FwdG((Init * E(TRUE U (((i4.u16.p225==0)||(i6...360
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Reverse transition relation is NOT exact ! Due to transitions i0.u2.t139, i2.t150, Intersection with reachable at each step enabled. (destroyed/reverse/in...182
(forward)formula 0,1,20.6297,519040,1,0,618211,134583,2741,1.32669e+06,1071,628322,1235266
FORMULA FlexibleBarrier-PT-06b-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 270 transition count 346
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 270 transition count 346
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 270 transition count 343
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 149 place count 242 transition count 315
Iterating global reduction 1 with 28 rules applied. Total rules applied 177 place count 242 transition count 315
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 186 place count 242 transition count 306
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 197 place count 231 transition count 295
Iterating global reduction 2 with 11 rules applied. Total rules applied 208 place count 231 transition count 295
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 217 place count 231 transition count 286
Applied a total of 217 rules in 9 ms. Remains 231 /329 variables (removed 98) and now considering 286/405 (removed 119) transitions.
// Phase 1: matrix 286 rows 231 cols
[2024-05-22 22:28:05] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:28:05] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-22 22:28:05] [INFO ] Invariant cache hit.
[2024-05-22 22:28:05] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 285 sub problems to find dead transitions.
[2024-05-22 22:28:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/517 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 5 (OVERLAPS) 0/517 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 239 constraints, problems are : Problem set: 0 solved, 285 unsolved in 8848 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 285 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 3 (OVERLAPS) 286/517 variables, 231/239 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 285/524 constraints. Problems are: Problem set: 0 solved, 285 unsolved
[2024-05-22 22:28:17] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2024-05-22 22:28:17] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 2 ms to minimize.
[2024-05-22 22:28:17] [INFO ] Deduced a trap composed of 59 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:28:18] [INFO ] Deduced a trap composed of 63 places in 76 ms of which 2 ms to minimize.
[2024-05-22 22:28:18] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:28:18] [INFO ] Deduced a trap composed of 64 places in 68 ms of which 2 ms to minimize.
[2024-05-22 22:28:19] [INFO ] Deduced a trap composed of 65 places in 77 ms of which 1 ms to minimize.
[2024-05-22 22:28:19] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 1 ms to minimize.
[2024-05-22 22:28:20] [INFO ] Deduced a trap composed of 161 places in 74 ms of which 1 ms to minimize.
[2024-05-22 22:28:20] [INFO ] Deduced a trap composed of 159 places in 68 ms of which 2 ms to minimize.
[2024-05-22 22:28:20] [INFO ] Deduced a trap composed of 139 places in 75 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 11/535 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 285 unsolved
At refinement iteration 7 (OVERLAPS) 0/517 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 285 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 535 constraints, problems are : Problem set: 0 solved, 285 unsolved in 17207 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 285/285 constraints, Known Traps: 11/11 constraints]
After SMT, in 26100ms problems are : Problem set: 0 solved, 285 unsolved
Search for dead transitions found 0 dead transitions in 26102ms
Starting structural reductions in LTL mode, iteration 1 : 231/329 places, 286/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26335 ms. Remains : 231/329 places, 286/405 transitions.
[2024-05-22 22:28:31] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:28:31] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:28:31] [INFO ] Input system was already deterministic with 286 transitions.
[2024-05-22 22:28:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:28:31] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:28:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality15017499698106100863.gal : 2 ms
[2024-05-22 22:28:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality3737775026095818894.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/CTLCardinality15017499698106100863.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3737775026095818894.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08472e+11,20.1156,466140,2,56038,5,1.78236e+06,6,0,1212,2.63134e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:29:01] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:29:01] [INFO ] Applying decomposition
[2024-05-22 22:29:01] [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/graph4746439776279412053.txt' '-o' '/tmp/graph4746439776279412053.bin' '-w' '/tmp/graph4746439776279412053.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4746439776279412053.bin' '-l' '-1' '-v' '-w' '/tmp/graph4746439776279412053.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:29:01] [INFO ] Decomposing Gal with order
[2024-05-22 22:29:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:29:01] [INFO ] Removed a total of 111 redundant transitions.
[2024-05-22 22:29:01] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:29:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-22 22:29:01] [INFO ] Time to serialize gal into /tmp/CTLCardinality14873080128338913445.gal : 2 ms
[2024-05-22 22:29:01] [INFO ] Time to serialize properties into /tmp/CTLCardinality779259968412934961.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/CTLCardinality14873080128338913445.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality779259968412934961.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08472e+11,1.20946,42880,2137,531,75150,9013,701,118428,227,42135,0


Converting to forward existential form...Done !
original formula: AX(AG(AX((E(((i4.i1.u26.p191==0)||(i12.u63.p510==1)) U (i12.u64.p497==0)) * ((i10.u58.p370==0)||(i11.i1.u61.p387==1))))))
=> equivalent forward existential formula: ([(EY(FwdU(EY(Init),TRUE)) * !(E(((i4.i1.u26.p191==0)||(i12.u63.p510==1)) U (i12.u64.p497==0))))] = FALSE * [(EY...234
(forward)formula 0,0,2.14039,49744,1,0,89322,9297,1511,149625,402,58223,192153
FORMULA FlexibleBarrier-PT-06b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 279 transition count 355
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 279 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 101 place count 279 transition count 354
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 123 place count 257 transition count 332
Iterating global reduction 1 with 22 rules applied. Total rules applied 145 place count 257 transition count 332
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 149 place count 257 transition count 328
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 161 place count 245 transition count 316
Iterating global reduction 2 with 12 rules applied. Total rules applied 173 place count 245 transition count 316
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 183 place count 245 transition count 306
Applied a total of 183 rules in 11 ms. Remains 245 /329 variables (removed 84) and now considering 306/405 (removed 99) transitions.
// Phase 1: matrix 306 rows 245 cols
[2024-05-22 22:29:03] [INFO ] Computed 8 invariants in 3 ms
[2024-05-22 22:29:03] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-22 22:29:03] [INFO ] Invariant cache hit.
[2024-05-22 22:29:03] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-05-22 22:29:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-22 22:29:06] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 306/551 variables, 245/254 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 254 constraints, problems are : Problem set: 0 solved, 305 unsolved in 12864 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/244 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/245 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/245 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/245 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (OVERLAPS) 306/551 variables, 245/254 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 305/559 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-22 22:29:20] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-22 22:29:20] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2024-05-22 22:29:22] [INFO ] Deduced a trap composed of 166 places in 80 ms of which 1 ms to minimize.
[2024-05-22 22:29:23] [INFO ] Deduced a trap composed of 165 places in 84 ms of which 2 ms to minimize.
[2024-05-22 22:29:23] [INFO ] Deduced a trap composed of 143 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 5/564 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-22 22:29:30] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-22 22:29:30] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/551 variables, 2/566 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 0/566 constraints. Problems are: Problem set: 0 solved, 305 unsolved
[2024-05-22 22:29:40] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/551 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 567 constraints, problems are : Problem set: 0 solved, 305 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 9/9 constraints]
After SMT, in 42926ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 42929ms
Starting structural reductions in LTL mode, iteration 1 : 245/329 places, 306/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43174 ms. Remains : 245/329 places, 306/405 transitions.
[2024-05-22 22:29:46] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:29:46] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:29:46] [INFO ] Input system was already deterministic with 306 transitions.
[2024-05-22 22:29:46] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:29:46] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:29:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality1071080074921332100.gal : 1 ms
[2024-05-22 22:29:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality9526568242417802254.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/CTLCardinality1071080074921332100.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9526568242417802254.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 22:30:17] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:30:17] [INFO ] Applying decomposition
[2024-05-22 22:30:17] [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/graph8342909962926146744.txt' '-o' '/tmp/graph8342909962926146744.bin' '-w' '/tmp/graph8342909962926146744.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8342909962926146744.bin' '-l' '-1' '-v' '-w' '/tmp/graph8342909962926146744.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:30:17] [INFO ] Decomposing Gal with order
[2024-05-22 22:30:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:30:17] [INFO ] Removed a total of 130 redundant transitions.
[2024-05-22 22:30:17] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:30:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2024-05-22 22:30:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality8926073529646499048.gal : 2 ms
[2024-05-22 22:30:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality17108054526748126656.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/CTLCardinality8926073529646499048.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17108054526748126656.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,1.57923e+11,1.53917,54424,2944,571,94400,11055,824,162038,244,24718,0


Converting to forward existential form...Done !
original formula: (EX(AG(((i8.i0.u44.p287==0)||(i1.u8.p55==1)))) + (E((!(AX((i0.i1.u10.p64==0))) * !(((EF(((i12.u65.p510==0)||(i12.u66.p457==1))) + (i0.i1....426
=> equivalent forward existential formula: ([((Init * !(EX(!(E(TRUE U !(((i8.i0.u44.p287==0)||(i1.u8.p55==1)))))))) * !(E((!(!(EX(!((i0.i1.u10.p64==0))))) ...781
Reverse transition relation is NOT exact ! Due to transitions t1, t42, t72, t102, t103, t131, t132, t165, t179, t209, t250, t251, t253, t255, i0.i0.u4.t198...822
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 276 transition count 352
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 276 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 109 place count 276 transition count 349
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 134 place count 251 transition count 324
Iterating global reduction 1 with 25 rules applied. Total rules applied 159 place count 251 transition count 324
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 167 place count 251 transition count 316
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 175 place count 243 transition count 308
Iterating global reduction 2 with 8 rules applied. Total rules applied 183 place count 243 transition count 308
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 189 place count 243 transition count 302
Applied a total of 189 rules in 26 ms. Remains 243 /329 variables (removed 86) and now considering 302/405 (removed 103) transitions.
// Phase 1: matrix 302 rows 243 cols
[2024-05-22 22:30:47] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:30:47] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-22 22:30:47] [INFO ] Invariant cache hit.
[2024-05-22 22:30:47] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-22 22:30:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-22 22:30:49] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/545 variables, 243/252 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (OVERLAPS) 0/545 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 252 constraints, problems are : Problem set: 0 solved, 301 unsolved in 12560 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/242 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/243 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/243 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/243 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/545 variables, 243/252 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 301/553 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-22 22:31:03] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:31:04] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 2 ms to minimize.
[2024-05-22 22:31:04] [INFO ] Deduced a trap composed of 65 places in 76 ms of which 2 ms to minimize.
[2024-05-22 22:31:04] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 1 ms to minimize.
[2024-05-22 22:31:05] [INFO ] Deduced a trap composed of 71 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:31:06] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:31:06] [INFO ] Deduced a trap composed of 162 places in 68 ms of which 2 ms to minimize.
[2024-05-22 22:31:06] [INFO ] Deduced a trap composed of 177 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:31:06] [INFO ] Deduced a trap composed of 164 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 9/562 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-22 22:31:11] [INFO ] Deduced a trap composed of 69 places in 58 ms of which 1 ms to minimize.
[2024-05-22 22:31:12] [INFO ] Deduced a trap composed of 167 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 2/564 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-22 22:31:14] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-05-22 22:31:14] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:31:17] [INFO ] Deduced a trap composed of 165 places in 68 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 3/567 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-22 22:31:20] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 1/568 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-22 22:31:24] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 301 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 545/545 variables, and 569 constraints, problems are : Problem set: 0 solved, 301 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 243/243 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 17/17 constraints]
After SMT, in 42622ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 42625ms
Starting structural reductions in LTL mode, iteration 1 : 243/329 places, 302/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42870 ms. Remains : 243/329 places, 302/405 transitions.
[2024-05-22 22:31:30] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:31:30] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:31:30] [INFO ] Input system was already deterministic with 302 transitions.
[2024-05-22 22:31:30] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:31:30] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:31:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality10675614368974656808.gal : 1 ms
[2024-05-22 22:31:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality7924495528582239322.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/CTLCardinality10675614368974656808.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7924495528582239322.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 22:32:00] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:32:00] [INFO ] Applying decomposition
[2024-05-22 22:32:00] [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/graph6441908246504262727.txt' '-o' '/tmp/graph6441908246504262727.bin' '-w' '/tmp/graph6441908246504262727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6441908246504262727.bin' '-l' '-1' '-v' '-w' '/tmp/graph6441908246504262727.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:32:00] [INFO ] Decomposing Gal with order
[2024-05-22 22:32:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:32:00] [INFO ] Removed a total of 129 redundant transitions.
[2024-05-22 22:32:00] [INFO ] Flatten gal took : 14 ms
[2024-05-22 22:32:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 22:32:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality1790582631174664119.gal : 3 ms
[2024-05-22 22:32:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13588161520480630609.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/CTLCardinality1790582631174664119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13588161520480630609.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,1.73973e+11,4.46314,124964,5333,733,218586,13848,783,424352,223,44963,0


Converting to forward existential form...Done !
original formula: EF((EX(AG(AF((i12.u68.p420==0)))) * AX((((E(((i2.i2.u71.p535==0)||(i0.i1.u9.p42==1)) U (i9.i1.u50.p302==0)) * EG(((i7.i0.u41.p252==0)||(i...286
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * EX(!(E(TRUE U !(!(EG(!((i12.u68.p420==0))))))))) * !(EX(!((((E(((i2.i2.u71.p535==0)||(i0.i1...362
Reverse transition relation is NOT exact ! Due to transitions t1, t40, t67, t68, t98, t99, t130, t161, t162, t202, t248, t249, t251, t252, t253, i0.i0.u2.t...939
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 329/329 places, 405/405 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 274 transition count 350
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 274 transition count 350
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 113 place count 274 transition count 347
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 140 place count 247 transition count 320
Iterating global reduction 1 with 27 rules applied. Total rules applied 167 place count 247 transition count 320
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 174 place count 247 transition count 313
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 186 place count 235 transition count 301
Iterating global reduction 2 with 12 rules applied. Total rules applied 198 place count 235 transition count 301
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 207 place count 235 transition count 292
Applied a total of 207 rules in 12 ms. Remains 235 /329 variables (removed 94) and now considering 292/405 (removed 113) transitions.
// Phase 1: matrix 292 rows 235 cols
[2024-05-22 22:32:30] [INFO ] Computed 8 invariants in 2 ms
[2024-05-22 22:32:30] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 22:32:30] [INFO ] Invariant cache hit.
[2024-05-22 22:32:30] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Running 291 sub problems to find dead transitions.
[2024-05-22 22:32:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-22 22:32:32] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 292/527 variables, 235/244 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 6 (OVERLAPS) 0/527 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 291 unsolved
No progress, stopping.
After SMT solving in domain Real declared 527/527 variables, and 244 constraints, problems are : Problem set: 0 solved, 291 unsolved in 11519 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 291 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 4 (OVERLAPS) 292/527 variables, 235/244 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 291/535 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-22 22:32:45] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2024-05-22 22:32:45] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2024-05-22 22:32:47] [INFO ] Deduced a trap composed of 164 places in 70 ms of which 2 ms to minimize.
[2024-05-22 22:32:47] [INFO ] Deduced a trap composed of 165 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 4/539 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-22 22:32:49] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/527 variables, 1/540 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-22 22:32:56] [INFO ] Deduced a trap composed of 164 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 1/541 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-22 22:32:59] [INFO ] Deduced a trap composed of 53 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/527 variables, 1/542 constraints. Problems are: Problem set: 0 solved, 291 unsolved
[2024-05-22 22:33:06] [INFO ] Deduced a trap composed of 164 places in 76 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 1/543 constraints. Problems are: Problem set: 0 solved, 291 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/527 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 527/527 variables, and 543 constraints, problems are : Problem set: 0 solved, 291 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 291/291 constraints, Known Traps: 9/9 constraints]
After SMT, in 41578ms problems are : Problem set: 0 solved, 291 unsolved
Search for dead transitions found 0 dead transitions in 41581ms
Starting structural reductions in LTL mode, iteration 1 : 235/329 places, 292/405 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41803 ms. Remains : 235/329 places, 292/405 transitions.
[2024-05-22 22:33:12] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:33:12] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:33:12] [INFO ] Input system was already deterministic with 292 transitions.
[2024-05-22 22:33:12] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:33:12] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:33:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality16748210922791359673.gal : 1 ms
[2024-05-22 22:33:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality14764721305914773714.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/CTLCardinality16748210922791359673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14764721305914773714.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.2397e+11,16.3792,425976,2,56109,5,1.69864e+06,6,0,1234,2.375e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-22 22:33:42] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:33:42] [INFO ] Applying decomposition
[2024-05-22 22:33:42] [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/graph5619213708570088199.txt' '-o' '/tmp/graph5619213708570088199.bin' '-w' '/tmp/graph5619213708570088199.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5619213708570088199.bin' '-l' '-1' '-v' '-w' '/tmp/graph5619213708570088199.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:33:42] [INFO ] Decomposing Gal with order
[2024-05-22 22:33:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:33:42] [INFO ] Removed a total of 120 redundant transitions.
[2024-05-22 22:33:42] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:33:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 22:33:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality15644672685133995101.gal : 3 ms
[2024-05-22 22:33:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality9550329672152871117.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/CTLCardinality15644672685133995101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9550329672152871117.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,1.2397e+11,1.80774,61104,2528,536,109662,7757,704,194950,226,40950,0


Converting to forward existential form...Done !
original formula: EG((((EX(((i7.u36.p270==1)&&(i1.u4.p23==1))) + !(A((i0.i1.u7.p56==1) U ((i6.i1.u38.p251==0)||(i0.i0.u13.p72==1))))) + ((i3.i1.u14.p89==0)...221
=> equivalent forward existential formula: [FwdG(Init,(((EX(((i7.u36.p270==1)&&(i1.u4.p23==1))) + !(!((E(!(((i6.i1.u38.p251==0)||(i0.i0.u13.p72==1))) U (!(...375
Reverse transition relation is NOT exact ! Due to transitions t1, t36, t65, t66, t96, t97, t127, t128, t156, t157, t240, t241, t242, t243, t245, u65.t7, u6...757
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Detected timeout of ITS tools.
[2024-05-22 22:34:12] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:34:12] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:34:12] [INFO ] Applying decomposition
[2024-05-22 22:34:12] [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/graph13189785505908663019.txt' '-o' '/tmp/graph13189785505908663019.bin' '-w' '/tmp/graph13189785505908663019.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13189785505908663019.bin' '-l' '-1' '-v' '-w' '/tmp/graph13189785505908663019.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:34:12] [INFO ] Decomposing Gal with order
[2024-05-22 22:34:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:34:12] [INFO ] Removed a total of 186 redundant transitions.
[2024-05-22 22:34:12] [INFO ] Flatten gal took : 15 ms
[2024-05-22 22:34:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2024-05-22 22:34:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality13917191449664514372.gal : 3 ms
[2024-05-22 22:34:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality6100718247083935121.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/CTLCardinality13917191449664514372.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6100718247083935121.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 8 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29188e+12,67.7835,1383596,23241,782,1.79348e+06,19494,1094,6.45738e+06,247,405964,0


Converting to forward existential form...Done !
original formula: A((AG(!(((i12.u81.p460==0) * (AF(((i12.u84.p458==0)||(i12.u83.p510==1))) + !(((u80.p419==0)||(i13.i1.u85.p378==1))))))) + EG(!(AX((i2.i0....204
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U EG(!(E(TRUE U !((i3.i0.u21.p118==1)))))))))) * !(E(!(E(TRUE U EG(!(E(TRUE U !((i3.i0.u...421
Reverse transition relation is NOT exact ! Due to transitions t1, t49, t139, t180, t223, t234, t333, t334, t397, t403, u80.t47, u80.t50, i1.t279, i1.i0.t27...1607
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,504.791,2985736,1,0,3.64854e+06,336401,3065,1.26645e+07,669,1.40211e+06,7135645
FORMULA FlexibleBarrier-PT-06b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2024-05-22 23:00:36] [INFO ] Applying decomposition
[2024-05-22 23:00:36] [INFO ] Flatten gal took : 7 ms
[2024-05-22 23:00:36] [INFO ] Decomposing Gal with order
[2024-05-22 23:00:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:00:36] [INFO ] Removed a total of 72 redundant transitions.
[2024-05-22 23:00:36] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:00:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 190 labels/synchronizations in 15 ms.
[2024-05-22 23:00:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality6097101365095424985.gal : 2 ms
[2024-05-22 23:00:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality15626245354093099880.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/CTLCardinality6097101365095424985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15626245354093099880.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 7 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 23:10:26] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:10:26] [INFO ] Input system was already deterministic with 405 transitions.
[2024-05-22 23:10:26] [INFO ] Transformed 329 places.
[2024-05-22 23:10:26] [INFO ] Transformed 405 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 23:10:26] [INFO ] Time to serialize gal into /tmp/CTLCardinality15268753641450435088.gal : 2 ms
[2024-05-22 23:10:26] [INFO ] Time to serialize properties into /tmp/CTLCardinality11690366281107612558.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/CTLCardinality15268753641450435088.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11690366281107612558.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

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