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.r400-tall-171690532200393.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 StigmergyElection-PT-11a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532200393
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 154M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 21:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 11 21:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 11 20:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K Apr 11 20:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 153M May 18 16:43 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 StigmergyElection-PT-11a-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-11a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717018559937

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-11a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 21:36:01] [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-29 21:36:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 21:36:06] [INFO ] Load time of PNML (sax parser for PT used): 5219 ms
[2024-05-29 21:36:06] [INFO ] Transformed 156 places.
[2024-05-29 21:36:07] [INFO ] Transformed 136650 transitions.
[2024-05-29 21:36:07] [INFO ] Found NUPN structural information;
[2024-05-29 21:36:07] [INFO ] Parsed PT model containing 156 places and 136650 transitions and 3001363 arcs in 6040 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Ensure Unique test removed 132345 transitions
Reduce redundant transitions removed 132345 transitions.
FORMULA StigmergyElection-PT-11a-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyElection-PT-11a-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 83 out of 156 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 156/156 places, 4305/4305 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 149 transition count 4294
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 149 transition count 4294
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 147 transition count 4290
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 147 transition count 4290
Applied a total of 18 rules in 191 ms. Remains 147 /156 variables (removed 9) and now considering 4290/4305 (removed 15) transitions.
[2024-05-29 21:36:08] [INFO ] Flow matrix only has 4264 transitions (discarded 26 similar events)
// Phase 1: matrix 4264 rows 147 cols
[2024-05-29 21:36:08] [INFO ] Computed 9 invariants in 62 ms
[2024-05-29 21:36:09] [INFO ] Implicit Places using invariants in 873 ms returned []
[2024-05-29 21:36:09] [INFO ] Flow matrix only has 4264 transitions (discarded 26 similar events)
[2024-05-29 21:36:09] [INFO ] Invariant cache hit.
[2024-05-29 21:36:11] [INFO ] State equation strengthened by 4148 read => feed constraints.
[2024-05-29 21:36:12] [INFO ] Implicit Places using invariants and state equation in 3494 ms returned [146]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 4437 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/156 places, 4290/4305 transitions.
Applied a total of 0 rules in 23 ms. Remains 146 /146 variables (removed 0) and now considering 4290/4290 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4685 ms. Remains : 146/156 places, 4290/4305 transitions.
Support contains 83 out of 146 places after structural reductions.
[2024-05-29 21:36:14] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-29 21:36:14] [INFO ] Flatten gal took : 554 ms
FORMULA StigmergyElection-PT-11a-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 21:36:14] [INFO ] Flatten gal took : 330 ms
[2024-05-29 21:36:15] [INFO ] Input system was already deterministic with 4290 transitions.
Support contains 64 out of 146 places (down from 83) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 15954 ms. (2 steps per ms) remains 11/52 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
[2024-05-29 21:36:20] [INFO ] Flow matrix only has 4264 transitions (discarded 26 similar events)
// Phase 1: matrix 4264 rows 146 cols
[2024-05-29 21:36:20] [INFO ] Computed 8 invariants in 22 ms
[2024-05-29 21:36:21] [INFO ] State equation strengthened by 4104 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 115/134 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 12/146 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 4263/4409 variables, 146/154 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4409 variables, 4103/4257 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4409 variables, 0/4257 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 1/4410 variables, 1/4258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4410 variables, 0/4258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/4410 variables, 0/4258 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4410/4410 variables, and 4258 constraints, problems are : Problem set: 0 solved, 10 unsolved in 3474 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 146/146 constraints, ReadFeed: 4104/4104 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 115/134 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-29 21:36:26] [INFO ] Deduced a trap composed of 13 places in 995 ms of which 14 ms to minimize.
[2024-05-29 21:36:27] [INFO ] Deduced a trap composed of 12 places in 1143 ms of which 2 ms to minimize.
[2024-05-29 21:36:28] [INFO ] Deduced a trap composed of 14 places in 961 ms of which 1 ms to minimize.
[2024-05-29 21:36:29] [INFO ] Deduced a trap composed of 12 places in 982 ms of which 2 ms to minimize.
[2024-05-29 21:36:30] [INFO ] Deduced a trap composed of 14 places in 1051 ms of which 2 ms to minimize.
SMT process timed out in 9674ms, After SMT, problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 19 out of 146 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 146/146 places, 4290/4290 transitions.
Graph (complete) has 531 edges and 146 vertex of which 140 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.40 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 67 rules applied. Total rules applied 68 place count 140 transition count 4217
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 67 rules applied. Total rules applied 135 place count 100 transition count 4190
Reduce places removed 12 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 19 rules applied. Total rules applied 154 place count 88 transition count 4183
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 161 place count 81 transition count 4183
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 161 place count 81 transition count 4174
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 179 place count 72 transition count 4174
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 199 place count 52 transition count 4152
Iterating global reduction 4 with 20 rules applied. Total rules applied 219 place count 52 transition count 4152
Ensure Unique test removed 1024 transitions
Reduce isomorphic transitions removed 1024 transitions.
Iterating post reduction 4 with 1024 rules applied. Total rules applied 1243 place count 52 transition count 3128
Performed 11 Post agglomeration using F-continuation condition with reduction of 2964 identical transitions.
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 1265 place count 41 transition count 153
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 5 with 99 rules applied. Total rules applied 1364 place count 41 transition count 54
Performed 2 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 1368 place count 39 transition count 49
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 1374 place count 39 transition count 43
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 1375 place count 39 transition count 42
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1376 place count 39 transition count 41
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1377 place count 38 transition count 41
Applied a total of 1377 rules in 349 ms. Remains 38 /146 variables (removed 108) and now considering 41/4290 (removed 4249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 349 ms. Remains : 38/146 places, 41/4290 transitions.
RANDOM walk for 40000 steps (2351 resets) in 158 ms. (251 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40004 steps (1416 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (477 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
// Phase 1: matrix 41 rows 38 cols
[2024-05-29 21:36:30] [INFO ] Computed 8 invariants in 1 ms
[2024-05-29 21:36:30] [INFO ] State equation strengthened by 11 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/32 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 34/66 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 7/73 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 11/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 6/79 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/79 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/79 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 57 constraints, problems are : Problem set: 0 solved, 2 unsolved in 126 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 38/38 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 16/27 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 21:36:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 21:36:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 21:36:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp13 is UNSAT
After SMT solving in domain Int declared 27/79 variables, and 9 constraints, problems are : Problem set: 2 solved, 0 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 6/8 constraints, State Equation: 0/38 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 211ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2024-05-29 21:36:31] [INFO ] Flatten gal took : 254 ms
[2024-05-29 21:36:31] [INFO ] Flatten gal took : 269 ms
[2024-05-29 21:36:32] [INFO ] Input system was already deterministic with 4290 transitions.
Computed a total of 23 stabilizing places and 23 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 4290/4290 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 118 transition count 4254
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 118 transition count 4254
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 75 place count 99 transition count 4228
Iterating global reduction 0 with 19 rules applied. Total rules applied 94 place count 99 transition count 4228
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 92 transition count 4221
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 92 transition count 4221
Applied a total of 108 rules in 61 ms. Remains 92 /146 variables (removed 54) and now considering 4221/4290 (removed 69) transitions.
[2024-05-29 21:36:32] [INFO ] Flow matrix only has 4209 transitions (discarded 12 similar events)
// Phase 1: matrix 4209 rows 92 cols
[2024-05-29 21:36:32] [INFO ] Computed 1 invariants in 22 ms
[2024-05-29 21:36:33] [INFO ] Implicit Places using invariants in 1312 ms returned []
[2024-05-29 21:36:33] [INFO ] Flow matrix only has 4209 transitions (discarded 12 similar events)
[2024-05-29 21:36:33] [INFO ] Invariant cache hit.
[2024-05-29 21:36:34] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:36:36] [INFO ] Implicit Places using invariants and state equation in 2741 ms returned []
Implicit Place search using SMT with State Equation took 4056 ms to find 0 implicit places.
Running 4220 sub problems to find dead transitions.
[2024-05-29 21:36:36] [INFO ] Flow matrix only has 4209 transitions (discarded 12 similar events)
[2024-05-29 21:36:36] [INFO ] Invariant cache hit.
[2024-05-29 21:36:36] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4220 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4220 unsolved
[2024-05-29 21:38:11] [INFO ] Deduced a trap composed of 9 places in 911 ms of which 1 ms to minimize.
[2024-05-29 21:38:12] [INFO ] Deduced a trap composed of 9 places in 937 ms of which 0 ms to minimize.
[2024-05-29 21:38:13] [INFO ] Deduced a trap composed of 9 places in 1041 ms of which 1 ms to minimize.
SMT process timed out in 97246ms, After SMT, problems are : Problem set: 0 solved, 4220 unsolved
Search for dead transitions found 0 dead transitions in 97340ms
Starting structural reductions in LTL mode, iteration 1 : 92/146 places, 4221/4290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101482 ms. Remains : 92/146 places, 4221/4290 transitions.
[2024-05-29 21:38:14] [INFO ] Flatten gal took : 251 ms
[2024-05-29 21:38:14] [INFO ] Flatten gal took : 277 ms
[2024-05-29 21:38:14] [INFO ] Input system was already deterministic with 4221 transitions.
[2024-05-29 21:38:15] [INFO ] Flatten gal took : 261 ms
[2024-05-29 21:38:15] [INFO ] Flatten gal took : 264 ms
[2024-05-29 21:38:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality15029788504856103641.gal : 129 ms
[2024-05-29 21:38:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality10223397668908257232.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/CTLCardinality15029788504856103641.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10223397668908257232.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-29 21:38:45] [INFO ] Flatten gal took : 301 ms
[2024-05-29 21:38:45] [INFO ] Applying decomposition
[2024-05-29 21:38:46] [INFO ] Flatten gal took : 262 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/graph17919918237302539485.txt' '-o' '/tmp/graph17919918237302539485.bin' '-w' '/tmp/graph17919918237302539485.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17919918237302539485.bin' '-l' '-1' '-v' '-w' '/tmp/graph17919918237302539485.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:38:47] [INFO ] Decomposing Gal with order
[2024-05-29 21:38:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:38:48] [INFO ] Removed a total of 45126 redundant transitions.
[2024-05-29 21:38:48] [INFO ] Flatten gal took : 1173 ms
[2024-05-29 21:38:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 417 ms.
[2024-05-29 21:38:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality7772206592968381219.gal : 52 ms
[2024-05-29 21:38:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality14397345994284688474.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/CTLCardinality7772206592968381219.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14397345994284688474.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.11024e+07,1.11759,31188,6934,33,30726,263,4350,17233,57,786,0


Converting to forward existential form...Done !
original formula: AF(AX((i3.i0.u17.p72==1)))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!((i3.i0.u17.p72==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4199, t4201, t4203, t4205, t4207, t4209, t4211, t4213, t4215, t4217, t4219, i0.t53, i0.t43, ...758
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,12.3927,354304,1,0,774080,565,43914,1.13244e+06,224,2505,1986211
FORMULA StigmergyElection-PT-11a-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 4290/4290 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 118 transition count 4254
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 118 transition count 4254
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 74 place count 100 transition count 4230
Iterating global reduction 0 with 18 rules applied. Total rules applied 92 place count 100 transition count 4230
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 98 place count 94 transition count 4224
Iterating global reduction 0 with 6 rules applied. Total rules applied 104 place count 94 transition count 4224
Applied a total of 104 rules in 58 ms. Remains 94 /146 variables (removed 52) and now considering 4224/4290 (removed 66) transitions.
[2024-05-29 21:39:01] [INFO ] Flow matrix only has 4211 transitions (discarded 13 similar events)
// Phase 1: matrix 4211 rows 94 cols
[2024-05-29 21:39:02] [INFO ] Computed 1 invariants in 26 ms
[2024-05-29 21:39:03] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2024-05-29 21:39:03] [INFO ] Flow matrix only has 4211 transitions (discarded 13 similar events)
[2024-05-29 21:39:03] [INFO ] Invariant cache hit.
[2024-05-29 21:39:04] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:39:05] [INFO ] Implicit Places using invariants and state equation in 2578 ms returned []
Implicit Place search using SMT with State Equation took 3820 ms to find 0 implicit places.
Running 4223 sub problems to find dead transitions.
[2024-05-29 21:39:05] [INFO ] Flow matrix only has 4211 transitions (discarded 13 similar events)
[2024-05-29 21:39:05] [INFO ] Invariant cache hit.
[2024-05-29 21:39:06] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4223 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4223 unsolved
[2024-05-29 21:40:47] [INFO ] Deduced a trap composed of 12 places in 956 ms of which 1 ms to minimize.
[2024-05-29 21:40:48] [INFO ] Deduced a trap composed of 10 places in 837 ms of which 1 ms to minimize.
[2024-05-29 21:40:48] [INFO ] Deduced a trap composed of 9 places in 918 ms of which 1 ms to minimize.
SMT process timed out in 103051ms, After SMT, problems are : Problem set: 0 solved, 4223 unsolved
Search for dead transitions found 0 dead transitions in 103097ms
Starting structural reductions in LTL mode, iteration 1 : 94/146 places, 4224/4290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 107011 ms. Remains : 94/146 places, 4224/4290 transitions.
[2024-05-29 21:40:49] [INFO ] Flatten gal took : 250 ms
[2024-05-29 21:40:49] [INFO ] Flatten gal took : 265 ms
[2024-05-29 21:40:50] [INFO ] Input system was already deterministic with 4224 transitions.
[2024-05-29 21:40:50] [INFO ] Flatten gal took : 262 ms
[2024-05-29 21:40:50] [INFO ] Flatten gal took : 279 ms
[2024-05-29 21:40:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality1976050086832662468.gal : 53 ms
[2024-05-29 21:40:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality2385809329764716384.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/CTLCardinality1976050086832662468.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2385809329764716384.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-29 21:41:20] [INFO ] Flatten gal took : 266 ms
[2024-05-29 21:41:20] [INFO ] Applying decomposition
[2024-05-29 21:41:21] [INFO ] Flatten gal took : 270 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/graph4568206633555680736.txt' '-o' '/tmp/graph4568206633555680736.bin' '-w' '/tmp/graph4568206633555680736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4568206633555680736.bin' '-l' '-1' '-v' '-w' '/tmp/graph4568206633555680736.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:41:22] [INFO ] Decomposing Gal with order
[2024-05-29 21:41:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:41:22] [INFO ] Removed a total of 45129 redundant transitions.
[2024-05-29 21:41:23] [INFO ] Flatten gal took : 582 ms
[2024-05-29 21:41:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 202 ms.
[2024-05-29 21:41:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality2521278296071474585.gal : 40 ms
[2024-05-29 21:41:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality1359205737778838915.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/CTLCardinality2521278296071474585.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1359205737778838915.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 4290/4290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 146 transition count 4249
Reduce places removed 41 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 43 rules applied. Total rules applied 84 place count 105 transition count 4247
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 103 transition count 4247
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 86 place count 103 transition count 4233
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 114 place count 89 transition count 4233
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 131 place count 72 transition count 4207
Iterating global reduction 3 with 17 rules applied. Total rules applied 148 place count 72 transition count 4207
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 155 place count 72 transition count 4200
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 155 place count 72 transition count 4198
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 159 place count 70 transition count 4198
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 166 place count 63 transition count 4184
Iterating global reduction 4 with 7 rules applied. Total rules applied 173 place count 63 transition count 4184
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 4 with 120 rules applied. Total rules applied 293 place count 63 transition count 4064
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 313 place count 53 transition count 4054
Drop transitions (Redundant composition of simpler transitions.) removed 3933 transitions
Redundant transition composition rules discarded 3933 transitions
Iterating global reduction 5 with 3933 rules applied. Total rules applied 4246 place count 53 transition count 121
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 4268 place count 42 transition count 110
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 4269 place count 42 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 4270 place count 42 transition count 109
Applied a total of 4270 rules in 1619 ms. Remains 42 /146 variables (removed 104) and now considering 109/4290 (removed 4181) transitions.
[2024-05-29 21:41:55] [INFO ] Flow matrix only has 97 transitions (discarded 12 similar events)
// Phase 1: matrix 97 rows 42 cols
[2024-05-29 21:41:55] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 21:41:55] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-29 21:41:55] [INFO ] Flow matrix only has 97 transitions (discarded 12 similar events)
[2024-05-29 21:41:55] [INFO ] Invariant cache hit.
[2024-05-29 21:41:55] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-05-29 21:41:55] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-05-29 21:41:55] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-29 21:41:55] [INFO ] Flow matrix only has 97 transitions (discarded 12 similar events)
[2024-05-29 21:41:55] [INFO ] Invariant cache hit.
[2024-05-29 21:41:55] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 6 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:41:55] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 4 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-29 21:41:56] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 21:41:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:41:58] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/42 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 96/138 variables, 42/137 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 55/192 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-29 21:42:00] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:42:00] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:42:00] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-29 21:42:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 21:42:01] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 14 (OVERLAPS) 1/139 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/139 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 16 (OVERLAPS) 0/139 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 198 constraints, problems are : Problem set: 0 solved, 108 unsolved in 9520 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-29 21:42:05] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 21:42:05] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:42:05] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:42:05] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:42:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:42:06] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:42:06] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:42:06] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:42:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:42:06] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 10/110 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-29 21:42:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:42:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:42:06] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:42:07] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 4/114 constraints. Problems are: Problem set: 0 solved, 108 unsolved
[2024-05-29 21:42:07] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 96/138 variables, 42/157 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 55/212 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 108/320 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/138 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 11 (OVERLAPS) 1/139 variables, 1/321 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 13 (OVERLAPS) 0/139 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 321 constraints, problems are : Problem set: 0 solved, 108 unsolved in 13087 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 42/42 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 113/113 constraints]
After SMT, in 22717ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 22718ms
Starting structural reductions in SI_CTL mode, iteration 1 : 42/146 places, 109/4290 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24612 ms. Remains : 42/146 places, 109/4290 transitions.
[2024-05-29 21:42:18] [INFO ] Flatten gal took : 13 ms
[2024-05-29 21:42:18] [INFO ] Flatten gal took : 6 ms
[2024-05-29 21:42:18] [INFO ] Input system was already deterministic with 109 transitions.
[2024-05-29 21:42:18] [INFO ] Flatten gal took : 5 ms
[2024-05-29 21:42:18] [INFO ] Flatten gal took : 5 ms
[2024-05-29 21:42:18] [INFO ] Time to serialize gal into /tmp/CTLCardinality4926790931731830837.gal : 2 ms
[2024-05-29 21:42:18] [INFO ] Time to serialize properties into /tmp/CTLCardinality2755790506802496217.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/CTLCardinality4926790931731830837.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2755790506802496217.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,8728,0.088298,6544,2,1178,5,11352,6,0,262,7569,0


