Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631132600401.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DiscoveryGPU-PT-08b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132600401
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 01:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 01:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 01:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 01:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 61K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716374751142

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-22 10:45:52] [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 10:45:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:45:52] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-05-22 10:45:52] [INFO ] Transformed 240 places.
[2024-05-22 10:45:52] [INFO ] Transformed 254 transitions.
[2024-05-22 10:45:52] [INFO ] Found NUPN structural information;
[2024-05-22 10:45:52] [INFO ] Parsed PT model containing 240 places and 254 transitions and 661 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 125 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 254/254 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 231 transition count 254
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 21 place count 219 transition count 242
Iterating global reduction 1 with 12 rules applied. Total rules applied 33 place count 219 transition count 242
Applied a total of 33 rules in 33 ms. Remains 219 /240 variables (removed 21) and now considering 242/254 (removed 12) transitions.
// Phase 1: matrix 242 rows 219 cols
[2024-05-22 10:45:52] [INFO ] Computed 4 invariants in 9 ms
[2024-05-22 10:45:52] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-22 10:45:52] [INFO ] Invariant cache hit.
[2024-05-22 10:45:53] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-22 10:45:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 5/216 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-22 10:45:55] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 13 ms to minimize.
[2024-05-22 10:45:55] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:45:55] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 10:45:55] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-22 10:45:57] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 242/458 variables, 216/225 constraints. Problems are: Problem set: 0 solved, 241 unsolved
[2024-05-22 10:46:00] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 2 ms to minimize.
[2024-05-22 10:46:00] [INFO ] Deduced a trap composed of 16 places in 122 ms of which 1 ms to minimize.
[2024-05-22 10:46:00] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 3 ms to minimize.
[2024-05-22 10:46:00] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-05-22 10:46:00] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-05-22 10:46:00] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 1 ms to minimize.
[2024-05-22 10:46:00] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-22 10:46:00] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-05-22 10:46:01] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 10:46:01] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 10:46:01] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2024-05-22 10:46:01] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-22 10:46:01] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 13/238 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (OVERLAPS) 3/461 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 0/461 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 241 constraints, problems are : Problem set: 0 solved, 241 unsolved in 16837 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 5/216 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 18/22 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/216 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (OVERLAPS) 242/458 variables, 216/238 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/458 variables, 238/476 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 7 (OVERLAPS) 3/461 variables, 3/479 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/461 variables, 3/482 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/461 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 10 (OVERLAPS) 0/461 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 482 constraints, problems are : Problem set: 0 solved, 241 unsolved in 19970 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 18/18 constraints]
After SMT, in 36972ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 36990ms
Starting structural reductions in LTL mode, iteration 1 : 219/240 places, 242/254 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37479 ms. Remains : 219/240 places, 242/254 transitions.
Support contains 125 out of 219 places after structural reductions.
[2024-05-22 10:46:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-22 10:46:30] [INFO ] Flatten gal took : 40 ms
[2024-05-22 10:46:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 10:46:30] [INFO ] Flatten gal took : 16 ms
[2024-05-22 10:46:30] [INFO ] Input system was already deterministic with 242 transitions.
Support contains 107 out of 219 places (down from 125) after GAL structural reductions.
RANDOM walk for 40000 steps (149 resets) in 1390 ms. (28 steps per ms) remains 6/68 properties
BEST_FIRST walk for 40002 steps (32 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (30 resets) in 108 ms. (367 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (28 resets) in 88 ms. (449 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (31 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
[2024-05-22 10:46:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 63/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/79 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 139/218 variables, 79/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 203/421 variables, 105/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/421 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 37/458 variables, 32/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/458 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 3/461 variables, 3/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/461 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/461 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 461/461 variables, and 223 constraints, problems are : Problem set: 0 solved, 3 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 63/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 10:46:31] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 5/79 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 139/218 variables, 79/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 203/421 variables, 105/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/421 variables, 3/192 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 10:46:31] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
Problem AtomicPropp50 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/421 variables, 1/193 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-22 10:46:31] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:46:31] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2024-05-22 10:46:31] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/421 variables, 3/196 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/421 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem AtomicPropp13 is UNSAT
At refinement iteration 13 (OVERLAPS) 37/458 variables, 32/228 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/458 variables, 0/228 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/461 variables, 3/231 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/461 variables, 0/231 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/461 variables, 0/231 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 461/461 variables, and 231 constraints, problems are : Problem set: 2 solved, 1 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 696ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 66 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=33 )
Parikh walk visited 1 properties in 8 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2024-05-22 10:46:31] [INFO ] Flatten gal took : 11 ms
[2024-05-22 10:46:31] [INFO ] Flatten gal took : 13 ms
[2024-05-22 10:46:31] [INFO ] Input system was already deterministic with 242 transitions.
Computed a total of 36 stabilizing places and 36 stable transitions
Graph (complete) has 392 edges and 219 vertex of which 199 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.5 ms
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 242/242 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 242
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 43 place count 176 transition count 206
Iterating global reduction 1 with 36 rules applied. Total rules applied 79 place count 176 transition count 206
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 86 place count 169 transition count 199
Iterating global reduction 1 with 7 rules applied. Total rules applied 93 place count 169 transition count 199
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 99 place count 163 transition count 193
Iterating global reduction 1 with 6 rules applied. Total rules applied 105 place count 163 transition count 193
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 111 place count 157 transition count 185
Iterating global reduction 1 with 6 rules applied. Total rules applied 117 place count 157 transition count 185
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 123 place count 151 transition count 175
Iterating global reduction 1 with 6 rules applied. Total rules applied 129 place count 151 transition count 175
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 134 place count 146 transition count 170
Iterating global reduction 1 with 5 rules applied. Total rules applied 139 place count 146 transition count 170
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 143 transition count 167
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 143 transition count 167
Applied a total of 145 rules in 41 ms. Remains 143 /219 variables (removed 76) and now considering 167/242 (removed 75) transitions.
// Phase 1: matrix 167 rows 143 cols
[2024-05-22 10:46:31] [INFO ] Computed 2 invariants in 8 ms
[2024-05-22 10:46:31] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-22 10:46:31] [INFO ] Invariant cache hit.
[2024-05-22 10:46:32] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 10:46:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 167/310 variables, 143/145 constraints. Problems are: Problem set: 0 solved, 166 unsolved
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 2 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 5 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:46:34] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 15/160 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/310 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 310/310 variables, and 160 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5750 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/142 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/143 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (OVERLAPS) 167/310 variables, 143/160 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 166/326 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 7 (OVERLAPS) 0/310 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 310/310 variables, and 326 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5588 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 143/143 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 15/15 constraints]
After SMT, in 11402ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 11406ms
Starting structural reductions in LTL mode, iteration 1 : 143/219 places, 167/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11613 ms. Remains : 143/219 places, 167/242 transitions.
[2024-05-22 10:46:43] [INFO ] Flatten gal took : 10 ms
[2024-05-22 10:46:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:46:43] [INFO ] Input system was already deterministic with 167 transitions.
[2024-05-22 10:46:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:46:43] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:46:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality12564399133715826685.gal : 29 ms
[2024-05-22 10:46:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality475528868800208133.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality12564399133715826685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality475528868800208133.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 10:47:13] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:47:13] [INFO ] Applying decomposition
[2024-05-22 10:47:13] [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/graph14896644276490684115.txt' '-o' '/tmp/graph14896644276490684115.bin' '-w' '/tmp/graph14896644276490684115.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14896644276490684115.bin' '-l' '-1' '-v' '-w' '/tmp/graph14896644276490684115.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:47:13] [INFO ] Decomposing Gal with order
[2024-05-22 10:47:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:47:13] [INFO ] Removed a total of 65 redundant transitions.
[2024-05-22 10:47:13] [INFO ] Flatten gal took : 37 ms
[2024-05-22 10:47:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2024-05-22 10:47:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality15645113705811155162.gal : 3 ms
[2024-05-22 10:47:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality10801168299169006194.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/CTLCardinality15645113705811155162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10801168299169006194.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 242/242 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 242
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 38 place count 181 transition count 211
Iterating global reduction 1 with 31 rules applied. Total rules applied 69 place count 181 transition count 211
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 77 place count 173 transition count 203
Iterating global reduction 1 with 8 rules applied. Total rules applied 85 place count 173 transition count 203
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 91 place count 167 transition count 197
Iterating global reduction 1 with 6 rules applied. Total rules applied 97 place count 167 transition count 197
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 103 place count 161 transition count 190
Iterating global reduction 1 with 6 rules applied. Total rules applied 109 place count 161 transition count 190
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 114 place count 156 transition count 181
Iterating global reduction 1 with 5 rules applied. Total rules applied 119 place count 156 transition count 181
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 124 place count 151 transition count 176
Iterating global reduction 1 with 5 rules applied. Total rules applied 129 place count 151 transition count 176
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 133 place count 147 transition count 172
Iterating global reduction 1 with 4 rules applied. Total rules applied 137 place count 147 transition count 172
Applied a total of 137 rules in 22 ms. Remains 147 /219 variables (removed 72) and now considering 172/242 (removed 70) transitions.
// Phase 1: matrix 172 rows 147 cols
[2024-05-22 10:47:43] [INFO ] Computed 2 invariants in 4 ms
[2024-05-22 10:47:43] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-22 10:47:43] [INFO ] Invariant cache hit.
[2024-05-22 10:47:44] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 171 sub problems to find dead transitions.
[2024-05-22 10:47:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (OVERLAPS) 172/319 variables, 147/149 constraints. Problems are: Problem set: 0 solved, 171 unsolved
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:47:46] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/319 variables, 14/163 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 0/319 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 163 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5821 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (OVERLAPS) 1/147 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (OVERLAPS) 172/319 variables, 147/163 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/319 variables, 171/334 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 7 (OVERLAPS) 0/319 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 334 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5466 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 14/14 constraints]
After SMT, in 11328ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 11331ms
Starting structural reductions in LTL mode, iteration 1 : 147/219 places, 172/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11538 ms. Remains : 147/219 places, 172/242 transitions.
[2024-05-22 10:47:55] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:47:55] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:47:55] [INFO ] Input system was already deterministic with 172 transitions.
[2024-05-22 10:47:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:47:55] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:47:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality9297478191775303106.gal : 1 ms
[2024-05-22 10:47:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality13261164631446968513.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/CTLCardinality9297478191775303106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13261164631446968513.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 10:48:25] [INFO ] Flatten gal took : 11 ms
[2024-05-22 10:48:25] [INFO ] Applying decomposition
[2024-05-22 10:48:25] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12152116929403364213.txt' '-o' '/tmp/graph12152116929403364213.bin' '-w' '/tmp/graph12152116929403364213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12152116929403364213.bin' '-l' '-1' '-v' '-w' '/tmp/graph12152116929403364213.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:48:25] [INFO ] Decomposing Gal with order
[2024-05-22 10:48:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:48:25] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-22 10:48:25] [INFO ] Flatten gal took : 11 ms
[2024-05-22 10:48:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-22 10:48:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality3209455236605324131.gal : 8 ms
[2024-05-22 10:48:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality16829230961785686857.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/CTLCardinality3209455236605324131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16829230961785686857.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 242/242 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 242
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 39 place count 180 transition count 210
Iterating global reduction 1 with 32 rules applied. Total rules applied 71 place count 180 transition count 210
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 77 place count 174 transition count 204
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 174 transition count 204
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 89 place count 168 transition count 198
Iterating global reduction 1 with 6 rules applied. Total rules applied 95 place count 168 transition count 198
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 100 place count 163 transition count 192
Iterating global reduction 1 with 5 rules applied. Total rules applied 105 place count 163 transition count 192
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 110 place count 158 transition count 183
Iterating global reduction 1 with 5 rules applied. Total rules applied 115 place count 158 transition count 183
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 120 place count 153 transition count 178
Iterating global reduction 1 with 5 rules applied. Total rules applied 125 place count 153 transition count 178
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 129 place count 149 transition count 174
Iterating global reduction 1 with 4 rules applied. Total rules applied 133 place count 149 transition count 174
Applied a total of 133 rules in 26 ms. Remains 149 /219 variables (removed 70) and now considering 174/242 (removed 68) transitions.
// Phase 1: matrix 174 rows 149 cols
[2024-05-22 10:48:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:48:55] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-22 10:48:55] [INFO ] Invariant cache hit.
[2024-05-22 10:48:55] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2024-05-22 10:48:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (OVERLAPS) 174/323 variables, 149/151 constraints. Problems are: Problem set: 0 solved, 173 unsolved
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 2 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-22 10:48:58] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-22 10:48:59] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2024-05-22 10:48:59] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 18/169 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (OVERLAPS) 0/323 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 323/323 variables, and 169 constraints, problems are : Problem set: 0 solved, 173 unsolved in 6022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/149 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (OVERLAPS) 174/323 variables, 149/169 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/323 variables, 173/342 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 0/323 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Int declared 323/323 variables, and 342 constraints, problems are : Problem set: 0 solved, 173 unsolved in 6222 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 18/18 constraints]
After SMT, in 12286ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 12289ms
Starting structural reductions in LTL mode, iteration 1 : 149/219 places, 174/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12532 ms. Remains : 149/219 places, 174/242 transitions.
[2024-05-22 10:49:08] [INFO ] Flatten gal took : 10 ms
[2024-05-22 10:49:08] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:49:08] [INFO ] Input system was already deterministic with 174 transitions.
[2024-05-22 10:49:08] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:49:08] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:49:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality16613232643185130858.gal : 2 ms
[2024-05-22 10:49:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality194897346672277067.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/CTLCardinality16613232643185130858.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality194897346672277067.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 10:49:38] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:49:38] [INFO ] Applying decomposition
[2024-05-22 10:49:38] [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/graph1511675851660917992.txt' '-o' '/tmp/graph1511675851660917992.bin' '-w' '/tmp/graph1511675851660917992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1511675851660917992.bin' '-l' '-1' '-v' '-w' '/tmp/graph1511675851660917992.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:49:38] [INFO ] Decomposing Gal with order
[2024-05-22 10:49:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:49:38] [INFO ] Removed a total of 64 redundant transitions.
[2024-05-22 10:49:38] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:49:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-22 10:49:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality16650395033525268217.gal : 3 ms
[2024-05-22 10:49:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality11373078788536414320.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/CTLCardinality16650395033525268217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11373078788536414320.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 242/242 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 242
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 34 place count 185 transition count 215
Iterating global reduction 1 with 27 rules applied. Total rules applied 61 place count 185 transition count 215
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 64 place count 182 transition count 212
Iterating global reduction 1 with 3 rules applied. Total rules applied 67 place count 182 transition count 212
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 181 transition count 211
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 181 transition count 211
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 70 place count 180 transition count 210
Iterating global reduction 1 with 1 rules applied. Total rules applied 71 place count 180 transition count 210
Applied a total of 71 rules in 18 ms. Remains 180 /219 variables (removed 39) and now considering 210/242 (removed 32) transitions.
// Phase 1: matrix 210 rows 180 cols
[2024-05-22 10:50:08] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:50:08] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 10:50:08] [INFO ] Invariant cache hit.
[2024-05-22 10:50:08] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Running 209 sub problems to find dead transitions.
[2024-05-22 10:50:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (OVERLAPS) 210/390 variables, 180/182 constraints. Problems are: Problem set: 0 solved, 209 unsolved
[2024-05-22 10:50:11] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 2 ms to minimize.
[2024-05-22 10:50:11] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 1 ms to minimize.
[2024-05-22 10:50:11] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 10:50:11] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-22 10:50:11] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2024-05-22 10:50:12] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-22 10:50:12] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-22 10:50:12] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
[2024-05-22 10:50:12] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 2 ms to minimize.
[2024-05-22 10:50:12] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 10/192 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 0/390 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 390/390 variables, and 192 constraints, problems are : Problem set: 0 solved, 209 unsolved in 7697 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 4 (OVERLAPS) 210/390 variables, 180/192 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 209/401 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 0/390 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Int declared 390/390 variables, and 401 constraints, problems are : Problem set: 0 solved, 209 unsolved in 8032 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 209/209 constraints, Known Traps: 10/10 constraints]
After SMT, in 15790ms problems are : Problem set: 0 solved, 209 unsolved
Search for dead transitions found 0 dead transitions in 15795ms
Starting structural reductions in LTL mode, iteration 1 : 180/219 places, 210/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16078 ms. Remains : 180/219 places, 210/242 transitions.
[2024-05-22 10:50:24] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:50:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:50:24] [INFO ] Input system was already deterministic with 210 transitions.
[2024-05-22 10:50:24] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:50:24] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:50:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality13770695111850430452.gal : 2 ms
[2024-05-22 10:50:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality15479277971464245978.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality13770695111850430452.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15479277971464245978.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 10:50:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:50:54] [INFO ] Applying decomposition
[2024-05-22 10:50:54] [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/graph3563586511001498509.txt' '-o' '/tmp/graph3563586511001498509.bin' '-w' '/tmp/graph3563586511001498509.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3563586511001498509.bin' '-l' '-1' '-v' '-w' '/tmp/graph3563586511001498509.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:50:54] [INFO ] Decomposing Gal with order
[2024-05-22 10:50:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:50:54] [INFO ] Removed a total of 73 redundant transitions.
[2024-05-22 10:50:54] [INFO ] Flatten gal took : 10 ms
[2024-05-22 10:50:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 10:50:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality13695351190301258681.gal : 2 ms
[2024-05-22 10:50:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality16997367710473934753.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/CTLCardinality13695351190301258681.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16997367710473934753.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 242/242 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 213 transition count 242
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 39 place count 180 transition count 209
Iterating global reduction 1 with 33 rules applied. Total rules applied 72 place count 180 transition count 209
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 79 place count 173 transition count 202
Iterating global reduction 1 with 7 rules applied. Total rules applied 86 place count 173 transition count 202
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 167 transition count 196
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 167 transition count 196
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 162 transition count 191
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 162 transition count 191
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 113 place count 157 transition count 181
Iterating global reduction 1 with 5 rules applied. Total rules applied 118 place count 157 transition count 181
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 153 transition count 177
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 153 transition count 177
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 130 place count 149 transition count 173
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 149 transition count 173
Applied a total of 134 rules in 12 ms. Remains 149 /219 variables (removed 70) and now considering 173/242 (removed 69) transitions.
// Phase 1: matrix 173 rows 149 cols
[2024-05-22 10:51:24] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:51:24] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 10:51:24] [INFO ] Invariant cache hit.
[2024-05-22 10:51:25] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 172 sub problems to find dead transitions.
[2024-05-22 10:51:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (OVERLAPS) 173/321 variables, 148/150 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-05-22 10:51:27] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-22 10:51:27] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:51:27] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:51:27] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:51:27] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:51:27] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:51:27] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:51:27] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:51:27] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:51:27] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:51:27] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 11/161 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (OVERLAPS) 1/322 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/322 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (OVERLAPS) 0/322 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 162 constraints, problems are : Problem set: 0 solved, 172 unsolved in 6362 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 172 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (OVERLAPS) 1/148 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 4 (OVERLAPS) 173/321 variables, 148/161 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 171/332 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 10 (OVERLAPS) 0/322 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 172 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 334 constraints, problems are : Problem set: 0 solved, 172 unsolved in 8534 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 149/149 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 11/11 constraints]
After SMT, in 14935ms problems are : Problem set: 0 solved, 172 unsolved
Search for dead transitions found 0 dead transitions in 14938ms
Starting structural reductions in LTL mode, iteration 1 : 149/219 places, 173/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15107 ms. Remains : 149/219 places, 173/242 transitions.
[2024-05-22 10:51:39] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:51:39] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:51:39] [INFO ] Input system was already deterministic with 173 transitions.
[2024-05-22 10:51:39] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:51:39] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:51:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality7014357453282353564.gal : 1 ms
[2024-05-22 10:51:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality13425634347081003880.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/CTLCardinality7014357453282353564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13425634347081003880.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 10:52:10] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:52:10] [INFO ] Applying decomposition
[2024-05-22 10:52:10] [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/graph17451387676313703740.txt' '-o' '/tmp/graph17451387676313703740.bin' '-w' '/tmp/graph17451387676313703740.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17451387676313703740.bin' '-l' '-1' '-v' '-w' '/tmp/graph17451387676313703740.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:52:10] [INFO ] Decomposing Gal with order
[2024-05-22 10:52:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:52:10] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-22 10:52:10] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:52:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 5 labels/synchronizations in 1 ms.
[2024-05-22 10:52:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality10725687278300136985.gal : 2 ms
[2024-05-22 10:52:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality13490191414677436266.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/CTLCardinality10725687278300136985.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13490191414677436266.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 219/219 places, 242/242 transitions.
Graph (complete) has 392 edges and 219 vertex of which 203 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Discarding 16 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 202 transition count 188
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 160 transition count 188
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 85 place count 160 transition count 174
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 113 place count 146 transition count 174
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 122 place count 137 transition count 165
Iterating global reduction 2 with 9 rules applied. Total rules applied 131 place count 137 transition count 165
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 131 place count 137 transition count 164
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 133 place count 136 transition count 164
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 138 place count 131 transition count 159
Iterating global reduction 2 with 5 rules applied. Total rules applied 143 place count 131 transition count 159
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 148 place count 126 transition count 153
Iterating global reduction 2 with 5 rules applied. Total rules applied 153 place count 126 transition count 153
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 158 place count 121 transition count 144
Iterating global reduction 2 with 5 rules applied. Total rules applied 163 place count 121 transition count 144
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 166 place count 118 transition count 141
Iterating global reduction 2 with 3 rules applied. Total rules applied 169 place count 118 transition count 141
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 2 with 44 rules applied. Total rules applied 213 place count 96 transition count 119
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 214 place count 95 transition count 118
Iterating global reduction 2 with 1 rules applied. Total rules applied 215 place count 95 transition count 118
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 216 place count 94 transition count 116
Iterating global reduction 2 with 1 rules applied. Total rules applied 217 place count 94 transition count 116
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 218 place count 93 transition count 115
Iterating global reduction 2 with 1 rules applied. Total rules applied 219 place count 93 transition count 115
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 221 place count 91 transition count 113
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 105 edges and 89 vertex of which 85 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 85 edges and 85 vertex of which 32 / 85 are part of one of the 16 SCC in 2 ms
Free SCC test removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 2 with 26 rules applied. Total rules applied 247 place count 69 transition count 86
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 41 rules applied. Total rules applied 288 place count 47 transition count 67
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 4 rules applied. Total rules applied 292 place count 45 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 294 place count 43 transition count 65
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 299 place count 38 transition count 55
Iterating global reduction 6 with 5 rules applied. Total rules applied 304 place count 38 transition count 55
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 308 place count 34 transition count 47
Iterating global reduction 6 with 4 rules applied. Total rules applied 312 place count 34 transition count 47
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 315 place count 31 transition count 41
Iterating global reduction 6 with 3 rules applied. Total rules applied 318 place count 31 transition count 41
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 320 place count 29 transition count 39
Iterating global reduction 6 with 2 rules applied. Total rules applied 322 place count 29 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 323 place count 29 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 325 place count 28 transition count 37
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 6 with 5 rules applied. Total rules applied 330 place count 23 transition count 32
Applied a total of 330 rules in 92 ms. Remains 23 /219 variables (removed 196) and now considering 32/242 (removed 210) transitions.
[2024-05-22 10:52:40] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
// Phase 1: matrix 25 rows 23 cols
[2024-05-22 10:52:40] [INFO ] Computed 0 invariants in 0 ms
[2024-05-22 10:52:40] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-22 10:52:40] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2024-05-22 10:52:40] [INFO ] Invariant cache hit.
[2024-05-22 10:52:40] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-22 10:52:40] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2024-05-22 10:52:40] [INFO ] Flow matrix only has 25 transitions (discarded 7 similar events)
[2024-05-22 10:52:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 24/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 8/47 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 0/47 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/48 variables, and 23 constraints, problems are : Problem set: 0 solved, 21 unsolved in 128 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 24/39 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 18/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (OVERLAPS) 8/47 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/48 variables, and 44 constraints, problems are : Problem set: 0 solved, 21 unsolved in 130 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 277ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 278ms
Starting structural reductions in SI_CTL mode, iteration 1 : 23/219 places, 32/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 441 ms. Remains : 23/219 places, 32/242 transitions.
[2024-05-22 10:52:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:52:40] [INFO ] Flatten gal took : 2 ms
[2024-05-22 10:52:40] [INFO ] Input system was already deterministic with 32 transitions.
[2024-05-22 10:52:40] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:52:40] [INFO ] Flatten gal took : 1 ms
[2024-05-22 10:52:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality11775375920159627669.gal : 0 ms
[2024-05-22 10:52:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality17127824156140539415.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/CTLCardinality11775375920159627669.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17127824156140539415.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,39216,0.008579,3448,2,105,5,623,6,0,104,541,0


Converting to forward existential form...Done !
original formula: (AG(!(A(!((((p110!=0)||(p56==0))||(p147==1))) U AG((p99==1))))) + AF(((p214==0)&&(p141==1))))
=> equivalent forward existential formula: [FwdG((Init * !(!(E(TRUE U !(!(!((E(!(!(E(TRUE U !((p99==1))))) U (!(!((((p110!=0)||(p56==0))||(p147==1)))) * !(...260
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t7, t10, t16, t27, t30, t31, Intersection with reachable at each step enabled. (dest...196
(forward)formula 0,1,0.059884,6132,1,0,133,16114,90,74,594,19700,166
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 242/242 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 214 transition count 242
Discarding 33 places :
Symmetric choice reduction at 1 with 33 rule applications. Total rules 38 place count 181 transition count 209
Iterating global reduction 1 with 33 rules applied. Total rules applied 71 place count 181 transition count 209
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 79 place count 173 transition count 201
Iterating global reduction 1 with 8 rules applied. Total rules applied 87 place count 173 transition count 201
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 166 transition count 194
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 166 transition count 194
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 108 place count 159 transition count 185
Iterating global reduction 1 with 7 rules applied. Total rules applied 115 place count 159 transition count 185
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 122 place count 152 transition count 173
Iterating global reduction 1 with 7 rules applied. Total rules applied 129 place count 152 transition count 173
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 135 place count 146 transition count 167
Iterating global reduction 1 with 6 rules applied. Total rules applied 141 place count 146 transition count 167
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 146 place count 141 transition count 162
Iterating global reduction 1 with 5 rules applied. Total rules applied 151 place count 141 transition count 162
Applied a total of 151 rules in 19 ms. Remains 141 /219 variables (removed 78) and now considering 162/242 (removed 80) transitions.
// Phase 1: matrix 162 rows 141 cols
[2024-05-22 10:52:40] [INFO ] Computed 2 invariants in 2 ms
[2024-05-22 10:52:40] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 10:52:40] [INFO ] Invariant cache hit.
[2024-05-22 10:52:40] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
Running 161 sub problems to find dead transitions.
[2024-05-22 10:52:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (OVERLAPS) 162/301 variables, 139/141 constraints. Problems are: Problem set: 0 solved, 161 unsolved
[2024-05-22 10:52:42] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-22 10:52:42] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:52:42] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:52:42] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-22 10:52:43] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:52:43] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-22 10:52:43] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:52:43] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-22 10:52:43] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:52:43] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:52:43] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-22 10:52:43] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 10:52:43] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2024-05-22 10:52:43] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:52:43] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 15/156 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 2/303 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (OVERLAPS) 0/303 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 158 constraints, problems are : Problem set: 0 solved, 161 unsolved in 6098 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (OVERLAPS) 1/139 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (OVERLAPS) 162/301 variables, 139/156 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 159/315 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 7 (OVERLAPS) 2/303 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 10 (OVERLAPS) 0/303 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 303/303 variables, and 319 constraints, problems are : Problem set: 0 solved, 161 unsolved in 7840 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 15/15 constraints]
After SMT, in 13976ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 13978ms
Starting structural reductions in LTL mode, iteration 1 : 141/219 places, 162/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14155 ms. Remains : 141/219 places, 162/242 transitions.
[2024-05-22 10:52:54] [INFO ] Flatten gal took : 10 ms
[2024-05-22 10:52:54] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:52:54] [INFO ] Input system was already deterministic with 162 transitions.
[2024-05-22 10:52:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:52:54] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:52:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality2348652081773242405.gal : 1 ms
[2024-05-22 10:52:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality11119366061866480996.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/CTLCardinality2348652081773242405.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11119366061866480996.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 10:53:24] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:53:24] [INFO ] Applying decomposition
[2024-05-22 10:53:24] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6459794178498671921.txt' '-o' '/tmp/graph6459794178498671921.bin' '-w' '/tmp/graph6459794178498671921.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6459794178498671921.bin' '-l' '-1' '-v' '-w' '/tmp/graph6459794178498671921.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:53:24] [INFO ] Decomposing Gal with order
[2024-05-22 10:53:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:53:24] [INFO ] Removed a total of 58 redundant transitions.
[2024-05-22 10:53:24] [INFO ] Flatten gal took : 32 ms
[2024-05-22 10:53:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2024-05-22 10:53:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality5928825159316173005.gal : 1 ms
[2024-05-22 10:53:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality14053926179794200902.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/CTLCardinality5928825159316173005.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14053926179794200902.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 242/242 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 242
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 42 place count 177 transition count 207
Iterating global reduction 1 with 35 rules applied. Total rules applied 77 place count 177 transition count 207
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 85 place count 169 transition count 199
Iterating global reduction 1 with 8 rules applied. Total rules applied 93 place count 169 transition count 199
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 100 place count 162 transition count 192
Iterating global reduction 1 with 7 rules applied. Total rules applied 107 place count 162 transition count 192
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 114 place count 155 transition count 183
Iterating global reduction 1 with 7 rules applied. Total rules applied 121 place count 155 transition count 183
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 128 place count 148 transition count 171
Iterating global reduction 1 with 7 rules applied. Total rules applied 135 place count 148 transition count 171
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 142 place count 141 transition count 164
Iterating global reduction 1 with 7 rules applied. Total rules applied 149 place count 141 transition count 164
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 153 place count 137 transition count 160
Iterating global reduction 1 with 4 rules applied. Total rules applied 157 place count 137 transition count 160
Applied a total of 157 rules in 15 ms. Remains 137 /219 variables (removed 82) and now considering 160/242 (removed 82) transitions.
// Phase 1: matrix 160 rows 137 cols
[2024-05-22 10:53:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:53:55] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-22 10:53:55] [INFO ] Invariant cache hit.
[2024-05-22 10:53:55] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2024-05-22 10:53:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 160/297 variables, 137/139 constraints. Problems are: Problem set: 0 solved, 159 unsolved
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 1 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 2 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-22 10:53:57] [INFO ] Deduced a trap composed of 15 places in 225 ms of which 1 ms to minimize.
[2024-05-22 10:53:58] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 10:53:58] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-22 10:53:58] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:53:58] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 11/150 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 150 constraints, problems are : Problem set: 0 solved, 159 unsolved in 5674 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/137 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 160/297 variables, 137/150 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 159/309 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 309 constraints, problems are : Problem set: 0 solved, 159 unsolved in 4600 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 137/137 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 11/11 constraints]
After SMT, in 10337ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 10338ms
Starting structural reductions in LTL mode, iteration 1 : 137/219 places, 160/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10662 ms. Remains : 137/219 places, 160/242 transitions.
[2024-05-22 10:54:05] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:54:05] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:54:05] [INFO ] Input system was already deterministic with 160 transitions.
[2024-05-22 10:54:05] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:54:05] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:54:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality4311433101054682807.gal : 1 ms
[2024-05-22 10:54:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality4024640791225954107.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/CTLCardinality4311433101054682807.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4024640791225954107.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 10:54:35] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:54:35] [INFO ] Applying decomposition
[2024-05-22 10:54:35] [INFO ] Flatten gal took : 2 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph6977673910311316562.txt' '-o' '/tmp/graph6977673910311316562.bin' '-w' '/tmp/graph6977673910311316562.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6977673910311316562.bin' '-l' '-1' '-v' '-w' '/tmp/graph6977673910311316562.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:54:35] [INFO ] Decomposing Gal with order
[2024-05-22 10:54:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:54:35] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-22 10:54:35] [INFO ] Flatten gal took : 9 ms
[2024-05-22 10:54:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2024-05-22 10:54:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality6218242387053577093.gal : 7 ms
[2024-05-22 10:54:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality13961538092748781413.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/CTLCardinality6218242387053577093.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13961538092748781413.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 242/242 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 213 transition count 242
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 36 place count 183 transition count 212
Iterating global reduction 1 with 30 rules applied. Total rules applied 66 place count 183 transition count 212
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 73 place count 176 transition count 205
Iterating global reduction 1 with 7 rules applied. Total rules applied 80 place count 176 transition count 205
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 170 transition count 199
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 170 transition count 199
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 165 transition count 192
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 165 transition count 192
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 160 transition count 184
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 160 transition count 184
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 117 place count 155 transition count 179
Iterating global reduction 1 with 5 rules applied. Total rules applied 122 place count 155 transition count 179
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 152 transition count 176
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 152 transition count 176
Applied a total of 128 rules in 26 ms. Remains 152 /219 variables (removed 67) and now considering 176/242 (removed 66) transitions.
// Phase 1: matrix 176 rows 152 cols
[2024-05-22 10:55:06] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:55:06] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-22 10:55:06] [INFO ] Invariant cache hit.
[2024-05-22 10:55:06] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2024-05-22 10:55:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 176/327 variables, 151/153 constraints. Problems are: Problem set: 0 solved, 175 unsolved
[2024-05-22 10:55:08] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2024-05-22 10:55:08] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-22 10:55:08] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-22 10:55:08] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
[2024-05-22 10:55:08] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-22 10:55:08] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2024-05-22 10:55:08] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:55:08] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:55:09] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2024-05-22 10:55:09] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-22 10:55:09] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-05-22 10:55:09] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-22 10:55:09] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:55:09] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-22 10:55:09] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-05-22 10:55:09] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-22 10:55:09] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2024-05-22 10:55:09] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/327 variables, 18/171 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 1/328 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/328 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 0/328 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 172 constraints, problems are : Problem set: 0 solved, 175 unsolved in 7205 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (OVERLAPS) 1/151 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 176/327 variables, 151/171 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/327 variables, 174/345 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/327 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 1/328 variables, 1/346 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/328 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/328 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/328 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 347 constraints, problems are : Problem set: 0 solved, 175 unsolved in 9735 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 152/152 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 18/18 constraints]
After SMT, in 16987ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 16990ms
Starting structural reductions in LTL mode, iteration 1 : 152/219 places, 176/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17255 ms. Remains : 152/219 places, 176/242 transitions.
[2024-05-22 10:55:23] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:55:23] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:23] [INFO ] Input system was already deterministic with 176 transitions.
[2024-05-22 10:55:23] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:55:23] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:55:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality2516325775806988131.gal : 1 ms
[2024-05-22 10:55:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality16538896530555678272.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/CTLCardinality2516325775806988131.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16538896530555678272.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 10:55:53] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:55:53] [INFO ] Applying decomposition
[2024-05-22 10:55:53] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5018492182709544074.txt' '-o' '/tmp/graph5018492182709544074.bin' '-w' '/tmp/graph5018492182709544074.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5018492182709544074.bin' '-l' '-1' '-v' '-w' '/tmp/graph5018492182709544074.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:55:53] [INFO ] Decomposing Gal with order
[2024-05-22 10:55:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:55:53] [INFO ] Removed a total of 61 redundant transitions.
[2024-05-22 10:55:53] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:55:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2024-05-22 10:55:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality2926054184674884393.gal : 13 ms
[2024-05-22 10:55:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality15079230231894118086.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/CTLCardinality2926054184674884393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15079230231894118086.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 242/242 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 242
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 37 place count 182 transition count 212
Iterating global reduction 1 with 30 rules applied. Total rules applied 67 place count 182 transition count 212
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 74 place count 175 transition count 205
Iterating global reduction 1 with 7 rules applied. Total rules applied 81 place count 175 transition count 205
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 87 place count 169 transition count 199
Iterating global reduction 1 with 6 rules applied. Total rules applied 93 place count 169 transition count 199
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 98 place count 164 transition count 193
Iterating global reduction 1 with 5 rules applied. Total rules applied 103 place count 164 transition count 193
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 107 place count 160 transition count 185
Iterating global reduction 1 with 4 rules applied. Total rules applied 111 place count 160 transition count 185
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 114 place count 157 transition count 182
Iterating global reduction 1 with 3 rules applied. Total rules applied 117 place count 157 transition count 182
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 154 transition count 179
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 154 transition count 179
Applied a total of 123 rules in 15 ms. Remains 154 /219 variables (removed 65) and now considering 179/242 (removed 63) transitions.
// Phase 1: matrix 179 rows 154 cols
[2024-05-22 10:56:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-22 10:56:23] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-22 10:56:23] [INFO ] Invariant cache hit.
[2024-05-22 10:56:23] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 178 sub problems to find dead transitions.
[2024-05-22 10:56:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (OVERLAPS) 179/333 variables, 154/156 constraints. Problems are: Problem set: 0 solved, 178 unsolved
[2024-05-22 10:56:25] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-22 10:56:26] [INFO ] Deduced a trap composed of 18 places in 62 ms of which 1 ms to minimize.
[2024-05-22 10:56:26] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-22 10:56:26] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2024-05-22 10:56:26] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 4 ms to minimize.
[2024-05-22 10:56:26] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-22 10:56:26] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
[2024-05-22 10:56:26] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-22 10:56:26] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 1 ms to minimize.
[2024-05-22 10:56:26] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-22 10:56:26] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-05-22 10:56:26] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/333 variables, 12/168 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (OVERLAPS) 0/333 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 168 constraints, problems are : Problem set: 0 solved, 178 unsolved in 6163 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 178 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 4 (OVERLAPS) 179/333 variables, 154/168 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 178/346 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/333 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 178 unsolved
At refinement iteration 7 (OVERLAPS) 0/333 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 178 unsolved
No progress, stopping.
After SMT solving in domain Int declared 333/333 variables, and 346 constraints, problems are : Problem set: 0 solved, 178 unsolved in 5924 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 178/178 constraints, Known Traps: 12/12 constraints]
After SMT, in 12147ms problems are : Problem set: 0 solved, 178 unsolved
Search for dead transitions found 0 dead transitions in 12149ms
Starting structural reductions in LTL mode, iteration 1 : 154/219 places, 179/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12419 ms. Remains : 154/219 places, 179/242 transitions.
[2024-05-22 10:56:35] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:56:35] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:56:35] [INFO ] Input system was already deterministic with 179 transitions.
[2024-05-22 10:56:35] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:56:35] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:56:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality12938552604579373584.gal : 1 ms
[2024-05-22 10:56:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality11303623013507339892.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/CTLCardinality12938552604579373584.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11303623013507339892.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 10:57:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:57:06] [INFO ] Applying decomposition
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9816242314207108727.txt' '-o' '/tmp/graph9816242314207108727.bin' '-w' '/tmp/graph9816242314207108727.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9816242314207108727.bin' '-l' '-1' '-v' '-w' '/tmp/graph9816242314207108727.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:57:06] [INFO ] Decomposing Gal with order
[2024-05-22 10:57:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:57:06] [INFO ] Removed a total of 67 redundant transitions.
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:57:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 3 labels/synchronizations in 1 ms.
[2024-05-22 10:57:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality13411209073045986305.gal : 2 ms
[2024-05-22 10:57:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality4114862219234390805.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/CTLCardinality13411209073045986305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4114862219234390805.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 : 219/219 places, 242/242 transitions.
Graph (complete) has 392 edges and 219 vertex of which 202 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 201 transition count 198
Reduce places removed 32 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 35 rules applied. Total rules applied 68 place count 169 transition count 195
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 166 transition count 195
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 71 place count 166 transition count 183
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 95 place count 154 transition count 183
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 102 place count 147 transition count 176
Iterating global reduction 3 with 7 rules applied. Total rules applied 109 place count 147 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 109 place count 147 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 111 place count 146 transition count 175
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 115 place count 142 transition count 171
Iterating global reduction 3 with 4 rules applied. Total rules applied 119 place count 142 transition count 171
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 122 place count 139 transition count 168
Iterating global reduction 3 with 3 rules applied. Total rules applied 125 place count 139 transition count 168
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 137 transition count 164
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 137 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 135 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 135 transition count 162
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 171 place count 116 transition count 143
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 115 transition count 142
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 115 transition count 142
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 174 place count 114 transition count 140
Iterating global reduction 3 with 1 rules applied. Total rules applied 175 place count 114 transition count 140
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 176 place count 113 transition count 139
Iterating global reduction 3 with 1 rules applied. Total rules applied 177 place count 113 transition count 139
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 181 place count 113 transition count 139
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 183 place count 111 transition count 137
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 8 rules applied. Total rules applied 191 place count 110 transition count 130
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 11 rules applied. Total rules applied 202 place count 103 transition count 126
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 5 rules applied. Total rules applied 207 place count 101 transition count 123
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 210 place count 98 transition count 123
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 210 place count 98 transition count 122
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 212 place count 97 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 214 place count 96 transition count 121
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 216 place count 96 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 218 place count 95 transition count 118
Applied a total of 218 rules in 49 ms. Remains 95 /219 variables (removed 124) and now considering 118/242 (removed 124) transitions.
[2024-05-22 10:57:36] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 95 cols
[2024-05-22 10:57:36] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 10:57:36] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-22 10:57:36] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2024-05-22 10:57:36] [INFO ] Invariant cache hit.
[2024-05-22 10:57:36] [INFO ] State equation strengthened by 29 read => feed constraints.
[2024-05-22 10:57:36] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-22 10:57:36] [INFO ] Redundant transitions in 2 ms returned []
Running 116 sub problems to find dead transitions.
[2024-05-22 10:57:36] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2024-05-22 10:57:36] [INFO ] Invariant cache hit.
[2024-05-22 10:57:36] [INFO ] State equation strengthened by 29 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 116/209 variables, 93/94 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 28/122 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (OVERLAPS) 2/211 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-22 10:57:38] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2024-05-22 10:57:38] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-22 10:57:38] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:57:38] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/211 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/211 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 1/212 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/212 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 212/212 variables, and 129 constraints, problems are : Problem set: 0 solved, 116 unsolved in 4228 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 116/209 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 28/124 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 115/239 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (OVERLAPS) 2/211 variables, 2/241 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/211 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/211 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 116 unsolved
[2024-05-22 10:57:42] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2024-05-22 10:57:42] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-22 10:57:42] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 0 ms to minimize.
[2024-05-22 10:57:42] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
[2024-05-22 10:57:42] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2024-05-22 10:57:42] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/211 variables, 6/250 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/211 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 13 (OVERLAPS) 1/212 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/212 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 15 (OVERLAPS) 0/212 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 212/212 variables, and 251 constraints, problems are : Problem set: 0 solved, 116 unsolved in 5427 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 29/29 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 10/10 constraints]
After SMT, in 9679ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 9680ms
Starting structural reductions in SI_CTL mode, iteration 1 : 95/219 places, 118/242 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9978 ms. Remains : 95/219 places, 118/242 transitions.
[2024-05-22 10:57:46] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:46] [INFO ] Flatten gal took : 13 ms
[2024-05-22 10:57:46] [INFO ] Input system was already deterministic with 118 transitions.
[2024-05-22 10:57:46] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:57:46] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:57:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality6352065380635217292.gal : 1 ms
[2024-05-22 10:57:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality7401623880383566379.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/CTLCardinality6352065380635217292.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7401623880383566379.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,9.33982e+08,0.479645,21000,2,4772,5,96373,6,0,487,77695,0


Converting to forward existential form...Done !
original formula: ((A(E((p62==1) U (p117==1)) U ((A((p154==1) U ((p3==0)||(p139==1))) + (p29==1)) + ((p31==0)||(p125==1)))) * AF(((!(A((p218==1) U (p26==0)...298
=> equivalent forward existential formula: (((([(FwdU((((FwdU(Init,!(((!((E(!(((p3==0)||(p139==1))) U (!((p154==1)) * !(((p3==0)||(p139==1))))) + EG(!(((p3...1079
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t7, t8, t11, t15, t19, t20, t21, t24, t26, t28, t30, t31, t35, t38, t39, t43, t47...329
(forward)formula 0,0,25.4342,747476,1,0,665,3.83486e+06,281,371,2954,5.24087e+06,590
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 219/219 places, 242/242 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 212 transition count 242
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 41 place count 178 transition count 208
Iterating global reduction 1 with 34 rules applied. Total rules applied 75 place count 178 transition count 208
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 171 transition count 201
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 171 transition count 201
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 95 place count 165 transition count 195
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 165 transition count 195
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 159 transition count 187
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 159 transition count 187
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 118 place count 154 transition count 179
Iterating global reduction 1 with 5 rules applied. Total rules applied 123 place count 154 transition count 179
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 128 place count 149 transition count 174
Iterating global reduction 1 with 5 rules applied. Total rules applied 133 place count 149 transition count 174
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 136 place count 146 transition count 171
Iterating global reduction 1 with 3 rules applied. Total rules applied 139 place count 146 transition count 171
Applied a total of 139 rules in 11 ms. Remains 146 /219 variables (removed 73) and now considering 171/242 (removed 71) transitions.
// Phase 1: matrix 171 rows 146 cols
[2024-05-22 10:58:11] [INFO ] Computed 2 invariants in 0 ms
[2024-05-22 10:58:11] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 10:58:11] [INFO ] Invariant cache hit.
[2024-05-22 10:58:11] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Running 170 sub problems to find dead transitions.
[2024-05-22 10:58:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (OVERLAPS) 171/317 variables, 146/148 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2024-05-22 10:58:13] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
[2024-05-22 10:58:14] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 1 ms to minimize.
[2024-05-22 10:58:14] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-22 10:58:14] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-22 10:58:14] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2024-05-22 10:58:14] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-22 10:58:14] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-22 10:58:14] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-22 10:58:14] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-22 10:58:14] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:58:14] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/317 variables, 11/159 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (OVERLAPS) 0/317 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 159 constraints, problems are : Problem set: 0 solved, 170 unsolved in 5527 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (OVERLAPS) 1/146 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 171/317 variables, 146/159 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/317 variables, 170/329 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 0/317 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 329 constraints, problems are : Problem set: 0 solved, 170 unsolved in 5350 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 11/11 constraints]
After SMT, in 10933ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 10938ms
Starting structural reductions in LTL mode, iteration 1 : 146/219 places, 171/242 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11105 ms. Remains : 146/219 places, 171/242 transitions.
[2024-05-22 10:58:22] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:58:22] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:58:22] [INFO ] Input system was already deterministic with 171 transitions.
[2024-05-22 10:58:22] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:58:22] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:58:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality2865002422542598110.gal : 1 ms
[2024-05-22 10:58:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality15402597361212563355.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/CTLCardinality2865002422542598110.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15402597361212563355.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 10:58:52] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:58:52] [INFO ] Applying decomposition
[2024-05-22 10:58:52] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17399052062624983572.txt' '-o' '/tmp/graph17399052062624983572.bin' '-w' '/tmp/graph17399052062624983572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17399052062624983572.bin' '-l' '-1' '-v' '-w' '/tmp/graph17399052062624983572.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:58:53] [INFO ] Decomposing Gal with order
[2024-05-22 10:58:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:58:53] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-22 10:58:53] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:58:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 1 ms.
[2024-05-22 10:58:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality2072772175061910364.gal : 1 ms
[2024-05-22 10:58:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality7369941722001551732.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/CTLCardinality2072772175061910364.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7369941722001551732.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.
[2024-05-22 10:59:23] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:59:23] [INFO ] Flatten gal took : 8 ms
[2024-05-22 10:59:23] [INFO ] Applying decomposition
[2024-05-22 10:59:23] [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/graph3625825795704427349.txt' '-o' '/tmp/graph3625825795704427349.bin' '-w' '/tmp/graph3625825795704427349.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3625825795704427349.bin' '-l' '-1' '-v' '-w' '/tmp/graph3625825795704427349.weights' '-q' '0' '-e' '0.001'
[2024-05-22 10:59:23] [INFO ] Decomposing Gal with order
[2024-05-22 10:59:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 10:59:23] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-22 10:59:23] [INFO ] Flatten gal took : 15 ms
[2024-05-22 10:59:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-22 10:59:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality9587895624388653704.gal : 2 ms
[2024-05-22 10:59:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality17119016128831225145.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/CTLCardinality9587895624388653704.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17119016128831225145.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 10 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05956e+12,1.59259,61400,3130,51,116512,451,527,212475,58,1815,0


Converting to forward existential form...Done !
original formula: EX(A(AF(((i21.u68.p203==0)||(i3.i0.u8.p18==1))) U (i7.i0.u20.p54==1)))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((i7.i0.u20.p54==1))))) * !(E(!((i7.i0.u20.p54==1)) U (!(!(EG(!(((i21.u68.p203==0)||(i3.i0.u...207
Reverse transition relation is NOT exact ! Due to transitions t220, t225, t227, i2.u6.t152, i3.i0.u9.t154, i4.u13.t156, i5.u16.t134, i6.u15.t136, i7.i0.u20...693
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Fast SCC detection found an SCC at level 22
Fast SCC detection found an SCC at level 23
Fast SCC detection found an SCC at level 24
(forward)formula 0,0,51.9571,1682956,1,0,3.29252e+06,572,3159,5.66721e+06,267,3226,3414034
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: (EX(AX((((((i13.i0.u45.p118==1)||(i19.i0.u59.p183==0))||((i24.u43.p124==1)||(i3.i1.u10.p24==0)))||((i3.i0.u9.p21==1)||(i0.u1.p3==1)))&&(i...324
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!((((((i13.i0.u45.p118==1)||(i19.i0.u59.p183==0))||((i24.u43.p124==1)||(i3.i1.u10.p24==0)))||...413
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-22 11:01:42] [INFO ] Applying decomposition
[2024-05-22 11:01:42] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:01:42] [INFO ] Decomposing Gal with order
[2024-05-22 11:01:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 11:01:42] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-22 11:01:42] [INFO ] Flatten gal took : 31 ms
[2024-05-22 11:01:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 365 labels/synchronizations in 14 ms.
[2024-05-22 11:01:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality8208801382861354329.gal : 6 ms
[2024-05-22 11:01:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality11069530136519290032.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/CTLCardinality8208801382861354329.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11069530136519290032.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 9 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.05956e+12,23.7535,609928,544,1682,790463,288356,295,2.60877e+06,252,3.02435e+06,0


Converting to forward existential form...Done !
original formula: (EX(AX((((((i0.i0.i0.i0.u12.p118==1)||(i0.i0.u14.p183==0))||((i0.i0.i0.i0.u12.p124==1)||(i0.i0.i0.i0.i0.i0.i0.u8.p24==0)))||((i0.i0.i0.i0...432
=> equivalent forward existential formula: ([(EY(Init) * !(EX(!((((((i0.i0.i0.i0.u12.p118==1)||(i0.i0.u14.p183==0))||((i0.i0.i0.i0.u12.p124==1)||(i0.i0.i0....521
Reverse transition relation is NOT exact ! Due to transitions t226, t227, i0.u15.t23, i0.u15.t26, i0.u15.t28, i0.u15.t230, i0.i0.u14.t43, i0.i0.u14.t45, i0...950
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
(forward)formula 0,0,145.907,2202740,1,0,2.00008e+06,2.35973e+06,661,6.84134e+06,835,1.70335e+07,14639
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG((((i1.u17.p233==1) + (EX(TRUE) * ((i1.u18.p239==0)||(i0.i0.i0.i0.i0.u11.p101==1)))) + ((EG((i0.i0.u14.p173==1)) * (i0.i0.i0.i0.i0.i0.i...194
=> equivalent forward existential formula: [FwdG(Init,(((i1.u17.p233==1) + (EX(TRUE) * ((i1.u18.p239==0)||(i0.i0.i0.i0.i0.u11.p101==1)))) + ((EG((i0.i0.u14...237
(forward)formula 1,1,299.877,2423112,1,0,2.21878e+06,2.58452e+06,598,7.68333e+06,689,1.85473e+07,267668
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EF((AG(!(E(((i0.i0.u14.p179==0)||(i0.i0.i0.u13.p148==1)) U (i0.i0.i0.i0.i0.i0.i0.u8.p31==0)))) + (((i0.i0.i0.i0.i0.i0.i0.u8.p28==1) * (A(...860
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(!(E(((i0.i0.u14.p179==0)||(i0.i0.i0.u13.p148==1)) U (i0.i0.i0.i0.i0.i0.i0.u8.p...2572
(forward)formula 2,1,313.283,2423112,1,0,2.21878e+06,2.58452e+06,1032,7.68333e+06,1053,1.85473e+07,412080
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (EF(AG((((i0.i0.i0.i0.i0.i0.i0.u9.p44==0)||(i0.i0.i0.i0.i0.u11.p111==1))||((i0.i0.i0.i0.i0.i0.i0.u8.p21==1)||((i0.u15.p209!=0)&&(i0.i0.i0...300
=> equivalent forward existential formula: [((((FwdU((Init * E(TRUE U !(E(TRUE U !((((i0.i0.i0.i0.i0.i0.i0.u9.p44==0)||(i0.i0.i0.i0.i0.u11.p111==1))||((i0....498
(forward)formula 3,1,459.5,2836792,1,0,2.95244e+06,3.34136e+06,1035,9.94653e+06,1175,2.22251e+07,956410
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX(((i0.i0.i0.i0.u12.p127==0) * A(AG(((i0.i0.i0.i0.i0.i0.i0.u9.p48==0)||(i0.i0.u14.p187==1))) U EG(E((i0.i0.i0.i0.u12.p133==0) U ((i0.i0....208
=> equivalent forward existential formula: [(((EY(Init) * (i0.i0.i0.i0.u12.p127==0)) * !(EG(!(EG(E((i0.i0.i0.i0.u12.p133==0) U ((i0.i0.i0.i0.u12.p142==0)||...479
(forward)formula 4,1,505.299,2937640,1,0,3.05466e+06,3.34136e+06,874,1.02805e+07,1037,2.22251e+07,173471
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: EX((AX(EG(AF((i0.u15.p208==0)))) * EG(((i0.i0.i0.i0.i0.i0.i0.u9.p49==0)||(i0.i0.i0.i0.i0.i0.u10.p85==1)))))
=> equivalent forward existential formula: [FwdG((EY(Init) * !(EX(!(EG(!(EG(!((i0.u15.p208==0))))))))),((i0.i0.i0.i0.i0.i0.i0.u9.p49==0)||(i0.i0.i0.i0.i0.i...180
(forward)formula 5,1,678.821,3815688,1,0,3.86762e+06,3.46573e+06,607,1.35817e+07,691,2.563e+07,20689
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG((AF(((AX((i0.i0.u25.p2==0)) + EG(((i0.i0.i0.u13.p148==0)&&(i0.i0.i0.u13.p145==1)))) + (i0.i0.u14.p189==0))) + AF(((((i0.i0.i0.i0.i0.u1...300
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * !(!(EG(!(((!(EX(!((i0.i0.u25.p2==0)))) + EG(((i0.i0.i0.u13.p148==0)&&(i0.i0.i0.u13.p145...367
(forward)formula 6,1,687.189,3815688,1,0,3.86762e+06,3.46573e+06,778,1.35817e+07,851,2.563e+07,103263
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: A(!(((i0.i0.i0.i0.i0.i0.i0.u8.p21==0)||(i0.i0.u14.p184==1))) U (EF(((!(((i0.i0.i0.i0.i0.i0.u10.p63==0)||(i0.i0.i0.u13.p166==1))||((i0.u15...502
=> equivalent forward existential formula: [((Init * !(EG(!((E(TRUE U ((!(((i0.i0.i0.i0.i0.i0.u10.p63==0)||(i0.i0.i0.u13.p166==1))||((i0.u15.p218==0)||(i0....1491
(forward)formula 7,1,732.114,3815688,1,0,3.86762e+06,3.46573e+06,1076,1.35817e+07,1063,2.563e+07,655596
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: !(E(EX(!(((i0.i0.i0.i0.i0.i0.i0.u8.p11==0)||(i0.u15.p203==1)))) U AX(E((i0.i0.i0.u13.p165==0) U (i0.u15.p202==1)))))
=> equivalent forward existential formula: [(FwdU(Init,EX(!(((i0.i0.i0.i0.i0.i0.i0.u8.p11==0)||(i0.u15.p203==1))))) * !(EX(!(E((i0.i0.i0.u13.p165==0) U (i0...182
(forward)formula 8,0,732.401,3815688,1,0,3.86762e+06,3.46573e+06,1106,1.35817e+07,1064,2.563e+07,664802
FORMULA DiscoveryGPU-PT-08b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1683594 ms.

BK_STOP 1716376435951

--------------------
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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

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