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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 676K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.7K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 13 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 13 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 13 08:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:45 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 241K 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-08b-CTLCardinality-2024-00
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2024-01
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2024-02
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2024-03
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2024-04
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2024-05
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2024-06
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2024-07
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2024-08
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2024-09
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2024-10
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2024-11
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2023-12
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2023-13
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2023-14
FORMULA_NAME FlexibleBarrier-PT-08b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716416599166

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-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 22:23:20] [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:23:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:23:20] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-22 22:23:20] [INFO ] Transformed 920 places.
[2024-05-22 22:23:20] [INFO ] Transformed 1057 transitions.
[2024-05-22 22:23:20] [INFO ] Found NUPN structural information;
[2024-05-22 22:23:20] [INFO ] Parsed PT model containing 920 places and 1057 transitions and 2627 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Support contains 133 out of 920 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 920/920 places, 1057/1057 transitions.
Discarding 283 places :
Symmetric choice reduction at 0 with 283 rule applications. Total rules 283 place count 637 transition count 774
Iterating global reduction 0 with 283 rules applied. Total rules applied 566 place count 637 transition count 774
Discarding 108 places :
Symmetric choice reduction at 0 with 108 rule applications. Total rules 674 place count 529 transition count 666
Iterating global reduction 0 with 108 rules applied. Total rules applied 782 place count 529 transition count 666
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 830 place count 481 transition count 618
Iterating global reduction 0 with 48 rules applied. Total rules applied 878 place count 481 transition count 618
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 886 place count 481 transition count 610
Applied a total of 886 rules in 142 ms. Remains 481 /920 variables (removed 439) and now considering 610/1057 (removed 447) transitions.
// Phase 1: matrix 610 rows 481 cols
[2024-05-22 22:23:20] [INFO ] Computed 10 invariants in 25 ms
[2024-05-22 22:23:21] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-22 22:23:21] [INFO ] Invariant cache hit.
[2024-05-22 22:23:21] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 760 ms to find 0 implicit places.
Running 609 sub problems to find dead transitions.
[2024-05-22 22:23:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (OVERLAPS) 1/481 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 609 unsolved
[2024-05-22 22:23:30] [INFO ] Deduced a trap composed of 92 places in 188 ms of which 22 ms to minimize.
[2024-05-22 22:23:30] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 4 ms to minimize.
[2024-05-22 22:23:30] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 3 ms to minimize.
[2024-05-22 22:23:30] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 3 ms to minimize.
[2024-05-22 22:23:30] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 3 ms to minimize.
[2024-05-22 22:23:30] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2024-05-22 22:23:31] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
[2024-05-22 22:23:31] [INFO ] Deduced a trap composed of 122 places in 87 ms of which 3 ms to minimize.
[2024-05-22 22:23:31] [INFO ] Deduced a trap composed of 122 places in 84 ms of which 2 ms to minimize.
[2024-05-22 22:23:32] [INFO ] Deduced a trap composed of 231 places in 145 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 4 (OVERLAPS) 610/1091 variables, 481/501 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1091/1091 variables, and 501 constraints, problems are : Problem set: 0 solved, 609 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 481/481 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 609 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 1 (OVERLAPS) 1/481 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/481 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 4 (OVERLAPS) 610/1091 variables, 481/501 constraints. Problems are: Problem set: 0 solved, 609 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1091 variables, 609/1110 constraints. Problems are: Problem set: 0 solved, 609 unsolved
[2024-05-22 22:24:03] [INFO ] Deduced a trap composed of 160 places in 143 ms of which 3 ms to minimize.
[2024-05-22 22:24:03] [INFO ] Deduced a trap composed of 153 places in 122 ms of which 3 ms to minimize.
[2024-05-22 22:24:03] [INFO ] Deduced a trap composed of 125 places in 130 ms of which 3 ms to minimize.
[2024-05-22 22:24:04] [INFO ] Deduced a trap composed of 211 places in 136 ms of which 3 ms to minimize.
[2024-05-22 22:24:04] [INFO ] Deduced a trap composed of 118 places in 124 ms of which 3 ms to minimize.
[2024-05-22 22:24:04] [INFO ] Deduced a trap composed of 120 places in 118 ms of which 3 ms to minimize.
[2024-05-22 22:24:05] [INFO ] Deduced a trap composed of 127 places in 131 ms of which 3 ms to minimize.
[2024-05-22 22:24:05] [INFO ] Deduced a trap composed of 127 places in 119 ms of which 2 ms to minimize.
[2024-05-22 22:24:06] [INFO ] Deduced a trap composed of 87 places in 133 ms of which 2 ms to minimize.
[2024-05-22 22:24:07] [INFO ] Deduced a trap composed of 90 places in 102 ms of which 2 ms to minimize.
[2024-05-22 22:24:08] [INFO ] Deduced a trap composed of 147 places in 139 ms of which 3 ms to minimize.
[2024-05-22 22:24:08] [INFO ] Deduced a trap composed of 169 places in 138 ms of which 3 ms to minimize.
[2024-05-22 22:24:08] [INFO ] Deduced a trap composed of 154 places in 132 ms of which 3 ms to minimize.
[2024-05-22 22:24:08] [INFO ] Deduced a trap composed of 85 places in 131 ms of which 3 ms to minimize.
[2024-05-22 22:24:10] [INFO ] Deduced a trap composed of 134 places in 124 ms of which 3 ms to minimize.
[2024-05-22 22:24:12] [INFO ] Deduced a trap composed of 92 places in 101 ms of which 2 ms to minimize.
[2024-05-22 22:24:13] [INFO ] Deduced a trap composed of 132 places in 113 ms of which 3 ms to minimize.
[2024-05-22 22:24:14] [INFO ] Deduced a trap composed of 100 places in 94 ms of which 2 ms to minimize.
[2024-05-22 22:24:15] [INFO ] Deduced a trap composed of 99 places in 94 ms of which 2 ms to minimize.
[2024-05-22 22:24:18] [INFO ] Deduced a trap composed of 132 places in 96 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1091 variables, 20/1130 constraints. Problems are: Problem set: 0 solved, 609 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1091/1091 variables, and 1130 constraints, problems are : Problem set: 0 solved, 609 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 481/481 constraints, PredecessorRefiner: 609/609 constraints, Known Traps: 30/30 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 609 unsolved
Search for dead transitions found 0 dead transitions in 60372ms
Starting structural reductions in LTL mode, iteration 1 : 481/920 places, 610/1057 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61304 ms. Remains : 481/920 places, 610/1057 transitions.
Support contains 133 out of 481 places after structural reductions.
[2024-05-22 22:24:22] [INFO ] Flatten gal took : 84 ms
[2024-05-22 22:24:22] [INFO ] Flatten gal took : 35 ms
[2024-05-22 22:24:22] [INFO ] Input system was already deterministic with 610 transitions.
Support contains 124 out of 481 places (down from 133) after GAL structural reductions.
RANDOM walk for 40000 steps (627 resets) in 1542 ms. (25 steps per ms) remains 28/72 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 28/28 properties
[2024-05-22 22:24:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 433/481 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 610/1091 variables, 481/491 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1091 variables, 0/491 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 0/1091 variables, 0/491 constraints. Problems are: Problem set: 1 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1091/1091 variables, and 491 constraints, problems are : Problem set: 1 solved, 27 unsolved in 1145 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 481/481 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 27 unsolved
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp49 is UNSAT
At refinement iteration 1 (OVERLAPS) 435/481 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-22 22:24:24] [INFO ] Deduced a trap composed of 118 places in 149 ms of which 2 ms to minimize.
[2024-05-22 22:24:24] [INFO ] Deduced a trap composed of 149 places in 143 ms of which 3 ms to minimize.
[2024-05-22 22:24:24] [INFO ] Deduced a trap composed of 123 places in 133 ms of which 2 ms to minimize.
[2024-05-22 22:24:24] [INFO ] Deduced a trap composed of 123 places in 118 ms of which 4 ms to minimize.
[2024-05-22 22:24:25] [INFO ] Deduced a trap composed of 120 places in 111 ms of which 4 ms to minimize.
[2024-05-22 22:24:25] [INFO ] Deduced a trap composed of 95 places in 101 ms of which 3 ms to minimize.
[2024-05-22 22:24:25] [INFO ] Deduced a trap composed of 132 places in 132 ms of which 3 ms to minimize.
[2024-05-22 22:24:25] [INFO ] Deduced a trap composed of 126 places in 134 ms of which 3 ms to minimize.
[2024-05-22 22:24:25] [INFO ] Deduced a trap composed of 127 places in 139 ms of which 3 ms to minimize.
[2024-05-22 22:24:25] [INFO ] Deduced a trap composed of 123 places in 137 ms of which 3 ms to minimize.
[2024-05-22 22:24:25] [INFO ] Deduced a trap composed of 154 places in 137 ms of which 2 ms to minimize.
[2024-05-22 22:24:26] [INFO ] Deduced a trap composed of 121 places in 139 ms of which 3 ms to minimize.
[2024-05-22 22:24:26] [INFO ] Deduced a trap composed of 149 places in 104 ms of which 3 ms to minimize.
[2024-05-22 22:24:26] [INFO ] Deduced a trap composed of 158 places in 134 ms of which 2 ms to minimize.
[2024-05-22 22:24:26] [INFO ] Deduced a trap composed of 124 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:24:26] [INFO ] Deduced a trap composed of 93 places in 158 ms of which 3 ms to minimize.
[2024-05-22 22:24:26] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 3 ms to minimize.
[2024-05-22 22:24:26] [INFO ] Deduced a trap composed of 96 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:24:27] [INFO ] Deduced a trap composed of 190 places in 132 ms of which 2 ms to minimize.
[2024-05-22 22:24:27] [INFO ] Deduced a trap composed of 87 places in 131 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/481 variables, 20/30 constraints. Problems are: Problem set: 3 solved, 25 unsolved
[2024-05-22 22:24:27] [INFO ] Deduced a trap composed of 99 places in 134 ms of which 4 ms to minimize.
[2024-05-22 22:24:27] [INFO ] Deduced a trap composed of 136 places in 133 ms of which 3 ms to minimize.
[2024-05-22 22:24:27] [INFO ] Deduced a trap composed of 165 places in 128 ms of which 3 ms to minimize.
[2024-05-22 22:24:27] [INFO ] Deduced a trap composed of 92 places in 106 ms of which 2 ms to minimize.
[2024-05-22 22:24:28] [INFO ] Deduced a trap composed of 97 places in 108 ms of which 3 ms to minimize.
[2024-05-22 22:24:28] [INFO ] Deduced a trap composed of 123 places in 105 ms of which 2 ms to minimize.
[2024-05-22 22:24:28] [INFO ] Deduced a trap composed of 311 places in 155 ms of which 10 ms to minimize.
[2024-05-22 22:24:28] [INFO ] Deduced a trap composed of 170 places in 142 ms of which 3 ms to minimize.
[2024-05-22 22:24:28] [INFO ] Deduced a trap composed of 179 places in 140 ms of which 3 ms to minimize.
[2024-05-22 22:24:28] [INFO ] Deduced a trap composed of 104 places in 129 ms of which 2 ms to minimize.
[2024-05-22 22:24:28] [INFO ] Deduced a trap composed of 155 places in 123 ms of which 3 ms to minimize.
[2024-05-22 22:24:29] [INFO ] Deduced a trap composed of 161 places in 107 ms of which 2 ms to minimize.
[2024-05-22 22:24:29] [INFO ] Deduced a trap composed of 123 places in 145 ms of which 3 ms to minimize.
[2024-05-22 22:24:29] [INFO ] Deduced a trap composed of 122 places in 123 ms of which 3 ms to minimize.
SMT process timed out in 6286ms, After SMT, problems are : Problem set: 3 solved, 25 unsolved
Fused 25 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 40 out of 481 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 481/481 places, 610/610 transitions.
Graph (trivial) has 403 edges and 481 vertex of which 50 / 481 are part of one of the 8 SCC in 3 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 439 transition count 509
Reduce places removed 50 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 54 rules applied. Total rules applied 105 place count 389 transition count 505
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 109 place count 385 transition count 505
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 109 place count 385 transition count 486
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 147 place count 366 transition count 486
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 208 place count 305 transition count 425
Iterating global reduction 3 with 61 rules applied. Total rules applied 269 place count 305 transition count 425
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 274 place count 305 transition count 420
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 274 place count 305 transition count 419
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 276 place count 304 transition count 419
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 289 place count 291 transition count 406
Iterating global reduction 4 with 13 rules applied. Total rules applied 302 place count 291 transition count 406
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 311 place count 291 transition count 397
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 409 place count 242 transition count 348
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 417 place count 242 transition count 340
Discarding 14 places :
Symmetric choice reduction at 6 with 14 rule applications. Total rules 431 place count 228 transition count 326
Iterating global reduction 6 with 14 rules applied. Total rules applied 445 place count 228 transition count 326
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 452 place count 228 transition count 319
Free-agglomeration rule applied 133 times.
Iterating global reduction 7 with 133 rules applied. Total rules applied 585 place count 228 transition count 186
Reduce places removed 133 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 7 with 174 rules applied. Total rules applied 759 place count 95 transition count 145
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 760 place count 95 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 761 place count 94 transition count 143
Applied a total of 761 rules in 130 ms. Remains 94 /481 variables (removed 387) and now considering 143/610 (removed 467) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 94/481 places, 143/610 transitions.
RANDOM walk for 40000 steps (635 resets) in 557 ms. (71 steps per ms) remains 1/25 properties
BEST_FIRST walk for 40003 steps (74 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2024-05-22 22:24:29] [INFO ] Flow matrix only has 139 transitions (discarded 4 similar events)
// Phase 1: matrix 139 rows 94 cols
[2024-05-22 22:24:29] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 22:24:29] [INFO ] State equation strengthened by 71 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/63 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/104 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 23/127 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/129 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 27/156 variables, 22/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/156 variables, 24/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/156 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 11/167 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/167 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/167 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 10/177 variables, 9/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/177 variables, 8/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/177 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 26/203 variables, 26/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/203 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 29/232 variables, 21/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/232 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/232 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 1/233 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/233 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/233 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/233 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/25 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/63 variables, 25/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/104 variables, 6/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 13/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 23/127 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/129 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 22:24:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/129 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 27/156 variables, 22/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/156 variables, 24/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/156 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/156 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 11/167 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/167 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/167 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 10/177 variables, 9/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/177 variables, 8/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/177 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 26/203 variables, 26/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/203 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 29/232 variables, 21/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/232 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/232 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 1/233 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/233 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/233 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 0/233 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 94/94 constraints, ReadFeed: 71/71 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 281ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 1 properties in 6 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-05-22 22:24:30] [INFO ] Flatten gal took : 25 ms
[2024-05-22 22:24:30] [INFO ] Flatten gal took : 31 ms
[2024-05-22 22:24:30] [INFO ] Input system was already deterministic with 610 transitions.
Computed a total of 14 stabilizing places and 14 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Graph (trivial) has 444 edges and 481 vertex of which 44 / 481 are part of one of the 7 SCC in 0 ms
Free SCC test removed 37 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 443 transition count 504
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 376 transition count 504
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 135 place count 376 transition count 483
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 177 place count 355 transition count 483
Discarding 85 places :
Symmetric choice reduction at 2 with 85 rule applications. Total rules 262 place count 270 transition count 398
Iterating global reduction 2 with 85 rules applied. Total rules applied 347 place count 270 transition count 398
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 352 place count 270 transition count 393
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 352 place count 270 transition count 390
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 358 place count 267 transition count 390
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 377 place count 248 transition count 371
Iterating global reduction 3 with 19 rules applied. Total rules applied 396 place count 248 transition count 371
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 413 place count 248 transition count 354
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 467 place count 221 transition count 327
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 479 place count 209 transition count 315
Iterating global reduction 4 with 12 rules applied. Total rules applied 491 place count 209 transition count 315
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 503 place count 209 transition count 303
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 511 place count 209 transition count 295
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 512 place count 208 transition count 294
Applied a total of 512 rules in 112 ms. Remains 208 /481 variables (removed 273) and now considering 294/610 (removed 316) transitions.
[2024-05-22 22:24:30] [INFO ] Flow matrix only has 288 transitions (discarded 6 similar events)
// Phase 1: matrix 288 rows 208 cols
[2024-05-22 22:24:30] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:24:30] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 22:24:30] [INFO ] Flow matrix only has 288 transitions (discarded 6 similar events)
[2024-05-22 22:24:30] [INFO ] Invariant cache hit.
[2024-05-22 22:24:30] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-22 22:24:30] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-05-22 22:24:30] [INFO ] Redundant transitions in 15 ms returned []
Running 221 sub problems to find dead transitions.
[2024-05-22 22:24:30] [INFO ] Flow matrix only has 288 transitions (discarded 6 similar events)
[2024-05-22 22:24:30] [INFO ] Invariant cache hit.
[2024-05-22 22:24:30] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 9/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 221 unsolved
[2024-05-22 22:24:32] [INFO ] Deduced a trap composed of 71 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:24:32] [INFO ] Deduced a trap composed of 69 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 287/495 variables, 208/220 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 40/260 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (OVERLAPS) 0/495 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Real declared 495/496 variables, and 260 constraints, problems are : Problem set: 0 solved, 221 unsolved in 8385 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 9/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (OVERLAPS) 287/495 variables, 208/220 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 40/260 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 221/481 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/495 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 0/495 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 221 unsolved
No progress, stopping.
After SMT solving in domain Int declared 495/496 variables, and 481 constraints, problems are : Problem set: 0 solved, 221 unsolved in 7925 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 2/2 constraints]
After SMT, in 16426ms problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 16428ms
Starting structural reductions in SI_CTL mode, iteration 1 : 208/481 places, 294/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16856 ms. Remains : 208/481 places, 294/610 transitions.
[2024-05-22 22:24:46] [INFO ] Flatten gal took : 15 ms
[2024-05-22 22:24:47] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:24:47] [INFO ] Input system was already deterministic with 294 transitions.
[2024-05-22 22:24:47] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:24:47] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:24:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality16400731234908871031.gal : 8 ms
[2024-05-22 22:24:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality8856267851136541.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/CTLCardinality16400731234908871031.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8856267851136541.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 -...281
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.60466e+12,5.75799,163520,2,13295,5,922700,6,0,1121,483896,0


Converting to forward existential form...Done !
original formula: AF((((EG(((p662!=0)&&(p430!=1))) * (p445!=0)) * ((p730!=1)&&(p887==1))) * !(A(E((p105==1) U ((p725==0)||(p908==1))) U EF((p345==0))))))
=> equivalent forward existential formula: [FwdG(Init,!((((EG(((p662!=0)&&(p430!=1))) * (p445!=0)) * ((p730!=1)&&(p887==1))) * !(!((E(!(E(TRUE U (p345==0))...271
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t48, t63, t79, t95, t109, t198, t199, t200, t201, t203, t204, t206, t209, t210, t213,...328
Detected timeout of ITS tools.
[2024-05-22 22:25:17] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:25:17] [INFO ] Applying decomposition
[2024-05-22 22:25:17] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9905364862564714531.txt' '-o' '/tmp/graph9905364862564714531.bin' '-w' '/tmp/graph9905364862564714531.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9905364862564714531.bin' '-l' '-1' '-v' '-w' '/tmp/graph9905364862564714531.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:25:17] [INFO ] Decomposing Gal with order
[2024-05-22 22:25:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:25:17] [INFO ] Removed a total of 118 redundant transitions.
[2024-05-22 22:25:17] [INFO ] Flatten gal took : 53 ms
[2024-05-22 22:25:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 10 ms.
[2024-05-22 22:25:17] [INFO ] Time to serialize gal into /tmp/CTLCardinality17747289917734556514.gal : 20 ms
[2024-05-22 22:25:17] [INFO ] Time to serialize properties into /tmp/CTLCardinality17690747311693353631.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/CTLCardinality17747289917734556514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17690747311693353631.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.60466e+12,0.120261,6716,142,302,2756,6601,587,4236,394,7172,0


Converting to forward existential form...Done !
original formula: AF((((EG(((u27.p662!=0)&&(i6.i0.u17.p430!=1))) * (i6.i0.u18.p445!=0)) * ((u27.p730!=1)&&(u27.p887==1))) * !(A(E((i1.u5.p105==1) U ((u27.p...212
=> equivalent forward existential formula: [FwdG(Init,!((((EG(((u27.p662!=0)&&(i6.i0.u17.p430!=1))) * (i6.i0.u18.p445!=0)) * ((u27.p730!=1)&&(u27.p887==1))...350
Reverse transition relation is NOT exact ! Due to transitions t198, t199, t203, t206, t210, t214, t225, t234, u27.t0, u27.t226, u27.t227, u27.t228, i1.t200...436
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,0,0.601191,26516,1,0,16861,69115,3935,32154,2121,180196,29917
FORMULA FlexibleBarrier-PT-08b-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Graph (trivial) has 452 edges and 481 vertex of which 50 / 481 are part of one of the 8 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 438 transition count 499
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 371 transition count 499
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 135 place count 371 transition count 474
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 185 place count 346 transition count 474
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 277 place count 254 transition count 382
Iterating global reduction 2 with 92 rules applied. Total rules applied 369 place count 254 transition count 382
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 374 place count 254 transition count 377
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 374 place count 254 transition count 375
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 378 place count 252 transition count 375
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 402 place count 228 transition count 351
Iterating global reduction 3 with 24 rules applied. Total rules applied 426 place count 228 transition count 351
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 449 place count 228 transition count 328
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 493 place count 206 transition count 306
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 505 place count 194 transition count 294
Iterating global reduction 4 with 12 rules applied. Total rules applied 517 place count 194 transition count 294
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 529 place count 194 transition count 282
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 537 place count 194 transition count 274
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 539 place count 192 transition count 272
Applied a total of 539 rules in 79 ms. Remains 192 /481 variables (removed 289) and now considering 272/610 (removed 338) transitions.
[2024-05-22 22:25:18] [INFO ] Flow matrix only has 265 transitions (discarded 7 similar events)
// Phase 1: matrix 265 rows 192 cols
[2024-05-22 22:25:18] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:25:18] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 22:25:18] [INFO ] Flow matrix only has 265 transitions (discarded 7 similar events)
[2024-05-22 22:25:18] [INFO ] Invariant cache hit.
[2024-05-22 22:25:18] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2024-05-22 22:25:18] [INFO ] Redundant transitions in 3 ms returned []
Running 149 sub problems to find dead transitions.
[2024-05-22 22:25:18] [INFO ] Flow matrix only has 265 transitions (discarded 7 similar events)
[2024-05-22 22:25:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 8/192 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-22 22:25:19] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 2 ms to minimize.
[2024-05-22 22:25:19] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 264/456 variables, 192/204 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/456 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/457 variables, and 204 constraints, problems are : Problem set: 0 solved, 149 unsolved in 5079 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 8/192 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 264/456 variables, 192/204 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 149/353 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (OVERLAPS) 0/456 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/457 variables, and 353 constraints, problems are : Problem set: 0 solved, 149 unsolved in 4664 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 2/2 constraints]
After SMT, in 9780ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 9782ms
Starting structural reductions in SI_CTL mode, iteration 1 : 192/481 places, 272/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10179 ms. Remains : 192/481 places, 272/610 transitions.
[2024-05-22 22:25:28] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:25:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:25:28] [INFO ] Input system was already deterministic with 272 transitions.
[2024-05-22 22:25:28] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:25:28] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:25:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality1880057222545442758.gal : 7 ms
[2024-05-22 22:25:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality10258608871910284097.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/CTLCardinality1880057222545442758.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10258608871910284097.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.02094e+11,1.55543,53464,2,6392,5,303523,6,0,1035,135566,0


Converting to forward existential form...Done !
original formula: AG(EF((EF((p267==1)) * (p759==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (E(TRUE U (p267==1)) * (p759==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t62, t76, t196, t197, t199, Intersection with reachable at each step enabled. (destroyed...193
Detected timeout of ITS tools.
[2024-05-22 22:25:58] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:25:58] [INFO ] Applying decomposition
[2024-05-22 22:25:58] [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/graph9136858341872013669.txt' '-o' '/tmp/graph9136858341872013669.bin' '-w' '/tmp/graph9136858341872013669.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9136858341872013669.bin' '-l' '-1' '-v' '-w' '/tmp/graph9136858341872013669.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:25:58] [INFO ] Decomposing Gal with order
[2024-05-22 22:25:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:25:58] [INFO ] Removed a total of 96 redundant transitions.
[2024-05-22 22:25:58] [INFO ] Flatten gal took : 36 ms
[2024-05-22 22:25:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 4 ms.
[2024-05-22 22:25:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality16475513304818265575.gal : 3 ms
[2024-05-22 22:25:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality8590139385786999614.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/CTLCardinality16475513304818265575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8590139385786999614.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,8.02094e+11,0.118864,6596,45,112,4306,1123,513,7525,353,1346,0


Converting to forward existential form...Done !
original formula: AG(EF((EF((i3.u11.p267==1)) * (i8.u25.p759==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (E(TRUE U (i3.u11.p267==1)) * (i8.u25.p759==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t196, t199, i2.u7.t76, i3.u10.t62, i3.u11.t197, i8.t0, Intersection with reachable at each s...216
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Graph (trivial) has 453 edges and 481 vertex of which 50 / 481 are part of one of the 8 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 438 transition count 498
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 137 place count 370 transition count 498
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 137 place count 370 transition count 473
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 187 place count 345 transition count 473
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 279 place count 253 transition count 381
Iterating global reduction 2 with 92 rules applied. Total rules applied 371 place count 253 transition count 381
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 376 place count 253 transition count 376
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 376 place count 253 transition count 374
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 380 place count 251 transition count 374
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 403 place count 228 transition count 351
Iterating global reduction 3 with 23 rules applied. Total rules applied 426 place count 228 transition count 351
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 448 place count 228 transition count 329
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 492 place count 206 transition count 307
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 504 place count 194 transition count 295
Iterating global reduction 4 with 12 rules applied. Total rules applied 516 place count 194 transition count 295
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 528 place count 194 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 536 place count 194 transition count 275
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 538 place count 192 transition count 273
Applied a total of 538 rules in 70 ms. Remains 192 /481 variables (removed 289) and now considering 273/610 (removed 337) transitions.
[2024-05-22 22:26:28] [INFO ] Flow matrix only has 266 transitions (discarded 7 similar events)
// Phase 1: matrix 266 rows 192 cols
[2024-05-22 22:26:28] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 22:26:28] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-22 22:26:28] [INFO ] Flow matrix only has 266 transitions (discarded 7 similar events)
[2024-05-22 22:26:28] [INFO ] Invariant cache hit.
[2024-05-22 22:26:28] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-22 22:26:28] [INFO ] Redundant transitions in 3 ms returned []
Running 149 sub problems to find dead transitions.
[2024-05-22 22:26:28] [INFO ] Flow matrix only has 266 transitions (discarded 7 similar events)
[2024-05-22 22:26:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 8/192 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 265/457 variables, 192/202 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (OVERLAPS) 0/457 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 457/458 variables, and 202 constraints, problems are : Problem set: 0 solved, 149 unsolved in 4246 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/184 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/184 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (OVERLAPS) 8/192 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/192 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (OVERLAPS) 265/457 variables, 192/202 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 149/351 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 0/457 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 457/458 variables, and 351 constraints, problems are : Problem set: 0 solved, 149 unsolved in 4504 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 192/192 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
After SMT, in 8786ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 8788ms
Starting structural reductions in SI_CTL mode, iteration 1 : 192/481 places, 273/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9203 ms. Remains : 192/481 places, 273/610 transitions.
[2024-05-22 22:26:37] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:26:37] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:26:37] [INFO ] Input system was already deterministic with 273 transitions.
[2024-05-22 22:26:37] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:26:37] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:26:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality10301987939431748598.gal : 2 ms
[2024-05-22 22:26:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality10972820035380871628.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/CTLCardinality10301987939431748598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10972820035380871628.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,8.74064e+11,1.23986,46784,2,3902,5,261900,6,0,1036,122149,0


Converting to forward existential form...Done !
original formula: EF(EG(((p523==0)||(p474==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),((p523==0)||(p474==1)))] != FALSE
Hit Full ! (commute/partial/dont) 269/0/4
(forward)formula 0,1,2.38654,63176,1,0,8,340903,19,3,5079,193117,8
FORMULA FlexibleBarrier-PT-08b-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Discarding 82 places :
Symmetric choice reduction at 0 with 82 rule applications. Total rules 82 place count 399 transition count 528
Iterating global reduction 0 with 82 rules applied. Total rules applied 164 place count 399 transition count 528
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 168 place count 399 transition count 524
Discarding 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 208 place count 359 transition count 484
Iterating global reduction 1 with 40 rules applied. Total rules applied 248 place count 359 transition count 484
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 272 place count 359 transition count 460
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 282 place count 349 transition count 450
Iterating global reduction 2 with 10 rules applied. Total rules applied 292 place count 349 transition count 450
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 298 place count 349 transition count 444
Applied a total of 298 rules in 28 ms. Remains 349 /481 variables (removed 132) and now considering 444/610 (removed 166) transitions.
// Phase 1: matrix 444 rows 349 cols
[2024-05-22 22:26:40] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:26:40] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-22 22:26:40] [INFO ] Invariant cache hit.
[2024-05-22 22:26:40] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Running 443 sub problems to find dead transitions.
[2024-05-22 22:26:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/349 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 444/793 variables, 349/359 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 5 (OVERLAPS) 0/793 variables, 0/359 constraints. Problems are: Problem set: 0 solved, 443 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 359 constraints, problems are : Problem set: 0 solved, 443 unsolved in 19874 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 443 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 1 (OVERLAPS) 1/349 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 3 (OVERLAPS) 444/793 variables, 349/359 constraints. Problems are: Problem set: 0 solved, 443 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/793 variables, 443/802 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 22:27:06] [INFO ] Deduced a trap composed of 261 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:27:07] [INFO ] Deduced a trap composed of 112 places in 73 ms of which 2 ms to minimize.
[2024-05-22 22:27:08] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:27:08] [INFO ] Deduced a trap composed of 77 places in 101 ms of which 2 ms to minimize.
[2024-05-22 22:27:09] [INFO ] Deduced a trap composed of 79 places in 99 ms of which 2 ms to minimize.
[2024-05-22 22:27:09] [INFO ] Deduced a trap composed of 81 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:27:10] [INFO ] Deduced a trap composed of 80 places in 87 ms of which 2 ms to minimize.
[2024-05-22 22:27:10] [INFO ] Deduced a trap composed of 111 places in 85 ms of which 2 ms to minimize.
[2024-05-22 22:27:11] [INFO ] Deduced a trap composed of 82 places in 94 ms of which 2 ms to minimize.
[2024-05-22 22:27:11] [INFO ] Deduced a trap composed of 82 places in 82 ms of which 2 ms to minimize.
[2024-05-22 22:27:12] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 2 ms to minimize.
[2024-05-22 22:27:13] [INFO ] Deduced a trap composed of 258 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:27:13] [INFO ] Deduced a trap composed of 260 places in 93 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/793 variables, 13/815 constraints. Problems are: Problem set: 0 solved, 443 unsolved
[2024-05-22 22:27:20] [INFO ] Deduced a trap composed of 85 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:27:20] [INFO ] Deduced a trap composed of 84 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 2/817 constraints. Problems are: Problem set: 0 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/793 variables, and 817 constraints, problems are : Problem set: 0 solved, 443 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 443/443 constraints, Known Traps: 15/15 constraints]
After SMT, in 50017ms problems are : Problem set: 0 solved, 443 unsolved
Search for dead transitions found 0 dead transitions in 50022ms
Starting structural reductions in LTL mode, iteration 1 : 349/481 places, 444/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50356 ms. Remains : 349/481 places, 444/610 transitions.
[2024-05-22 22:27:30] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:27:30] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:27:30] [INFO ] Input system was already deterministic with 444 transitions.
[2024-05-22 22:27:30] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:27:30] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:27:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality5341534255277846023.gal : 2 ms
[2024-05-22 22:27:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality9428607089241396950.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/CTLCardinality5341534255277846023.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9428607089241396950.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:28:00] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:28:00] [INFO ] Applying decomposition
[2024-05-22 22:28:00] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17809346676898370992.txt' '-o' '/tmp/graph17809346676898370992.bin' '-w' '/tmp/graph17809346676898370992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17809346676898370992.bin' '-l' '-1' '-v' '-w' '/tmp/graph17809346676898370992.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:28:00] [INFO ] Decomposing Gal with order
[2024-05-22 22:28:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:28:00] [INFO ] Removed a total of 221 redundant transitions.
[2024-05-22 22:28:00] [INFO ] Flatten gal took : 40 ms
[2024-05-22 22:28:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 15 ms.
[2024-05-22 22:28:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality8950075907689207139.gal : 5 ms
[2024-05-22 22:28:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality14612597408110327471.ctl : 8 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/CTLCardinality8950075907689207139.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14612597408110327471.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.46562e+14,10.7909,305924,10411,1432,572736,37026,1120,1.01812e+06,395,122987,0


Converting to forward existential form...Done !
original formula: (EX(A(!(((((i7.i0.u44.p357==0)||(i4.i1.u19.p155==1))&&((i9.i1.u52.p454==0)||(i5.i0.u27.p181==1)))&&(i3.i0.u23.p121==1))) U E(!(((i13.u80....325
=> equivalent forward existential formula: [(FwdU((Init * !(EX(!((E(!(E(!(((i13.u80.p699==0)||(i7.i0.u45.p390==1))) U (((((i2.i0.u6.p18==0)||(i13.u82.p862=...721
Reverse transition relation is NOT exact ! Due to transitions t1, t64, t94, t95, t126, t127, t159, t193, t225, t239, t258, t259, t291, t356, t357, t358, t3...1079
(forward)formula 0,1,24.988,553028,1,0,890277,250310,6447,2.19693e+06,1777,1.15577e+06,2554123
FORMULA FlexibleBarrier-PT-08b-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 86 place count 395 transition count 524
Iterating global reduction 0 with 86 rules applied. Total rules applied 172 place count 395 transition count 524
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 177 place count 395 transition count 519
Discarding 46 places :
Symmetric choice reduction at 1 with 46 rule applications. Total rules 223 place count 349 transition count 473
Iterating global reduction 1 with 46 rules applied. Total rules applied 269 place count 349 transition count 473
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 293 place count 349 transition count 449
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 308 place count 334 transition count 434
Iterating global reduction 2 with 15 rules applied. Total rules applied 323 place count 334 transition count 434
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 333 place count 334 transition count 424
Applied a total of 333 rules in 18 ms. Remains 334 /481 variables (removed 147) and now considering 424/610 (removed 186) transitions.
// Phase 1: matrix 424 rows 334 cols
[2024-05-22 22:28:26] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 22:28:26] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-22 22:28:26] [INFO ] Invariant cache hit.
[2024-05-22 22:28:26] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
Running 423 sub problems to find dead transitions.
[2024-05-22 22:28:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/333 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 1/334 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-22 22:28:31] [INFO ] Deduced a trap composed of 170 places in 93 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (OVERLAPS) 424/758 variables, 334/345 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/758 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 6 (OVERLAPS) 0/758 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 423 unsolved
No progress, stopping.
After SMT solving in domain Real declared 758/758 variables, and 345 constraints, problems are : Problem set: 0 solved, 423 unsolved in 22257 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 334/334 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 423 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/333 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 1 (OVERLAPS) 1/334 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/334 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/334 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 4 (OVERLAPS) 424/758 variables, 334/345 constraints. Problems are: Problem set: 0 solved, 423 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/758 variables, 423/768 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-22 22:28:55] [INFO ] Deduced a trap composed of 74 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:28:56] [INFO ] Deduced a trap composed of 78 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:28:57] [INFO ] Deduced a trap composed of 79 places in 80 ms of which 2 ms to minimize.
[2024-05-22 22:28:57] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 1 ms to minimize.
[2024-05-22 22:28:57] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:28:58] [INFO ] Deduced a trap composed of 81 places in 71 ms of which 2 ms to minimize.
[2024-05-22 22:28:58] [INFO ] Deduced a trap composed of 83 places in 65 ms of which 1 ms to minimize.
[2024-05-22 22:28:59] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:29:00] [INFO ] Deduced a trap composed of 250 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:29:00] [INFO ] Deduced a trap composed of 250 places in 93 ms of which 2 ms to minimize.
[2024-05-22 22:29:00] [INFO ] Deduced a trap composed of 253 places in 93 ms of which 3 ms to minimize.
[2024-05-22 22:29:01] [INFO ] Deduced a trap composed of 250 places in 83 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/758 variables, 12/780 constraints. Problems are: Problem set: 0 solved, 423 unsolved
[2024-05-22 22:29:06] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/758 variables, 1/781 constraints. Problems are: Problem set: 0 solved, 423 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 758/758 variables, and 781 constraints, problems are : Problem set: 0 solved, 423 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 334/334 constraints, PredecessorRefiner: 423/423 constraints, Known Traps: 14/14 constraints]
After SMT, in 52398ms problems are : Problem set: 0 solved, 423 unsolved
Search for dead transitions found 0 dead transitions in 52402ms
Starting structural reductions in LTL mode, iteration 1 : 334/481 places, 424/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52793 ms. Remains : 334/481 places, 424/610 transitions.
[2024-05-22 22:29:18] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:29:18] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:29:18] [INFO ] Input system was already deterministic with 424 transitions.
[2024-05-22 22:29:18] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:29:18] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:29:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality16405056830482799489.gal : 3 ms
[2024-05-22 22:29:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality3868152239262933956.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/CTLCardinality16405056830482799489.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3868152239262933956.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:29:48] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:29:48] [INFO ] Applying decomposition
[2024-05-22 22:29:48] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12199695807309248785.txt' '-o' '/tmp/graph12199695807309248785.bin' '-w' '/tmp/graph12199695807309248785.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12199695807309248785.bin' '-l' '-1' '-v' '-w' '/tmp/graph12199695807309248785.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:29:48] [INFO ] Decomposing Gal with order
[2024-05-22 22:29:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:29:48] [INFO ] Removed a total of 206 redundant transitions.
[2024-05-22 22:29:48] [INFO ] Flatten gal took : 22 ms
[2024-05-22 22:29:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 22:29:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality10690939106525876128.gal : 4 ms
[2024-05-22 22:29:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality4399511022109638621.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/CTLCardinality10690939106525876128.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4399511022109638621.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Graph (trivial) has 446 edges and 481 vertex of which 48 / 481 are part of one of the 8 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 440 transition count 503
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 374 transition count 503
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 133 place count 374 transition count 479
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 181 place count 350 transition count 479
Discarding 92 places :
Symmetric choice reduction at 2 with 92 rule applications. Total rules 273 place count 258 transition count 387
Iterating global reduction 2 with 92 rules applied. Total rules applied 365 place count 258 transition count 387
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 370 place count 258 transition count 382
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 370 place count 258 transition count 380
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 374 place count 256 transition count 380
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 395 place count 235 transition count 359
Iterating global reduction 3 with 21 rules applied. Total rules applied 416 place count 235 transition count 359
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 436 place count 235 transition count 339
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 480 place count 213 transition count 317
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 492 place count 201 transition count 305
Iterating global reduction 4 with 12 rules applied. Total rules applied 504 place count 201 transition count 305
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 516 place count 201 transition count 293
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 524 place count 201 transition count 285
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 526 place count 199 transition count 283
Applied a total of 526 rules in 46 ms. Remains 199 /481 variables (removed 282) and now considering 283/610 (removed 327) transitions.
[2024-05-22 22:30:19] [INFO ] Flow matrix only has 276 transitions (discarded 7 similar events)
// Phase 1: matrix 276 rows 199 cols
[2024-05-22 22:30:19] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 22:30:19] [INFO ] Implicit Places using invariants in 119 ms returned []
[2024-05-22 22:30:19] [INFO ] Flow matrix only has 276 transitions (discarded 7 similar events)
[2024-05-22 22:30:19] [INFO ] Invariant cache hit.
[2024-05-22 22:30:19] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2024-05-22 22:30:19] [INFO ] Redundant transitions in 2 ms returned []
Running 156 sub problems to find dead transitions.
[2024-05-22 22:30:19] [INFO ] Flow matrix only has 276 transitions (discarded 7 similar events)
[2024-05-22 22:30:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 8/199 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 275/474 variables, 199/209 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 0/474 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/475 variables, and 209 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4697 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 8/199 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/199 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 275/474 variables, 199/209 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/474 variables, 156/365 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 0/474 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/475 variables, and 365 constraints, problems are : Problem set: 0 solved, 156 unsolved in 4954 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints]
After SMT, in 9692ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 9694ms
Starting structural reductions in SI_CTL mode, iteration 1 : 199/481 places, 283/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10014 ms. Remains : 199/481 places, 283/610 transitions.
[2024-05-22 22:30:29] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:30:29] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:30:29] [INFO ] Input system was already deterministic with 283 transitions.
[2024-05-22 22:30:29] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:30:29] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:30:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality16188925807023231262.gal : 2 ms
[2024-05-22 22:30:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality9654030729349262764.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/CTLCardinality16188925807023231262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9654030729349262764.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.2742e+12,1.91173,54504,2,4330,5,309590,6,0,1074,143507,0


Converting to forward existential form...Done !
original formula: A(((p162==0)||(p64==1)) U ((AG(!(((p604==0)&&(p353==1)))) * AF(((p650==0)||(p561==1)))) * EF((p209==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(((!(E(TRUE U !(!(((p604==0)&&(p353==1)))))) * !(EG(!(((p650==0)||(p561==1)))))) * E(TRUE U (p20...428
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-22 22:30:59] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:30:59] [INFO ] Applying decomposition
[2024-05-22 22:30:59] [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/graph4819393495811964241.txt' '-o' '/tmp/graph4819393495811964241.bin' '-w' '/tmp/graph4819393495811964241.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4819393495811964241.bin' '-l' '-1' '-v' '-w' '/tmp/graph4819393495811964241.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:30:59] [INFO ] Decomposing Gal with order
[2024-05-22 22:30:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:30:59] [INFO ] Removed a total of 103 redundant transitions.
[2024-05-22 22:30:59] [INFO ] Flatten gal took : 14 ms
[2024-05-22 22:30:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 51 labels/synchronizations in 3 ms.
[2024-05-22 22:30:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality16226302915650451212.gal : 3 ms
[2024-05-22 22:30:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality1429188248326286736.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/CTLCardinality16226302915650451212.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1429188248326286736.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.2742e+12,0.052267,5560,62,100,1738,1289,555,2197,368,1478,0


Converting to forward existential form...Done !
original formula: A(((i2.i1.u5.p162==0)||(i0.u0.p64==1)) U ((AG(!(((i8.u25.p604==0)&&(i5.u15.p353==1)))) * AF(((i8.u24.p650==0)||(i7.u21.p561==1)))) * EF((...172
=> equivalent forward existential formula: [((Init * !(EG(!(((!(E(TRUE U !(!(((i8.u25.p604==0)&&(i5.u15.p353==1)))))) * !(EG(!(((i8.u24.p650==0)||(i7.u21.p...545
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 79 place count 402 transition count 531
Iterating global reduction 0 with 79 rules applied. Total rules applied 158 place count 402 transition count 531
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 163 place count 402 transition count 526
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 204 place count 361 transition count 485
Iterating global reduction 1 with 41 rules applied. Total rules applied 245 place count 361 transition count 485
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 266 place count 361 transition count 464
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 277 place count 350 transition count 453
Iterating global reduction 2 with 11 rules applied. Total rules applied 288 place count 350 transition count 453
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 295 place count 350 transition count 446
Applied a total of 295 rules in 26 ms. Remains 350 /481 variables (removed 131) and now considering 446/610 (removed 164) transitions.
// Phase 1: matrix 446 rows 350 cols
[2024-05-22 22:31:29] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 22:31:29] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-22 22:31:29] [INFO ] Invariant cache hit.
[2024-05-22 22:31:29] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2024-05-22 22:31:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/350 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (OVERLAPS) 446/796 variables, 350/360 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/796 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (OVERLAPS) 0/796 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 445 unsolved
No progress, stopping.
After SMT solving in domain Real declared 796/796 variables, and 360 constraints, problems are : Problem set: 0 solved, 445 unsolved in 20143 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 350/350 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/350 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (OVERLAPS) 446/796 variables, 350/360 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/796 variables, 445/805 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-22 22:31:57] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2024-05-22 22:31:57] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:31:58] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 2 ms to minimize.
[2024-05-22 22:31:59] [INFO ] Deduced a trap composed of 81 places in 102 ms of which 2 ms to minimize.
[2024-05-22 22:32:00] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:32:01] [INFO ] Deduced a trap composed of 83 places in 74 ms of which 1 ms to minimize.
[2024-05-22 22:32:01] [INFO ] Deduced a trap composed of 82 places in 74 ms of which 1 ms to minimize.
[2024-05-22 22:32:02] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:32:03] [INFO ] Deduced a trap composed of 86 places in 89 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/796 variables, 9/814 constraints. Problems are: Problem set: 0 solved, 445 unsolved
[2024-05-22 22:32:11] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/796 variables, 1/815 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/796 variables, and 815 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 350/350 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 10/10 constraints]
After SMT, in 50290ms problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 50294ms
Starting structural reductions in LTL mode, iteration 1 : 350/481 places, 446/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50661 ms. Remains : 350/481 places, 446/610 transitions.
[2024-05-22 22:32:20] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:32:20] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:32:20] [INFO ] Input system was already deterministic with 446 transitions.
[2024-05-22 22:32:20] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:32:20] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:32:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality16894745005071525680.gal : 2 ms
[2024-05-22 22:32:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality6080754183533635435.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/CTLCardinality16894745005071525680.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6080754183533635435.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:50] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:32:50] [INFO ] Applying decomposition
[2024-05-22 22:32:50] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6233923481830996861.txt' '-o' '/tmp/graph6233923481830996861.bin' '-w' '/tmp/graph6233923481830996861.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6233923481830996861.bin' '-l' '-1' '-v' '-w' '/tmp/graph6233923481830996861.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:32:50] [INFO ] Decomposing Gal with order
[2024-05-22 22:32:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:32:50] [INFO ] Removed a total of 215 redundant transitions.
[2024-05-22 22:32:50] [INFO ] Flatten gal took : 20 ms
[2024-05-22 22:32:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 22:32:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality12140106420511593785.gal : 4 ms
[2024-05-22 22:32:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality8004204931922647872.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/CTLCardinality12140106420511593785.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8004204931922647872.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.66598e+14,29.5433,676468,13744,1435,1.19669e+06,33460,1104,2.79345e+06,393,115344,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Discarding 81 places :
Symmetric choice reduction at 0 with 81 rule applications. Total rules 81 place count 400 transition count 529
Iterating global reduction 0 with 81 rules applied. Total rules applied 162 place count 400 transition count 529
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 166 place count 400 transition count 525
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 207 place count 359 transition count 484
Iterating global reduction 1 with 41 rules applied. Total rules applied 248 place count 359 transition count 484
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 271 place count 359 transition count 461
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 284 place count 346 transition count 448
Iterating global reduction 2 with 13 rules applied. Total rules applied 297 place count 346 transition count 448
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 305 place count 346 transition count 440
Applied a total of 305 rules in 20 ms. Remains 346 /481 variables (removed 135) and now considering 440/610 (removed 170) transitions.
// Phase 1: matrix 440 rows 346 cols
[2024-05-22 22:33:20] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 22:33:20] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-22 22:33:20] [INFO ] Invariant cache hit.
[2024-05-22 22:33:20] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 439 sub problems to find dead transitions.
[2024-05-22 22:33:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2024-05-22 22:33:25] [INFO ] Deduced a trap composed of 31 places in 76 ms of which 3 ms to minimize.
[2024-05-22 22:33:25] [INFO ] Deduced a trap composed of 78 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (OVERLAPS) 440/786 variables, 346/358 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/786 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 6 (OVERLAPS) 0/786 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 439 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 358 constraints, problems are : Problem set: 0 solved, 439 unsolved in 24237 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/346 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (OVERLAPS) 440/786 variables, 346/358 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/786 variables, 439/797 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2024-05-22 22:33:51] [INFO ] Deduced a trap composed of 70 places in 81 ms of which 2 ms to minimize.
[2024-05-22 22:33:51] [INFO ] Deduced a trap composed of 96 places in 87 ms of which 2 ms to minimize.
[2024-05-22 22:33:51] [INFO ] Deduced a trap composed of 87 places in 72 ms of which 2 ms to minimize.
[2024-05-22 22:33:52] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 2 ms to minimize.
[2024-05-22 22:33:52] [INFO ] Deduced a trap composed of 76 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:33:53] [INFO ] Deduced a trap composed of 77 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:33:54] [INFO ] Deduced a trap composed of 240 places in 95 ms of which 3 ms to minimize.
[2024-05-22 22:33:54] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:33:55] [INFO ] Deduced a trap composed of 80 places in 95 ms of which 2 ms to minimize.
[2024-05-22 22:33:55] [INFO ] Deduced a trap composed of 104 places in 85 ms of which 2 ms to minimize.
[2024-05-22 22:33:56] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 2 ms to minimize.
[2024-05-22 22:33:56] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 12/809 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2024-05-22 22:34:02] [INFO ] Deduced a trap composed of 81 places in 95 ms of which 1 ms to minimize.
[2024-05-22 22:34:02] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 2/811 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 786/786 variables, and 811 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 16/16 constraints]
After SMT, in 54382ms problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 54386ms
Starting structural reductions in LTL mode, iteration 1 : 346/481 places, 440/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54719 ms. Remains : 346/481 places, 440/610 transitions.
[2024-05-22 22:34:15] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:34:15] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:34:15] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 22:34:15] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:34:15] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:34:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality11068052320427926747.gal : 2 ms
[2024-05-22 22:34:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality9793250882801455534.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/CTLCardinality11068052320427926747.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9793250882801455534.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:34:45] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:34:45] [INFO ] Applying decomposition
[2024-05-22 22:34:45] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2340367019453220910.txt' '-o' '/tmp/graph2340367019453220910.bin' '-w' '/tmp/graph2340367019453220910.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2340367019453220910.bin' '-l' '-1' '-v' '-w' '/tmp/graph2340367019453220910.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:34:45] [INFO ] Decomposing Gal with order
[2024-05-22 22:34:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:34:45] [INFO ] Removed a total of 216 redundant transitions.
[2024-05-22 22:34:45] [INFO ] Flatten gal took : 18 ms
[2024-05-22 22:34:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 3 ms.
[2024-05-22 22:34:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality4324622770892734651.gal : 3 ms
[2024-05-22 22:34:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality11884471903757316173.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/CTLCardinality4324622770892734651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11884471903757316173.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Graph (trivial) has 432 edges and 481 vertex of which 30 / 481 are part of one of the 5 SCC in 1 ms
Free SCC test removed 25 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 455 transition count 521
Reduce places removed 63 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 67 rules applied. Total rules applied 131 place count 392 transition count 517
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 136 place count 388 transition count 516
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 27 Pre rules applied. Total rules applied 136 place count 388 transition count 489
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 190 place count 361 transition count 489
Discarding 83 places :
Symmetric choice reduction at 3 with 83 rule applications. Total rules 273 place count 278 transition count 406
Iterating global reduction 3 with 83 rules applied. Total rules applied 356 place count 278 transition count 406
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 361 place count 278 transition count 401
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 361 place count 278 transition count 400
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 363 place count 277 transition count 400
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 387 place count 253 transition count 376
Iterating global reduction 4 with 24 rules applied. Total rules applied 411 place count 253 transition count 376
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 4 with 23 rules applied. Total rules applied 434 place count 253 transition count 353
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 496 place count 222 transition count 322
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 504 place count 214 transition count 314
Iterating global reduction 5 with 8 rules applied. Total rules applied 512 place count 214 transition count 314
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 520 place count 214 transition count 306
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 527 place count 214 transition count 299
Partial Post-agglomeration rule applied 10 times.
Drop transitions (Partial Post agglomeration) removed 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 537 place count 214 transition count 299
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 539 place count 212 transition count 297
Applied a total of 539 rules in 69 ms. Remains 212 /481 variables (removed 269) and now considering 297/610 (removed 313) transitions.
[2024-05-22 22:35:15] [INFO ] Flow matrix only has 293 transitions (discarded 4 similar events)
// Phase 1: matrix 293 rows 212 cols
[2024-05-22 22:35:15] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 22:35:15] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-22 22:35:15] [INFO ] Flow matrix only has 293 transitions (discarded 4 similar events)
[2024-05-22 22:35:15] [INFO ] Invariant cache hit.
[2024-05-22 22:35:15] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2024-05-22 22:35:15] [INFO ] Redundant transitions in 1 ms returned []
Running 196 sub problems to find dead transitions.
[2024-05-22 22:35:15] [INFO ] Flow matrix only has 293 transitions (discarded 4 similar events)
[2024-05-22 22:35:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
[2024-05-22 22:35:17] [INFO ] Deduced a trap composed of 65 places in 74 ms of which 2 ms to minimize.
[2024-05-22 22:35:17] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 292/504 variables, 212/224 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/504 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 504/505 variables, and 224 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7052 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/204 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 8/212 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (OVERLAPS) 292/504 variables, 212/224 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 196/420 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/504 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/504 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 504/505 variables, and 420 constraints, problems are : Problem set: 0 solved, 196 unsolved in 6464 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 2/2 constraints]
After SMT, in 13557ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 13559ms
Starting structural reductions in SI_CTL mode, iteration 1 : 212/481 places, 297/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13878 ms. Remains : 212/481 places, 297/610 transitions.
[2024-05-22 22:35:29] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:35:29] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:35:29] [INFO ] Input system was already deterministic with 297 transitions.
[2024-05-22 22:35:29] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:35:29] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:35:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15478189919892011938.gal : 1 ms
[2024-05-22 22:35:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality8456928805897591162.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/CTLCardinality15478189919892011938.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8456928805897591162.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,2.17794e+12,2.54251,83748,2,9250,5,471066,6,0,1143,265658,0


Converting to forward existential form...Done !
original formula: AG(E((p888!=1) U (!(E(((p599==0)||(p271==1)) U ((p594==1)||(p751==1)))) + (AG((p106!=1)) * (AF(((p641==0)||(p130==1))) + (EG(((p164==0)||...184
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((p888!=1) U (!(E(((p599==0)||(p271==1)) U ((p594==1)||(p751==1)))) + (!(E(TRUE U !((p106...256
Reverse transition relation is NOT exact ! Due to transitions t3, t54, t87, t201, t208, Intersection with reachable at each step enabled. (destroyed/rever...187
Detected timeout of ITS tools.
[2024-05-22 22:35:59] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:35:59] [INFO ] Applying decomposition
[2024-05-22 22:35:59] [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/graph10643959165784569048.txt' '-o' '/tmp/graph10643959165784569048.bin' '-w' '/tmp/graph10643959165784569048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10643959165784569048.bin' '-l' '-1' '-v' '-w' '/tmp/graph10643959165784569048.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:35:59] [INFO ] Decomposing Gal with order
[2024-05-22 22:35:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:35:59] [INFO ] Removed a total of 125 redundant transitions.
[2024-05-22 22:35:59] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:35:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 37 labels/synchronizations in 2 ms.
[2024-05-22 22:35:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality11354539977276210793.gal : 2 ms
[2024-05-22 22:35:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality17865902026683380574.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/CTLCardinality11354539977276210793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17865902026683380574.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,2.17794e+12,0.110229,8156,107,105,7099,2141,718,11125,396,2540,0


Converting to forward existential form...Done !
original formula: AG(E((i9.u32.p888!=1) U (!(E(((i7.u30.p599==0)||(i3.u15.p271==1)) U ((i6.i1.u23.p594==1)||(i9.u33.p751==1)))) + (AG((i1.u4.p106!=1)) * (A...263
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E((i9.u32.p888!=1) U (!(E(((i7.u30.p599==0)||(i3.u15.p271==1)) U ((i6.i1.u23.p594==1)||(i9...335
Reverse transition relation is NOT exact ! Due to transitions t201, t208, i4.u16.t87, i8.i1.u28.t54, i9.t3, Intersection with reachable at each step enabl...207
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 86 place count 395 transition count 524
Iterating global reduction 0 with 86 rules applied. Total rules applied 172 place count 395 transition count 524
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 177 place count 395 transition count 519
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 222 place count 350 transition count 474
Iterating global reduction 1 with 45 rules applied. Total rules applied 267 place count 350 transition count 474
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 291 place count 350 transition count 450
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 305 place count 336 transition count 436
Iterating global reduction 2 with 14 rules applied. Total rules applied 319 place count 336 transition count 436
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 329 place count 336 transition count 426
Applied a total of 329 rules in 16 ms. Remains 336 /481 variables (removed 145) and now considering 426/610 (removed 184) transitions.
// Phase 1: matrix 426 rows 336 cols
[2024-05-22 22:36:29] [INFO ] Computed 10 invariants in 6 ms
[2024-05-22 22:36:29] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-22 22:36:29] [INFO ] Invariant cache hit.
[2024-05-22 22:36:29] [INFO ] Implicit Places using invariants and state equation in 192 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 425 sub problems to find dead transitions.
[2024-05-22 22:36:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:36:34] [INFO ] Deduced a trap composed of 47 places in 39 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 426/762 variables, 336/347 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 6 (OVERLAPS) 0/762 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 425 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 347 constraints, problems are : Problem set: 0 solved, 425 unsolved in 22776 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 425 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/336 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 4 (OVERLAPS) 426/762 variables, 336/347 constraints. Problems are: Problem set: 0 solved, 425 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 425/772 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:36:59] [INFO ] Deduced a trap composed of 74 places in 102 ms of which 2 ms to minimize.
[2024-05-22 22:37:00] [INFO ] Deduced a trap composed of 77 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:37:00] [INFO ] Deduced a trap composed of 80 places in 90 ms of which 2 ms to minimize.
[2024-05-22 22:37:01] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:37:01] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 1 ms to minimize.
[2024-05-22 22:37:02] [INFO ] Deduced a trap composed of 84 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:37:02] [INFO ] Deduced a trap composed of 83 places in 69 ms of which 1 ms to minimize.
[2024-05-22 22:37:03] [INFO ] Deduced a trap composed of 85 places in 61 ms of which 1 ms to minimize.
[2024-05-22 22:37:04] [INFO ] Deduced a trap composed of 250 places in 81 ms of which 2 ms to minimize.
[2024-05-22 22:37:04] [INFO ] Deduced a trap composed of 257 places in 85 ms of which 2 ms to minimize.
[2024-05-22 22:37:04] [INFO ] Deduced a trap composed of 249 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 11/783 constraints. Problems are: Problem set: 0 solved, 425 unsolved
[2024-05-22 22:37:11] [INFO ] Deduced a trap composed of 78 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:37:14] [INFO ] Deduced a trap composed of 253 places in 95 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/762 variables, 2/785 constraints. Problems are: Problem set: 0 solved, 425 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 1)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 1)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 1)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 1)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 1)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 1)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 timeout
0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 785 constraints, problems are : Problem set: 0 solved, 425 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 425/425 constraints, Known Traps: 14/14 constraints]
After SMT, in 52926ms problems are : Problem set: 0 solved, 425 unsolved
Search for dead transitions found 0 dead transitions in 52930ms
Starting structural reductions in LTL mode, iteration 1 : 336/481 places, 426/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53247 ms. Remains : 336/481 places, 426/610 transitions.
[2024-05-22 22:37:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:37:22] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:37:22] [INFO ] Input system was already deterministic with 426 transitions.
[2024-05-22 22:37:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:37:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:37:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality13539602787041895412.gal : 2 ms
[2024-05-22 22:37:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality1794460038887205564.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/CTLCardinality13539602787041895412.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1794460038887205564.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:37:52] [INFO ] Flatten gal took : 14 ms
[2024-05-22 22:37:52] [INFO ] Applying decomposition
[2024-05-22 22:37:52] [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/graph1562171731741751420.txt' '-o' '/tmp/graph1562171731741751420.bin' '-w' '/tmp/graph1562171731741751420.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1562171731741751420.bin' '-l' '-1' '-v' '-w' '/tmp/graph1562171731741751420.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:37:52] [INFO ] Decomposing Gal with order
[2024-05-22 22:37:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:37:52] [INFO ] Removed a total of 206 redundant transitions.
[2024-05-22 22:37:52] [INFO ] Flatten gal took : 16 ms
[2024-05-22 22:37:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 4 ms.
[2024-05-22 22:37:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality9561460459768602288.gal : 4 ms
[2024-05-22 22:37:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality2386137422255864187.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/CTLCardinality9561460459768602288.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2386137422255864187.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Graph (trivial) has 433 edges and 481 vertex of which 44 / 481 are part of one of the 7 SCC in 1 ms
Free SCC test removed 37 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 443 transition count 507
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 379 transition count 507
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 129 place count 379 transition count 482
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 179 place count 354 transition count 482
Discarding 87 places :
Symmetric choice reduction at 2 with 87 rule applications. Total rules 266 place count 267 transition count 395
Iterating global reduction 2 with 87 rules applied. Total rules applied 353 place count 267 transition count 395
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 358 place count 267 transition count 390
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 358 place count 267 transition count 388
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 362 place count 265 transition count 388
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 385 place count 242 transition count 365
Iterating global reduction 3 with 23 rules applied. Total rules applied 408 place count 242 transition count 365
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 431 place count 242 transition count 342
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 485 place count 215 transition count 315
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 495 place count 205 transition count 305
Iterating global reduction 4 with 10 rules applied. Total rules applied 505 place count 205 transition count 305
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 515 place count 205 transition count 295
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 523 place count 205 transition count 287
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 525 place count 203 transition count 285
Applied a total of 525 rules in 41 ms. Remains 203 /481 variables (removed 278) and now considering 285/610 (removed 325) transitions.
[2024-05-22 22:38:22] [INFO ] Flow matrix only has 279 transitions (discarded 6 similar events)
// Phase 1: matrix 279 rows 203 cols
[2024-05-22 22:38:22] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 22:38:22] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 22:38:22] [INFO ] Flow matrix only has 279 transitions (discarded 6 similar events)
[2024-05-22 22:38:22] [INFO ] Invariant cache hit.
[2024-05-22 22:38:23] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2024-05-22 22:38:23] [INFO ] Redundant transitions in 1 ms returned []
Running 167 sub problems to find dead transitions.
[2024-05-22 22:38:23] [INFO ] Flow matrix only has 279 transitions (discarded 6 similar events)
[2024-05-22 22:38:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-22 22:38:24] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 2 ms to minimize.
[2024-05-22 22:38:24] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 278/481 variables, 203/215 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (OVERLAPS) 0/481 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/482 variables, and 215 constraints, problems are : Problem set: 0 solved, 167 unsolved in 5876 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/195 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 8/203 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/203 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/203 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 278/481 variables, 203/215 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 167/382 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/482 variables, and 382 constraints, problems are : Problem set: 0 solved, 167 unsolved in 5380 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 203/203 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 2/2 constraints]
After SMT, in 11292ms problems are : Problem set: 0 solved, 167 unsolved
Search for dead transitions found 0 dead transitions in 11293ms
Starting structural reductions in SI_CTL mode, iteration 1 : 203/481 places, 285/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11615 ms. Remains : 203/481 places, 285/610 transitions.
[2024-05-22 22:38:34] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:38:34] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:38:34] [INFO ] Input system was already deterministic with 285 transitions.
[2024-05-22 22:38:34] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:38:34] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:38:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality15942551193747109425.gal : 3 ms
[2024-05-22 22:38:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality7125938126039512797.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/CTLCardinality15942551193747109425.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7125938126039512797.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.44501e+12,2.94273,97484,2,9910,5,555584,6,0,1093,293206,0


Converting to forward existential form...Done !
original formula: EF(!(E(AF(!(((p167==0)||(p438==1)))) U !(AG((((p474==0)||(p68==1))&&((p768==0)||(p188==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EG(!(!(((p167==0)||(p438==1)))))) U !(!(E(TRUE U !((((p474==0)||(p68==1))&&((p768==0)|...184
Reverse transition relation is NOT exact ! Due to transitions t27, t82, t87, t113, t199, t203, t204, Intersection with reachable at each step enabled. (de...200
Detected timeout of ITS tools.
[2024-05-22 22:39:04] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:39:04] [INFO ] Applying decomposition
[2024-05-22 22:39:04] [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/graph5275320439919507185.txt' '-o' '/tmp/graph5275320439919507185.bin' '-w' '/tmp/graph5275320439919507185.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5275320439919507185.bin' '-l' '-1' '-v' '-w' '/tmp/graph5275320439919507185.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:39:04] [INFO ] Decomposing Gal with order
[2024-05-22 22:39:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:39:04] [INFO ] Removed a total of 106 redundant transitions.
[2024-05-22 22:39:04] [INFO ] Flatten gal took : 16 ms
[2024-05-22 22:39:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 5 ms.
[2024-05-22 22:39:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality10251552051151143903.gal : 2 ms
[2024-05-22 22:39:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality4163728164774321429.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/CTLCardinality10251552051151143903.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4163728164774321429.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.44501e+12,0.056527,5676,86,109,1896,1841,644,2809,370,1772,0


Converting to forward existential form...Done !
original formula: EF(!(E(AF(!(((i1.u7.p167==0)||(i5.u18.p438==1)))) U !(AG((((i5.u19.p474==0)||(i0.u1.p68==1))&&((i9.u28.p768==0)||(i2.i1.u8.p188==1)))))))...156
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EG(!(!(((i1.u7.p167==0)||(i5.u18.p438==1)))))) U !(!(E(TRUE U !((((i5.u19.p474==0)||(i...226
Reverse transition relation is NOT exact ! Due to transitions t199, t204, i3.u13.t113, i5.t203, i5.u19.t87, i6.u21.t82, i9.t27, Intersection with reachabl...227
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 86 place count 395 transition count 524
Iterating global reduction 0 with 86 rules applied. Total rules applied 172 place count 395 transition count 524
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 176 place count 395 transition count 520
Discarding 45 places :
Symmetric choice reduction at 1 with 45 rule applications. Total rules 221 place count 350 transition count 475
Iterating global reduction 1 with 45 rules applied. Total rules applied 266 place count 350 transition count 475
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 291 place count 350 transition count 450
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 305 place count 336 transition count 436
Iterating global reduction 2 with 14 rules applied. Total rules applied 319 place count 336 transition count 436
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 328 place count 336 transition count 427
Applied a total of 328 rules in 21 ms. Remains 336 /481 variables (removed 145) and now considering 427/610 (removed 183) transitions.
// Phase 1: matrix 427 rows 336 cols
[2024-05-22 22:39:34] [INFO ] Computed 10 invariants in 9 ms
[2024-05-22 22:39:34] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-22 22:39:34] [INFO ] Invariant cache hit.
[2024-05-22 22:39:35] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 426 sub problems to find dead transitions.
[2024-05-22 22:39:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 5 (OVERLAPS) 0/763 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
No progress, stopping.
After SMT solving in domain Real declared 763/763 variables, and 346 constraints, problems are : Problem set: 0 solved, 426 unsolved in 18353 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 426 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/335 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 1 (OVERLAPS) 1/336 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/336 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 3 (OVERLAPS) 427/763 variables, 336/346 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/763 variables, 426/772 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-22 22:40:00] [INFO ] Deduced a trap composed of 193 places in 104 ms of which 2 ms to minimize.
[2024-05-22 22:40:00] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 2 ms to minimize.
[2024-05-22 22:40:00] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-22 22:40:01] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 2 ms to minimize.
[2024-05-22 22:40:01] [INFO ] Deduced a trap composed of 97 places in 100 ms of which 2 ms to minimize.
[2024-05-22 22:40:02] [INFO ] Deduced a trap composed of 78 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:40:02] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 2 ms to minimize.
[2024-05-22 22:40:03] [INFO ] Deduced a trap composed of 82 places in 75 ms of which 1 ms to minimize.
[2024-05-22 22:40:04] [INFO ] Deduced a trap composed of 81 places in 73 ms of which 1 ms to minimize.
[2024-05-22 22:40:04] [INFO ] Deduced a trap composed of 103 places in 67 ms of which 1 ms to minimize.
[2024-05-22 22:40:04] [INFO ] Deduced a trap composed of 82 places in 52 ms of which 1 ms to minimize.
[2024-05-22 22:40:05] [INFO ] Deduced a trap composed of 252 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:40:05] [INFO ] Deduced a trap composed of 252 places in 97 ms of which 2 ms to minimize.
[2024-05-22 22:40:06] [INFO ] Deduced a trap composed of 251 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/763 variables, 14/786 constraints. Problems are: Problem set: 0 solved, 426 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/763 variables, 0/786 constraints. Problems are: Problem set: 0 solved, 426 unsolved
[2024-05-22 22:40:22] [INFO ] Deduced a trap composed of 78 places in 80 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 763/763 variables, and 787 constraints, problems are : Problem set: 0 solved, 426 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 336/336 constraints, PredecessorRefiner: 426/426 constraints, Known Traps: 15/15 constraints]
After SMT, in 48520ms problems are : Problem set: 0 solved, 426 unsolved
Search for dead transitions found 0 dead transitions in 48525ms
Starting structural reductions in LTL mode, iteration 1 : 336/481 places, 427/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48886 ms. Remains : 336/481 places, 427/610 transitions.
[2024-05-22 22:40:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:40:23] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:40:23] [INFO ] Input system was already deterministic with 427 transitions.
[2024-05-22 22:40:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:40:23] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:40:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality17214881923338108614.gal : 1 ms
[2024-05-22 22:40:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality11069256426310817401.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/CTLCardinality17214881923338108614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11069256426310817401.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2024-05-22 22:40:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:40:53] [INFO ] Applying decomposition
[2024-05-22 22:40:53] [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/graph10954035127245444072.txt' '-o' '/tmp/graph10954035127245444072.bin' '-w' '/tmp/graph10954035127245444072.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10954035127245444072.bin' '-l' '-1' '-v' '-w' '/tmp/graph10954035127245444072.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:40:53] [INFO ] Decomposing Gal with order
[2024-05-22 22:40:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:40:53] [INFO ] Removed a total of 209 redundant transitions.
[2024-05-22 22:40:53] [INFO ] Flatten gal took : 21 ms
[2024-05-22 22:40:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-22 22:40:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality17132361143864182780.gal : 3 ms
[2024-05-22 22:40:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality11426847304365243816.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/CTLCardinality17132361143864182780.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11426847304365243816.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,3.27661e+14,24.489,622828,8821,1311,1.10186e+06,27728,925,2.58895e+06,388,224167,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Graph (trivial) has 433 edges and 481 vertex of which 44 / 481 are part of one of the 7 SCC in 2 ms
Free SCC test removed 37 places
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 38 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 443 transition count 509
Reduce places removed 62 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 127 place count 381 transition count 507
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 129 place count 379 transition count 507
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 129 place count 379 transition count 484
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 175 place count 356 transition count 484
Discarding 85 places :
Symmetric choice reduction at 3 with 85 rule applications. Total rules 260 place count 271 transition count 399
Iterating global reduction 3 with 85 rules applied. Total rules applied 345 place count 271 transition count 399
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 350 place count 271 transition count 394
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 350 place count 271 transition count 393
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 352 place count 270 transition count 393
Discarding 23 places :
Symmetric choice reduction at 4 with 23 rule applications. Total rules 375 place count 247 transition count 370
Iterating global reduction 4 with 23 rules applied. Total rules applied 398 place count 247 transition count 370
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 4 with 22 rules applied. Total rules applied 420 place count 247 transition count 348
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 478 place count 218 transition count 319
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 487 place count 209 transition count 310
Iterating global reduction 5 with 9 rules applied. Total rules applied 496 place count 209 transition count 310
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 505 place count 209 transition count 301
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 506 place count 209 transition count 301
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 508 place count 207 transition count 299
Applied a total of 508 rules in 58 ms. Remains 207 /481 variables (removed 274) and now considering 299/610 (removed 311) transitions.
[2024-05-22 22:41:23] [INFO ] Flow matrix only has 286 transitions (discarded 13 similar events)
// Phase 1: matrix 286 rows 207 cols
[2024-05-22 22:41:23] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 22:41:23] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-22 22:41:23] [INFO ] Flow matrix only has 286 transitions (discarded 13 similar events)
[2024-05-22 22:41:23] [INFO ] Invariant cache hit.
[2024-05-22 22:41:24] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-22 22:41:24] [INFO ] Redundant transitions in 5 ms returned []
Running 174 sub problems to find dead transitions.
[2024-05-22 22:41:24] [INFO ] Flow matrix only has 286 transitions (discarded 13 similar events)
[2024-05-22 22:41:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 8/207 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
[2024-05-22 22:41:25] [INFO ] Deduced a trap composed of 67 places in 67 ms of which 2 ms to minimize.
[2024-05-22 22:41:25] [INFO ] Deduced a trap composed of 67 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 285/492 variables, 207/219 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (OVERLAPS) 0/492 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Real declared 492/493 variables, and 219 constraints, problems are : Problem set: 0 solved, 174 unsolved in 6300 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 174 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/199 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/199 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 2 (OVERLAPS) 8/207 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 285/492 variables, 207/219 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 174/393 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 174 unsolved
At refinement iteration 8 (OVERLAPS) 0/492 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 174 unsolved
No progress, stopping.
After SMT solving in domain Int declared 492/493 variables, and 393 constraints, problems are : Problem set: 0 solved, 174 unsolved in 5869 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 174/174 constraints, Known Traps: 2/2 constraints]
After SMT, in 12208ms problems are : Problem set: 0 solved, 174 unsolved
Search for dead transitions found 0 dead transitions in 12210ms
Starting structural reductions in SI_CTL mode, iteration 1 : 207/481 places, 299/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12533 ms. Remains : 207/481 places, 299/610 transitions.
[2024-05-22 22:41:36] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:41:36] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:41:36] [INFO ] Input system was already deterministic with 299 transitions.
[2024-05-22 22:41:36] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:41:36] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:41:36] [INFO ] Time to serialize gal into /tmp/CTLCardinality2835005769126388432.gal : 2 ms
[2024-05-22 22:41:36] [INFO ] Time to serialize properties into /tmp/CTLCardinality4169465305374228020.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/CTLCardinality2835005769126388432.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4169465305374228020.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.59851e+12,3.57705,110992,2,14645,5,604655,6,0,1123,331045,0


Converting to forward existential form...Done !
original formula: (AF((p363==1)) + (AG((AF(((p873==0)&&(p902==1))) + (p509==1))) * E(!((!(A((p439==1) U ((p483==0)||(p566==1)))) * ((p895==0)||(p548==1))))...187
=> equivalent forward existential formula: ([FwdG((FwdU((Init * !(!(EG(!((p363==1)))))),TRUE) * !((p509==1))),!(((p873==0)&&(p902==1))))] = FALSE * [((Init...379
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t55, t71, t79, t87, t103, t118, t132, t148, t162, t193, t197, t200, t203, t204, t207,...292
Detected timeout of ITS tools.
[2024-05-22 22:42:06] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:42:06] [INFO ] Applying decomposition
[2024-05-22 22:42:06] [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/graph3927837956460646806.txt' '-o' '/tmp/graph3927837956460646806.bin' '-w' '/tmp/graph3927837956460646806.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3927837956460646806.bin' '-l' '-1' '-v' '-w' '/tmp/graph3927837956460646806.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:42:06] [INFO ] Decomposing Gal with order
[2024-05-22 22:42:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:42:06] [INFO ] Removed a total of 110 redundant transitions.
[2024-05-22 22:42:06] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:42:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 3 ms.
[2024-05-22 22:42:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality9336351090785275928.gal : 2 ms
[2024-05-22 22:42:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality11727909412554783388.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/CTLCardinality9336351090785275928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11727909412554783388.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.59851e+12,0.070387,5768,117,142,2191,2131,626,3497,397,2383,0


Converting to forward existential form...Done !
original formula: (AF((i5.u15.p363==1)) + (AG((AF(((i9.u26.p873==0)&&(i9.u27.p902==1))) + (i6.u18.p509==1))) * E(!((!(A((i6.u18.p439==1) U ((i6.u16.p483==0...270
=> equivalent forward existential formula: ([FwdG((FwdU((Init * !(!(EG(!((i5.u15.p363==1)))))),TRUE) * !((i6.u18.p509==1))),!(((i9.u26.p873==0)&&(i9.u27.p9...503
Reverse transition relation is NOT exact ! Due to transitions t193, t197, t200, t203, t208, t211, t217, t220, i0.u1.t162, i1.u4.t148, i2.u7.t132, i3.u10.t1...392
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Graph (trivial) has 453 edges and 481 vertex of which 50 / 481 are part of one of the 8 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 438 transition count 499
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 371 transition count 499
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 135 place count 371 transition count 473
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 187 place count 345 transition count 473
Discarding 93 places :
Symmetric choice reduction at 2 with 93 rule applications. Total rules 280 place count 252 transition count 380
Iterating global reduction 2 with 93 rules applied. Total rules applied 373 place count 252 transition count 380
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 378 place count 252 transition count 375
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 378 place count 252 transition count 373
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 382 place count 250 transition count 373
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 405 place count 227 transition count 350
Iterating global reduction 3 with 23 rules applied. Total rules applied 428 place count 227 transition count 350
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 451 place count 227 transition count 327
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 495 place count 205 transition count 305
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 508 place count 192 transition count 292
Iterating global reduction 4 with 13 rules applied. Total rules applied 521 place count 192 transition count 292
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 534 place count 192 transition count 279
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 5 with 8 rules applied. Total rules applied 542 place count 192 transition count 271
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 544 place count 190 transition count 269
Applied a total of 544 rules in 46 ms. Remains 190 /481 variables (removed 291) and now considering 269/610 (removed 341) transitions.
[2024-05-22 22:42:36] [INFO ] Flow matrix only has 262 transitions (discarded 7 similar events)
// Phase 1: matrix 262 rows 190 cols
[2024-05-22 22:42:36] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 22:42:36] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-22 22:42:36] [INFO ] Flow matrix only has 262 transitions (discarded 7 similar events)
[2024-05-22 22:42:36] [INFO ] Invariant cache hit.
[2024-05-22 22:42:36] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2024-05-22 22:42:36] [INFO ] Redundant transitions in 1 ms returned []
Running 147 sub problems to find dead transitions.
[2024-05-22 22:42:36] [INFO ] Flow matrix only has 262 transitions (discarded 7 similar events)
[2024-05-22 22:42:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 8/190 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 261/451 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 0/451 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 451/452 variables, and 200 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4094 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/182 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 8/190 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (OVERLAPS) 261/451 variables, 190/200 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/451 variables, 147/347 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/451 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (OVERLAPS) 0/451 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 451/452 variables, and 347 constraints, problems are : Problem set: 0 solved, 147 unsolved in 4317 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 190/190 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 0/0 constraints]
After SMT, in 8443ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 8444ms
Starting structural reductions in SI_CTL mode, iteration 1 : 190/481 places, 269/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8747 ms. Remains : 190/481 places, 269/610 transitions.
[2024-05-22 22:42:45] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:42:45] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:42:45] [INFO ] Input system was already deterministic with 269 transitions.
[2024-05-22 22:42:45] [INFO ] Flatten gal took : 5 ms
[2024-05-22 22:42:45] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:42:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality5180963787937464218.gal : 5 ms
[2024-05-22 22:42:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality703043563261828065.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/CTLCardinality5180963787937464218.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality703043563261828065.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 -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.79643e+11,1.03059,36200,2,3840,5,203611,6,0,1024,95701,0


Converting to forward existential form...Done !
original formula: EF(AG((p236==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p236==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-22 22:43:15] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:43:15] [INFO ] Applying decomposition
[2024-05-22 22:43:15] [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/graph1267672336145859356.txt' '-o' '/tmp/graph1267672336145859356.bin' '-w' '/tmp/graph1267672336145859356.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1267672336145859356.bin' '-l' '-1' '-v' '-w' '/tmp/graph1267672336145859356.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:43:15] [INFO ] Decomposing Gal with order
[2024-05-22 22:43:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:43:15] [INFO ] Removed a total of 94 redundant transitions.
[2024-05-22 22:43:15] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:43:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 35 labels/synchronizations in 1 ms.
[2024-05-22 22:43:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality11872871288106126936.gal : 1 ms
[2024-05-22 22:43:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality15574573565799506509.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/CTLCardinality11872871288106126936.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15574573565799506509.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,7.79643e+11,0.049143,5500,51,100,1355,917,448,1657,338,794,0


Converting to forward existential form...Done !
original formula: EF(AG((i2.u7.p236==0)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((i2.u7.p236==0)))))] != FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
(forward)formula 0,1,7.02908,220384,1,0,284574,134360,1641,798874,1269,402853,487200
FORMULA FlexibleBarrier-PT-08b-CTLCardinality-2023-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Graph (trivial) has 449 edges and 481 vertex of which 50 / 481 are part of one of the 8 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 67 place count 438 transition count 500
Reduce places removed 66 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 372 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 371 transition count 499
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 135 place count 371 transition count 474
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 185 place count 346 transition count 474
Discarding 90 places :
Symmetric choice reduction at 3 with 90 rule applications. Total rules 275 place count 256 transition count 384
Iterating global reduction 3 with 90 rules applied. Total rules applied 365 place count 256 transition count 384
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 370 place count 256 transition count 379
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 370 place count 256 transition count 377
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 374 place count 254 transition count 377
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 394 place count 234 transition count 357
Iterating global reduction 4 with 20 rules applied. Total rules applied 414 place count 234 transition count 357
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 4 with 20 rules applied. Total rules applied 434 place count 234 transition count 337
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 478 place count 212 transition count 315
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 492 place count 198 transition count 301
Iterating global reduction 5 with 14 rules applied. Total rules applied 506 place count 198 transition count 301
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 520 place count 198 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 527 place count 198 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 529 place count 196 transition count 278
Applied a total of 529 rules in 41 ms. Remains 196 /481 variables (removed 285) and now considering 278/610 (removed 332) transitions.
[2024-05-22 22:43:22] [INFO ] Flow matrix only has 271 transitions (discarded 7 similar events)
// Phase 1: matrix 271 rows 196 cols
[2024-05-22 22:43:22] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 22:43:22] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-22 22:43:22] [INFO ] Flow matrix only has 271 transitions (discarded 7 similar events)
[2024-05-22 22:43:22] [INFO ] Invariant cache hit.
[2024-05-22 22:43:22] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-22 22:43:22] [INFO ] Redundant transitions in 1 ms returned []
Running 162 sub problems to find dead transitions.
[2024-05-22 22:43:22] [INFO ] Flow matrix only has 271 transitions (discarded 7 similar events)
[2024-05-22 22:43:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 8/196 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 270/466 variables, 196/206 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/466 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 466/467 variables, and 206 constraints, problems are : Problem set: 0 solved, 162 unsolved in 4606 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/188 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 8/196 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 270/466 variables, 196/206 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 162/368 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 0/466 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 466/467 variables, and 368 constraints, problems are : Problem set: 0 solved, 162 unsolved in 4954 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints]
After SMT, in 9603ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 9605ms
Starting structural reductions in SI_CTL mode, iteration 1 : 196/481 places, 278/610 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9892 ms. Remains : 196/481 places, 278/610 transitions.
[2024-05-22 22:43:32] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:43:32] [INFO ] Flatten gal took : 6 ms
[2024-05-22 22:43:32] [INFO ] Input system was already deterministic with 278 transitions.
[2024-05-22 22:43:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:43:32] [INFO ] Flatten gal took : 4 ms
[2024-05-22 22:43:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality8459872181467234928.gal : 1 ms
[2024-05-22 22:43:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality4214553152315011890.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/CTLCardinality8459872181467234928.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4214553152315011890.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.07973e+12,2.163,67152,2,7614,5,390977,6,0,1056,177579,0


Converting to forward existential form...Done !
original formula: AF(E(((p193!=0) * EF(((p166==0)||(p511==1)))) U AF(((p153==1)&&(p458==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(((p193!=0) * E(TRUE U ((p166==0)||(p511==1)))) U !(EG(!(((p153==1)&&(p458==1))))))))] = FALSE
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Hit Full ! (commute/partial/dont) 274/0/4
Detected timeout of ITS tools.
[2024-05-22 22:44:02] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:44:02] [INFO ] Applying decomposition
[2024-05-22 22:44:02] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4293478692210021056.txt' '-o' '/tmp/graph4293478692210021056.bin' '-w' '/tmp/graph4293478692210021056.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4293478692210021056.bin' '-l' '-1' '-v' '-w' '/tmp/graph4293478692210021056.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:44:02] [INFO ] Decomposing Gal with order
[2024-05-22 22:44:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:44:02] [INFO ] Removed a total of 99 redundant transitions.
[2024-05-22 22:44:02] [INFO ] Flatten gal took : 13 ms
[2024-05-22 22:44:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 1 ms.
[2024-05-22 22:44:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality8701051635757171075.gal : 1 ms
[2024-05-22 22:44:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality18022519350863162292.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/CTLCardinality8701051635757171075.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18022519350863162292.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.07973e+12,0.049523,5508,43,100,1570,1153,471,2093,363,1409,0


Converting to forward existential form...Done !
original formula: AF(E(((i2.u8.p193!=0) * EF(((i1.u5.p166==0)||(i6.u18.p511==1)))) U AF(((i1.u5.p153==1)&&(i6.u17.p458==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(((i2.u8.p193!=0) * E(TRUE U ((i1.u5.p166==0)||(i6.u18.p511==1)))) U !(EG(!(((i1.u5.p153==1)&&(i6....183
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 481/481 places, 610/610 transitions.
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 80 place count 401 transition count 530
Iterating global reduction 0 with 80 rules applied. Total rules applied 160 place count 401 transition count 530
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 165 place count 401 transition count 525
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 207 place count 359 transition count 483
Iterating global reduction 1 with 42 rules applied. Total rules applied 249 place count 359 transition count 483
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 271 place count 359 transition count 461
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 284 place count 346 transition count 448
Iterating global reduction 2 with 13 rules applied. Total rules applied 297 place count 346 transition count 448
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 305 place count 346 transition count 440
Applied a total of 305 rules in 14 ms. Remains 346 /481 variables (removed 135) and now considering 440/610 (removed 170) transitions.
// Phase 1: matrix 440 rows 346 cols
[2024-05-22 22:44:32] [INFO ] Computed 10 invariants in 4 ms
[2024-05-22 22:44:32] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-22 22:44:32] [INFO ] Invariant cache hit.
[2024-05-22 22:44:32] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 439 sub problems to find dead transitions.
[2024-05-22 22:44:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (OVERLAPS) 440/786 variables, 346/356 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/786 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 5 (OVERLAPS) 0/786 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 439 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 356 constraints, problems are : Problem set: 0 solved, 439 unsolved in 19658 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 3 (OVERLAPS) 440/786 variables, 346/356 constraints. Problems are: Problem set: 0 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/786 variables, 439/795 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2024-05-22 22:44:59] [INFO ] Deduced a trap composed of 257 places in 105 ms of which 2 ms to minimize.
[2024-05-22 22:45:00] [INFO ] Deduced a trap composed of 74 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:45:02] [INFO ] Deduced a trap composed of 80 places in 89 ms of which 2 ms to minimize.
[2024-05-22 22:45:02] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 2 ms to minimize.
[2024-05-22 22:45:03] [INFO ] Deduced a trap composed of 81 places in 88 ms of which 2 ms to minimize.
[2024-05-22 22:45:04] [INFO ] Deduced a trap composed of 83 places in 80 ms of which 2 ms to minimize.
[2024-05-22 22:45:04] [INFO ] Deduced a trap composed of 84 places in 90 ms of which 1 ms to minimize.
[2024-05-22 22:45:05] [INFO ] Deduced a trap composed of 256 places in 91 ms of which 2 ms to minimize.
[2024-05-22 22:45:05] [INFO ] Deduced a trap composed of 259 places in 100 ms of which 2 ms to minimize.
[2024-05-22 22:45:06] [INFO ] Deduced a trap composed of 260 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/786 variables, 10/805 constraints. Problems are: Problem set: 0 solved, 439 unsolved
[2024-05-22 22:45:10] [INFO ] Deduced a trap composed of 82 places in 83 ms of which 2 ms to minimize.
[2024-05-22 22:45:11] [INFO ] Deduced a trap composed of 76 places in 98 ms of which 2 ms to minimize.
[2024-05-22 22:45:12] [INFO ] Deduced a trap composed of 81 places in 101 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 3/808 constraints. Problems are: Problem set: 0 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 786/786 variables, and 808 constraints, problems are : Problem set: 0 solved, 439 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 439/439 constraints, Known Traps: 13/13 constraints]
After SMT, in 49791ms problems are : Problem set: 0 solved, 439 unsolved
Search for dead transitions found 0 dead transitions in 49794ms
Starting structural reductions in LTL mode, iteration 1 : 346/481 places, 440/610 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50114 ms. Remains : 346/481 places, 440/610 transitions.
[2024-05-22 22:45:22] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:45:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:45:22] [INFO ] Input system was already deterministic with 440 transitions.
[2024-05-22 22:45:22] [INFO ] Flatten gal took : 7 ms
[2024-05-22 22:45:22] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:45:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality2456144545769122859.gal : 2 ms
[2024-05-22 22:45:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality4658235082153550666.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/CTLCardinality2456144545769122859.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4658235082153550666.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:45:52] [INFO ] Flatten gal took : 14 ms
[2024-05-22 22:45:52] [INFO ] Applying decomposition
[2024-05-22 22:45:52] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11962477400053736225.txt' '-o' '/tmp/graph11962477400053736225.bin' '-w' '/tmp/graph11962477400053736225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11962477400053736225.bin' '-l' '-1' '-v' '-w' '/tmp/graph11962477400053736225.weights' '-q' '0' '-e' '0.001'
[2024-05-22 22:45:52] [INFO ] Decomposing Gal with order
[2024-05-22 22:45:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 22:45:52] [INFO ] Removed a total of 217 redundant transitions.
[2024-05-22 22:45:52] [INFO ] Flatten gal took : 16 ms
[2024-05-22 22:45:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-22 22:45:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality3654841665232848909.gal : 3 ms
[2024-05-22 22:45:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality6642592460538269323.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/CTLCardinality3654841665232848909.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6642592460538269323.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,4.23748e+14,20.2052,398084,6706,1300,517226,31063,1111,2.15798e+06,387,491177,0


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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...260
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 23:05:03] [INFO ] Applying decomposition
[2024-05-22 23:05:03] [INFO ] Flatten gal took : 11 ms
[2024-05-22 23:05:03] [INFO ] Decomposing Gal with order
[2024-05-22 23:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 23:05:03] [INFO ] Removed a total of 129 redundant transitions.
[2024-05-22 23:05:03] [INFO ] Flatten gal took : 22 ms
[2024-05-22 23:05:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 325 labels/synchronizations in 10 ms.
[2024-05-22 23:05:03] [INFO ] Time to serialize gal into /tmp/CTLCardinality476448055767676782.gal : 3 ms
[2024-05-22 23:05:03] [INFO ] Time to serialize properties into /tmp/CTLCardinality2931817917348413183.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/CTLCardinality476448055767676782.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2931817917348413183.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 -...261
No direction supplied, using forward translation only.
Parsed 12 CTL formulae.
ITS-tools command line returned an error code 137
[2024-05-22 23:14:05] [INFO ] Flatten gal took : 14 ms
[2024-05-22 23:14:05] [INFO ] Input system was already deterministic with 610 transitions.
[2024-05-22 23:14:05] [INFO ] Transformed 481 places.
[2024-05-22 23:14:05] [INFO ] Transformed 610 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:14:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality15932128637835369930.gal : 4 ms
[2024-05-22 23:14:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality7345371683654002403.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/CTLCardinality15932128637835369930.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7345371683654002403.ctl' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...329
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 12 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-08b"
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-08b, 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-171640602500041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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