About the Execution of ITS-Tools for StigmergyElection-PT-09a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 4264.947 | 1163456.00 | 1291971.00 | 2350.30 | FFFTFFFFTTTTFFFF | normal |
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-171690532200361.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-09a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532200361
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 19:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 19:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 19:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 19:09 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 17M 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-09a-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-09a-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717013546238
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-09a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 20:12:27] [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 20:12:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:12:28] [INFO ] Load time of PNML (sax parser for PT used): 862 ms
[2024-05-29 20:12:28] [INFO ] Transformed 128 places.
[2024-05-29 20:12:28] [INFO ] Transformed 18490 transitions.
[2024-05-29 20:12:28] [INFO ] Found NUPN structural information;
[2024-05-29 20:12:28] [INFO ] Parsed PT model containing 128 places and 18490 transitions and 329609 arcs in 1078 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Ensure Unique test removed 17295 transitions
Reduce redundant transitions removed 17295 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-09a-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 88 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 1195/1195 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 1190
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 1190
Applied a total of 8 rules in 37 ms. Remains 124 /128 variables (removed 4) and now considering 1190/1195 (removed 5) transitions.
[2024-05-29 20:12:28] [INFO ] Flow matrix only has 1167 transitions (discarded 23 similar events)
// Phase 1: matrix 1167 rows 124 cols
[2024-05-29 20:12:28] [INFO ] Computed 7 invariants in 27 ms
[2024-05-29 20:12:29] [INFO ] Implicit Places using invariants in 547 ms returned []
[2024-05-29 20:12:29] [INFO ] Flow matrix only has 1167 transitions (discarded 23 similar events)
[2024-05-29 20:12:29] [INFO ] Invariant cache hit.
[2024-05-29 20:12:29] [INFO ] State equation strengthened by 1066 read => feed constraints.
[2024-05-29 20:12:30] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned [123]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2193 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 123/128 places, 1190/1195 transitions.
Applied a total of 0 rules in 6 ms. Remains 123 /123 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2254 ms. Remains : 123/128 places, 1190/1195 transitions.
Support contains 88 out of 123 places after structural reductions.
[2024-05-29 20:12:31] [INFO ] Flatten gal took : 179 ms
[2024-05-29 20:12:31] [INFO ] Flatten gal took : 107 ms
[2024-05-29 20:12:31] [INFO ] Input system was already deterministic with 1190 transitions.
Support contains 85 out of 123 places (down from 88) after GAL structural reductions.
RANDOM walk for 40000 steps (12 resets) in 4115 ms. (9 steps per ms) remains 9/68 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
[2024-05-29 20:12:33] [INFO ] Flow matrix only has 1167 transitions (discarded 23 similar events)
// Phase 1: matrix 1167 rows 123 cols
[2024-05-29 20:12:33] [INFO ] Computed 6 invariants in 14 ms
[2024-05-29 20:12:33] [INFO ] State equation strengthened by 1030 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 87/109 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:12:33] [INFO ] Deduced a trap composed of 12 places in 291 ms of which 17 ms to minimize.
[2024-05-29 20:12:34] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 2 ms to minimize.
[2024-05-29 20:12:34] [INFO ] Deduced a trap composed of 13 places in 268 ms of which 2 ms to minimize.
[2024-05-29 20:12:34] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-29 20:12:34] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:12:35] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:12:35] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 1 ms to minimize.
[2024-05-29 20:12:35] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 0 ms to minimize.
[2024-05-29 20:12:35] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 1 ms to minimize.
[2024-05-29 20:12:36] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 0 ms to minimize.
[2024-05-29 20:12:36] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 1 ms to minimize.
[2024-05-29 20:12:36] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2024-05-29 20:12:36] [INFO ] Deduced a trap composed of 13 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:12:36] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 1 ms to minimize.
[2024-05-29 20:12:37] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 1 ms to minimize.
[2024-05-29 20:12:37] [INFO ] Deduced a trap composed of 13 places in 201 ms of which 1 ms to minimize.
[2024-05-29 20:12:37] [INFO ] Deduced a trap composed of 11 places in 197 ms of which 1 ms to minimize.
[2024-05-29 20:12:37] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2024-05-29 20:12:37] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 1 ms to minimize.
[2024-05-29 20:12:38] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 1 ms to minimize.
[2024-05-29 20:12:38] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:12:38] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
SMT process timed out in 5285ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Graph (complete) has 386 edges and 123 vertex of which 117 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.14 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 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 117 transition count 1125
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 47 rules applied. Total rules applied 107 place count 85 transition count 1110
Reduce places removed 6 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 11 rules applied. Total rules applied 118 place count 79 transition count 1105
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 124 place count 74 transition count 1104
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 124 place count 74 transition count 1094
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 144 place count 64 transition count 1094
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 154 place count 54 transition count 1083
Iterating global reduction 4 with 10 rules applied. Total rules applied 164 place count 54 transition count 1083
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 170 place count 54 transition count 1077
Performed 8 Post agglomeration using F-continuation condition with reduction of 480 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 186 place count 46 transition count 589
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 377 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 5 with 384 rules applied. Total rules applied 570 place count 46 transition count 205
Drop transitions (Redundant composition of simpler transitions.) removed 144 transitions
Redundant transition composition rules discarded 144 transitions
Iterating global reduction 6 with 144 rules applied. Total rules applied 714 place count 46 transition count 61
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 714 place count 46 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 716 place count 45 transition count 60
Applied a total of 716 rules in 149 ms. Remains 45 /123 variables (removed 78) and now considering 60/1190 (removed 1130) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 45/123 places, 60/1190 transitions.
RANDOM walk for 40000 steps (8 resets) in 262 ms. (152 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
// Phase 1: matrix 60 rows 45 cols
[2024-05-29 20:12:38] [INFO ] Computed 9 invariants in 0 ms
[2024-05-29 20:12:38] [INFO ] State equation strengthened by 24 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 23/44 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/45 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 0 ms to minimize.
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 7/16 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 60/105 variables, 45/61 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 24/85 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/105 variables, 0/85 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/105 variables, and 85 constraints, problems are : Problem set: 2 solved, 3 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 2 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 3/8 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
Problem AtomicPropp1 is UNSAT
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
Problem AtomicPropp61 is UNSAT
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 4 ms to minimize.
[2024-05-29 20:12:39] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
Problem AtomicPropp67 is UNSAT
After SMT solving in domain Int declared 34/105 variables, and 15 constraints, problems are : Problem set: 5 solved, 0 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 5/9 constraints, State Equation: 0/45 constraints, ReadFeed: 0/24 constraints, PredecessorRefiner: 0/5 constraints, Known Traps: 10/14 constraints]
After SMT, in 494ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 15 simplifications.
[2024-05-29 20:12:39] [INFO ] Flatten gal took : 83 ms
[2024-05-29 20:12:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyElection-PT-09a-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 20:12:39] [INFO ] Flatten gal took : 77 ms
[2024-05-29 20:12:39] [INFO ] Input system was already deterministic with 1190 transitions.
Support contains 75 out of 123 places (down from 77) after GAL structural reductions.
Computed a total of 19 stabilizing places and 19 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 123 transition count 1157
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 90 transition count 1156
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 89 transition count 1156
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 68 place count 89 transition count 1138
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 104 place count 71 transition count 1138
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 117 place count 58 transition count 1117
Iterating global reduction 3 with 13 rules applied. Total rules applied 130 place count 58 transition count 1117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 131 place count 58 transition count 1116
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 138 place count 51 transition count 1102
Iterating global reduction 4 with 7 rules applied. Total rules applied 145 place count 51 transition count 1102
Ensure Unique test removed 254 transitions
Reduce isomorphic transitions removed 254 transitions.
Iterating post reduction 4 with 254 rules applied. Total rules applied 399 place count 51 transition count 848
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 415 place count 43 transition count 840
Drop transitions (Redundant composition of simpler transitions.) removed 753 transitions
Redundant transition composition rules discarded 753 transitions
Iterating global reduction 5 with 753 rules applied. Total rules applied 1168 place count 43 transition count 87
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 1186 place count 34 transition count 78
Applied a total of 1186 rules in 178 ms. Remains 34 /123 variables (removed 89) and now considering 78/1190 (removed 1112) transitions.
[2024-05-29 20:12:39] [INFO ] Flow matrix only has 68 transitions (discarded 10 similar events)
// Phase 1: matrix 68 rows 34 cols
[2024-05-29 20:12:39] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 20:12:40] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-29 20:12:40] [INFO ] Flow matrix only has 68 transitions (discarded 10 similar events)
[2024-05-29 20:12:40] [INFO ] Invariant cache hit.
[2024-05-29 20:12:40] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-29 20:12:40] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-29 20:12:40] [INFO ] Redundant transitions in 1 ms returned []
Running 77 sub problems to find dead transitions.
[2024-05-29 20:12:40] [INFO ] Flow matrix only has 68 transitions (discarded 10 similar events)
[2024-05-29 20:12:40] [INFO ] Invariant cache hit.
[2024-05-29 20:12:40] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 1 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 7 places in 16 ms of which 1 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 8 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 5 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:12:40] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:12:41] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/34 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 20:12:42] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/34 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/34 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 67/101 variables, 34/109 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/101 variables, 31/140 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 20:12:43] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/101 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/101 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 14 (OVERLAPS) 1/102 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 16 (OVERLAPS) 0/102 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 142 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6048 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 20:12:46] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:12:46] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:12:46] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 67/101 variables, 34/113 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/101 variables, 31/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 77/221 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 1/102 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 77 unsolved
[2024-05-29 20:12:50] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/102 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/102 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 13 (OVERLAPS) 0/102 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 223 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6880 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 79/79 constraints]
After SMT, in 13004ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 13005ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/123 places, 78/1190 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13293 ms. Remains : 34/123 places, 78/1190 transitions.
[2024-05-29 20:12:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 20:12:53] [INFO ] Flatten gal took : 5 ms
[2024-05-29 20:12:53] [INFO ] Input system was already deterministic with 78 transitions.
[2024-05-29 20:12:53] [INFO ] Flatten gal took : 4 ms
[2024-05-29 20:12:53] [INFO ] Flatten gal took : 4 ms
[2024-05-29 20:12:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality8352503412257918896.gal : 3 ms
[2024-05-29 20:12:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality5641951132601043681.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/CTLCardinality8352503412257918896.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5641951132601043681.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,1046,0.038106,4340,2,382,5,3350,6,0,203,1651,0
Converting to forward existential form...Done !
original formula: AG(((AF(EG(EF((p98==1)))) + (p93==0)) + (p103==1)))
=> equivalent forward existential formula: [FwdG(((FwdU(Init,TRUE) * !((p103==1))) * !((p93==0))),!(EG(E(TRUE U (p98==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, t20, t22...300
Using saturation style SCC detection
(forward)formula 0,0,0.115524,6272,1,0,140,12447,180,55,2749,9259,172
FORMULA StigmergyElection-PT-09a-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 123 transition count 1155
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 88 transition count 1154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 87 transition count 1154
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 72 place count 87 transition count 1138
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 104 place count 71 transition count 1138
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 114 place count 61 transition count 1122
Iterating global reduction 3 with 10 rules applied. Total rules applied 124 place count 61 transition count 1122
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 130 place count 55 transition count 1110
Iterating global reduction 3 with 6 rules applied. Total rules applied 136 place count 55 transition count 1110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 199 place count 55 transition count 1047
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 215 place count 47 transition count 1039
Drop transitions (Redundant composition of simpler transitions.) removed 934 transitions
Redundant transition composition rules discarded 934 transitions
Iterating global reduction 4 with 934 rules applied. Total rules applied 1149 place count 47 transition count 105
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 4 with 18 rules applied. Total rules applied 1167 place count 38 transition count 96
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1169 place count 38 transition count 96
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1170 place count 38 transition count 95
Applied a total of 1170 rules in 299 ms. Remains 38 /123 variables (removed 85) and now considering 95/1190 (removed 1095) transitions.
[2024-05-29 20:12:53] [INFO ] Flow matrix only has 83 transitions (discarded 12 similar events)
// Phase 1: matrix 83 rows 38 cols
[2024-05-29 20:12:53] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 20:12:53] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-29 20:12:53] [INFO ] Flow matrix only has 83 transitions (discarded 12 similar events)
[2024-05-29 20:12:53] [INFO ] Invariant cache hit.
[2024-05-29 20:12:53] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-29 20:12:53] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2024-05-29 20:12:53] [INFO ] Redundant transitions in 5 ms returned []
Running 94 sub problems to find dead transitions.
[2024-05-29 20:12:53] [INFO ] Flow matrix only has 83 transitions (discarded 12 similar events)
[2024-05-29 20:12:53] [INFO ] Invariant cache hit.
[2024-05-29 20:12:53] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 8 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 5 places in 15 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:12:54] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 16/58 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:12:55] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 10/68 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 5/73 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:12:56] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:12:57] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-29 20:12:57] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:12:57] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/38 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-29 20:12:57] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:12:57] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:12:57] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:12:57] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/38 variables, 4/83 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/38 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 82/120 variables, 38/121 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/120 variables, 43/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/120 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 14 (OVERLAPS) 1/121 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/121 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 16 (OVERLAPS) 0/121 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 165 constraints, problems are : Problem set: 0 solved, 94 unsolved in 5496 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 81/81 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 81/83 constraints. Problems are: Problem set: 0 solved, 94 unsolved
[2024-05-29 20:12:59] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (OVERLAPS) 82/120 variables, 38/122 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 43/165 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 94/259 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/120 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 1/121 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (OVERLAPS) 0/121 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 260 constraints, problems are : Problem set: 0 solved, 94 unsolved in 4960 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 38/38 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 82/82 constraints]
After SMT, in 10546ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 10548ms
Starting structural reductions in SI_CTL mode, iteration 1 : 38/123 places, 95/1190 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10967 ms. Remains : 38/123 places, 95/1190 transitions.
[2024-05-29 20:13:04] [INFO ] Flatten gal took : 7 ms
[2024-05-29 20:13:04] [INFO ] Flatten gal took : 12 ms
[2024-05-29 20:13:04] [INFO ] Input system was already deterministic with 95 transitions.
[2024-05-29 20:13:04] [INFO ] Flatten gal took : 4 ms
[2024-05-29 20:13:04] [INFO ] Flatten gal took : 4 ms
[2024-05-29 20:13:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality4243048271476447371.gal : 2 ms
[2024-05-29 20:13:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality6786471144969241055.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/CTLCardinality4243048271476447371.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6786471144969241055.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,3476,0.043566,4888,2,399,5,3048,6,0,232,2592,0
Converting to forward existential form...Done !
original formula: EF(((!(A(AF(((p89==1)&&(p5==1))) U AF((p64==1)))) * EG(AG((p76==0)))) * EF(((p7==0)&&(p112==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * (!(!((E(!(!(EG(!((p64==1))))) U (!(!(EG(!(((p89==1)&&(p5==1)))))) * !(!(EG(!((p64==1))...264
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21, t24...305
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.239097,10484,1,0,202,25319,224,88,3607,23895,272
FORMULA StigmergyElection-PT-09a-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 107 transition count 1166
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 107 transition count 1166
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 45 place count 94 transition count 1146
Iterating global reduction 0 with 13 rules applied. Total rules applied 58 place count 94 transition count 1146
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 65 place count 87 transition count 1139
Iterating global reduction 0 with 7 rules applied. Total rules applied 72 place count 87 transition count 1139
Applied a total of 72 rules in 23 ms. Remains 87 /123 variables (removed 36) and now considering 1139/1190 (removed 51) transitions.
[2024-05-29 20:13:04] [INFO ] Flow matrix only has 1126 transitions (discarded 13 similar events)
// Phase 1: matrix 1126 rows 87 cols
[2024-05-29 20:13:04] [INFO ] Computed 3 invariants in 10 ms
[2024-05-29 20:13:04] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-29 20:13:04] [INFO ] Flow matrix only has 1126 transitions (discarded 13 similar events)
[2024-05-29 20:13:04] [INFO ] Invariant cache hit.
[2024-05-29 20:13:05] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:13:05] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
Running 1138 sub problems to find dead transitions.
[2024-05-29 20:13:05] [INFO ] Flow matrix only has 1126 transitions (discarded 13 similar events)
[2024-05-29 20:13:05] [INFO ] Invariant cache hit.
[2024-05-29 20:13:05] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:13:26] [INFO ] Deduced a trap composed of 9 places in 333 ms of which 1 ms to minimize.
[2024-05-29 20:13:26] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 1 ms to minimize.
[2024-05-29 20:13:27] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:13:27] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:13:27] [INFO ] Deduced a trap composed of 9 places in 252 ms of which 1 ms to minimize.
[2024-05-29 20:13:27] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 0 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2024-05-29 20:13:28] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 1 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-29 20:13:29] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:13:30] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:13:30] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:13:30] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2024-05-29 20:13:30] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:13:30] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2024-05-29 20:13:30] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 0 ms to minimize.
[2024-05-29 20:13:31] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 0 ms to minimize.
[2024-05-29 20:13:32] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:13:32] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2024-05-29 20:13:32] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 1 ms to minimize.
[2024-05-29 20:13:32] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:13:32] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:13:33] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2024-05-29 20:13:33] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 0 ms to minimize.
[2024-05-29 20:13:33] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2024-05-29 20:13:36] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 0 ms to minimize.
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 1 ms to minimize.
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 12 places in 247 ms of which 1 ms to minimize.
[2024-05-29 20:13:37] [INFO ] Deduced a trap composed of 12 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:13:38] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 2 ms to minimize.
[2024-05-29 20:13:38] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:13:38] [INFO ] Deduced a trap composed of 12 places in 173 ms of which 0 ms to minimize.
[2024-05-29 20:13:38] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2024-05-29 20:13:38] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 1 ms to minimize.
[2024-05-29 20:13:38] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:13:38] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 1 ms to minimize.
[2024-05-29 20:13:39] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 5 ms to minimize.
[2024-05-29 20:13:39] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:13:39] [INFO ] Deduced a trap composed of 12 places in 232 ms of which 0 ms to minimize.
[2024-05-29 20:13:40] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 1 ms to minimize.
[2024-05-29 20:13:40] [INFO ] Deduced a trap composed of 9 places in 172 ms of which 1 ms to minimize.
[2024-05-29 20:13:40] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2024-05-29 20:13:40] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 0 ms to minimize.
[2024-05-29 20:13:40] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-29 20:13:40] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:13:40] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:13:41] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:13:41] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:13:41] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:13:41] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:13:41] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 0 ms to minimize.
[2024-05-29 20:13:41] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 1 ms to minimize.
[2024-05-29 20:13:41] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2024-05-29 20:13:41] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 0 ms to minimize.
[2024-05-29 20:13:41] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:13:42] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 0 ms to minimize.
[2024-05-29 20:13:42] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2024-05-29 20:13:42] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:13:43] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:13:43] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 0 ms to minimize.
[2024-05-29 20:13:43] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-29 20:13:43] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:13:43] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 1 ms to minimize.
[2024-05-29 20:13:43] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:13:43] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:13:43] [INFO ] Deduced a trap composed of 12 places in 195 ms of which 1 ms to minimize.
[2024-05-29 20:13:47] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:13:47] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 87/1213 variables, and 93 constraints, problems are : Problem set: 0 solved, 1138 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/87 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1138/106 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
At refinement iteration 1 (OVERLAPS) 1/87 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:13:55] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:13:55] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:13:55] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:13:55] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:13:55] [INFO ] Deduced a trap composed of 12 places in 122 ms of which 1 ms to minimize.
[2024-05-29 20:13:55] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-05-29 20:13:56] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-29 20:13:56] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:13:56] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 1 ms to minimize.
[2024-05-29 20:13:56] [INFO ] Deduced a trap composed of 12 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:13:56] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:13:56] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:13:57] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:13:57] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:13:57] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2024-05-29 20:13:57] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:13:57] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:14:01] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 20:14:02] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 19/112 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:14:08] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:14:08] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:14:08] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:14:10] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:14:14] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
SMT process timed out in 76391ms, After SMT, problems are : Problem set: 0 solved, 1138 unsolved
Search for dead transitions found 0 dead transitions in 76407ms
Starting structural reductions in LTL mode, iteration 1 : 87/123 places, 1139/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77196 ms. Remains : 87/123 places, 1139/1190 transitions.
[2024-05-29 20:14:21] [INFO ] Flatten gal took : 56 ms
[2024-05-29 20:14:21] [INFO ] Flatten gal took : 59 ms
[2024-05-29 20:14:22] [INFO ] Input system was already deterministic with 1139 transitions.
[2024-05-29 20:14:22] [INFO ] Flatten gal took : 56 ms
[2024-05-29 20:14:22] [INFO ] Flatten gal took : 55 ms
[2024-05-29 20:14:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality2278235918142115683.gal : 12 ms
[2024-05-29 20:14:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality14744686808871505276.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/CTLCardinality2278235918142115683.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14744686808871505276.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.16944e+06,12.4231,266208,2,9754,5,194389,6,0,1470,118171,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2024-05-29 20:14:52] [INFO ] Flatten gal took : 57 ms
[2024-05-29 20:14:52] [INFO ] Applying decomposition
[2024-05-29 20:14:52] [INFO ] Flatten gal took : 57 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/graph9348378488386391903.txt' '-o' '/tmp/graph9348378488386391903.bin' '-w' '/tmp/graph9348378488386391903.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9348378488386391903.bin' '-l' '-1' '-v' '-w' '/tmp/graph9348378488386391903.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:14:52] [INFO ] Decomposing Gal with order
[2024-05-29 20:14:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:14:53] [INFO ] Removed a total of 9265 redundant transitions.
[2024-05-29 20:14:53] [INFO ] Flatten gal took : 449 ms
[2024-05-29 20:14:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 96 ms.
[2024-05-29 20:14:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality4496076102390297986.gal : 13 ms
[2024-05-29 20:14:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality10690673139029438212.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/CTLCardinality4496076102390297986.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10690673139029438212.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,2.16944e+06,1.42446,57468,3955,35,70065,299,2096,361992,56,842,0
Converting to forward existential form...Done !
original formula: (EG(((i7.u17.p69==0)||(i7.u13.p59==1))) + !(E(!(AX(A(((i7.u16.p63==0)||(i7.u17.p69==1)) U (i10.u31.p120==0)))) U ((((((((i8.u23.p92==0)||...384
=> equivalent forward existential formula: [(FwdU((Init * !(EG(((i7.u17.p69==0)||(i7.u13.p59==1))))),!(!(EX(!(!((E(!((i10.u31.p120==0)) U (!(((i7.u16.p63==...498
Reverse transition relation is NOT exact ! Due to transitions t4, t8, t13, t19, t31, t36, t42, t46, t55, t65, t70, t1120, t1124, t1126, t1128, t1131, t1133...476
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
(forward)formula 0,0,7.57183,239892,1,0,222978,371,22300,1.40428e+06,246,1342,1808582
FORMULA StigmergyElection-PT-09a-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 100 transition count 1158
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 100 transition count 1158
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 62 place count 84 transition count 1135
Iterating global reduction 0 with 16 rules applied. Total rules applied 78 place count 84 transition count 1135
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 85 place count 77 transition count 1128
Iterating global reduction 0 with 7 rules applied. Total rules applied 92 place count 77 transition count 1128
Applied a total of 92 rules in 25 ms. Remains 77 /123 variables (removed 46) and now considering 1128/1190 (removed 62) transitions.
[2024-05-29 20:15:01] [INFO ] Flow matrix only has 1118 transitions (discarded 10 similar events)
// Phase 1: matrix 1118 rows 77 cols
[2024-05-29 20:15:01] [INFO ] Computed 1 invariants in 5 ms
[2024-05-29 20:15:01] [INFO ] Implicit Places using invariants in 291 ms returned []
[2024-05-29 20:15:01] [INFO ] Flow matrix only has 1118 transitions (discarded 10 similar events)
[2024-05-29 20:15:01] [INFO ] Invariant cache hit.
[2024-05-29 20:15:01] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:15:02] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 990 ms to find 0 implicit places.
Running 1127 sub problems to find dead transitions.
[2024-05-29 20:15:02] [INFO ] Flow matrix only has 1118 transitions (discarded 10 similar events)
[2024-05-29 20:15:02] [INFO ] Invariant cache hit.
[2024-05-29 20:15:02] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:15:23] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 1 ms to minimize.
[2024-05-29 20:15:23] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 0 ms to minimize.
[2024-05-29 20:15:23] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 0 ms to minimize.
[2024-05-29 20:15:24] [INFO ] Deduced a trap composed of 9 places in 202 ms of which 1 ms to minimize.
[2024-05-29 20:15:24] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 0 ms to minimize.
[2024-05-29 20:15:24] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 1 ms to minimize.
[2024-05-29 20:15:24] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 0 ms to minimize.
[2024-05-29 20:15:24] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2024-05-29 20:15:25] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:15:25] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 0 ms to minimize.
[2024-05-29 20:15:25] [INFO ] Deduced a trap composed of 11 places in 267 ms of which 1 ms to minimize.
[2024-05-29 20:15:25] [INFO ] Deduced a trap composed of 10 places in 214 ms of which 0 ms to minimize.
[2024-05-29 20:15:26] [INFO ] Deduced a trap composed of 13 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:15:26] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2024-05-29 20:15:26] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 0 ms to minimize.
[2024-05-29 20:15:26] [INFO ] Deduced a trap composed of 9 places in 204 ms of which 1 ms to minimize.
[2024-05-29 20:15:27] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 1 ms to minimize.
[2024-05-29 20:15:27] [INFO ] Deduced a trap composed of 9 places in 222 ms of which 1 ms to minimize.
[2024-05-29 20:15:27] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 1 ms to minimize.
[2024-05-29 20:15:27] [INFO ] Deduced a trap composed of 9 places in 215 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:15:28] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2024-05-29 20:15:28] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 1 ms to minimize.
[2024-05-29 20:15:28] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 0 ms to minimize.
[2024-05-29 20:15:28] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-29 20:15:28] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2024-05-29 20:15:28] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-29 20:15:28] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:15:29] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2024-05-29 20:15:29] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:15:29] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 1 ms to minimize.
[2024-05-29 20:15:29] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2024-05-29 20:15:29] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2024-05-29 20:15:29] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:15:29] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:15:29] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:15:30] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:15:30] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:15:30] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:15:30] [INFO ] Deduced a trap composed of 13 places in 223 ms of which 0 ms to minimize.
[2024-05-29 20:15:30] [INFO ] Deduced a trap composed of 10 places in 225 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:15:33] [INFO ] Deduced a trap composed of 11 places in 192 ms of which 1 ms to minimize.
[2024-05-29 20:15:33] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 0 ms to minimize.
[2024-05-29 20:15:33] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 0 ms to minimize.
[2024-05-29 20:15:33] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2024-05-29 20:15:33] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2024-05-29 20:15:34] [INFO ] Deduced a trap composed of 10 places in 129 ms of which 1 ms to minimize.
[2024-05-29 20:15:34] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:15:34] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:15:34] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 20:15:34] [INFO ] Deduced a trap composed of 12 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:15:34] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:15:34] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 0 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 13 places in 163 ms of which 0 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:15:35] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 9 places in 189 ms of which 0 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:15:36] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 0 ms to minimize.
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 1 ms to minimize.
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:15:37] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:15:38] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:15:38] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:15:38] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:15:38] [INFO ] Deduced a trap composed of 12 places in 185 ms of which 0 ms to minimize.
[2024-05-29 20:15:38] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 1 ms to minimize.
[2024-05-29 20:15:38] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 1 ms to minimize.
[2024-05-29 20:15:39] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-05-29 20:15:39] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:15:39] [INFO ] Deduced a trap composed of 13 places in 156 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:15:39] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:15:39] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:15:40] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 0 ms to minimize.
[2024-05-29 20:15:40] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:15:40] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2024-05-29 20:15:40] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 0 ms to minimize.
[2024-05-29 20:15:40] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 0 ms to minimize.
[2024-05-29 20:15:43] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 0 ms to minimize.
[2024-05-29 20:15:43] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-29 20:15:44] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:15:44] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 20:15:44] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:15:44] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-29 20:15:44] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2024-05-29 20:15:44] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:15:44] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:15:44] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2024-05-29 20:15:44] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:15:44] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:15:44] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 77/1195 variables, and 101 constraints, problems are : Problem set: 0 solved, 1127 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/77 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1127/95 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 1 (OVERLAPS) 1/77 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:15:52] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:15:53] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 0 ms to minimize.
[2024-05-29 20:15:53] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:15:53] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:15:53] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:15:53] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:15:53] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:15:53] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:15:53] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:15:53] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:15:54] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 20:15:54] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:15:54] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:15:54] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:15:54] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:15:59] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-29 20:15:59] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 20:15:59] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-29 20:15:59] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2024-05-29 20:15:59] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:16:01] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 1 ms to minimize.
[2024-05-29 20:16:06] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:16:06] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:16:06] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:16:06] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:16:06] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:16:06] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:16:07] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 8/129 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:16:09] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-29 20:16:10] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:16:10] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:16:10] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 4/133 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:16:18] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 1 ms to minimize.
[2024-05-29 20:16:19] [INFO ] Deduced a trap composed of 13 places in 290 ms of which 0 ms to minimize.
SMT process timed out in 77025ms, After SMT, problems are : Problem set: 0 solved, 1127 unsolved
Search for dead transitions found 0 dead transitions in 77042ms
Starting structural reductions in LTL mode, iteration 1 : 77/123 places, 1128/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78067 ms. Remains : 77/123 places, 1128/1190 transitions.
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 56 ms
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 61 ms
[2024-05-29 20:16:19] [INFO ] Input system was already deterministic with 1128 transitions.
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 55 ms
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 55 ms
[2024-05-29 20:16:19] [INFO ] Time to serialize gal into /tmp/CTLCardinality15245717808964028488.gal : 12 ms
[2024-05-29 20:16:19] [INFO ] Time to serialize properties into /tmp/CTLCardinality13611358475249531235.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/CTLCardinality15245717808964028488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13611358475249531235.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.1039e+06,12.4843,263940,2,9965,5,209481,6,0,1426,126211,0
Converting to forward existential form...Done !
original formula: EF(EX(AX(EG(((p126==0)||(p20==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EX(!(EG(((p126==0)||(p20==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...451
Detected timeout of ITS tools.
[2024-05-29 20:16:49] [INFO ] Flatten gal took : 56 ms
[2024-05-29 20:16:49] [INFO ] Applying decomposition
[2024-05-29 20:16:49] [INFO ] Flatten gal took : 59 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/graph12790998501450677171.txt' '-o' '/tmp/graph12790998501450677171.bin' '-w' '/tmp/graph12790998501450677171.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12790998501450677171.bin' '-l' '-1' '-v' '-w' '/tmp/graph12790998501450677171.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:16:49] [INFO ] Decomposing Gal with order
[2024-05-29 20:16:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:16:50] [INFO ] Removed a total of 9257 redundant transitions.
[2024-05-29 20:16:50] [INFO ] Flatten gal took : 154 ms
[2024-05-29 20:16:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 39 ms.
[2024-05-29 20:16:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality15723614369794801770.gal : 13 ms
[2024-05-29 20:16:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality3224318431236787416.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/CTLCardinality15723614369794801770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3224318431236787416.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,2.1039e+06,0.295663,13572,1610,27,12944,224,1690,41295,48,618,0
Converting to forward existential form...Done !
original formula: EF(EX(AX(EG(((i2.u27.p126==0)||(i0.u3.p20==1))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EX(!(EG(((i2.u27.p126==0)||(i0.u3.p20==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t51, t1110, t1112, t1114, t1116, t1118, t1120, t1122, t1124, t1126, i0.t41, i0.t38, i0.u3.t37...621
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
(forward)formula 0,1,3.03436,143460,1,0,123017,275,17147,1.44981e+06,191,1010,194177
FORMULA StigmergyElection-PT-09a-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 102 transition count 1162
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 102 transition count 1162
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 56 place count 88 transition count 1142
Iterating global reduction 0 with 14 rules applied. Total rules applied 70 place count 88 transition count 1142
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 76 place count 82 transition count 1136
Iterating global reduction 0 with 6 rules applied. Total rules applied 82 place count 82 transition count 1136
Applied a total of 82 rules in 17 ms. Remains 82 /123 variables (removed 41) and now considering 1136/1190 (removed 54) transitions.
[2024-05-29 20:16:53] [INFO ] Flow matrix only has 1125 transitions (discarded 11 similar events)
// Phase 1: matrix 1125 rows 82 cols
[2024-05-29 20:16:53] [INFO ] Computed 1 invariants in 4 ms
[2024-05-29 20:16:53] [INFO ] Implicit Places using invariants in 283 ms returned []
[2024-05-29 20:16:53] [INFO ] Flow matrix only has 1125 transitions (discarded 11 similar events)
[2024-05-29 20:16:53] [INFO ] Invariant cache hit.
[2024-05-29 20:16:53] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:16:54] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
Running 1135 sub problems to find dead transitions.
[2024-05-29 20:16:54] [INFO ] Flow matrix only has 1125 transitions (discarded 11 similar events)
[2024-05-29 20:16:54] [INFO ] Invariant cache hit.
[2024-05-29 20:16:54] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
At refinement iteration 1 (OVERLAPS) 1/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:17:15] [INFO ] Deduced a trap composed of 9 places in 265 ms of which 1 ms to minimize.
[2024-05-29 20:17:15] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:17:15] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 0 ms to minimize.
[2024-05-29 20:17:16] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 0 ms to minimize.
[2024-05-29 20:17:16] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 1 ms to minimize.
[2024-05-29 20:17:16] [INFO ] Deduced a trap composed of 13 places in 258 ms of which 1 ms to minimize.
[2024-05-29 20:17:17] [INFO ] Deduced a trap composed of 11 places in 259 ms of which 1 ms to minimize.
[2024-05-29 20:17:17] [INFO ] Deduced a trap composed of 12 places in 300 ms of which 1 ms to minimize.
[2024-05-29 20:17:17] [INFO ] Deduced a trap composed of 13 places in 309 ms of which 0 ms to minimize.
[2024-05-29 20:17:17] [INFO ] Deduced a trap composed of 9 places in 310 ms of which 1 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 0 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 9 places in 225 ms of which 2 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 0 ms to minimize.
[2024-05-29 20:17:18] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-29 20:17:19] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:17:20] [INFO ] Deduced a trap composed of 11 places in 189 ms of which 0 ms to minimize.
[2024-05-29 20:17:20] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2024-05-29 20:17:20] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 0 ms to minimize.
[2024-05-29 20:17:20] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:17:20] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2024-05-29 20:17:20] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-29 20:17:21] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:17:21] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
[2024-05-29 20:17:21] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 0 ms to minimize.
[2024-05-29 20:17:21] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 0 ms to minimize.
[2024-05-29 20:17:21] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 0 ms to minimize.
[2024-05-29 20:17:22] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 1 ms to minimize.
[2024-05-29 20:17:22] [INFO ] Deduced a trap composed of 11 places in 188 ms of which 1 ms to minimize.
[2024-05-29 20:17:22] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:17:22] [INFO ] Deduced a trap composed of 14 places in 230 ms of which 1 ms to minimize.
[2024-05-29 20:17:22] [INFO ] Deduced a trap composed of 10 places in 251 ms of which 0 ms to minimize.
[2024-05-29 20:17:23] [INFO ] Deduced a trap composed of 10 places in 170 ms of which 0 ms to minimize.
[2024-05-29 20:17:23] [INFO ] Deduced a trap composed of 12 places in 160 ms of which 1 ms to minimize.
[2024-05-29 20:17:23] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2024-05-29 20:17:23] [INFO ] Deduced a trap composed of 9 places in 140 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:17:26] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2024-05-29 20:17:26] [INFO ] Deduced a trap composed of 12 places in 165 ms of which 0 ms to minimize.
[2024-05-29 20:17:26] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 0 ms to minimize.
[2024-05-29 20:17:26] [INFO ] Deduced a trap composed of 13 places in 141 ms of which 0 ms to minimize.
[2024-05-29 20:17:26] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 0 ms to minimize.
[2024-05-29 20:17:26] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 0 ms to minimize.
[2024-05-29 20:17:27] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:17:27] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 0 ms to minimize.
[2024-05-29 20:17:27] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 0 ms to minimize.
[2024-05-29 20:17:27] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
[2024-05-29 20:17:27] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-29 20:17:27] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:17:27] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:17:28] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2024-05-29 20:17:28] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:17:28] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-29 20:17:28] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:17:28] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 0 ms to minimize.
[2024-05-29 20:17:28] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 0 ms to minimize.
[2024-05-29 20:17:29] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:17:29] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-29 20:17:29] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:17:29] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 1 ms to minimize.
[2024-05-29 20:17:29] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-05-29 20:17:30] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:17:30] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:17:30] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-29 20:17:30] [INFO ] Deduced a trap composed of 11 places in 185 ms of which 1 ms to minimize.
[2024-05-29 20:17:30] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2024-05-29 20:17:30] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 1 ms to minimize.
[2024-05-29 20:17:30] [INFO ] Deduced a trap composed of 11 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:17:30] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:17:31] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:17:31] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 0 ms to minimize.
[2024-05-29 20:17:31] [INFO ] Deduced a trap composed of 11 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:17:31] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 0 ms to minimize.
[2024-05-29 20:17:31] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 0 ms to minimize.
[2024-05-29 20:17:32] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 1 ms to minimize.
[2024-05-29 20:17:32] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 1 ms to minimize.
[2024-05-29 20:17:32] [INFO ] Deduced a trap composed of 12 places in 190 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:17:33] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:17:33] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-29 20:17:33] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2024-05-29 20:17:33] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2024-05-29 20:17:33] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 1 ms to minimize.
[2024-05-29 20:17:33] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2024-05-29 20:17:34] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2024-05-29 20:17:34] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2024-05-29 20:17:34] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-29 20:17:34] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:17:34] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:17:34] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:17:35] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 0 ms to minimize.
[2024-05-29 20:17:35] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 0 ms to minimize.
[2024-05-29 20:17:35] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 1 ms to minimize.
[2024-05-29 20:17:35] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 1 ms to minimize.
[2024-05-29 20:17:36] [INFO ] Deduced a trap composed of 13 places in 165 ms of which 1 ms to minimize.
[2024-05-29 20:17:36] [INFO ] Deduced a trap composed of 12 places in 153 ms of which 1 ms to minimize.
[2024-05-29 20:17:36] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:17:36] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:17:39] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 0 ms to minimize.
[2024-05-29 20:17:39] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:17:39] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 0 ms to minimize.
[2024-05-29 20:17:39] [INFO ] Deduced a trap composed of 11 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:17:39] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:17:40] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2024-05-29 20:17:40] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:17:40] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:17:40] [INFO ] Deduced a trap composed of 11 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:17:40] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:17:40] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:17:40] [INFO ] Deduced a trap composed of 13 places in 183 ms of which 1 ms to minimize.
SMT process timed out in 46502ms, After SMT, problems are : Problem set: 0 solved, 1135 unsolved
Search for dead transitions found 0 dead transitions in 46516ms
Starting structural reductions in LTL mode, iteration 1 : 82/123 places, 1136/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47472 ms. Remains : 82/123 places, 1136/1190 transitions.
[2024-05-29 20:17:40] [INFO ] Flatten gal took : 67 ms
[2024-05-29 20:17:41] [INFO ] Flatten gal took : 59 ms
[2024-05-29 20:17:41] [INFO ] Input system was already deterministic with 1136 transitions.
[2024-05-29 20:17:41] [INFO ] Flatten gal took : 59 ms
[2024-05-29 20:17:41] [INFO ] Flatten gal took : 59 ms
[2024-05-29 20:17:41] [INFO ] Time to serialize gal into /tmp/CTLCardinality16867599013284175720.gal : 11 ms
[2024-05-29 20:17:41] [INFO ] Time to serialize properties into /tmp/CTLCardinality9495411785850843174.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/CTLCardinality16867599013284175720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9495411785850843174.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21859e+06,10.8317,231968,2,9189,5,249236,6,0,1453,133408,0
Converting to forward existential form...Done !
original formula: (EG(AF(((EG((p56==1)) + ((p34==0)&&(p72==1))) + ((p113==1)||(p88==0))))) * AG((EX((p116==1)) + (p117==0))))
=> equivalent forward existential formula: ([(Init * !(EG(!(EG(!(((EG((p56==1)) + ((p34==0)&&(p72==1))) + ((p113==1)||(p88==0)))))))))] = FALSE * [((FwdU(I...210
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t19, t20, t21, t22, t23, t24, t26, t28, t29,...471
(forward)formula 0,0,29.2961,494280,1,0,1272,624350,2278,112,47595,359249,2268
FORMULA StigmergyElection-PT-09a-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 102 transition count 1160
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 102 transition count 1160
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 58 place count 86 transition count 1136
Iterating global reduction 0 with 16 rules applied. Total rules applied 74 place count 86 transition count 1136
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 81 place count 79 transition count 1129
Iterating global reduction 0 with 7 rules applied. Total rules applied 88 place count 79 transition count 1129
Applied a total of 88 rules in 12 ms. Remains 79 /123 variables (removed 44) and now considering 1129/1190 (removed 61) transitions.
[2024-05-29 20:18:10] [INFO ] Flow matrix only has 1118 transitions (discarded 11 similar events)
// Phase 1: matrix 1118 rows 79 cols
[2024-05-29 20:18:10] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 20:18:11] [INFO ] Implicit Places using invariants in 441 ms returned []
[2024-05-29 20:18:11] [INFO ] Flow matrix only has 1118 transitions (discarded 11 similar events)
[2024-05-29 20:18:11] [INFO ] Invariant cache hit.
[2024-05-29 20:18:11] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:18:12] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 1107 ms to find 0 implicit places.
Running 1128 sub problems to find dead transitions.
[2024-05-29 20:18:12] [INFO ] Flow matrix only has 1118 transitions (discarded 11 similar events)
[2024-05-29 20:18:12] [INFO ] Invariant cache hit.
[2024-05-29 20:18:12] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:18:34] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 1 ms to minimize.
[2024-05-29 20:18:34] [INFO ] Deduced a trap composed of 9 places in 301 ms of which 1 ms to minimize.
[2024-05-29 20:18:34] [INFO ] Deduced a trap composed of 9 places in 294 ms of which 0 ms to minimize.
[2024-05-29 20:18:35] [INFO ] Deduced a trap composed of 9 places in 304 ms of which 1 ms to minimize.
[2024-05-29 20:18:35] [INFO ] Deduced a trap composed of 9 places in 309 ms of which 1 ms to minimize.
[2024-05-29 20:18:35] [INFO ] Deduced a trap composed of 9 places in 300 ms of which 1 ms to minimize.
[2024-05-29 20:18:35] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:18:36] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 0 ms to minimize.
[2024-05-29 20:18:36] [INFO ] Deduced a trap composed of 10 places in 228 ms of which 1 ms to minimize.
[2024-05-29 20:18:36] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
[2024-05-29 20:18:36] [INFO ] Deduced a trap composed of 9 places in 188 ms of which 1 ms to minimize.
[2024-05-29 20:18:36] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 0 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2024-05-29 20:18:37] [INFO ] Deduced a trap composed of 9 places in 192 ms of which 1 ms to minimize.
[2024-05-29 20:18:38] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:18:38] [INFO ] Deduced a trap composed of 9 places in 198 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:18:38] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:18:38] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:18:38] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2024-05-29 20:18:39] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2024-05-29 20:18:39] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:18:39] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:18:39] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:18:39] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:18:39] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:18:39] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:18:39] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 1 ms to minimize.
[2024-05-29 20:18:39] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:18:39] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:18:40] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 1 ms to minimize.
[2024-05-29 20:18:40] [INFO ] Deduced a trap composed of 12 places in 216 ms of which 1 ms to minimize.
[2024-05-29 20:18:40] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 1 ms to minimize.
[2024-05-29 20:18:40] [INFO ] Deduced a trap composed of 12 places in 209 ms of which 1 ms to minimize.
[2024-05-29 20:18:41] [INFO ] Deduced a trap composed of 12 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:18:41] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2024-05-29 20:18:41] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:18:43] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:18:43] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:18:47] [INFO ] Deduced a trap composed of 11 places in 221 ms of which 1 ms to minimize.
[2024-05-29 20:18:47] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 1 ms to minimize.
[2024-05-29 20:18:47] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:18:47] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:18:47] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:18:48] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:18:48] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:18:48] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
[2024-05-29 20:18:48] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:18:48] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:18:48] [INFO ] Deduced a trap composed of 10 places in 152 ms of which 1 ms to minimize.
[2024-05-29 20:18:48] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:18:48] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:18:48] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:18:49] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2024-05-29 20:18:49] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2024-05-29 20:18:49] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 19/61 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:18:49] [INFO ] Deduced a trap composed of 13 places in 247 ms of which 1 ms to minimize.
[2024-05-29 20:18:50] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:18:50] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2024-05-29 20:18:50] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2024-05-29 20:18:50] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 0 ms to minimize.
[2024-05-29 20:18:50] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 1 ms to minimize.
[2024-05-29 20:18:50] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-05-29 20:18:50] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2024-05-29 20:18:51] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2024-05-29 20:18:51] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:18:51] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:18:51] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2024-05-29 20:18:51] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2024-05-29 20:18:51] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 0 ms to minimize.
[2024-05-29 20:18:51] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:18:51] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:18:52] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:18:52] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:18:52] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:18:55] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:18:56] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 1 ms to minimize.
[2024-05-29 20:18:56] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:18:56] [INFO ] Deduced a trap composed of 9 places in 121 ms of which 1 ms to minimize.
[2024-05-29 20:18:56] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:18:56] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:18:56] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:18:56] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2024-05-29 20:18:56] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:18:57] [INFO ] Deduced a trap composed of 12 places in 199 ms of which 1 ms to minimize.
[2024-05-29 20:18:57] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:18:57] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 0 ms to minimize.
[2024-05-29 20:18:57] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:18:57] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 0 ms to minimize.
[2024-05-29 20:18:57] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:18:57] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 79/1197 variables, and 96 constraints, problems are : Problem set: 0 solved, 1128 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/79 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1128/96 constraints, Known Traps: 94/94 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 1 (OVERLAPS) 1/79 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 94/96 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:19:02] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2024-05-29 20:19:03] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:19:03] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:19:03] [INFO ] Deduced a trap composed of 10 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:19:03] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 20:19:03] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:19:03] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:19:04] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-29 20:19:04] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 9/105 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:19:10] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:19:10] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:19:10] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:19:10] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:19:10] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 5/110 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
[2024-05-29 20:19:17] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:19:17] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 2/112 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
At refinement iteration 7 (OVERLAPS) 1117/1196 variables, 79/191 constraints. Problems are: Problem set: 0 solved, 1128 unsolved
SMT process timed out in 77542ms, After SMT, problems are : Problem set: 0 solved, 1128 unsolved
Search for dead transitions found 0 dead transitions in 77558ms
Starting structural reductions in LTL mode, iteration 1 : 79/123 places, 1129/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78681 ms. Remains : 79/123 places, 1129/1190 transitions.
[2024-05-29 20:19:29] [INFO ] Flatten gal took : 52 ms
[2024-05-29 20:19:29] [INFO ] Flatten gal took : 56 ms
[2024-05-29 20:19:29] [INFO ] Input system was already deterministic with 1129 transitions.
[2024-05-29 20:19:29] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:19:29] [INFO ] Flatten gal took : 69 ms
[2024-05-29 20:19:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality11867893317422503869.gal : 12 ms
[2024-05-29 20:19:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality16752702643577607098.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/CTLCardinality11867893317422503869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16752702643577607098.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.03836e+06,12.2661,265984,2,9651,5,207589,6,0,1432,126352,0
Converting to forward existential form...Done !
original formula: AF(EG((AG(AF((p120==1))) + (EX(((p52==0)&&(p17==1))) * EF((p37==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(E(TRUE U !(!(EG(!((p120==1))))))) + (EX(((p52==0)&&(p17==1))) * E(TRUE U (p37==0)))))))] = FA...158
Reverse transition relation is NOT exact ! Due to transitions t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33, t34...442
Detected timeout of ITS tools.
[2024-05-29 20:20:00] [INFO ] Flatten gal took : 58 ms
[2024-05-29 20:20:00] [INFO ] Applying decomposition
[2024-05-29 20:20:00] [INFO ] Flatten gal took : 57 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/graph3677630180586557400.txt' '-o' '/tmp/graph3677630180586557400.bin' '-w' '/tmp/graph3677630180586557400.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3677630180586557400.bin' '-l' '-1' '-v' '-w' '/tmp/graph3677630180586557400.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:20:00] [INFO ] Decomposing Gal with order
[2024-05-29 20:20:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:20:00] [INFO ] Removed a total of 9253 redundant transitions.
[2024-05-29 20:20:00] [INFO ] Flatten gal took : 131 ms
[2024-05-29 20:20:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 52 ms.
[2024-05-29 20:20:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality12755344468842137834.gal : 10 ms
[2024-05-29 20:20:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13438127661484805090.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/CTLCardinality12755344468842137834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13438127661484805090.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.03836e+06,0.703294,29328,1939,35,20120,276,2382,196778,63,680,0
Converting to forward existential form...Done !
original formula: AF(EG((AG(AF((i7.u25.p120==1))) + (EX(((i2.u9.p52==0)&&(i0.u3.p17==1))) * EF((i2.u6.p37==0))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((!(E(TRUE U !(!(EG(!((i7.u25.p120==1))))))) + (EX(((i2.u9.p52==0)&&(i0.u3.p17==1))) * E(TRUE U (...183
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t14, t18, t24, t38, t51, t60, t1111, t1113, t1115, t1117, t1119, t1121, t1125, t1127,...535
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,10.8675,319464,1,0,342142,577,22871,2.37269e+06,290,2567,1485339
FORMULA StigmergyElection-PT-09a-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 104 transition count 1164
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 104 transition count 1164
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 51 place count 91 transition count 1144
Iterating global reduction 0 with 13 rules applied. Total rules applied 64 place count 91 transition count 1144
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 69 place count 86 transition count 1139
Iterating global reduction 0 with 5 rules applied. Total rules applied 74 place count 86 transition count 1139
Applied a total of 74 rules in 22 ms. Remains 86 /123 variables (removed 37) and now considering 1139/1190 (removed 51) transitions.
[2024-05-29 20:20:11] [INFO ] Flow matrix only has 1128 transitions (discarded 11 similar events)
// Phase 1: matrix 1128 rows 86 cols
[2024-05-29 20:20:11] [INFO ] Computed 1 invariants in 6 ms
[2024-05-29 20:20:11] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-29 20:20:11] [INFO ] Flow matrix only has 1128 transitions (discarded 11 similar events)
[2024-05-29 20:20:11] [INFO ] Invariant cache hit.
[2024-05-29 20:20:12] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:20:12] [INFO ] Implicit Places using invariants and state equation in 700 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
Running 1138 sub problems to find dead transitions.
[2024-05-29 20:20:12] [INFO ] Flow matrix only has 1128 transitions (discarded 11 similar events)
[2024-05-29 20:20:12] [INFO ] Invariant cache hit.
[2024-05-29 20:20:12] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:20:34] [INFO ] Deduced a trap composed of 9 places in 302 ms of which 0 ms to minimize.
[2024-05-29 20:20:34] [INFO ] Deduced a trap composed of 9 places in 282 ms of which 1 ms to minimize.
[2024-05-29 20:20:35] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 0 ms to minimize.
[2024-05-29 20:20:35] [INFO ] Deduced a trap composed of 13 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:20:35] [INFO ] Deduced a trap composed of 9 places in 229 ms of which 1 ms to minimize.
[2024-05-29 20:20:35] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:20:36] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 1 ms to minimize.
[2024-05-29 20:20:36] [INFO ] Deduced a trap composed of 9 places in 234 ms of which 0 ms to minimize.
[2024-05-29 20:20:36] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:20:36] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2024-05-29 20:20:36] [INFO ] Deduced a trap composed of 10 places in 209 ms of which 0 ms to minimize.
[2024-05-29 20:20:37] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:20:37] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2024-05-29 20:20:37] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 0 ms to minimize.
[2024-05-29 20:20:37] [INFO ] Deduced a trap composed of 14 places in 173 ms of which 1 ms to minimize.
[2024-05-29 20:20:37] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:20:38] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 1 ms to minimize.
[2024-05-29 20:20:38] [INFO ] Deduced a trap composed of 9 places in 247 ms of which 0 ms to minimize.
[2024-05-29 20:20:38] [INFO ] Deduced a trap composed of 10 places in 295 ms of which 1 ms to minimize.
[2024-05-29 20:20:38] [INFO ] Deduced a trap composed of 10 places in 235 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:20:39] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 0 ms to minimize.
[2024-05-29 20:20:39] [INFO ] Deduced a trap composed of 9 places in 190 ms of which 1 ms to minimize.
[2024-05-29 20:20:39] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:20:39] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 1 ms to minimize.
[2024-05-29 20:20:40] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:20:40] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2024-05-29 20:20:40] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 1 ms to minimize.
[2024-05-29 20:20:40] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2024-05-29 20:20:40] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 1 ms to minimize.
[2024-05-29 20:20:40] [INFO ] Deduced a trap composed of 9 places in 167 ms of which 0 ms to minimize.
[2024-05-29 20:20:41] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2024-05-29 20:20:41] [INFO ] Deduced a trap composed of 12 places in 253 ms of which 0 ms to minimize.
[2024-05-29 20:20:41] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2024-05-29 20:20:41] [INFO ] Deduced a trap composed of 12 places in 264 ms of which 1 ms to minimize.
[2024-05-29 20:20:42] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 0 ms to minimize.
[2024-05-29 20:20:42] [INFO ] Deduced a trap composed of 9 places in 220 ms of which 0 ms to minimize.
[2024-05-29 20:20:42] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 0 ms to minimize.
[2024-05-29 20:20:42] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 1 ms to minimize.
[2024-05-29 20:20:42] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 1 ms to minimize.
[2024-05-29 20:20:43] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:20:45] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:20:45] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:20:46] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 0 ms to minimize.
[2024-05-29 20:20:46] [INFO ] Deduced a trap composed of 10 places in 154 ms of which 0 ms to minimize.
[2024-05-29 20:20:46] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 0 ms to minimize.
[2024-05-29 20:20:46] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2024-05-29 20:20:46] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:20:46] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 0 ms to minimize.
[2024-05-29 20:20:46] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 1 ms to minimize.
[2024-05-29 20:20:47] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:20:47] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 1 ms to minimize.
[2024-05-29 20:20:47] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:20:47] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:20:47] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:20:47] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-29 20:20:47] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 0 ms to minimize.
[2024-05-29 20:20:47] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-05-29 20:20:48] [INFO ] Deduced a trap composed of 13 places in 206 ms of which 1 ms to minimize.
[2024-05-29 20:20:48] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:20:48] [INFO ] Deduced a trap composed of 13 places in 243 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:20:49] [INFO ] Deduced a trap composed of 12 places in 271 ms of which 0 ms to minimize.
[2024-05-29 20:20:49] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:20:49] [INFO ] Deduced a trap composed of 11 places in 211 ms of which 1 ms to minimize.
[2024-05-29 20:20:49] [INFO ] Deduced a trap composed of 12 places in 246 ms of which 1 ms to minimize.
[2024-05-29 20:20:50] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 1 ms to minimize.
[2024-05-29 20:20:50] [INFO ] Deduced a trap composed of 12 places in 180 ms of which 1 ms to minimize.
[2024-05-29 20:20:50] [INFO ] Deduced a trap composed of 12 places in 214 ms of which 1 ms to minimize.
[2024-05-29 20:20:50] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 0 ms to minimize.
[2024-05-29 20:20:50] [INFO ] Deduced a trap composed of 13 places in 181 ms of which 1 ms to minimize.
[2024-05-29 20:20:51] [INFO ] Deduced a trap composed of 13 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:20:51] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2024-05-29 20:20:51] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:20:51] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2024-05-29 20:20:51] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 0 ms to minimize.
[2024-05-29 20:20:52] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-05-29 20:20:52] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 1 ms to minimize.
[2024-05-29 20:20:52] [INFO ] Deduced a trap composed of 10 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:20:52] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 0 ms to minimize.
[2024-05-29 20:20:52] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2024-05-29 20:20:52] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:20:53] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 1 ms to minimize.
[2024-05-29 20:20:53] [INFO ] Deduced a trap composed of 10 places in 149 ms of which 1 ms to minimize.
[2024-05-29 20:20:54] [INFO ] Deduced a trap composed of 10 places in 138 ms of which 1 ms to minimize.
[2024-05-29 20:20:54] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:20:54] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
[2024-05-29 20:20:54] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2024-05-29 20:20:54] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 0 ms to minimize.
[2024-05-29 20:20:55] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:20:55] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 1 ms to minimize.
[2024-05-29 20:20:55] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 1 ms to minimize.
[2024-05-29 20:20:55] [INFO ] Deduced a trap composed of 14 places in 178 ms of which 1 ms to minimize.
[2024-05-29 20:20:55] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 0 ms to minimize.
[2024-05-29 20:20:56] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 1 ms to minimize.
[2024-05-29 20:20:56] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:20:59] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 86/1214 variables, and 100 constraints, problems are : Problem set: 0 solved, 1138 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/86 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1138/106 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
At refinement iteration 1 (OVERLAPS) 1/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:21:03] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:21:03] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:21:03] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:21:03] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:21:03] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:21:04] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 0 ms to minimize.
[2024-05-29 20:21:04] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:21:04] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:21:04] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:21:04] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:21:04] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:21:04] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:21:04] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:21:04] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:21:05] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:21:05] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2024-05-29 20:21:05] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2024-05-29 20:21:05] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 1 ms to minimize.
[2024-05-29 20:21:05] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:21:05] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/86 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:21:07] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:21:07] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:21:07] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 0 ms to minimize.
[2024-05-29 20:21:07] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2024-05-29 20:21:07] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 0 ms to minimize.
[2024-05-29 20:21:07] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:21:07] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:21:08] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:21:08] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:21:08] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 0 ms to minimize.
[2024-05-29 20:21:08] [INFO ] Deduced a trap composed of 12 places in 218 ms of which 0 ms to minimize.
[2024-05-29 20:21:08] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:21:09] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:21:09] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 0 ms to minimize.
[2024-05-29 20:21:09] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 15/135 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:21:15] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:21:15] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:21:15] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:21:16] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 0 ms to minimize.
[2024-05-29 20:21:21] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 5/140 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
[2024-05-29 20:21:23] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 1/141 constraints. Problems are: Problem set: 0 solved, 1138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 86/1214 variables, and 141 constraints, problems are : Problem set: 0 solved, 1138 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/86 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/106 constraints, Known Traps: 140/140 constraints]
After SMT, in 77252ms problems are : Problem set: 0 solved, 1138 unsolved
Search for dead transitions found 0 dead transitions in 77269ms
Starting structural reductions in LTL mode, iteration 1 : 86/123 places, 1139/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78298 ms. Remains : 86/123 places, 1139/1190 transitions.
[2024-05-29 20:21:29] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:21:30] [INFO ] Flatten gal took : 59 ms
[2024-05-29 20:21:30] [INFO ] Input system was already deterministic with 1139 transitions.
[2024-05-29 20:21:30] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:21:30] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:21:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality7832207373866934825.gal : 10 ms
[2024-05-29 20:21:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality11129306390248455315.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/CTLCardinality7832207373866934825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11129306390248455315.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21654e+06,11.0241,246436,2,9873,5,254385,6,0,1472,137849,0
Converting to forward existential form...Done !
original formula: AF((((p80==0) * EX(((((p116==1)||(p126==0))||(p11==1))&&(p119==1)))) * (EG((p91==1)) * ((EX((p66==1)) + EF(((p47==0)&&(p70==1)))) + ((AF(...256
=> equivalent forward existential formula: [FwdG(Init,!((((p80==0) * EX(((((p116==1)||(p126==0))||(p11==1))&&(p119==1)))) * (EG((p91==1)) * ((EX((p66==1)) ...331
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t8, t9, t11, t13, t14, t15, t16, t17, t18, t19, t20, t21, t23, t25, t26, ...470
Detected timeout of ITS tools.
[2024-05-29 20:22:00] [INFO ] Flatten gal took : 60 ms
[2024-05-29 20:22:00] [INFO ] Applying decomposition
[2024-05-29 20:22:00] [INFO ] Flatten gal took : 60 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/graph310627351948502277.txt' '-o' '/tmp/graph310627351948502277.bin' '-w' '/tmp/graph310627351948502277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph310627351948502277.bin' '-l' '-1' '-v' '-w' '/tmp/graph310627351948502277.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:22:00] [INFO ] Decomposing Gal with order
[2024-05-29 20:22:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:22:00] [INFO ] Removed a total of 9260 redundant transitions.
[2024-05-29 20:22:00] [INFO ] Flatten gal took : 142 ms
[2024-05-29 20:22:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 40 ms.
[2024-05-29 20:22:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality5433938258066752106.gal : 7 ms
[2024-05-29 20:22:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality5315665205824986898.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/CTLCardinality5433938258066752106.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5315665205824986898.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21654e+06,7.67994,213600,4924,33,87931,265,2386,2.44548e+06,60,624,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 122 transition count 1155
Reduce places removed 34 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 69 place count 88 transition count 1154
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 70 place count 87 transition count 1154
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 70 place count 87 transition count 1136
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 106 place count 69 transition count 1136
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 120 place count 55 transition count 1113
Iterating global reduction 3 with 14 rules applied. Total rules applied 134 place count 55 transition count 1113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 55 transition count 1112
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 143 place count 47 transition count 1096
Iterating global reduction 4 with 8 rules applied. Total rules applied 151 place count 47 transition count 1096
Ensure Unique test removed 510 transitions
Reduce isomorphic transitions removed 510 transitions.
Iterating post reduction 4 with 510 rules applied. Total rules applied 661 place count 47 transition count 586
Drop transitions (Redundant composition of simpler transitions.) removed 513 transitions
Redundant transition composition rules discarded 513 transitions
Iterating global reduction 5 with 513 rules applied. Total rules applied 1174 place count 47 transition count 73
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 1192 place count 38 transition count 64
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 1193 place count 38 transition count 64
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 5 with 9 rules applied. Total rules applied 1202 place count 29 transition count 55
Applied a total of 1202 rules in 131 ms. Remains 29 /123 variables (removed 94) and now considering 55/1190 (removed 1135) transitions.
[2024-05-29 20:22:31] [INFO ] Flow matrix only has 46 transitions (discarded 9 similar events)
// Phase 1: matrix 46 rows 29 cols
[2024-05-29 20:22:31] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 20:22:31] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-29 20:22:31] [INFO ] Flow matrix only has 46 transitions (discarded 9 similar events)
[2024-05-29 20:22:31] [INFO ] Invariant cache hit.
[2024-05-29 20:22:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 20:22:31] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-29 20:22:31] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2024-05-29 20:22:31] [INFO ] Flow matrix only has 46 transitions (discarded 9 similar events)
[2024-05-29 20:22:31] [INFO ] Invariant cache hit.
[2024-05-29 20:22:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 9/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 4 places in 14 ms of which 1 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:22:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 19/40 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:22:32] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 45/74 variables, 29/80 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/74 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:22:33] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/74 variables, 9/109 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/74 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 1/75 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/75 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 0/75 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 75/75 variables, and 110 constraints, problems are : Problem set: 0 solved, 37 unsolved in 2987 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 9/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 79/80 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 45/74 variables, 29/109 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 37/146 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 1/75 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/75 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 75/75 variables, and 147 constraints, problems are : Problem set: 0 solved, 37 unsolved in 851 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 79/79 constraints]
After SMT, in 3848ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 3848ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/123 places, 55/1190 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4210 ms. Remains : 29/123 places, 55/1190 transitions.
[2024-05-29 20:22:35] [INFO ] Flatten gal took : 4 ms
[2024-05-29 20:22:35] [INFO ] Flatten gal took : 3 ms
[2024-05-29 20:22:35] [INFO ] Input system was already deterministic with 55 transitions.
[2024-05-29 20:22:35] [INFO ] Flatten gal took : 4 ms
[2024-05-29 20:22:35] [INFO ] Flatten gal took : 4 ms
RANDOM walk for 402 steps (23 resets) in 22 ms. (17 steps per ms) remains 0/1 properties
[2024-05-29 20:22:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5145978029753266176.gal : 0 ms
FORMULA StigmergyElection-PT-09a-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 20:22:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5791499235606811817.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5145978029753266176.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5791499235606811817.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 : 123/123 places, 1190/1190 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 103 transition count 1161
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 103 transition count 1161
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 53 place count 90 transition count 1141
Iterating global reduction 0 with 13 rules applied. Total rules applied 66 place count 90 transition count 1141
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 85 transition count 1136
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 85 transition count 1136
Applied a total of 76 rules in 13 ms. Remains 85 /123 variables (removed 38) and now considering 1136/1190 (removed 54) transitions.
[2024-05-29 20:22:35] [INFO ] Flow matrix only has 1125 transitions (discarded 11 similar events)
// Phase 1: matrix 1125 rows 85 cols
[2024-05-29 20:22:35] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 20:22:35] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-29 20:22:35] [INFO ] Flow matrix only has 1125 transitions (discarded 11 similar events)
[2024-05-29 20:22:35] [INFO ] Invariant cache hit.
[2024-05-29 20:22:35] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:22:36] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
Running 1135 sub problems to find dead transitions.
[2024-05-29 20:22:36] [INFO ] Flow matrix only has 1125 transitions (discarded 11 similar events)
[2024-05-29 20:22:36] [INFO ] Invariant cache hit.
[2024-05-29 20:22:36] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:22:57] [INFO ] Deduced a trap composed of 9 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:22:57] [INFO ] Deduced a trap composed of 9 places in 317 ms of which 3 ms to minimize.
[2024-05-29 20:22:58] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 1 ms to minimize.
[2024-05-29 20:22:58] [INFO ] Deduced a trap composed of 9 places in 263 ms of which 1 ms to minimize.
[2024-05-29 20:22:58] [INFO ] Deduced a trap composed of 9 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:22:58] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:22:59] [INFO ] Deduced a trap composed of 10 places in 231 ms of which 0 ms to minimize.
[2024-05-29 20:22:59] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:22:59] [INFO ] Deduced a trap composed of 9 places in 251 ms of which 0 ms to minimize.
[2024-05-29 20:22:59] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:23:00] [INFO ] Deduced a trap composed of 9 places in 268 ms of which 1 ms to minimize.
[2024-05-29 20:23:00] [INFO ] Deduced a trap composed of 10 places in 215 ms of which 1 ms to minimize.
[2024-05-29 20:23:00] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 0 ms to minimize.
[2024-05-29 20:23:00] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 1 ms to minimize.
[2024-05-29 20:23:01] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2024-05-29 20:23:01] [INFO ] Deduced a trap composed of 11 places in 190 ms of which 0 ms to minimize.
[2024-05-29 20:23:01] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 1 ms to minimize.
[2024-05-29 20:23:01] [INFO ] Deduced a trap composed of 9 places in 195 ms of which 1 ms to minimize.
[2024-05-29 20:23:01] [INFO ] Deduced a trap composed of 12 places in 183 ms of which 1 ms to minimize.
[2024-05-29 20:23:02] [INFO ] Deduced a trap composed of 9 places in 183 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:23:02] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
[2024-05-29 20:23:02] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 1 ms to minimize.
[2024-05-29 20:23:03] [INFO ] Deduced a trap composed of 9 places in 185 ms of which 0 ms to minimize.
[2024-05-29 20:23:03] [INFO ] Deduced a trap composed of 9 places in 154 ms of which 1 ms to minimize.
[2024-05-29 20:23:03] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 0 ms to minimize.
[2024-05-29 20:23:03] [INFO ] Deduced a trap composed of 10 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:23:03] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 1 ms to minimize.
[2024-05-29 20:23:04] [INFO ] Deduced a trap composed of 13 places in 283 ms of which 1 ms to minimize.
[2024-05-29 20:23:04] [INFO ] Deduced a trap composed of 9 places in 264 ms of which 1 ms to minimize.
[2024-05-29 20:23:04] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2024-05-29 20:23:04] [INFO ] Deduced a trap composed of 13 places in 124 ms of which 1 ms to minimize.
[2024-05-29 20:23:04] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 1 ms to minimize.
[2024-05-29 20:23:05] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2024-05-29 20:23:05] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:23:05] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:23:05] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:23:05] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:23:05] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2024-05-29 20:23:05] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2024-05-29 20:23:05] [INFO ] Deduced a trap composed of 9 places in 98 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:23:08] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2024-05-29 20:23:08] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2024-05-29 20:23:08] [INFO ] Deduced a trap composed of 12 places in 125 ms of which 1 ms to minimize.
[2024-05-29 20:23:08] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2024-05-29 20:23:08] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2024-05-29 20:23:09] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 1 ms to minimize.
[2024-05-29 20:23:09] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:23:09] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:23:09] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-05-29 20:23:09] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 1 ms to minimize.
[2024-05-29 20:23:09] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:23:09] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:23:09] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 20:23:09] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:23:10] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 1 ms to minimize.
[2024-05-29 20:23:10] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:23:10] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:23:10] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 0 ms to minimize.
[2024-05-29 20:23:10] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:23:10] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:23:11] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 0 ms to minimize.
[2024-05-29 20:23:11] [INFO ] Deduced a trap composed of 13 places in 257 ms of which 1 ms to minimize.
[2024-05-29 20:23:11] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 0 ms to minimize.
[2024-05-29 20:23:11] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 0 ms to minimize.
[2024-05-29 20:23:12] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2024-05-29 20:23:12] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2024-05-29 20:23:12] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2024-05-29 20:23:12] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-29 20:23:12] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 1 ms to minimize.
[2024-05-29 20:23:12] [INFO ] Deduced a trap composed of 13 places in 244 ms of which 0 ms to minimize.
[2024-05-29 20:23:13] [INFO ] Deduced a trap composed of 13 places in 303 ms of which 1 ms to minimize.
[2024-05-29 20:23:13] [INFO ] Deduced a trap composed of 13 places in 291 ms of which 0 ms to minimize.
[2024-05-29 20:23:13] [INFO ] Deduced a trap composed of 12 places in 327 ms of which 1 ms to minimize.
[2024-05-29 20:23:14] [INFO ] Deduced a trap composed of 13 places in 176 ms of which 1 ms to minimize.
[2024-05-29 20:23:14] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 0 ms to minimize.
[2024-05-29 20:23:14] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 1 ms to minimize.
[2024-05-29 20:23:14] [INFO ] Deduced a trap composed of 10 places in 160 ms of which 0 ms to minimize.
[2024-05-29 20:23:14] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:23:15] [INFO ] Deduced a trap composed of 10 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:23:15] [INFO ] Deduced a trap composed of 9 places in 267 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:23:15] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:23:15] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:23:16] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 1 ms to minimize.
[2024-05-29 20:23:16] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2024-05-29 20:23:16] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:23:16] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 0 ms to minimize.
[2024-05-29 20:23:16] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:23:16] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-29 20:23:17] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2024-05-29 20:23:17] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:23:17] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2024-05-29 20:23:17] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:23:17] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2024-05-29 20:23:17] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:23:17] [INFO ] Deduced a trap composed of 12 places in 188 ms of which 0 ms to minimize.
[2024-05-29 20:23:18] [INFO ] Deduced a trap composed of 12 places in 220 ms of which 1 ms to minimize.
[2024-05-29 20:23:18] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 0 ms to minimize.
[2024-05-29 20:23:18] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 1 ms to minimize.
[2024-05-29 20:23:18] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 1 ms to minimize.
[2024-05-29 20:23:19] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:23:22] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
[2024-05-29 20:23:22] [INFO ] Deduced a trap composed of 12 places in 244 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 85/1210 variables, and 104 constraints, problems are : Problem set: 0 solved, 1135 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/85 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1135/103 constraints, Known Traps: 102/102 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:23:25] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:23:26] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:23:26] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:23:26] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2024-05-29 20:23:26] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:23:26] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-29 20:23:26] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 0 ms to minimize.
[2024-05-29 20:23:26] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:23:26] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 0 ms to minimize.
[2024-05-29 20:23:26] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:23:26] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:23:27] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:23:27] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:23:27] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:23:27] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 1 ms to minimize.
[2024-05-29 20:23:27] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:23:28] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:23:28] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 1 ms to minimize.
[2024-05-29 20:23:28] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:23:28] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:23:32] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2024-05-29 20:23:32] [INFO ] Deduced a trap composed of 13 places in 192 ms of which 0 ms to minimize.
[2024-05-29 20:23:32] [INFO ] Deduced a trap composed of 12 places in 158 ms of which 1 ms to minimize.
[2024-05-29 20:23:33] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:23:33] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-29 20:23:33] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 0 ms to minimize.
[2024-05-29 20:23:33] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:23:39] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2024-05-29 20:23:39] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 9/133 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
[2024-05-29 20:23:41] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:23:42] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:23:42] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:23:42] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:23:42] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 1135 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 85/1210 variables, and 138 constraints, problems are : Problem set: 0 solved, 1135 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/85 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/103 constraints, Known Traps: 136/136 constraints]
After SMT, in 76697ms problems are : Problem set: 0 solved, 1135 unsolved
Search for dead transitions found 0 dead transitions in 76712ms
Starting structural reductions in LTL mode, iteration 1 : 85/123 places, 1136/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77637 ms. Remains : 85/123 places, 1136/1190 transitions.
[2024-05-29 20:23:52] [INFO ] Flatten gal took : 50 ms
[2024-05-29 20:23:53] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:23:53] [INFO ] Input system was already deterministic with 1136 transitions.
[2024-05-29 20:23:53] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:23:53] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:23:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality3985971805443989229.gal : 27 ms
[2024-05-29 20:23:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality6229501704562848112.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/CTLCardinality3985971805443989229.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6229501704562848112.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.16125e+06,8.47247,207292,2,7559,5,181341,6,0,1463,104864,0
Converting to forward existential form...Done !
original formula: EF((EF(AG(((p56==0)||(p92==1)))) * (AX(((p32==0)&&(p104==1))) + ((AX((p13==0)) * AX(((p123!=0)&&(p52!=1)))) * (!(E(((p80==0)||(p111==1)) ...184
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * E(TRUE U !(E(TRUE U !(((p56==0)||(p92==1))))))) * !(EX(!(((p32==0)&&(p104==1))))))] != FAL...495
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t5, t6, t7, t8, t9, t10, t11, t15, t16, t18, t20, t21, t23, t25, t26, t28, t30, t...459
(forward)formula 0,1,21.5257,405812,1,0,1271,554013,2284,115,46286,323488,2282
FORMULA StigmergyElection-PT-09a-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 103 transition count 1163
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 103 transition count 1163
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 54 place count 89 transition count 1144
Iterating global reduction 0 with 14 rules applied. Total rules applied 68 place count 89 transition count 1144
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 85 transition count 1140
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 85 transition count 1140
Applied a total of 76 rules in 21 ms. Remains 85 /123 variables (removed 38) and now considering 1140/1190 (removed 50) transitions.
[2024-05-29 20:24:14] [INFO ] Flow matrix only has 1127 transitions (discarded 13 similar events)
// Phase 1: matrix 1127 rows 85 cols
[2024-05-29 20:24:14] [INFO ] Computed 2 invariants in 3 ms
[2024-05-29 20:24:15] [INFO ] Implicit Places using invariants in 286 ms returned []
[2024-05-29 20:24:15] [INFO ] Flow matrix only has 1127 transitions (discarded 13 similar events)
[2024-05-29 20:24:15] [INFO ] Invariant cache hit.
[2024-05-29 20:24:15] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:24:15] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
Running 1139 sub problems to find dead transitions.
[2024-05-29 20:24:15] [INFO ] Flow matrix only has 1127 transitions (discarded 13 similar events)
[2024-05-29 20:24:15] [INFO ] Invariant cache hit.
[2024-05-29 20:24:15] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
[2024-05-29 20:24:38] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 0 ms to minimize.
[2024-05-29 20:24:38] [INFO ] Deduced a trap composed of 9 places in 297 ms of which 1 ms to minimize.
[2024-05-29 20:24:38] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 0 ms to minimize.
[2024-05-29 20:24:38] [INFO ] Deduced a trap composed of 12 places in 286 ms of which 0 ms to minimize.
[2024-05-29 20:24:39] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 1 ms to minimize.
[2024-05-29 20:24:39] [INFO ] Deduced a trap composed of 13 places in 276 ms of which 1 ms to minimize.
[2024-05-29 20:24:39] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 0 ms to minimize.
[2024-05-29 20:24:39] [INFO ] Deduced a trap composed of 10 places in 268 ms of which 0 ms to minimize.
[2024-05-29 20:24:40] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 1 ms to minimize.
[2024-05-29 20:24:40] [INFO ] Deduced a trap composed of 12 places in 198 ms of which 1 ms to minimize.
[2024-05-29 20:24:40] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 0 ms to minimize.
[2024-05-29 20:24:40] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
[2024-05-29 20:24:41] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 0 ms to minimize.
[2024-05-29 20:24:41] [INFO ] Deduced a trap composed of 13 places in 139 ms of which 1 ms to minimize.
[2024-05-29 20:24:41] [INFO ] Deduced a trap composed of 12 places in 272 ms of which 0 ms to minimize.
[2024-05-29 20:24:41] [INFO ] Deduced a trap composed of 13 places in 269 ms of which 1 ms to minimize.
[2024-05-29 20:24:42] [INFO ] Deduced a trap composed of 12 places in 298 ms of which 1 ms to minimize.
[2024-05-29 20:24:42] [INFO ] Deduced a trap composed of 13 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:24:42] [INFO ] Deduced a trap composed of 9 places in 206 ms of which 1 ms to minimize.
[2024-05-29 20:24:42] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
[2024-05-29 20:24:43] [INFO ] Deduced a trap composed of 9 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:24:43] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-29 20:24:43] [INFO ] Deduced a trap composed of 9 places in 240 ms of which 1 ms to minimize.
[2024-05-29 20:24:43] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:24:44] [INFO ] Deduced a trap composed of 10 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:24:44] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 1 ms to minimize.
[2024-05-29 20:24:44] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 0 ms to minimize.
[2024-05-29 20:24:44] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 0 ms to minimize.
[2024-05-29 20:24:44] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:24:44] [INFO ] Deduced a trap composed of 13 places in 221 ms of which 1 ms to minimize.
[2024-05-29 20:24:45] [INFO ] Deduced a trap composed of 12 places in 201 ms of which 1 ms to minimize.
[2024-05-29 20:24:45] [INFO ] Deduced a trap composed of 9 places in 165 ms of which 1 ms to minimize.
[2024-05-29 20:24:45] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2024-05-29 20:24:45] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:24:45] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:24:45] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:24:46] [INFO ] Deduced a trap composed of 12 places in 262 ms of which 0 ms to minimize.
[2024-05-29 20:24:46] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 1 ms to minimize.
[2024-05-29 20:24:46] [INFO ] Deduced a trap composed of 11 places in 207 ms of which 1 ms to minimize.
[2024-05-29 20:24:46] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
[2024-05-29 20:24:49] [INFO ] Deduced a trap composed of 12 places in 164 ms of which 1 ms to minimize.
[2024-05-29 20:24:49] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-29 20:24:49] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:24:49] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 2 ms to minimize.
[2024-05-29 20:24:49] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:24:50] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:24:50] [INFO ] Deduced a trap composed of 10 places in 222 ms of which 1 ms to minimize.
[2024-05-29 20:24:50] [INFO ] Deduced a trap composed of 9 places in 201 ms of which 1 ms to minimize.
[2024-05-29 20:24:50] [INFO ] Deduced a trap composed of 11 places in 167 ms of which 0 ms to minimize.
[2024-05-29 20:24:50] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 0 ms to minimize.
[2024-05-29 20:24:51] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 0 ms to minimize.
[2024-05-29 20:24:51] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 2 ms to minimize.
[2024-05-29 20:24:51] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 0 ms to minimize.
[2024-05-29 20:24:51] [INFO ] Deduced a trap composed of 10 places in 171 ms of which 1 ms to minimize.
[2024-05-29 20:24:51] [INFO ] Deduced a trap composed of 12 places in 227 ms of which 1 ms to minimize.
[2024-05-29 20:24:52] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 1 ms to minimize.
[2024-05-29 20:24:52] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 0 ms to minimize.
[2024-05-29 20:24:52] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2024-05-29 20:24:52] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:24:52] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
[2024-05-29 20:24:53] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-29 20:24:53] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2024-05-29 20:24:53] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 1 ms to minimize.
[2024-05-29 20:24:53] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2024-05-29 20:24:53] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:24:53] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:24:53] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 0 ms to minimize.
[2024-05-29 20:24:54] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2024-05-29 20:24:54] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-29 20:24:54] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 0 ms to minimize.
[2024-05-29 20:24:54] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2024-05-29 20:24:54] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
[2024-05-29 20:24:54] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:24:54] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:24:54] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 0 ms to minimize.
[2024-05-29 20:24:55] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
[2024-05-29 20:24:55] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2024-05-29 20:24:55] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 1 ms to minimize.
[2024-05-29 20:24:55] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2024-05-29 20:24:55] [INFO ] Deduced a trap composed of 11 places in 129 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
[2024-05-29 20:24:56] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:24:56] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:24:56] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:24:56] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:24:56] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:24:56] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:24:56] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:24:56] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2024-05-29 20:24:57] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:24:57] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:24:57] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-05-29 20:24:57] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 1 ms to minimize.
[2024-05-29 20:24:57] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:24:57] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 0 ms to minimize.
[2024-05-29 20:24:57] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 15/97 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 85/1212 variables, and 97 constraints, problems are : Problem set: 0 solved, 1139 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/85 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1139/107 constraints, Known Traps: 95/95 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1139 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
At refinement iteration 1 (OVERLAPS) 1/85 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 95/97 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
[2024-05-29 20:25:06] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 0 ms to minimize.
[2024-05-29 20:25:06] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:25:06] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-29 20:25:06] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:25:07] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:25:07] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:25:07] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 1 ms to minimize.
[2024-05-29 20:25:07] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:25:07] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:25:07] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:25:07] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:25:07] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:25:08] [INFO ] Deduced a trap composed of 13 places in 179 ms of which 0 ms to minimize.
[2024-05-29 20:25:08] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:25:08] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:25:08] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:25:08] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:25:08] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:25:08] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:25:09] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
[2024-05-29 20:25:10] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:25:10] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:25:10] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:25:10] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:25:11] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:25:11] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 1 ms to minimize.
[2024-05-29 20:25:11] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:25:11] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:25:11] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:25:12] [INFO ] Deduced a trap composed of 12 places in 142 ms of which 0 ms to minimize.
[2024-05-29 20:25:12] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:25:12] [INFO ] Deduced a trap composed of 12 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:25:12] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:25:12] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 0 ms to minimize.
[2024-05-29 20:25:12] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:25:17] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 0 ms to minimize.
[2024-05-29 20:25:17] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:25:17] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:25:17] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 0 ms to minimize.
[2024-05-29 20:25:18] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
[2024-05-29 20:25:20] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:25:21] [INFO ] Deduced a trap composed of 12 places in 238 ms of which 0 ms to minimize.
[2024-05-29 20:25:21] [INFO ] Deduced a trap composed of 12 places in 234 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 1139 unsolved
[2024-05-29 20:25:28] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 85/1212 variables, and 141 constraints, problems are : Problem set: 0 solved, 1139 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/85 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/107 constraints, Known Traps: 139/139 constraints]
After SMT, in 77435ms problems are : Problem set: 0 solved, 1139 unsolved
Search for dead transitions found 0 dead transitions in 77447ms
Starting structural reductions in LTL mode, iteration 1 : 85/123 places, 1140/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78395 ms. Remains : 85/123 places, 1140/1190 transitions.
[2024-05-29 20:25:33] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:25:33] [INFO ] Flatten gal took : 68 ms
[2024-05-29 20:25:33] [INFO ] Input system was already deterministic with 1140 transitions.
[2024-05-29 20:25:33] [INFO ] Flatten gal took : 74 ms
[2024-05-29 20:25:33] [INFO ] Flatten gal took : 56 ms
[2024-05-29 20:25:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality8383964139554899000.gal : 11 ms
[2024-05-29 20:25:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality7060917953074837884.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/CTLCardinality8383964139554899000.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7060917953074837884.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22883e+06,7.74714,185060,2,7319,5,188121,6,0,1465,99242,0
Converting to forward existential form...Done !
original formula: EF((AX(((!(E((p1==1) U ((p113==0)||(p95==1)))) * (p42!=0)) * (p17!=1))) + (AG(E((p114==0) U (p58==0))) * ((p82==1) + AX(E((p59==0) U (p64...165
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(((!(E((p1==1) U ((p113==0)||(p95==1)))) * (p42!=0)) * (p17!=1))))))] != FALSE + ([((...347
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t7, t9, t11, t12, t14, t16, t17, t19, t21, t22, t25, t26, t27, t28, t29, t31,...466
Detected timeout of ITS tools.
[2024-05-29 20:26:03] [INFO ] Flatten gal took : 59 ms
[2024-05-29 20:26:03] [INFO ] Applying decomposition
[2024-05-29 20:26:03] [INFO ] Flatten gal took : 59 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/graph8054136298422507221.txt' '-o' '/tmp/graph8054136298422507221.bin' '-w' '/tmp/graph8054136298422507221.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8054136298422507221.bin' '-l' '-1' '-v' '-w' '/tmp/graph8054136298422507221.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:26:04] [INFO ] Decomposing Gal with order
[2024-05-29 20:26:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:26:04] [INFO ] Removed a total of 9266 redundant transitions.
[2024-05-29 20:26:04] [INFO ] Flatten gal took : 185 ms
[2024-05-29 20:26:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 41 ms.
[2024-05-29 20:26:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality16318631456315842479.gal : 7 ms
[2024-05-29 20:26:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality13871270163483157014.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/CTLCardinality16318631456315842479.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13871270163483157014.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.22883e+06,12.2812,424548,9971,24,247350,243,1256,4.43887e+06,43,992,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 105 transition count 1165
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 105 transition count 1165
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 47 place count 94 transition count 1148
Iterating global reduction 0 with 11 rules applied. Total rules applied 58 place count 94 transition count 1148
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 64 place count 88 transition count 1142
Iterating global reduction 0 with 6 rules applied. Total rules applied 70 place count 88 transition count 1142
Applied a total of 70 rules in 18 ms. Remains 88 /123 variables (removed 35) and now considering 1142/1190 (removed 48) transitions.
[2024-05-29 20:26:34] [INFO ] Flow matrix only has 1131 transitions (discarded 11 similar events)
// Phase 1: matrix 1131 rows 88 cols
[2024-05-29 20:26:34] [INFO ] Computed 1 invariants in 3 ms
[2024-05-29 20:26:34] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-29 20:26:34] [INFO ] Flow matrix only has 1131 transitions (discarded 11 similar events)
[2024-05-29 20:26:34] [INFO ] Invariant cache hit.
[2024-05-29 20:26:35] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:26:35] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 927 ms to find 0 implicit places.
Running 1141 sub problems to find dead transitions.
[2024-05-29 20:26:35] [INFO ] Flow matrix only has 1131 transitions (discarded 11 similar events)
[2024-05-29 20:26:35] [INFO ] Invariant cache hit.
[2024-05-29 20:26:35] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-29 20:26:56] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 0 ms to minimize.
[2024-05-29 20:26:57] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 1 ms to minimize.
[2024-05-29 20:26:57] [INFO ] Deduced a trap composed of 12 places in 259 ms of which 1 ms to minimize.
[2024-05-29 20:26:57] [INFO ] Deduced a trap composed of 12 places in 268 ms of which 1 ms to minimize.
[2024-05-29 20:26:57] [INFO ] Deduced a trap composed of 9 places in 255 ms of which 1 ms to minimize.
[2024-05-29 20:26:58] [INFO ] Deduced a trap composed of 12 places in 235 ms of which 1 ms to minimize.
[2024-05-29 20:26:58] [INFO ] Deduced a trap composed of 13 places in 318 ms of which 1 ms to minimize.
[2024-05-29 20:26:58] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 0 ms to minimize.
[2024-05-29 20:26:59] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 0 ms to minimize.
[2024-05-29 20:26:59] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 1 ms to minimize.
[2024-05-29 20:26:59] [INFO ] Deduced a trap composed of 9 places in 224 ms of which 1 ms to minimize.
[2024-05-29 20:26:59] [INFO ] Deduced a trap composed of 9 places in 219 ms of which 1 ms to minimize.
[2024-05-29 20:26:59] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 0 ms to minimize.
[2024-05-29 20:27:00] [INFO ] Deduced a trap composed of 12 places in 192 ms of which 0 ms to minimize.
[2024-05-29 20:27:00] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 0 ms to minimize.
[2024-05-29 20:27:00] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 1 ms to minimize.
[2024-05-29 20:27:00] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2024-05-29 20:27:00] [INFO ] Deduced a trap composed of 9 places in 139 ms of which 1 ms to minimize.
[2024-05-29 20:27:00] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 1 ms to minimize.
[2024-05-29 20:27:01] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-29 20:27:01] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 0 ms to minimize.
[2024-05-29 20:27:01] [INFO ] Deduced a trap composed of 12 places in 149 ms of which 1 ms to minimize.
[2024-05-29 20:27:01] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2024-05-29 20:27:02] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 1 ms to minimize.
[2024-05-29 20:27:02] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 0 ms to minimize.
[2024-05-29 20:27:02] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:27:02] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 0 ms to minimize.
[2024-05-29 20:27:02] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-29 20:27:02] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:27:02] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 1 ms to minimize.
[2024-05-29 20:27:02] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:27:02] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:27:02] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 1 ms to minimize.
[2024-05-29 20:27:03] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:27:03] [INFO ] Deduced a trap composed of 9 places in 149 ms of which 0 ms to minimize.
[2024-05-29 20:27:03] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 1 ms to minimize.
[2024-05-29 20:27:03] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-05-29 20:27:03] [INFO ] Deduced a trap composed of 12 places in 250 ms of which 1 ms to minimize.
[2024-05-29 20:27:04] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 1 ms to minimize.
[2024-05-29 20:27:04] [INFO ] Deduced a trap composed of 13 places in 246 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-29 20:27:06] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 0 ms to minimize.
[2024-05-29 20:27:06] [INFO ] Deduced a trap composed of 12 places in 150 ms of which 1 ms to minimize.
[2024-05-29 20:27:07] [INFO ] Deduced a trap composed of 12 places in 151 ms of which 1 ms to minimize.
[2024-05-29 20:27:07] [INFO ] Deduced a trap composed of 13 places in 145 ms of which 0 ms to minimize.
[2024-05-29 20:27:07] [INFO ] Deduced a trap composed of 11 places in 148 ms of which 1 ms to minimize.
[2024-05-29 20:27:07] [INFO ] Deduced a trap composed of 11 places in 122 ms of which 0 ms to minimize.
[2024-05-29 20:27:07] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-29 20:27:07] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2024-05-29 20:27:07] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:27:08] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2024-05-29 20:27:08] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2024-05-29 20:27:08] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:27:08] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 1 ms to minimize.
[2024-05-29 20:27:08] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 0 ms to minimize.
[2024-05-29 20:27:08] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 0 ms to minimize.
[2024-05-29 20:27:09] [INFO ] Deduced a trap composed of 12 places in 211 ms of which 0 ms to minimize.
[2024-05-29 20:27:09] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:27:09] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 1 ms to minimize.
[2024-05-29 20:27:09] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 0 ms to minimize.
[2024-05-29 20:27:09] [INFO ] Deduced a trap composed of 13 places in 169 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-29 20:27:10] [INFO ] Deduced a trap composed of 9 places in 210 ms of which 0 ms to minimize.
[2024-05-29 20:27:10] [INFO ] Deduced a trap composed of 10 places in 168 ms of which 1 ms to minimize.
[2024-05-29 20:27:10] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 1 ms to minimize.
[2024-05-29 20:27:11] [INFO ] Deduced a trap composed of 9 places in 184 ms of which 1 ms to minimize.
[2024-05-29 20:27:11] [INFO ] Deduced a trap composed of 9 places in 180 ms of which 0 ms to minimize.
[2024-05-29 20:27:11] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:27:11] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 0 ms to minimize.
[2024-05-29 20:27:11] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 1 ms to minimize.
[2024-05-29 20:27:12] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 0 ms to minimize.
[2024-05-29 20:27:12] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 1 ms to minimize.
[2024-05-29 20:27:12] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2024-05-29 20:27:12] [INFO ] Deduced a trap composed of 13 places in 225 ms of which 0 ms to minimize.
[2024-05-29 20:27:12] [INFO ] Deduced a trap composed of 13 places in 254 ms of which 0 ms to minimize.
[2024-05-29 20:27:12] [INFO ] Deduced a trap composed of 12 places in 159 ms of which 0 ms to minimize.
[2024-05-29 20:27:13] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:27:13] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:27:13] [INFO ] Deduced a trap composed of 12 places in 193 ms of which 1 ms to minimize.
[2024-05-29 20:27:13] [INFO ] Deduced a trap composed of 12 places in 156 ms of which 0 ms to minimize.
[2024-05-29 20:27:14] [INFO ] Deduced a trap composed of 11 places in 155 ms of which 1 ms to minimize.
[2024-05-29 20:27:14] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-29 20:27:14] [INFO ] Deduced a trap composed of 13 places in 184 ms of which 0 ms to minimize.
[2024-05-29 20:27:14] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 0 ms to minimize.
[2024-05-29 20:27:15] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 1 ms to minimize.
[2024-05-29 20:27:15] [INFO ] Deduced a trap composed of 13 places in 208 ms of which 1 ms to minimize.
[2024-05-29 20:27:15] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 0 ms to minimize.
[2024-05-29 20:27:15] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:27:15] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 1 ms to minimize.
[2024-05-29 20:27:16] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:27:16] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 0 ms to minimize.
[2024-05-29 20:27:16] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:27:16] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 1 ms to minimize.
[2024-05-29 20:27:16] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
[2024-05-29 20:27:16] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:27:16] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 0 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 1 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-05-29 20:27:20] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 19/100 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 88/1219 variables, and 100 constraints, problems are : Problem set: 0 solved, 1141 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/88 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1141/109 constraints, Known Traps: 99/99 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 1 (OVERLAPS) 1/88 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 99/100 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-29 20:27:25] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 0 ms to minimize.
[2024-05-29 20:27:25] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 1 ms to minimize.
[2024-05-29 20:27:25] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 0 ms to minimize.
[2024-05-29 20:27:25] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:27:25] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2024-05-29 20:27:25] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:27:25] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:27:26] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:27:26] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 0 ms to minimize.
[2024-05-29 20:27:26] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2024-05-29 20:27:26] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:27:26] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 0 ms to minimize.
[2024-05-29 20:27:26] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:27:26] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:27:27] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2024-05-29 20:27:27] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:27:27] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 0 ms to minimize.
[2024-05-29 20:27:27] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 20:27:27] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
[2024-05-29 20:27:28] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:27:32] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:27:33] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:27:33] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 1 ms to minimize.
[2024-05-29 20:27:33] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:27:33] [INFO ] Deduced a trap composed of 12 places in 223 ms of which 0 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 1 ms to minimize.
[2024-05-29 20:27:34] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
[2024-05-29 20:27:39] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:27:39] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2024-05-29 20:27:40] [INFO ] Deduced a trap composed of 13 places in 245 ms of which 1 ms to minimize.
[2024-05-29 20:27:40] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/88 variables, 14/134 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-29 20:27:42] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2024-05-29 20:27:43] [INFO ] Deduced a trap composed of 12 places in 217 ms of which 1 ms to minimize.
[2024-05-29 20:27:49] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 1141 unsolved
[2024-05-29 20:27:51] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 88/1219 variables, and 138 constraints, problems are : Problem set: 0 solved, 1141 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/88 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1032/109 constraints, Known Traps: 137/137 constraints]
After SMT, in 76508ms problems are : Problem set: 0 solved, 1141 unsolved
Search for dead transitions found 0 dead transitions in 76522ms
Starting structural reductions in LTL mode, iteration 1 : 88/123 places, 1142/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 77472 ms. Remains : 88/123 places, 1142/1190 transitions.
[2024-05-29 20:27:52] [INFO ] Flatten gal took : 50 ms
[2024-05-29 20:27:52] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:27:52] [INFO ] Input system was already deterministic with 1142 transitions.
[2024-05-29 20:27:52] [INFO ] Flatten gal took : 54 ms
[2024-05-29 20:27:52] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:27:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality9475000354584240049.gal : 11 ms
[2024-05-29 20:27:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality10397909115010646329.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/CTLCardinality9475000354584240049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10397909115010646329.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21859e+06,9.01776,204344,2,8573,5,233944,6,0,1483,125009,0
Converting to forward existential form...Done !
original formula: ((AG(EX(((p66==0)||(p76==1)))) + AF(((p83==0)&&(p27==1)))) + AF(((EG((p124==0)) + (p111==1)) + ((p33==0)&&(p48==1)))))
=> equivalent forward existential formula: [FwdG((Init * !((!(E(TRUE U !(EX(((p66==0)||(p76==1)))))) + !(EG(!(((p83==0)&&(p27==1)))))))),!(((EG((p124==0)) ...202
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t17, t18, t19, t20, t21, t23, t25, t26, t28, t29,...471
Detected timeout of ITS tools.
[2024-05-29 20:28:22] [INFO ] Flatten gal took : 55 ms
[2024-05-29 20:28:22] [INFO ] Applying decomposition
[2024-05-29 20:28:22] [INFO ] Flatten gal took : 54 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/graph15364284602326438592.txt' '-o' '/tmp/graph15364284602326438592.bin' '-w' '/tmp/graph15364284602326438592.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15364284602326438592.bin' '-l' '-1' '-v' '-w' '/tmp/graph15364284602326438592.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:28:22] [INFO ] Decomposing Gal with order
[2024-05-29 20:28:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:28:22] [INFO ] Removed a total of 9264 redundant transitions.
[2024-05-29 20:28:22] [INFO ] Flatten gal took : 128 ms
[2024-05-29 20:28:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 44 ms.
[2024-05-29 20:28:22] [INFO ] Time to serialize gal into /tmp/CTLCardinality9819389016905761120.gal : 8 ms
[2024-05-29 20:28:22] [INFO ] Time to serialize properties into /tmp/CTLCardinality7337172623137384547.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/CTLCardinality9819389016905761120.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7337172623137384547.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.21859e+06,13.3402,309560,6935,30,167127,341,1377,3.13683e+06,56,1378,0
Converting to forward existential form...Done !
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 123 transition count 1168
Reduce places removed 22 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 24 rules applied. Total rules applied 46 place count 101 transition count 1166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 48 place count 99 transition count 1166
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 48 place count 99 transition count 1149
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 82 place count 82 transition count 1149
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 94 place count 70 transition count 1130
Iterating global reduction 3 with 12 rules applied. Total rules applied 106 place count 70 transition count 1130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 70 transition count 1129
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 112 place count 65 transition count 1119
Iterating global reduction 4 with 5 rules applied. Total rules applied 117 place count 65 transition count 1119
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 147 place count 65 transition count 1089
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 157 place count 60 transition count 1084
Drop transitions (Redundant composition of simpler transitions.) removed 906 transitions
Redundant transition composition rules discarded 906 transitions
Iterating global reduction 5 with 906 rules applied. Total rules applied 1063 place count 60 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 1064 place count 60 transition count 177
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1065 place count 59 transition count 177
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1081 place count 51 transition count 169
Applied a total of 1081 rules in 224 ms. Remains 51 /123 variables (removed 72) and now considering 169/1190 (removed 1021) transitions.
[2024-05-29 20:28:53] [INFO ] Flow matrix only has 157 transitions (discarded 12 similar events)
// Phase 1: matrix 157 rows 51 cols
[2024-05-29 20:28:53] [INFO ] Computed 2 invariants in 5 ms
[2024-05-29 20:28:53] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-29 20:28:53] [INFO ] Flow matrix only has 157 transitions (discarded 12 similar events)
[2024-05-29 20:28:53] [INFO ] Invariant cache hit.
[2024-05-29 20:28:53] [INFO ] State equation strengthened by 104 read => feed constraints.
[2024-05-29 20:28:53] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-29 20:28:53] [INFO ] Redundant transitions in 7 ms returned []
Running 168 sub problems to find dead transitions.
[2024-05-29 20:28:53] [INFO ] Flow matrix only has 157 transitions (discarded 12 similar events)
[2024-05-29 20:28:53] [INFO ] Invariant cache hit.
[2024-05-29 20:28:53] [INFO ] State equation strengthened by 104 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 9 places in 31 ms of which 1 ms to minimize.
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 20/22 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-29 20:28:54] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 3 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-29 20:28:55] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-29 20:28:56] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 0 ms to minimize.
[2024-05-29 20:28:57] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-29 20:28:58] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:28:58] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:28:58] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:28:58] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:28:58] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 20:28:58] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 6/87 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-29 20:28:59] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-29 20:28:59] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 0 ms to minimize.
[2024-05-29 20:28:59] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 156/207 variables, 51/141 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 103/244 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-29 20:29:00] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/207 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 14 (OVERLAPS) 1/208 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/208 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 16 (OVERLAPS) 0/208 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 246 constraints, problems are : Problem set: 0 solved, 168 unsolved in 12254 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 89/89 constraints]
Escalating to Integer solving :Problem set: 0 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 168 unsolved
[2024-05-29 20:29:06] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:29:06] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 156/207 variables, 51/144 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 103/247 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 168/415 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 1/208 variables, 1/416 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 168 unsolved
At refinement iteration 11 (OVERLAPS) 0/208 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 416 constraints, problems are : Problem set: 0 solved, 168 unsolved in 19267 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 51/51 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 168/168 constraints, Known Traps: 91/91 constraints]
After SMT, in 31825ms problems are : Problem set: 0 solved, 168 unsolved
Search for dead transitions found 0 dead transitions in 31828ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/123 places, 169/1190 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32353 ms. Remains : 51/123 places, 169/1190 transitions.
[2024-05-29 20:29:25] [INFO ] Flatten gal took : 8 ms
[2024-05-29 20:29:25] [INFO ] Flatten gal took : 7 ms
[2024-05-29 20:29:25] [INFO ] Input system was already deterministic with 169 transitions.
[2024-05-29 20:29:25] [INFO ] Flatten gal took : 8 ms
[2024-05-29 20:29:25] [INFO ] Flatten gal took : 7 ms
[2024-05-29 20:29:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality8560276857786311908.gal : 2 ms
[2024-05-29 20:29:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality16704128880745965047.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/CTLCardinality8560276857786311908.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16704128880745965047.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4174,0.089598,6720,2,712,5,4982,6,0,358,3317,0
Converting to forward existential form...Done !
original formula: (EF(!(E(((p43==0)||(p79==1)) U (((p82==0)||(p63==1))||((p37==0)||(p0==1)))))) * E(EG(A((((p106==0)||(p112==1)) * AF((p97==0))) U EF((p82=...284
=> equivalent forward existential formula: ([(FwdU((FwdU((Init * E(TRUE U !(E(((p43==0)||(p79==1)) U (((p82==0)||(p63==1))||((p37==0)||(p0==1))))))),EG(!((...781
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t2...334
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.425846,14432,1,0,301,33646,382,103,6288,27787,427
FORMULA StigmergyElection-PT-09a-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 101 transition count 1159
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 101 transition count 1159
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 59 place count 86 transition count 1136
Iterating global reduction 0 with 15 rules applied. Total rules applied 74 place count 86 transition count 1136
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 82 place count 78 transition count 1128
Iterating global reduction 0 with 8 rules applied. Total rules applied 90 place count 78 transition count 1128
Applied a total of 90 rules in 19 ms. Remains 78 /123 variables (removed 45) and now considering 1128/1190 (removed 62) transitions.
[2024-05-29 20:29:25] [INFO ] Flow matrix only has 1118 transitions (discarded 10 similar events)
// Phase 1: matrix 1118 rows 78 cols
[2024-05-29 20:29:25] [INFO ] Computed 1 invariants in 9 ms
[2024-05-29 20:29:26] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-29 20:29:26] [INFO ] Flow matrix only has 1118 transitions (discarded 10 similar events)
[2024-05-29 20:29:26] [INFO ] Invariant cache hit.
[2024-05-29 20:29:26] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2024-05-29 20:29:26] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 880 ms to find 0 implicit places.
Running 1127 sub problems to find dead transitions.
[2024-05-29 20:29:26] [INFO ] Flow matrix only has 1118 transitions (discarded 10 similar events)
[2024-05-29 20:29:26] [INFO ] Invariant cache hit.
[2024-05-29 20:29:26] [INFO ] State equation strengthened by 1030 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:29:47] [INFO ] Deduced a trap composed of 9 places in 299 ms of which 1 ms to minimize.
[2024-05-29 20:29:47] [INFO ] Deduced a trap composed of 9 places in 293 ms of which 1 ms to minimize.
[2024-05-29 20:29:47] [INFO ] Deduced a trap composed of 9 places in 288 ms of which 1 ms to minimize.
[2024-05-29 20:29:48] [INFO ] Deduced a trap composed of 9 places in 276 ms of which 0 ms to minimize.
[2024-05-29 20:29:48] [INFO ] Deduced a trap composed of 9 places in 272 ms of which 1 ms to minimize.
[2024-05-29 20:29:48] [INFO ] Deduced a trap composed of 9 places in 275 ms of which 1 ms to minimize.
[2024-05-29 20:29:48] [INFO ] Deduced a trap composed of 9 places in 232 ms of which 0 ms to minimize.
[2024-05-29 20:29:49] [INFO ] Deduced a trap composed of 9 places in 227 ms of which 1 ms to minimize.
[2024-05-29 20:29:49] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 1 ms to minimize.
[2024-05-29 20:29:49] [INFO ] Deduced a trap composed of 9 places in 259 ms of which 1 ms to minimize.
[2024-05-29 20:29:49] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 0 ms to minimize.
[2024-05-29 20:29:50] [INFO ] Deduced a trap composed of 9 places in 199 ms of which 1 ms to minimize.
[2024-05-29 20:29:50] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 0 ms to minimize.
[2024-05-29 20:29:50] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 0 ms to minimize.
[2024-05-29 20:29:50] [INFO ] Deduced a trap composed of 9 places in 187 ms of which 0 ms to minimize.
[2024-05-29 20:29:50] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2024-05-29 20:29:51] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2024-05-29 20:29:51] [INFO ] Deduced a trap composed of 14 places in 192 ms of which 0 ms to minimize.
[2024-05-29 20:29:51] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2024-05-29 20:29:51] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:29:51] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2024-05-29 20:29:51] [INFO ] Deduced a trap composed of 9 places in 89 ms of which 1 ms to minimize.
[2024-05-29 20:29:52] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:29:52] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-05-29 20:29:52] [INFO ] Deduced a trap composed of 9 places in 112 ms of which 1 ms to minimize.
[2024-05-29 20:29:52] [INFO ] Deduced a trap composed of 9 places in 113 ms of which 0 ms to minimize.
[2024-05-29 20:29:52] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 0 ms to minimize.
[2024-05-29 20:29:52] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 0 ms to minimize.
[2024-05-29 20:29:52] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-29 20:29:52] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:29:52] [INFO ] Deduced a trap composed of 9 places in 116 ms of which 1 ms to minimize.
[2024-05-29 20:29:53] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2024-05-29 20:29:53] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 1 ms to minimize.
[2024-05-29 20:29:53] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:29:53] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:29:53] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 0 ms to minimize.
[2024-05-29 20:29:53] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 0 ms to minimize.
[2024-05-29 20:29:53] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 1 ms to minimize.
[2024-05-29 20:29:53] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-29 20:29:53] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:29:56] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 1 ms to minimize.
[2024-05-29 20:29:56] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 1 ms to minimize.
[2024-05-29 20:29:56] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 0 ms to minimize.
[2024-05-29 20:29:56] [INFO ] Deduced a trap composed of 13 places in 93 ms of which 1 ms to minimize.
[2024-05-29 20:29:56] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2024-05-29 20:29:57] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2024-05-29 20:29:57] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2024-05-29 20:29:57] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 0 ms to minimize.
[2024-05-29 20:29:57] [INFO ] Deduced a trap composed of 12 places in 258 ms of which 1 ms to minimize.
[2024-05-29 20:29:57] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 1 ms to minimize.
[2024-05-29 20:29:58] [INFO ] Deduced a trap composed of 13 places in 251 ms of which 1 ms to minimize.
[2024-05-29 20:29:58] [INFO ] Deduced a trap composed of 13 places in 222 ms of which 0 ms to minimize.
[2024-05-29 20:29:58] [INFO ] Deduced a trap composed of 12 places in 208 ms of which 0 ms to minimize.
[2024-05-29 20:29:58] [INFO ] Deduced a trap composed of 12 places in 200 ms of which 1 ms to minimize.
[2024-05-29 20:29:59] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 0 ms to minimize.
[2024-05-29 20:29:59] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 0 ms to minimize.
[2024-05-29 20:29:59] [INFO ] Deduced a trap composed of 9 places in 151 ms of which 1 ms to minimize.
[2024-05-29 20:29:59] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 0 ms to minimize.
[2024-05-29 20:29:59] [INFO ] Deduced a trap composed of 9 places in 127 ms of which 1 ms to minimize.
[2024-05-29 20:29:59] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:30:00] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 0 ms to minimize.
[2024-05-29 20:30:00] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:30:00] [INFO ] Deduced a trap composed of 9 places in 134 ms of which 0 ms to minimize.
[2024-05-29 20:30:00] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 0 ms to minimize.
[2024-05-29 20:30:00] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:30:00] [INFO ] Deduced a trap composed of 9 places in 129 ms of which 1 ms to minimize.
[2024-05-29 20:30:01] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:30:01] [INFO ] Deduced a trap composed of 9 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:30:01] [INFO ] Deduced a trap composed of 10 places in 69 ms of which 1 ms to minimize.
[2024-05-29 20:30:01] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 0 ms to minimize.
[2024-05-29 20:30:01] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 1 ms to minimize.
[2024-05-29 20:30:01] [INFO ] Deduced a trap composed of 13 places in 186 ms of which 0 ms to minimize.
[2024-05-29 20:30:01] [INFO ] Deduced a trap composed of 12 places in 187 ms of which 0 ms to minimize.
[2024-05-29 20:30:02] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 1 ms to minimize.
[2024-05-29 20:30:02] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 1 ms to minimize.
[2024-05-29 20:30:02] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2024-05-29 20:30:02] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 0 ms to minimize.
[2024-05-29 20:30:02] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:30:06] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:30:06] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:30:06] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2024-05-29 20:30:06] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 0 ms to minimize.
[2024-05-29 20:30:06] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2024-05-29 20:30:07] [INFO ] Deduced a trap composed of 10 places in 146 ms of which 0 ms to minimize.
[2024-05-29 20:30:07] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2024-05-29 20:30:07] [INFO ] Deduced a trap composed of 9 places in 130 ms of which 1 ms to minimize.
[2024-05-29 20:30:07] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2024-05-29 20:30:07] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:30:07] [INFO ] Deduced a trap composed of 9 places in 67 ms of which 0 ms to minimize.
[2024-05-29 20:30:07] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2024-05-29 20:30:08] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 0 ms to minimize.
[2024-05-29 20:30:08] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 1 ms to minimize.
[2024-05-29 20:30:08] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-29 20:30:08] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2024-05-29 20:30:11] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-29 20:30:11] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:30:11] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2024-05-29 20:30:11] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 1 ms to minimize.
[2024-05-29 20:30:11] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-29 20:30:12] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 78/1196 variables, and 101 constraints, problems are : Problem set: 0 solved, 1127 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/78 constraints, ReadFeed: 0/1030 constraints, PredecessorRefiner: 1127/95 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 1 (OVERLAPS) 1/78 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:30:16] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2024-05-29 20:30:16] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:30:16] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:30:16] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2024-05-29 20:30:16] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 20:30:16] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
[2024-05-29 20:30:17] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2024-05-29 20:30:17] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:30:17] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2024-05-29 20:30:17] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 20:30:17] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:30:17] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 1 ms to minimize.
[2024-05-29 20:30:17] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2024-05-29 20:30:18] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 0 ms to minimize.
[2024-05-29 20:30:18] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2024-05-29 20:30:18] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 0 ms to minimize.
[2024-05-29 20:30:22] [INFO ] Deduced a trap composed of 10 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 17/118 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:30:23] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 20:30:23] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 1 ms to minimize.
[2024-05-29 20:30:24] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 0 ms to minimize.
[2024-05-29 20:30:28] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
[2024-05-29 20:30:33] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:30:33] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2024-05-29 20:30:34] [INFO ] Deduced a trap composed of 10 places in 94 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 3/125 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
At refinement iteration 7 (OVERLAPS) 1117/1195 variables, 78/203 constraints. Problems are: Problem set: 0 solved, 1127 unsolved
SMT process timed out in 75978ms, After SMT, problems are : Problem set: 0 solved, 1127 unsolved
Search for dead transitions found 0 dead transitions in 75993ms
Starting structural reductions in LTL mode, iteration 1 : 78/123 places, 1128/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76895 ms. Remains : 78/123 places, 1128/1190 transitions.
[2024-05-29 20:30:42] [INFO ] Flatten gal took : 53 ms
[2024-05-29 20:30:42] [INFO ] Flatten gal took : 56 ms
[2024-05-29 20:30:42] [INFO ] Input system was already deterministic with 1128 transitions.
[2024-05-29 20:30:43] [INFO ] Flatten gal took : 57 ms
[2024-05-29 20:30:43] [INFO ] Flatten gal took : 57 ms
[2024-05-29 20:30:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality5064343037907953304.gal : 12 ms
[2024-05-29 20:30:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality8437652891823260660.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/CTLCardinality5064343037907953304.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8437652891823260660.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.03836e+06,11.7051,218996,2,7440,5,165446,6,0,1430,97535,0
Converting to forward existential form...Done !
original formula: A((AF(((p102==0)||(p38==1))) + (p12==1)) U EF((AX((p9!=0)) * (p77==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(EX(!((p9!=0)))) * (p77==1))))))) * !(E(!(E(TRUE U (!(EX(!((p9!=0)))) * (p77==1)))) ...265
Reverse transition relation is NOT exact ! Due to transitions t1, t3, t4, t6, t8, t9, t11, t13, t14, t16, t18, t19, t21, t23, t24, t26, t28, t29, t31, t33,...446
Detected timeout of ITS tools.
[2024-05-29 20:31:13] [INFO ] Flatten gal took : 57 ms
[2024-05-29 20:31:13] [INFO ] Applying decomposition
[2024-05-29 20:31:13] [INFO ] Flatten gal took : 59 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/graph13245155184472820547.txt' '-o' '/tmp/graph13245155184472820547.bin' '-w' '/tmp/graph13245155184472820547.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13245155184472820547.bin' '-l' '-1' '-v' '-w' '/tmp/graph13245155184472820547.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:31:13] [INFO ] Decomposing Gal with order
[2024-05-29 20:31:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:31:13] [INFO ] Removed a total of 9260 redundant transitions.
[2024-05-29 20:31:13] [INFO ] Flatten gal took : 134 ms
[2024-05-29 20:31:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 42 ms.
[2024-05-29 20:31:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17607882138557245359.gal : 8 ms
[2024-05-29 20:31:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality14725618715666018736.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/CTLCardinality17607882138557245359.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14725618715666018736.ctl'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.03836e+06,6.77237,225128,5690,20,128246,229,1214,2.21801e+06,37,856,0
Converting to forward existential form...Done !
original formula: A((AF(((i7.u12.p102==0)||(i2.u9.p38==1))) + (i7.u2.p12==1)) U EF((AX((i2.u1.p9!=0)) * (i7.u20.p77==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(EX(!((i2.u1.p9!=0)))) * (i7.u20.p77==1))))))) * !(E(!(E(TRUE U (!(EX(!((i2.u1.p9!=0...323
Reverse transition relation is NOT exact ! Due to transitions t4, t9, t14, t18, t24, t29, t33, t43, t53, t60, t1110, t1112, t1114, t1116, t1118, t1120, t11...516
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 123/123 places, 1190/1190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 122 transition count 1154
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 87 transition count 1153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 86 transition count 1153
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 72 place count 86 transition count 1135
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 108 place count 68 transition count 1135
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 122 place count 54 transition count 1112
Iterating global reduction 3 with 14 rules applied. Total rules applied 136 place count 54 transition count 1112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 54 transition count 1111
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 145 place count 46 transition count 1095
Iterating global reduction 4 with 8 rules applied. Total rules applied 153 place count 46 transition count 1095
Ensure Unique test removed 510 transitions
Reduce isomorphic transitions removed 510 transitions.
Iterating post reduction 4 with 510 rules applied. Total rules applied 663 place count 46 transition count 585
Drop transitions (Redundant composition of simpler transitions.) removed 513 transitions
Redundant transition composition rules discarded 513 transitions
Iterating global reduction 5 with 513 rules applied. Total rules applied 1176 place count 46 transition count 72
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 1194 place count 37 transition count 63
Reduce places removed 9 places and 9 transitions.
Iterating global reduction 5 with 9 rules applied. Total rules applied 1203 place count 28 transition count 54
Applied a total of 1203 rules in 79 ms. Remains 28 /123 variables (removed 95) and now considering 54/1190 (removed 1136) transitions.
[2024-05-29 20:31:43] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
// Phase 1: matrix 45 rows 28 cols
[2024-05-29 20:31:43] [INFO ] Computed 1 invariants in 1 ms
[2024-05-29 20:31:43] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 20:31:43] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-05-29 20:31:43] [INFO ] Invariant cache hit.
[2024-05-29 20:31:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 20:31:43] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-29 20:31:43] [INFO ] Redundant transitions in 1 ms returned []
Running 37 sub problems to find dead transitions.
[2024-05-29 20:31:43] [INFO ] Flow matrix only has 45 transitions (discarded 9 similar events)
[2024-05-29 20:31:43] [INFO ] Invariant cache hit.
[2024-05-29 20:31:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:31:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 44/72 variables, 28/81 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:31:45] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:31:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:31:46] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:31:46] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-05-29 20:31:46] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:31:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-05-29 20:31:46] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 37 unsolved
[2024-05-29 20:31:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-05-29 20:31:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-29 20:31:46] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:31:46] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-05-29 20:31:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:31:46] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 6/107 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 1/73 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/73 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 13 (OVERLAPS) 0/73 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 108 constraints, problems are : Problem set: 0 solved, 37 unsolved in 2942 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 78/78 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 9/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 78/79 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (OVERLAPS) 44/72 variables, 28/107 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 37/144 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 1/73 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/73 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 145 constraints, problems are : Problem set: 0 solved, 37 unsolved in 819 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 78/78 constraints]
After SMT, in 3768ms problems are : Problem set: 0 solved, 37 unsolved
Search for dead transitions found 0 dead transitions in 3769ms
Starting structural reductions in SI_CTL mode, iteration 1 : 28/123 places, 54/1190 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3939 ms. Remains : 28/123 places, 54/1190 transitions.
[2024-05-29 20:31:47] [INFO ] Flatten gal took : 4 ms
[2024-05-29 20:31:47] [INFO ] Flatten gal took : 2 ms
[2024-05-29 20:31:47] [INFO ] Input system was already deterministic with 54 transitions.
[2024-05-29 20:31:47] [INFO ] Flatten gal took : 1 ms
[2024-05-29 20:31:47] [INFO ] Flatten gal took : 1 ms
[2024-05-29 20:31:47] [INFO ] Time to serialize gal into /tmp/CTLCardinality11569028842352654510.gal : 0 ms
[2024-05-29 20:31:47] [INFO ] Time to serialize properties into /tmp/CTLCardinality13261133759585085934.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/CTLCardinality11569028842352654510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13261133759585085934.ctl' '--gen-order' 'FOLLOW'
its-ctl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,530,0.022903,4028,2,170,5,1374,6,0,157,873,0
Converting to forward existential form...Done !
original formula: AF(AG((p81!=0)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((p81!=0))))))] = 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, t20...285
(forward)formula 0,0,0.054066,4876,1,0,110,5386,124,44,1616,5081,116
FORMULA StigmergyElection-PT-09a-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !
***************************************
[2024-05-29 20:31:47] [INFO ] Flatten gal took : 58 ms
[2024-05-29 20:31:47] [INFO ] Flatten gal took : 56 ms
[2024-05-29 20:31:47] [INFO ] Applying decomposition
[2024-05-29 20:31:48] [INFO ] Flatten gal took : 57 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/graph16734472776891010879.txt' '-o' '/tmp/graph16734472776891010879.bin' '-w' '/tmp/graph16734472776891010879.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16734472776891010879.bin' '-l' '-1' '-v' '-w' '/tmp/graph16734472776891010879.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:31:48] [INFO ] Decomposing Gal with order
[2024-05-29 20:31:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:31:48] [INFO ] Removed a total of 9270 redundant transitions.
[2024-05-29 20:31:48] [INFO ] Flatten gal took : 127 ms
[2024-05-29 20:31:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 41 labels/synchronizations in 47 ms.
[2024-05-29 20:31:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality14575957545795798370.gal : 7 ms
[2024-05-29 20:31:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality2209302007917603486.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/CTLCardinality14575957545795798370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2209302007917603486.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 4 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.23499e+06,0.180281,9640,557,40,6446,270,1247,11165,60,662,0
Converting to forward existential form...Done !
original formula: AF((((i0.u25.p80==0) * EX(((((i3.u41.p116==1)||(i9.i0.u46.p126==0))||(i0.u2.p11==1))&&(i9.i0.u42.p119==1)))) * (EG((i6.i0.u29.p91==1)) * ...385
=> equivalent forward existential formula: [FwdG(Init,!((((i0.u25.p80==0) * EX(((((i3.u41.p116==1)||(i9.i0.u46.p126==0))||(i0.u2.p11==1))&&(i9.i0.u42.p119=...460
Reverse transition relation is NOT exact ! Due to transitions t1167, t1170, t1173, t1175, t1178, t1181, t1187, i0.t64, i0.t40, i0.t25, i0.u1.t48, i1.t1184,...593
Using saturation style SCC detection
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 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
(forward)formula 0,0,0.796286,28644,1,0,38064,453,17224,89250,279,1524,136939
FORMULA StigmergyElection-PT-09a-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
original formula: EF((AX(((!(E((i10.u0.p1==1) U ((i9.i0.u40.p113==0)||(i7.u31.p95==1)))) * (i2.u12.p42!=0)) * (i1.i0.u4.p17!=1))) + (AG(E((i9.i0.u40.p114==...246
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!(((!(E((i10.u0.p1==1) U ((i9.i0.u40.p113==0)||(i7.u31.p95==1)))) * (i2.u12.p42!=0)) *...445
(forward)formula 1,1,0.961478,34188,1,0,45743,457,17274,117134,281,1539,154623
FORMULA StigmergyElection-PT-09a-CTLCardinality-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: ((AG(EX(((i4.u20.p66==0)||(i6.i0.u24.p76==1)))) + AF(((i6.i0.u26.p83==0)&&(i1.i0.u8.p27==1)))) + AF(((EG((i9.i0.u42.p124==0)) + (i5.u39.p...203
=> equivalent forward existential formula: [FwdG((Init * !((!(E(TRUE U !(EX(((i4.u20.p66==0)||(i6.i0.u24.p76==1)))))) + !(EG(!(((i6.i0.u26.p83==0)&&(i1.i0....269
(forward)formula 2,1,1.03451,37620,1,0,51699,460,17322,125021,283,1549,165536
FORMULA StigmergyElection-PT-09a-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !
***************************************
original formula: A((AF(((i10.u45.p102==0)||(i0.u10.p38==1))) + (i10.u45.p12==1)) U EF((AX((i0.u2.p9!=0)) * (i9.i0.u42.p77==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(E(TRUE U (!(EX(!((i0.u2.p9!=0)))) * (i9.i0.u42.p77==1))))))) * !(E(!(E(TRUE U (!(EX(!((i0.u2.p9...336
(forward)formula 3,0,1.09183,38412,1,0,53266,461,17347,126627,284,1562,169355
FORMULA StigmergyElection-PT-09a-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
***************************************
Total runtime 1162264 ms.
BK_STOP 1717014709694
--------------------
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-09a"
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-09a, 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-171690532200361"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-09a.tgz
mv StigmergyElection-PT-09a 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 '
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 ;