Converting to forward existential form...Done !
original formula: EF(EG(!(E((((p144==0)||(p21==1))||(p8==1)) U !((((p59==1)||(p98==0))||(p91==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(E((((p144==0)||(p21==1))||(p8==1)) U !((((p59==1)||(p98==0))||(p91==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21...331
(forward)formula 0,1,0.359231,13144,1,0,183,37213,232,60,4588,29560,229
FORMULA StigmergyElection-PT-11a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 4290/4290 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 119 transition count 4256
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 119 transition count 4256
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 71 place count 102 transition count 4235
Iterating global reduction 0 with 17 rules applied. Total rules applied 88 place count 102 transition count 4235
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 92 place count 98 transition count 4231
Iterating global reduction 0 with 4 rules applied. Total rules applied 96 place count 98 transition count 4231
Applied a total of 96 rules in 49 ms. Remains 98 /146 variables (removed 48) and now considering 4231/4290 (removed 59) transitions.
[2024-05-29 21:42:18] [INFO ] Flow matrix only has 4217 transitions (discarded 14 similar events)
// Phase 1: matrix 4217 rows 98 cols
[2024-05-29 21:42:18] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 21:42:19] [INFO ] Implicit Places using invariants in 1212 ms returned []
[2024-05-29 21:42:19] [INFO ] Flow matrix only has 4217 transitions (discarded 14 similar events)
[2024-05-29 21:42:19] [INFO ] Invariant cache hit.
[2024-05-29 21:42:20] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:42:22] [INFO ] Implicit Places using invariants and state equation in 2636 ms returned []
Implicit Place search using SMT with State Equation took 3851 ms to find 0 implicit places.
Running 4230 sub problems to find dead transitions.
[2024-05-29 21:42:22] [INFO ] Flow matrix only has 4217 transitions (discarded 14 similar events)
[2024-05-29 21:42:22] [INFO ] Invariant cache hit.
[2024-05-29 21:42:22] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4230 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4230 unsolved
[2024-05-29 21:44:07] [INFO ] Deduced a trap composed of 9 places in 1151 ms of which 1 ms to minimize.
[2024-05-29 21:44:08] [INFO ] Deduced a trap composed of 9 places in 1250 ms of which 1 ms to minimize.
SMT process timed out in 105952ms, After SMT, problems are : Problem set: 0 solved, 4230 unsolved
Search for dead transitions found 0 dead transitions in 105998ms
Starting structural reductions in LTL mode, iteration 1 : 98/146 places, 4231/4290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109918 ms. Remains : 98/146 places, 4231/4290 transitions.
[2024-05-29 21:44:08] [INFO ] Flatten gal took : 241 ms
[2024-05-29 21:44:08] [INFO ] Flatten gal took : 260 ms
[2024-05-29 21:44:09] [INFO ] Input system was already deterministic with 4231 transitions.
[2024-05-29 21:44:09] [INFO ] Flatten gal took : 258 ms
[2024-05-29 21:44:09] [INFO ] Flatten gal took : 259 ms
[2024-05-29 21:44:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality14495821389558369536.gal : 51 ms
[2024-05-29 21:44:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality16259903863054069263.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/CTLCardinality14495821389558369536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16259903863054069263.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-29 21:44:40] [INFO ] Flatten gal took : 263 ms
[2024-05-29 21:44:40] [INFO ] Applying decomposition
[2024-05-29 21:44:40] [INFO ] Flatten gal took : 264 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/graph8868180433107894027.txt' '-o' '/tmp/graph8868180433107894027.bin' '-w' '/tmp/graph8868180433107894027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8868180433107894027.bin' '-l' '-1' '-v' '-w' '/tmp/graph8868180433107894027.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:44:41] [INFO ] Decomposing Gal with order
[2024-05-29 21:44:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:44:42] [INFO ] Removed a total of 45133 redundant transitions.
[2024-05-29 21:44:42] [INFO ] Flatten gal took : 673 ms
[2024-05-29 21:44:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 45 labels/synchronizations in 211 ms.
[2024-05-29 21:44:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality18095013923158856647.gal : 28 ms
[2024-05-29 21:44:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality7000156463259688611.ctl : 9 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/CTLCardinality18095013923158856647.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7000156463259688611.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 : 146/146 places, 4290/4290 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 120 transition count 4255
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 120 transition count 4255
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 69 place count 103 transition count 4231
Iterating global reduction 0 with 17 rules applied. Total rules applied 86 place count 103 transition count 4231
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 93 place count 96 transition count 4224
Iterating global reduction 0 with 7 rules applied. Total rules applied 100 place count 96 transition count 4224
Applied a total of 100 rules in 54 ms. Remains 96 /146 variables (removed 50) and now considering 4224/4290 (removed 66) transitions.
[2024-05-29 21:45:12] [INFO ] Flow matrix only has 4212 transitions (discarded 12 similar events)
// Phase 1: matrix 4212 rows 96 cols
[2024-05-29 21:45:12] [INFO ] Computed 1 invariants in 14 ms
[2024-05-29 21:45:13] [INFO ] Implicit Places using invariants in 1166 ms returned []
[2024-05-29 21:45:13] [INFO ] Flow matrix only has 4212 transitions (discarded 12 similar events)
[2024-05-29 21:45:13] [INFO ] Invariant cache hit.
[2024-05-29 21:45:14] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:45:16] [INFO ] Implicit Places using invariants and state equation in 2539 ms returned []
Implicit Place search using SMT with State Equation took 3711 ms to find 0 implicit places.
Running 4223 sub problems to find dead transitions.
[2024-05-29 21:45:16] [INFO ] Flow matrix only has 4212 transitions (discarded 12 similar events)
[2024-05-29 21:45:16] [INFO ] Invariant cache hit.
[2024-05-29 21:45:16] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4223 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4223 unsolved
[2024-05-29 21:46:55] [INFO ] Deduced a trap composed of 9 places in 1123 ms of which 1 ms to minimize.
[2024-05-29 21:46:56] [INFO ] Deduced a trap composed of 9 places in 1103 ms of which 1 ms to minimize.
[2024-05-29 21:46:57] [INFO ] Deduced a trap composed of 9 places in 1103 ms of which 1 ms to minimize.
[2024-05-29 21:46:58] [INFO ] Deduced a trap composed of 9 places in 1201 ms of which 1 ms to minimize.
SMT process timed out in 101912ms, After SMT, problems are : Problem set: 0 solved, 4223 unsolved
Search for dead transitions found 0 dead transitions in 101958ms
Starting structural reductions in LTL mode, iteration 1 : 96/146 places, 4224/4290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105737 ms. Remains : 96/146 places, 4224/4290 transitions.
[2024-05-29 21:46:58] [INFO ] Flatten gal took : 246 ms
[2024-05-29 21:46:59] [INFO ] Flatten gal took : 264 ms
[2024-05-29 21:46:59] [INFO ] Input system was already deterministic with 4224 transitions.
[2024-05-29 21:46:59] [INFO ] Flatten gal took : 260 ms
[2024-05-29 21:47:00] [INFO ] Flatten gal took : 262 ms
[2024-05-29 21:47:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality14667044150356985082.gal : 62 ms
[2024-05-29 21:47:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality2542065228632826451.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/CTLCardinality14667044150356985082.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2542065228632826451.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-29 21:47:30] [INFO ] Flatten gal took : 268 ms
[2024-05-29 21:47:30] [INFO ] Applying decomposition
[2024-05-29 21:47:30] [INFO ] Flatten gal took : 265 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/graph10054061574450203218.txt' '-o' '/tmp/graph10054061574450203218.bin' '-w' '/tmp/graph10054061574450203218.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10054061574450203218.bin' '-l' '-1' '-v' '-w' '/tmp/graph10054061574450203218.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:47:31] [INFO ] Decomposing Gal with order
[2024-05-29 21:47:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:47:32] [INFO ] Removed a total of 45127 redundant transitions.
[2024-05-29 21:47:32] [INFO ] Flatten gal took : 634 ms
[2024-05-29 21:47:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 147 ms.
[2024-05-29 21:47:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15168069794952601079.gal : 29 ms
[2024-05-29 21:47:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality2158865042802735365.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/CTLCardinality15168069794952601079.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2158865042802735365.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.90053e+07,1.285,35260,2680,29,23325,336,5343,39095,55,1057,0


Converting to forward existential form...Done !
original formula: AF(((EG((i1.i1.i0.u3.p40==1)) * EF((i0.u4.p13==1))) * (((i0.u22.p93==1) + EX(TRUE)) + EF((i3.u32.p139==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((EG((i1.i1.i0.u3.p40==1)) * E(TRUE U (i0.u4.p13==1))) * (((i0.u22.p93==1) + EX(TRUE)) + E(TRUE U (...184
Reverse transition relation is NOT exact ! Due to transitions t4202, t4204, t4206, t4208, t4210, t4212, t4214, t4216, t4218, t4220, t4222, u33.t3, u33.t4, ...559
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
(forward)formula 0,0,12.5468,285000,1,0,363665,460,60200,2.01747e+06,242,1843,691274
FORMULA StigmergyElection-PT-11a-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 4290/4290 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 125 transition count 4264
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 125 transition count 4264
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 52 place count 115 transition count 4252
Iterating global reduction 0 with 10 rules applied. Total rules applied 62 place count 115 transition count 4252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 114 transition count 4251
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 114 transition count 4251
Applied a total of 64 rules in 50 ms. Remains 114 /146 variables (removed 32) and now considering 4251/4290 (removed 39) transitions.
[2024-05-29 21:47:45] [INFO ] Flow matrix only has 4234 transitions (discarded 17 similar events)
// Phase 1: matrix 4234 rows 114 cols
[2024-05-29 21:47:45] [INFO ] Computed 2 invariants in 13 ms
[2024-05-29 21:47:46] [INFO ] Implicit Places using invariants in 1087 ms returned []
[2024-05-29 21:47:46] [INFO ] Flow matrix only has 4234 transitions (discarded 17 similar events)
[2024-05-29 21:47:46] [INFO ] Invariant cache hit.
[2024-05-29 21:47:47] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:47:48] [INFO ] Implicit Places using invariants and state equation in 2526 ms returned []
Implicit Place search using SMT with State Equation took 3617 ms to find 0 implicit places.
Running 4250 sub problems to find dead transitions.
[2024-05-29 21:47:49] [INFO ] Flow matrix only has 4234 transitions (discarded 17 similar events)
[2024-05-29 21:47:49] [INFO ] Invariant cache hit.
[2024-05-29 21:47:49] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4250 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4250 unsolved
[2024-05-29 21:49:30] [INFO ] Deduced a trap composed of 12 places in 1311 ms of which 1 ms to minimize.
SMT process timed out in 101678ms, After SMT, problems are : Problem set: 0 solved, 4250 unsolved
Search for dead transitions found 0 dead transitions in 101725ms
Starting structural reductions in LTL mode, iteration 1 : 114/146 places, 4251/4290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105408 ms. Remains : 114/146 places, 4251/4290 transitions.
[2024-05-29 21:49:30] [INFO ] Flatten gal took : 272 ms
[2024-05-29 21:49:31] [INFO ] Flatten gal took : 278 ms
[2024-05-29 21:49:31] [INFO ] Input system was already deterministic with 4251 transitions.
[2024-05-29 21:49:32] [INFO ] Flatten gal took : 255 ms
[2024-05-29 21:49:32] [INFO ] Flatten gal took : 257 ms
[2024-05-29 21:49:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality5892678774279639984.gal : 52 ms
[2024-05-29 21:49:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality6113146328414491929.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/CTLCardinality5892678774279639984.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6113146328414491929.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-29 21:50:02] [INFO ] Flatten gal took : 260 ms
[2024-05-29 21:50:02] [INFO ] Applying decomposition
[2024-05-29 21:50:02] [INFO ] Flatten gal took : 261 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/graph16859148934108409050.txt' '-o' '/tmp/graph16859148934108409050.bin' '-w' '/tmp/graph16859148934108409050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16859148934108409050.bin' '-l' '-1' '-v' '-w' '/tmp/graph16859148934108409050.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:50:03] [INFO ] Decomposing Gal with order
[2024-05-29 21:50:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:50:04] [INFO ] Removed a total of 45143 redundant transitions.
[2024-05-29 21:50:04] [INFO ] Flatten gal took : 641 ms
[2024-05-29 21:50:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 189 ms.
[2024-05-29 21:50:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality13574436288158942034.gal : 22 ms
[2024-05-29 21:50:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality6193538418703282334.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/CTLCardinality13574436288158942034.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6193538418703282334.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 : 146/146 places, 4290/4290 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 118 transition count 4253
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 118 transition count 4253
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 75 place count 99 transition count 4227
Iterating global reduction 0 with 19 rules applied. Total rules applied 94 place count 99 transition count 4227
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 101 place count 92 transition count 4220
Iterating global reduction 0 with 7 rules applied. Total rules applied 108 place count 92 transition count 4220
Applied a total of 108 rules in 51 ms. Remains 92 /146 variables (removed 54) and now considering 4220/4290 (removed 70) transitions.
[2024-05-29 21:50:34] [INFO ] Flow matrix only has 4208 transitions (discarded 12 similar events)
// Phase 1: matrix 4208 rows 92 cols
[2024-05-29 21:50:34] [INFO ] Computed 1 invariants in 18 ms
[2024-05-29 21:50:36] [INFO ] Implicit Places using invariants in 1168 ms returned []
[2024-05-29 21:50:36] [INFO ] Flow matrix only has 4208 transitions (discarded 12 similar events)
[2024-05-29 21:50:36] [INFO ] Invariant cache hit.
[2024-05-29 21:50:37] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:50:38] [INFO ] Implicit Places using invariants and state equation in 2624 ms returned []
Implicit Place search using SMT with State Equation took 3795 ms to find 0 implicit places.
Running 4219 sub problems to find dead transitions.
[2024-05-29 21:50:38] [INFO ] Flow matrix only has 4208 transitions (discarded 12 similar events)
[2024-05-29 21:50:38] [INFO ] Invariant cache hit.
[2024-05-29 21:50:39] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4219 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4219 unsolved
[2024-05-29 21:52:17] [INFO ] Deduced a trap composed of 9 places in 1446 ms of which 1 ms to minimize.
[2024-05-29 21:52:19] [INFO ] Deduced a trap composed of 9 places in 1453 ms of which 1 ms to minimize.
[2024-05-29 21:52:20] [INFO ] Deduced a trap composed of 9 places in 1447 ms of which 2 ms to minimize.
SMT process timed out in 101639ms, After SMT, problems are : Problem set: 0 solved, 4219 unsolved
Search for dead transitions found 0 dead transitions in 101685ms
Starting structural reductions in LTL mode, iteration 1 : 92/146 places, 4220/4290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 105550 ms. Remains : 92/146 places, 4220/4290 transitions.
[2024-05-29 21:52:20] [INFO ] Flatten gal took : 242 ms
[2024-05-29 21:52:21] [INFO ] Flatten gal took : 262 ms
[2024-05-29 21:52:21] [INFO ] Input system was already deterministic with 4220 transitions.
[2024-05-29 21:52:21] [INFO ] Flatten gal took : 254 ms
[2024-05-29 21:52:22] [INFO ] Flatten gal took : 257 ms
[2024-05-29 21:52:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality15646552293917543180.gal : 52 ms
[2024-05-29 21:52:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality13159849186300596812.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/CTLCardinality15646552293917543180.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13159849186300596812.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-29 21:52:52] [INFO ] Flatten gal took : 261 ms
[2024-05-29 21:52:52] [INFO ] Applying decomposition
[2024-05-29 21:52:52] [INFO ] Flatten gal took : 264 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/graph10202038348194290890.txt' '-o' '/tmp/graph10202038348194290890.bin' '-w' '/tmp/graph10202038348194290890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10202038348194290890.bin' '-l' '-1' '-v' '-w' '/tmp/graph10202038348194290890.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:52:53] [INFO ] Decomposing Gal with order
[2024-05-29 21:52:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:52:54] [INFO ] Removed a total of 45128 redundant transitions.
[2024-05-29 21:52:54] [INFO ] Flatten gal took : 673 ms
[2024-05-29 21:52:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 210 ms.
[2024-05-29 21:52:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality4643528988628537236.gal : 26 ms
[2024-05-29 21:52:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality4368606603656933959.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality4643528988628537236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4368606603656933959.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 4290/4290 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 146 transition count 4252
Reduce places removed 38 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 77 place count 108 transition count 4251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 107 transition count 4251
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 78 place count 107 transition count 4232
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 116 place count 88 transition count 4232
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 133 place count 71 transition count 4207
Iterating global reduction 3 with 17 rules applied. Total rules applied 150 place count 71 transition count 4207
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 165 place count 71 transition count 4192
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 165 place count 71 transition count 4190
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 169 place count 69 transition count 4190
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 175 place count 63 transition count 4178
Iterating global reduction 4 with 6 rules applied. Total rules applied 181 place count 63 transition count 4178
Ensure Unique test removed 1008 transitions
Reduce isomorphic transitions removed 1008 transitions.
Iterating post reduction 4 with 1008 rules applied. Total rules applied 1189 place count 63 transition count 3170
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 1207 place count 54 transition count 3161
Drop transitions (Redundant composition of simpler transitions.) removed 3035 transitions
Redundant transition composition rules discarded 3035 transitions
Iterating global reduction 5 with 3035 rules applied. Total rules applied 4242 place count 54 transition count 126
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 4264 place count 43 transition count 115
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 4265 place count 43 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 4266 place count 43 transition count 114
Applied a total of 4266 rules in 999 ms. Remains 43 /146 variables (removed 103) and now considering 114/4290 (removed 4176) transitions.
[2024-05-29 21:53:25] [INFO ] Flow matrix only has 101 transitions (discarded 13 similar events)
// Phase 1: matrix 101 rows 43 cols
[2024-05-29 21:53:25] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 21:53:25] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-29 21:53:25] [INFO ] Flow matrix only has 101 transitions (discarded 13 similar events)
[2024-05-29 21:53:25] [INFO ] Invariant cache hit.
[2024-05-29 21:53:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-29 21:53:25] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2024-05-29 21:53:25] [INFO ] Redundant transitions in 3 ms returned []
Running 113 sub problems to find dead transitions.
[2024-05-29 21:53:25] [INFO ] Flow matrix only has 101 transitions (discarded 13 similar events)
[2024-05-29 21:53:25] [INFO ] Invariant cache hit.
[2024-05-29 21:53:25] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:53:26] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:53:27] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 1 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:53:28] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 21:53:29] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:53:29] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 21:53:29] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:53:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:53:29] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 21:53:29] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 21:53:29] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:53:29] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-29 21:53:29] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-05-29 21:53:29] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:53:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:53:29] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 21:53:30] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:53:30] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 21:53:30] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-29 21:53:30] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 21:53:30] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 21:53:30] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 21:53:30] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:53:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:53:30] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 9/101 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 21:53:30] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/43 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/43 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 100/143 variables, 43/145 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/143 variables, 57/202 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/143 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 15 (OVERLAPS) 1/144 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/144 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 17 (OVERLAPS) 0/144 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 144/144 variables, and 203 constraints, problems are : Problem set: 0 solved, 113 unsolved in 7620 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 100/102 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 21:53:34] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:53:34] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:53:34] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 113 unsolved
[2024-05-29 21:53:34] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 21:53:34] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:53:35] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:53:35] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:53:35] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:53:35] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 21:53:35] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:53:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:53:35] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:53:35] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 2 ms to minimize.
[2024-05-29 21:53:35] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:53:35] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 12/117 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 100/143 variables, 43/160 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/143 variables, 57/217 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/143 variables, 113/330 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 1/144 variables, 1/331 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 12 (OVERLAPS) 0/144 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 144/144 variables, and 331 constraints, problems are : Problem set: 0 solved, 113 unsolved in 9916 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 115/115 constraints]
After SMT, in 17658ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 17659ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/146 places, 114/4290 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18777 ms. Remains : 43/146 places, 114/4290 transitions.
[2024-05-29 21:53:43] [INFO ] Flatten gal took : 9 ms
[2024-05-29 21:53:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 21:53:43] [INFO ] Input system was already deterministic with 114 transitions.
[2024-05-29 21:53:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 21:53:43] [INFO ] Flatten gal took : 5 ms
[2024-05-29 21:53:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality3409339680001291897.gal : 1 ms
[2024-05-29 21:53:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality5491554488323541741.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/CTLCardinality3409339680001291897.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5491554488323541741.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,4126,0.057313,5776,2,401,5,2862,6,0,270,2046,0


Converting to forward existential form...Done !
original formula: A((AG(!(A(((p109==0)||(p79==1)) U ((p113==0)||(p41==1))))) * (p0!=0)) U EF(!(AF(((p110==0)||(p120==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U !(!(EG(!(((p110==0)||(p120==1))))))))))) * !(E(!(E(TRUE U !(!(EG(!(((p110==0)||(p120==...386
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t2...327
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,0.244798,8208,1,0,209,14941,259,80,4648,12820,275
FORMULA StigmergyElection-PT-11a-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 4290/4290 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 122 transition count 4257
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 122 transition count 4257
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 64 place count 106 transition count 4235
Iterating global reduction 0 with 16 rules applied. Total rules applied 80 place count 106 transition count 4235
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 85 place count 101 transition count 4230
Iterating global reduction 0 with 5 rules applied. Total rules applied 90 place count 101 transition count 4230
Applied a total of 90 rules in 51 ms. Remains 101 /146 variables (removed 45) and now considering 4230/4290 (removed 60) transitions.
[2024-05-29 21:53:43] [INFO ] Flow matrix only has 4215 transitions (discarded 15 similar events)
// Phase 1: matrix 4215 rows 101 cols
[2024-05-29 21:53:43] [INFO ] Computed 4 invariants in 25 ms
[2024-05-29 21:53:45] [INFO ] Implicit Places using invariants in 1221 ms returned []
[2024-05-29 21:53:45] [INFO ] Flow matrix only has 4215 transitions (discarded 15 similar events)
[2024-05-29 21:53:45] [INFO ] Invariant cache hit.
[2024-05-29 21:53:46] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:53:47] [INFO ] Implicit Places using invariants and state equation in 2786 ms returned []
Implicit Place search using SMT with State Equation took 4009 ms to find 0 implicit places.
Running 4229 sub problems to find dead transitions.
[2024-05-29 21:53:47] [INFO ] Flow matrix only has 4215 transitions (discarded 15 similar events)
[2024-05-29 21:53:47] [INFO ] Invariant cache hit.
[2024-05-29 21:53:48] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4229 unsolved
At refinement iteration 1 (OVERLAPS) 1/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4229 unsolved
[2024-05-29 21:55:28] [INFO ] Deduced a trap composed of 9 places in 1273 ms of which 1 ms to minimize.
[2024-05-29 21:55:29] [INFO ] Deduced a trap composed of 15 places in 1299 ms of which 1 ms to minimize.
SMT process timed out in 102091ms, After SMT, problems are : Problem set: 0 solved, 4229 unsolved
Search for dead transitions found 0 dead transitions in 102138ms
Starting structural reductions in LTL mode, iteration 1 : 101/146 places, 4230/4290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106216 ms. Remains : 101/146 places, 4230/4290 transitions.
[2024-05-29 21:55:30] [INFO ] Flatten gal took : 242 ms
[2024-05-29 21:55:30] [INFO ] Flatten gal took : 261 ms
[2024-05-29 21:55:31] [INFO ] Input system was already deterministic with 4230 transitions.
[2024-05-29 21:55:31] [INFO ] Flatten gal took : 259 ms
[2024-05-29 21:55:31] [INFO ] Flatten gal took : 259 ms
[2024-05-29 21:55:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality18292756517639591260.gal : 51 ms
[2024-05-29 21:55:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality15538690256549315989.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/CTLCardinality18292756517639591260.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15538690256549315989.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-29 21:56:01] [INFO ] Flatten gal took : 263 ms
[2024-05-29 21:56:01] [INFO ] Applying decomposition
[2024-05-29 21:56:02] [INFO ] Flatten gal took : 265 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/graph17872691583653012703.txt' '-o' '/tmp/graph17872691583653012703.bin' '-w' '/tmp/graph17872691583653012703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17872691583653012703.bin' '-l' '-1' '-v' '-w' '/tmp/graph17872691583653012703.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:56:02] [INFO ] Decomposing Gal with order
[2024-05-29 21:56:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:56:03] [INFO ] Removed a total of 45132 redundant transitions.
[2024-05-29 21:56:03] [INFO ] Flatten gal took : 695 ms
[2024-05-29 21:56:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 237 ms.
[2024-05-29 21:56:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality13991550716379177978.gal : 30 ms
[2024-05-29 21:56:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality6371489302376905552.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/CTLCardinality13991550716379177978.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6371489302376905552.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 : 146/146 places, 4290/4290 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 118 transition count 4253
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 118 transition count 4253
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 73 place count 101 transition count 4230
Iterating global reduction 0 with 17 rules applied. Total rules applied 90 place count 101 transition count 4230
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 95 place count 96 transition count 4225
Iterating global reduction 0 with 5 rules applied. Total rules applied 100 place count 96 transition count 4225
Applied a total of 100 rules in 51 ms. Remains 96 /146 variables (removed 50) and now considering 4225/4290 (removed 65) transitions.
[2024-05-29 21:56:34] [INFO ] Flow matrix only has 4213 transitions (discarded 12 similar events)
// Phase 1: matrix 4213 rows 96 cols
[2024-05-29 21:56:34] [INFO ] Computed 1 invariants in 26 ms
[2024-05-29 21:56:35] [INFO ] Implicit Places using invariants in 1211 ms returned []
[2024-05-29 21:56:35] [INFO ] Flow matrix only has 4213 transitions (discarded 12 similar events)
[2024-05-29 21:56:35] [INFO ] Invariant cache hit.
[2024-05-29 21:56:36] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:56:38] [INFO ] Implicit Places using invariants and state equation in 2598 ms returned []
Implicit Place search using SMT with State Equation took 3813 ms to find 0 implicit places.
Running 4224 sub problems to find dead transitions.
[2024-05-29 21:56:38] [INFO ] Flow matrix only has 4213 transitions (discarded 12 similar events)
[2024-05-29 21:56:38] [INFO ] Invariant cache hit.
[2024-05-29 21:56:38] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4224 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4224 unsolved
[2024-05-29 21:58:17] [INFO ] Deduced a trap composed of 9 places in 1092 ms of which 1 ms to minimize.
[2024-05-29 21:58:18] [INFO ] Deduced a trap composed of 9 places in 1068 ms of which 0 ms to minimize.
SMT process timed out in 100371ms, After SMT, problems are : Problem set: 0 solved, 4224 unsolved
Search for dead transitions found 0 dead transitions in 100417ms
Starting structural reductions in LTL mode, iteration 1 : 96/146 places, 4225/4290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104303 ms. Remains : 96/146 places, 4225/4290 transitions.
[2024-05-29 21:58:18] [INFO ] Flatten gal took : 308 ms
[2024-05-29 21:58:19] [INFO ] Flatten gal took : 255 ms
[2024-05-29 21:58:19] [INFO ] Input system was already deterministic with 4225 transitions.
[2024-05-29 21:58:19] [INFO ] Flatten gal took : 268 ms
[2024-05-29 21:58:20] [INFO ] Flatten gal took : 264 ms
[2024-05-29 21:58:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality2295892972135330589.gal : 52 ms
[2024-05-29 21:58:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality3048965206058464717.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/CTLCardinality2295892972135330589.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3048965206058464717.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-29 21:58:50] [INFO ] Flatten gal took : 261 ms
[2024-05-29 21:58:50] [INFO ] Applying decomposition
[2024-05-29 21:58:50] [INFO ] Flatten gal took : 263 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/graph17633398444279850309.txt' '-o' '/tmp/graph17633398444279850309.bin' '-w' '/tmp/graph17633398444279850309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17633398444279850309.bin' '-l' '-1' '-v' '-w' '/tmp/graph17633398444279850309.weights' '-q' '0' '-e' '0.001'
[2024-05-29 21:58:51] [INFO ] Decomposing Gal with order
[2024-05-29 21:58:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 21:58:52] [INFO ] Removed a total of 45129 redundant transitions.
[2024-05-29 21:58:52] [INFO ] Flatten gal took : 634 ms
[2024-05-29 21:58:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 226 ms.
[2024-05-29 21:58:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality3743292514589889651.gal : 29 ms
[2024-05-29 21:58:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality6123394302181262193.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/CTLCardinality3743292514589889651.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6123394302181262193.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 146/146 places, 4290/4290 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 42 place count 145 transition count 4247
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 103 transition count 4246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 102 transition count 4246
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 86 place count 102 transition count 4229
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 120 place count 85 transition count 4229
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 138 place count 67 transition count 4202
Iterating global reduction 3 with 18 rules applied. Total rules applied 156 place count 67 transition count 4202
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 163 place count 67 transition count 4195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 163 place count 67 transition count 4193
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 167 place count 65 transition count 4193
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 174 place count 58 transition count 4179
Iterating global reduction 4 with 7 rules applied. Total rules applied 181 place count 58 transition count 4179
Ensure Unique test removed 1016 transitions
Reduce isomorphic transitions removed 1016 transitions.
Iterating post reduction 4 with 1016 rules applied. Total rules applied 1197 place count 58 transition count 3163
Drop transitions (Redundant composition of simpler transitions.) removed 3051 transitions
Redundant transition composition rules discarded 3051 transitions
Iterating global reduction 5 with 3051 rules applied. Total rules applied 4248 place count 58 transition count 112
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 4270 place count 47 transition count 101
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 4280 place count 37 transition count 91
Applied a total of 4280 rules in 967 ms. Remains 37 /146 variables (removed 109) and now considering 91/4290 (removed 4199) transitions.
[2024-05-29 21:59:23] [INFO ] Flow matrix only has 80 transitions (discarded 11 similar events)
// Phase 1: matrix 80 rows 37 cols
[2024-05-29 21:59:23] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 21:59:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-29 21:59:23] [INFO ] Flow matrix only has 80 transitions (discarded 11 similar events)
[2024-05-29 21:59:23] [INFO ] Invariant cache hit.
[2024-05-29 21:59:23] [INFO ] State equation strengthened by 27 read => feed constraints.
[2024-05-29 21:59:23] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
[2024-05-29 21:59:23] [INFO ] Redundant transitions in 2 ms returned []
Running 90 sub problems to find dead transitions.
[2024-05-29 21:59:23] [INFO ] Flow matrix only has 80 transitions (discarded 11 similar events)
[2024-05-29 21:59:23] [INFO ] Invariant cache hit.
[2024-05-29 21:59:23] [INFO ] State equation strengthened by 27 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 21:59:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:59:25] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/37 variables, 13/77 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 21:59:26] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/37 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:27] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/37 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/37 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 11 (OVERLAPS) 79/116 variables, 37/130 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 26/156 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:28] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-29 21:59:28] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 21:59:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/116 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:28] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 21:59:28] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 21:59:28] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/116 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/116 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 16 (OVERLAPS) 1/117 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/117 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 18 (OVERLAPS) 0/117 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 163 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5995 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 98/98 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 93/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (OVERLAPS) 1/37 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 5/99 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 6 (OVERLAPS) 79/116 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 26/163 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 90/253 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 1/254 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 21:59:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/116 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-05-29 21:59:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/116 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/116 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 13 (OVERLAPS) 1/117 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/117 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 15 (OVERLAPS) 0/117 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 258 constraints, problems are : Problem set: 0 solved, 90 unsolved in 6576 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 37/37 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 103/103 constraints]
After SMT, in 12643ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 12645ms
Starting structural reductions in SI_CTL mode, iteration 1 : 37/146 places, 91/4290 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13737 ms. Remains : 37/146 places, 91/4290 transitions.
[2024-05-29 21:59:36] [INFO ] Flatten gal took : 6 ms
[2024-05-29 21:59:36] [INFO ] Flatten gal took : 6 ms
[2024-05-29 21:59:36] [INFO ] Input system was already deterministic with 91 transitions.
RANDOM walk for 24 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-11a-CTLCardinality-2023-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 21:59:36] [INFO ] Flatten gal took : 10 ms
[2024-05-29 21:59:36] [INFO ] Flatten gal took : 3 ms
[2024-05-29 21:59:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17258711267470908048.gal : 1 ms
[2024-05-29 21:59:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4592819763106473468.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17258711267470908048.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4592819763106473468.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 4290/4290 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 117 transition count 4252
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 117 transition count 4252
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 78 place count 97 transition count 4225
Iterating global reduction 0 with 20 rules applied. Total rules applied 98 place count 97 transition count 4225
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 104 place count 91 transition count 4219
Iterating global reduction 0 with 6 rules applied. Total rules applied 110 place count 91 transition count 4219
Applied a total of 110 rules in 48 ms. Remains 91 /146 variables (removed 55) and now considering 4219/4290 (removed 71) transitions.
[2024-05-29 21:59:36] [INFO ] Flow matrix only has 4207 transitions (discarded 12 similar events)
// Phase 1: matrix 4207 rows 91 cols
[2024-05-29 21:59:36] [INFO ] Computed 1 invariants in 20 ms
[2024-05-29 21:59:37] [INFO ] Implicit Places using invariants in 1201 ms returned []
[2024-05-29 21:59:37] [INFO ] Flow matrix only has 4207 transitions (discarded 12 similar events)
[2024-05-29 21:59:37] [INFO ] Invariant cache hit.
[2024-05-29 21:59:38] [INFO ] State equation strengthened by 4104 read => feed constraints.
[2024-05-29 21:59:40] [INFO ] Implicit Places using invariants and state equation in 2639 ms returned []
Implicit Place search using SMT with State Equation took 3842 ms to find 0 implicit places.
Running 4218 sub problems to find dead transitions.
[2024-05-29 21:59:40] [INFO ] Flow matrix only has 4207 transitions (discarded 12 similar events)
[2024-05-29 21:59:40] [INFO ] Invariant cache hit.
[2024-05-29 21:59:40] [INFO ] State equation strengthened by 4104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4218 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4218 unsolved
[2024-05-29 22:01:20] [INFO ] Deduced a trap composed of 9 places in 920 ms of which 1 ms to minimize.
[2024-05-29 22:01:21] [INFO ] Deduced a trap composed of 9 places in 1324 ms of which 1 ms to minimize.
SMT process timed out in 100848ms, After SMT, problems are : Problem set: 0 solved, 4218 unsolved
Search for dead transitions found 0 dead transitions in 100895ms
Starting structural reductions in LTL mode, iteration 1 : 91/146 places, 4219/4290 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104805 ms. Remains : 91/146 places, 4219/4290 transitions.
[2024-05-29 22:01:21] [INFO ] Flatten gal took : 244 ms
[2024-05-29 22:01:22] [INFO ] Flatten gal took : 301 ms
[2024-05-29 22:01:22] [INFO ] Input system was already deterministic with 4219 transitions.
[2024-05-29 22:01:22] [INFO ] Flatten gal took : 261 ms
[2024-05-29 22:01:23] [INFO ] Flatten gal took : 261 ms
[2024-05-29 22:01:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality6917100886224909455.gal : 50 ms
[2024-05-29 22:01:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality9358647446778087640.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/CTLCardinality6917100886224909455.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9358647446778087640.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-29 22:01:53] [INFO ] Flatten gal took : 265 ms
[2024-05-29 22:01:53] [INFO ] Applying decomposition
[2024-05-29 22:01:53] [INFO ] Flatten gal took : 264 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/graph12051559137015131325.txt' '-o' '/tmp/graph12051559137015131325.bin' '-w' '/tmp/graph12051559137015131325.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12051559137015131325.bin' '-l' '-1' '-v' '-w' '/tmp/graph12051559137015131325.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:01:54] [INFO ] Decomposing Gal with order
[2024-05-29 22:01:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:01:55] [INFO ] Removed a total of 45123 redundant transitions.
[2024-05-29 22:01:55] [INFO ] Flatten gal took : 648 ms
[2024-05-29 22:01:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 246 ms.
[2024-05-29 22:01:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality14586045298225322710.gal : 20 ms
[2024-05-29 22:01:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality7616035443425868230.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/CTLCardinality14586045298225322710.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7616035443425868230.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.00539e+07,3.2549,62084,7498,35,67311,396,7497,284279,58,1048,0


Converting to forward existential form...Done !
original formula: EG(((i1.i1.u28.p119==0) * AX(EX(TRUE))))
=> equivalent forward existential formula: [FwdG(Init,((i1.i1.u28.p119==0) * !(EX(!(EX(TRUE))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t23, t39, t58, t4197, t4199, t4201, t4203, t4205, t4207, t4209, t4211, t4213, t4215, t4217, i...712
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Detected timeout of ITS tools.
[2024-05-29 22:02:26] [INFO ] Flatten gal took : 263 ms
[2024-05-29 22:02:26] [INFO ] Flatten gal took : 265 ms
[2024-05-29 22:02:26] [INFO ] Applying decomposition
[2024-05-29 22:02:26] [INFO ] Flatten gal took : 265 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/graph6742185837334930120.txt' '-o' '/tmp/graph6742185837334930120.bin' '-w' '/tmp/graph6742185837334930120.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph6742185837334930120.bin' '-l' '-1' '-v' '-w' '/tmp/graph6742185837334930120.weights' '-q' '0' '-e' '0.001'
[2024-05-29 22:02:27] [INFO ] Decomposing Gal with order
[2024-05-29 22:02:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:02:28] [INFO ] Removed a total of 45134 redundant transitions.
[2024-05-29 22:02:28] [INFO ] Flatten gal took : 621 ms
[2024-05-29 22:02:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 217 ms.
[2024-05-29 22:02:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality230100850126975236.gal : 30 ms
[2024-05-29 22:02:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality14864952603666729761.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality230100850126975236.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14864952603666729761.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 7 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,5.31996e+07,258.162,3695224,44369,25,1.17014e+06,270,4554,4.32286e+07,40,689,0


Converting to forward existential form...Done !
ITS-tools command line returned an error code 137
[2024-05-29 22:13:39] [INFO ] Applying decomposition
[2024-05-29 22:13:39] [INFO ] Flatten gal took : 271 ms
[2024-05-29 22:13:39] [INFO ] Decomposing Gal with order
[2024-05-29 22:13:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 22:13:40] [INFO ] Removed a total of 45124 redundant transitions.
[2024-05-29 22:13:40] [INFO ] Flatten gal took : 548 ms
[2024-05-29 22:13:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 76 ms.
[2024-05-29 22:13:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality18180722451096534627.gal : 36 ms
[2024-05-29 22:13:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality13370110649888720345.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/CTLCardinality18180722451096534627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13370110649888720345.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 7 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,5.31996e+07,1.01791,34640,127,229,579,637,4231,775,109,2605,0


Converting to forward existential form...Done !
original formula: (EF((u5.p59==1)) + AF(EX(EG((u11.p141==0)))))
=> equivalent forward existential formula: [FwdG((Init * !(E(TRUE U (u5.p59==1)))),!(EX(EG((u11.p141==0)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t9, t30, t38, u1.t75, u1.t76, u1.t78, u1.t79, u1.t113, u1.t4287, u2.t67, u2.t68, u2.t70, u2.t...771
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,2.47388,34640,1,0,20304,3159,40616,10089,844,12385,75289
FORMULA StigmergyElection-PT-11a-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (AX(EX(EF((u11.p141==1)))) + AG(AF(!(A(((u11.p144==0)||(u7.p90==1)) U (u10.p131==1))))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!(EX(!(EX(E(TRUE U (u11.p141==1)))))))),TRUE),!(!(!((E(!((u10.p131==1)) U (!(((u11.p144==0)...228
(forward)formula 1,1,2.62065,34640,1,0,24196,3998,40646,15552,849,15360,80448
FORMULA StigmergyElection-PT-11a-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: (E(((u11.p150==0)||(u10.p133==1)) U ((AF(E(A((u9.p116==1) U ((u2.p15==0)||(u3.p39==1))) U (u8.p101==1))) + AX(AG((u8.p101==1)))) + (E((u5...508
=> equivalent forward existential formula: ((([(FwdU(Init,((u11.p150==0)||(u10.p133==1))) * !(EG(!(E(!((E(!(((u2.p15==0)||(u3.p39==1))) U (!((u9.p116==1)) ...1520
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 2,1,2.83142,35148,1,0,33569,5639,40939,28449,957,24447,91157
FORMULA StigmergyElection-PT-11a-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(AF(AX((u6.p83==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(!(EX(!((u6.p83==1))))))] = FALSE
(forward)formula 3,0,2.85243,36204,1,0,36083,5708,40945,31002,970,25366,95645
FORMULA StigmergyElection-PT-11a-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: E(AX((EF((u1.p3==0)) * (EX(AG((u4.p50==1))) + (u9.p120==1)))) U E(AG(EX(TRUE)) U (!(AG(((u2.p27==0)&&(u6.p83==1)))) * ((!(EF((u1.p10==1))...191
=> equivalent forward existential formula: (([((FwdU(FwdU(Init,!(EX(!((E(TRUE U (u1.p3==0)) * (EX(!(E(TRUE U !((u4.p50==1))))) + (u9.p120==1))))))),!(E(TRU...674
(forward)formula 4,1,2.99135,38052,1,0,36835,5773,40988,32034,975,25786,97794
FORMULA StigmergyElection-PT-11a-CTLCardinality-2023-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: E((!((!((!(((u8.p101==0)||(u5.p70==1))) + E(((u1.p10==0)||(u1.p11==1)) U (u10.p130==0)))) * EX(AG((u10.p129==1))))) + AX(EF(EX(((u8.p101=...189
=> equivalent forward existential formula: [(FwdU(Init,(!((!((!(((u8.p101==0)||(u5.p70==1))) + E(((u1.p10==0)||(u1.p11==1)) U (u10.p130==0)))) * EX(!(E(TRU...265
(forward)formula 5,0,2.99143,38052,1,0,36835,5773,40988,32034,975,25786,97794
FORMULA StigmergyElection-PT-11a-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: EG(((u9.p119==0) * AX(EX(TRUE))))
=> equivalent forward existential formula: [FwdG(Init,((u9.p119==0) * !(EX(!(EX(TRUE))))))] != FALSE
(forward)formula 6,1,3.08757,40692,1,0,44278,6012,40993,41712,976,30539,110013
FORMULA StigmergyElection-PT-11a-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 2262536 ms.

BK_STOP 1717020823663

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyElection-PT-11a"
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 StigmergyElection-PT-11a, 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 r400-tall-171690532200393"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-11a.tgz
mv StigmergyElection-PT-11a 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 ;