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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 11 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 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 71K 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-02b-CTLCardinality-2024-00
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2024-01
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2024-02
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2024-03
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2024-04
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2024-05
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2024-06
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2024-07
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2024-08
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2024-09
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2024-10
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2024-11
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2023-12
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2023-13
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2023-14
FORMULA_NAME StigmergyElection-PT-02b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717006276198

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-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-29 18:11:17] [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 18:11:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 18:11:17] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2024-05-29 18:11:17] [INFO ] Transformed 291 places.
[2024-05-29 18:11:17] [INFO ] Transformed 332 transitions.
[2024-05-29 18:11:17] [INFO ] Found NUPN structural information;
[2024-05-29 18:11:17] [INFO ] Parsed PT model containing 291 places and 332 transitions and 734 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Initial state reduction rules removed 1 formulas.
FORMULA StigmergyElection-PT-02b-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 95 out of 291 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 291/291 places, 332/332 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 269 transition count 310
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 269 transition count 310
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 262 transition count 303
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 262 transition count 303
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 261 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 261 transition count 302
Applied a total of 60 rules in 58 ms. Remains 261 /291 variables (removed 30) and now considering 302/332 (removed 30) transitions.
// Phase 1: matrix 302 rows 261 cols
[2024-05-29 18:11:17] [INFO ] Computed 3 invariants in 21 ms
[2024-05-29 18:11:17] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-29 18:11:17] [INFO ] Invariant cache hit.
[2024-05-29 18:11:18] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 301 sub problems to find dead transitions.
[2024-05-29 18:11:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:11:21] [INFO ] Deduced a trap composed of 199 places in 120 ms of which 22 ms to minimize.
[2024-05-29 18:11:21] [INFO ] Deduced a trap composed of 176 places in 104 ms of which 2 ms to minimize.
[2024-05-29 18:11:21] [INFO ] Deduced a trap composed of 179 places in 89 ms of which 2 ms to minimize.
[2024-05-29 18:11:22] [INFO ] Deduced a trap composed of 177 places in 71 ms of which 2 ms to minimize.
[2024-05-29 18:11:22] [INFO ] Deduced a trap composed of 180 places in 77 ms of which 2 ms to minimize.
[2024-05-29 18:11:23] [INFO ] Deduced a trap composed of 175 places in 85 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/563 variables, 261/270 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:11:27] [INFO ] Deduced a trap composed of 176 places in 87 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (OVERLAPS) 0/563 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 271 constraints, problems are : Problem set: 0 solved, 301 unsolved in 17983 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 301 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/260 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 1 (OVERLAPS) 1/261 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/261 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 4 (OVERLAPS) 302/563 variables, 261/271 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 301/572 constraints. Problems are: Problem set: 0 solved, 301 unsolved
[2024-05-29 18:11:40] [INFO ] Deduced a trap composed of 101 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:11:41] [INFO ] Deduced a trap composed of 153 places in 77 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 2/574 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 301 unsolved
At refinement iteration 8 (OVERLAPS) 0/563 variables, 0/574 constraints. Problems are: Problem set: 0 solved, 301 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 574 constraints, problems are : Problem set: 0 solved, 301 unsolved in 16832 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 301/301 constraints, Known Traps: 9/9 constraints]
After SMT, in 34902ms problems are : Problem set: 0 solved, 301 unsolved
Search for dead transitions found 0 dead transitions in 34920ms
Starting structural reductions in LTL mode, iteration 1 : 261/291 places, 302/332 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35461 ms. Remains : 261/291 places, 302/332 transitions.
Support contains 95 out of 261 places after structural reductions.
[2024-05-29 18:11:53] [INFO ] Flatten gal took : 45 ms
[2024-05-29 18:11:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA StigmergyElection-PT-02b-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-29 18:11:53] [INFO ] Flatten gal took : 17 ms
[2024-05-29 18:11:53] [INFO ] Input system was already deterministic with 302 transitions.
Support contains 76 out of 261 places (down from 95) after GAL structural reductions.
RANDOM walk for 40000 steps (207 resets) in 1528 ms. (26 steps per ms) remains 5/44 properties
BEST_FIRST walk for 40003 steps (229 resets) in 79 ms. (500 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (274 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (102 resets) in 106 ms. (373 steps per ms) remains 2/4 properties
[2024-05-29 18:11:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 254/261 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 302/563 variables, 261/264 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 0/264 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/563 variables, 0/264 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 264 constraints, problems are : Problem set: 1 solved, 1 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 258/261 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 302/563 variables, 261/264 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/563 variables, 1/265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/563 variables, 0/265 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 265 constraints, problems are : Problem set: 1 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 261/261 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 73 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=73 )
Parikh walk visited 1 properties in 8 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2024-05-29 18:11:54] [INFO ] Flatten gal took : 13 ms
[2024-05-29 18:11:54] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:11:54] [INFO ] Input system was already deterministic with 302 transitions.
Computed a total of 33 stabilizing places and 35 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Graph (trivial) has 260 edges and 261 vertex of which 40 / 261 are part of one of the 6 SCC in 2 ms
Free SCC test removed 34 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 155 transitions
Trivial Post-agglo rules discarded 155 transitions
Performed 155 trivial Post agglomeration. Transition count delta: 155
Iterating post reduction 0 with 155 rules applied. Total rules applied 156 place count 226 transition count 109
Reduce places removed 155 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 159 rules applied. Total rules applied 315 place count 71 transition count 105
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 318 place count 69 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 319 place count 68 transition count 104
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 319 place count 68 transition count 97
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 333 place count 61 transition count 97
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 341 place count 53 transition count 88
Iterating global reduction 4 with 8 rules applied. Total rules applied 349 place count 53 transition count 88
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 350 place count 53 transition count 87
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 351 place count 52 transition count 87
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 351 place count 52 transition count 85
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 355 place count 50 transition count 85
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 359 place count 46 transition count 75
Iterating global reduction 6 with 4 rules applied. Total rules applied 363 place count 46 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 365 place count 46 transition count 73
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 366 place count 45 transition count 72
Iterating global reduction 7 with 1 rules applied. Total rules applied 367 place count 45 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 375 place count 41 transition count 68
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 379 place count 37 transition count 60
Iterating global reduction 7 with 4 rules applied. Total rules applied 383 place count 37 transition count 60
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 386 place count 37 transition count 57
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 388 place count 37 transition count 55
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 392 place count 35 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 393 place count 34 transition count 52
Applied a total of 393 rules in 36 ms. Remains 34 /261 variables (removed 227) and now considering 52/302 (removed 250) transitions.
[2024-05-29 18:11:54] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
// Phase 1: matrix 48 rows 34 cols
[2024-05-29 18:11:54] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:11:54] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 18:11:54] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
[2024-05-29 18:11:54] [INFO ] Invariant cache hit.
[2024-05-29 18:11:54] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 18:11:54] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-29 18:11:54] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-29 18:11:54] [INFO ] Flow matrix only has 48 transitions (discarded 4 similar events)
[2024-05-29 18:11:54] [INFO ] Invariant cache hit.
[2024-05-29 18:11:54] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-29 18:11:54] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:11:54] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-29 18:11:54] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 47/81 variables, 34/39 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 1/82 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/82 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 42 constraints, problems are : Problem set: 0 solved, 47 unsolved in 805 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 2/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-29 18:11:55] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 47/81 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 47/89 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 1/82 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 12 (OVERLAPS) 0/82 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 90 constraints, problems are : Problem set: 0 solved, 47 unsolved in 766 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 34/34 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
After SMT, in 1582ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1582ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/261 places, 52/302 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1689 ms. Remains : 34/261 places, 52/302 transitions.
[2024-05-29 18:11:56] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:11:56] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:11:56] [INFO ] Input system was already deterministic with 52 transitions.
RANDOM walk for 194 steps (27 resets) in 6 ms. (27 steps per ms) remains 0/1 properties
FORMULA StigmergyElection-PT-02b-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-29 18:11:56] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:11:56] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:11:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18397217937029240244.gal : 1 ms
[2024-05-29 18:11:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16881078239009506162.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/ReachabilityCardinality18397217937029240244.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16881078239009506162.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 : 261/261 places, 302/302 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 249 transition count 290
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 249 transition count 290
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 31 place count 242 transition count 283
Iterating global reduction 0 with 7 rules applied. Total rules applied 38 place count 242 transition count 283
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 239 transition count 280
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 239 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 237 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 237 transition count 278
Applied a total of 48 rules in 27 ms. Remains 237 /261 variables (removed 24) and now considering 278/302 (removed 24) transitions.
// Phase 1: matrix 278 rows 237 cols
[2024-05-29 18:11:56] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:11:56] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-29 18:11:56] [INFO ] Invariant cache hit.
[2024-05-29 18:11:56] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2024-05-29 18:11:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-29 18:11:59] [INFO ] Deduced a trap composed of 167 places in 76 ms of which 2 ms to minimize.
[2024-05-29 18:11:59] [INFO ] Deduced a trap composed of 167 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:11:59] [INFO ] Deduced a trap composed of 168 places in 75 ms of which 2 ms to minimize.
[2024-05-29 18:12:00] [INFO ] Deduced a trap composed of 167 places in 70 ms of which 2 ms to minimize.
[2024-05-29 18:12:00] [INFO ] Deduced a trap composed of 168 places in 65 ms of which 2 ms to minimize.
[2024-05-29 18:12:00] [INFO ] Deduced a trap composed of 167 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-29 18:12:00] [INFO ] Deduced a trap composed of 98 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 278/515 variables, 237/247 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 0/515 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Real declared 515/515 variables, and 247 constraints, problems are : Problem set: 0 solved, 277 unsolved in 13623 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (OVERLAPS) 278/515 variables, 237/247 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 277/524 constraints. Problems are: Problem set: 0 solved, 277 unsolved
[2024-05-29 18:12:14] [INFO ] Deduced a trap composed of 193 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 1/525 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/515 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (OVERLAPS) 0/515 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 277 unsolved
No progress, stopping.
After SMT solving in domain Int declared 515/515 variables, and 525 constraints, problems are : Problem set: 0 solved, 277 unsolved in 13679 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 8/8 constraints]
After SMT, in 27335ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 27339ms
Starting structural reductions in LTL mode, iteration 1 : 237/261 places, 278/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27602 ms. Remains : 237/261 places, 278/302 transitions.
[2024-05-29 18:12:23] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:12:23] [INFO ] Flatten gal took : 10 ms
[2024-05-29 18:12:23] [INFO ] Input system was already deterministic with 278 transitions.
[2024-05-29 18:12:23] [INFO ] Flatten gal took : 11 ms
[2024-05-29 18:12:23] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:12:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality10613870821210002707.gal : 5 ms
[2024-05-29 18:12:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality10140523562935490171.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality10613870821210002707.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10140523562935490171.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,143550,0.282742,14800,2,2492,5,33406,6,0,1228,56592,0


Converting to forward existential form...Done !
original formula: EX((((p181==1) + EG(!(E((p144==0) U (p176==1))))) + E(EG(A((p274==1) U ((p193==0)||(p157==1)))) U (((((p30==1)&&(p247==1))||((p156==1)&&(...236
=> equivalent forward existential formula: (([(EY(Init) * (p181==1))] != FALSE + [FwdG(EY(Init),!(E((p144==0) U (p176==1))))] != FALSE) + [FwdG((FwdU(EY(In...399
Reverse transition relation is NOT exact ! Due to transitions t17, t23, t44, t53, t89, t90, t91, t125, t126, t127, t128, t144, t153, t161, t189, t190, t191...293
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Hit Full ! (commute/partial/dont) 272/3/6
(forward)formula 0,1,23.6618,737296,1,0,1518,5.21605e+06,611,960,7503,3.72852e+06,1818
FORMULA StigmergyElection-PT-02b-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 245 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 245 transition count 286
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 235 transition count 276
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 235 transition count 276
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 233 transition count 274
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 233 transition count 274
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 232 transition count 273
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 232 transition count 273
Applied a total of 58 rules in 22 ms. Remains 232 /261 variables (removed 29) and now considering 273/302 (removed 29) transitions.
// Phase 1: matrix 273 rows 232 cols
[2024-05-29 18:12:47] [INFO ] Computed 3 invariants in 5 ms
[2024-05-29 18:12:47] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-29 18:12:47] [INFO ] Invariant cache hit.
[2024-05-29 18:12:48] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-05-29 18:12:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-29 18:12:50] [INFO ] Deduced a trap composed of 167 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:12:50] [INFO ] Deduced a trap composed of 164 places in 57 ms of which 1 ms to minimize.
[2024-05-29 18:12:51] [INFO ] Deduced a trap composed of 167 places in 67 ms of which 2 ms to minimize.
[2024-05-29 18:12:51] [INFO ] Deduced a trap composed of 163 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:12:51] [INFO ] Deduced a trap composed of 166 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/505 variables, 232/240 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 0/505 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 240 constraints, problems are : Problem set: 0 solved, 272 unsolved in 11354 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/231 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/232 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/232 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/232 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (OVERLAPS) 273/505 variables, 232/240 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/505 variables, 272/512 constraints. Problems are: Problem set: 0 solved, 272 unsolved
[2024-05-29 18:13:04] [INFO ] Deduced a trap composed of 166 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/505 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 8 (OVERLAPS) 0/505 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 505/505 variables, and 513 constraints, problems are : Problem set: 0 solved, 272 unsolved in 14475 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 232/232 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 6/6 constraints]
After SMT, in 25860ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 25867ms
Starting structural reductions in LTL mode, iteration 1 : 232/261 places, 273/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26065 ms. Remains : 232/261 places, 273/302 transitions.
[2024-05-29 18:13:13] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:13:13] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:13:13] [INFO ] Input system was already deterministic with 273 transitions.
[2024-05-29 18:13:13] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:13:13] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:13:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality577763776187792069.gal : 2 ms
[2024-05-29 18:13:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality13260430746765541890.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/CTLCardinality577763776187792069.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13260430746765541890.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,133463,0.204661,11740,2,1916,5,26961,6,0,1203,37965,0


Converting to forward existential form...Done !
original formula: EF(AX(A(A(!(((p82==0)||(p221==1))) U AG((p246==0))) U ((!((p247==0)||(p109==1)))||(!((p54==0)||(p52==1)))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(!(!((E(!(((!((p247==0)||(p109==1)))||(!((p54==0)||(p52==1))))) U (!(!((E(!(!(E(TRUE U !...409
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t150, t188, t189, t222, t223, t225, t238, t2...259
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,28.7625,741084,1,0,1219,5.47957e+06,583,786,7285,3.42912e+06,1683
FORMULA StigmergyElection-PT-02b-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 245 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 245 transition count 286
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 235 transition count 276
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 235 transition count 276
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 232 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 230 transition count 271
Applied a total of 62 rules in 16 ms. Remains 230 /261 variables (removed 31) and now considering 271/302 (removed 31) transitions.
// Phase 1: matrix 271 rows 230 cols
[2024-05-29 18:13:42] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:13:43] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 18:13:43] [INFO ] Invariant cache hit.
[2024-05-29 18:13:43] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-29 18:13:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:13:45] [INFO ] Deduced a trap composed of 163 places in 67 ms of which 2 ms to minimize.
[2024-05-29 18:13:45] [INFO ] Deduced a trap composed of 165 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:13:46] [INFO ] Deduced a trap composed of 164 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:13:46] [INFO ] Deduced a trap composed of 165 places in 70 ms of which 1 ms to minimize.
[2024-05-29 18:13:46] [INFO ] Deduced a trap composed of 164 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:13:46] [INFO ] Deduced a trap composed of 164 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:13:46] [INFO ] Deduced a trap composed of 165 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 240 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11453 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/240 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/510 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:13:58] [INFO ] Deduced a trap composed of 164 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:13:59] [INFO ] Deduced a trap composed of 162 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 2/512 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 8 (OVERLAPS) 0/501 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 512 constraints, problems are : Problem set: 0 solved, 270 unsolved in 13520 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 9/9 constraints]
After SMT, in 24999ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 25002ms
Starting structural reductions in LTL mode, iteration 1 : 230/261 places, 271/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25222 ms. Remains : 230/261 places, 271/302 transitions.
[2024-05-29 18:14:08] [INFO ] Flatten gal took : 12 ms
[2024-05-29 18:14:08] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:14:08] [INFO ] Input system was already deterministic with 271 transitions.
[2024-05-29 18:14:08] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:14:08] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:14:08] [INFO ] Time to serialize gal into /tmp/CTLCardinality11768827407964858746.gal : 1 ms
[2024-05-29 18:14:08] [INFO ] Time to serialize properties into /tmp/CTLCardinality1021036083294682399.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/CTLCardinality11768827407964858746.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1021036083294682399.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,136997,0.276788,14632,2,2689,5,35541,6,0,1193,54590,0


Converting to forward existential form...Done !
original formula: E(AG(A(AX(EG((p288==0))) U (((p23!=1)&&(p127==0))&&(((p212==0)||(p63==1))||(p27==0))))) U AX(!(AF(((p160!=1)||(p136==1))))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!((E(!((((p23!=1)&&(p127==0))&&(((p212==0)||(p63==1))||(p27==0)))) U (!(!(EX(!(EG((p288...363
Reverse transition relation is NOT exact ! Due to transitions t17, t18, t44, t53, t87, t88, t89, t122, t123, t124, t125, t141, t150, t184, t185, t186, t219...287
(forward)formula 0,0,22.8452,694216,1,0,1513,5.17414e+06,585,768,6852,2.87244e+06,1927
FORMULA StigmergyElection-PT-02b-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 244 transition count 285
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 244 transition count 285
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 234 transition count 275
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 234 transition count 275
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 232 transition count 273
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 232 transition count 273
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 231 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 231 transition count 272
Applied a total of 60 rules in 10 ms. Remains 231 /261 variables (removed 30) and now considering 272/302 (removed 30) transitions.
// Phase 1: matrix 272 rows 231 cols
[2024-05-29 18:14:31] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:14:31] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 18:14:31] [INFO ] Invariant cache hit.
[2024-05-29 18:14:31] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-05-29 18:14:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-29 18:14:34] [INFO ] Deduced a trap composed of 163 places in 60 ms of which 2 ms to minimize.
[2024-05-29 18:14:34] [INFO ] Deduced a trap composed of 164 places in 65 ms of which 2 ms to minimize.
[2024-05-29 18:14:34] [INFO ] Deduced a trap composed of 164 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:14:34] [INFO ] Deduced a trap composed of 165 places in 59 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/503 variables, 231/238 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/503 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 238 constraints, problems are : Problem set: 0 solved, 271 unsolved in 11338 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/503 variables, 231/238 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 271/509 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-29 18:14:47] [INFO ] Deduced a trap composed of 166 places in 66 ms of which 1 ms to minimize.
[2024-05-29 18:14:47] [INFO ] Deduced a trap composed of 165 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 0/503 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 511 constraints, problems are : Problem set: 0 solved, 271 unsolved in 15426 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 6/6 constraints]
After SMT, in 26790ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 26793ms
Starting structural reductions in LTL mode, iteration 1 : 231/261 places, 272/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26985 ms. Remains : 231/261 places, 272/302 transitions.
[2024-05-29 18:14:58] [INFO ] Flatten gal took : 9 ms
[2024-05-29 18:14:58] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:14:58] [INFO ] Input system was already deterministic with 272 transitions.
[2024-05-29 18:14:58] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:14:58] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:14:58] [INFO ] Time to serialize gal into /tmp/CTLCardinality1306492438897741302.gal : 2 ms
[2024-05-29 18:14:58] [INFO ] Time to serialize properties into /tmp/CTLCardinality7762216674801640715.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/CTLCardinality1306492438897741302.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7762216674801640715.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,132539,0.217175,11732,2,1922,5,27155,6,0,1198,37390,0


Converting to forward existential form...Done !
original formula: !(E(((p186==0)||(p151==1)) U AG(AX(((p55==0)||(p77==1))))))
=> equivalent forward existential formula: [(FwdU(Init,((p186==0)||(p151==1))) * !(E(TRUE U !(!(EX(!(((p55==0)||(p77==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t150, t187, t188, t221, t222, t224, t237, t2...259
Hit Full ! (commute/partial/dont) 267/0/5
(forward)formula 0,0,3.41353,113688,1,0,370,608823,573,266,7059,401831,584
FORMULA StigmergyElection-PT-02b-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 244 transition count 285
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 244 transition count 285
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 44 place count 234 transition count 275
Iterating global reduction 0 with 10 rules applied. Total rules applied 54 place count 234 transition count 275
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 231 transition count 272
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 231 transition count 272
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 229 transition count 270
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 229 transition count 270
Applied a total of 64 rules in 18 ms. Remains 229 /261 variables (removed 32) and now considering 270/302 (removed 32) transitions.
// Phase 1: matrix 270 rows 229 cols
[2024-05-29 18:15:01] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:15:01] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-29 18:15:01] [INFO ] Invariant cache hit.
[2024-05-29 18:15:01] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-05-29 18:15:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-29 18:15:04] [INFO ] Deduced a trap composed of 165 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:15:05] [INFO ] Deduced a trap composed of 164 places in 67 ms of which 1 ms to minimize.
[2024-05-29 18:15:05] [INFO ] Deduced a trap composed of 163 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:15:05] [INFO ] Deduced a trap composed of 164 places in 59 ms of which 2 ms to minimize.
[2024-05-29 18:15:05] [INFO ] Deduced a trap composed of 163 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-29 18:15:05] [INFO ] Deduced a trap composed of 164 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/229 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 270/499 variables, 229/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (OVERLAPS) 0/499 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 238 constraints, problems are : Problem set: 0 solved, 269 unsolved in 12680 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (OVERLAPS) 1/229 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/229 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/229 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (OVERLAPS) 270/499 variables, 229/238 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 269/507 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-29 18:15:19] [INFO ] Deduced a trap composed of 163 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/499 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 8 (OVERLAPS) 0/499 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 269 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 508 constraints, problems are : Problem set: 0 solved, 269 unsolved in 16473 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 229/229 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 7/7 constraints]
After SMT, in 29181ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 29184ms
Starting structural reductions in LTL mode, iteration 1 : 229/261 places, 270/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29383 ms. Remains : 229/261 places, 270/302 transitions.
[2024-05-29 18:15:31] [INFO ] Flatten gal took : 8 ms
[2024-05-29 18:15:31] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:15:31] [INFO ] Input system was already deterministic with 270 transitions.
[2024-05-29 18:15:31] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:15:31] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:15:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality13291383277304083078.gal : 2 ms
[2024-05-29 18:15:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality13351132584639382104.ctl : 5 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/CTLCardinality13291383277304083078.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13351132584639382104.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,130971,0.198343,11720,2,1870,5,26646,6,0,1188,38114,0


Converting to forward existential form...Done !
original formula: AX(EG((AX(((p65==0)||(p72==1))) + ((p77==0)&&((p96==0)||(p274==1))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG((!(EX(!(((p65==0)||(p72==1))))) + ((p77==0)&&((p96==0)||(p274==1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t156, t184, t185, t186, t219, t220, t2...271
(forward)formula 0,1,7.32757,244316,1,0,523,1.63353e+06,566,317,6809,963852,771
FORMULA StigmergyElection-PT-02b-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 248 transition count 289
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 248 transition count 289
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 239 transition count 280
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 239 transition count 280
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 237 transition count 278
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 237 transition count 278
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 236 transition count 277
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 236 transition count 277
Applied a total of 50 rules in 9 ms. Remains 236 /261 variables (removed 25) and now considering 277/302 (removed 25) transitions.
// Phase 1: matrix 277 rows 236 cols
[2024-05-29 18:15:38] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 18:15:38] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-29 18:15:38] [INFO ] Invariant cache hit.
[2024-05-29 18:15:38] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 276 sub problems to find dead transitions.
[2024-05-29 18:15:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-29 18:15:40] [INFO ] Deduced a trap composed of 96 places in 58 ms of which 1 ms to minimize.
[2024-05-29 18:15:41] [INFO ] Deduced a trap composed of 164 places in 68 ms of which 2 ms to minimize.
[2024-05-29 18:15:41] [INFO ] Deduced a trap composed of 167 places in 66 ms of which 2 ms to minimize.
[2024-05-29 18:15:41] [INFO ] Deduced a trap composed of 166 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:15:42] [INFO ] Deduced a trap composed of 168 places in 71 ms of which 1 ms to minimize.
[2024-05-29 18:15:42] [INFO ] Deduced a trap composed of 164 places in 73 ms of which 2 ms to minimize.
[2024-05-29 18:15:42] [INFO ] Deduced a trap composed of 164 places in 70 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-29 18:15:42] [INFO ] Deduced a trap composed of 96 places in 65 ms of which 7 ms to minimize.
[2024-05-29 18:15:42] [INFO ] Deduced a trap composed of 167 places in 61 ms of which 2 ms to minimize.
[2024-05-29 18:15:43] [INFO ] Deduced a trap composed of 169 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (OVERLAPS) 277/513 variables, 236/249 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (OVERLAPS) 0/513 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Real declared 513/513 variables, and 249 constraints, problems are : Problem set: 0 solved, 276 unsolved in 13321 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 276 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 4 (OVERLAPS) 277/513 variables, 236/249 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 276/525 constraints. Problems are: Problem set: 0 solved, 276 unsolved
[2024-05-29 18:15:56] [INFO ] Deduced a trap composed of 194 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 276 unsolved
At refinement iteration 8 (OVERLAPS) 0/513 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 276 unsolved
No progress, stopping.
After SMT solving in domain Int declared 513/513 variables, and 526 constraints, problems are : Problem set: 0 solved, 276 unsolved in 14136 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 276/276 constraints, Known Traps: 11/11 constraints]
After SMT, in 27479ms problems are : Problem set: 0 solved, 276 unsolved
Search for dead transitions found 0 dead transitions in 27482ms
Starting structural reductions in LTL mode, iteration 1 : 236/261 places, 277/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27655 ms. Remains : 236/261 places, 277/302 transitions.
[2024-05-29 18:16:06] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:16:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:16:06] [INFO ] Input system was already deterministic with 277 transitions.
[2024-05-29 18:16:06] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:16:06] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:16:06] [INFO ] Time to serialize gal into /tmp/CTLCardinality3507586006122362912.gal : 1 ms
[2024-05-29 18:16:06] [INFO ] Time to serialize properties into /tmp/CTLCardinality14679241748515679477.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/CTLCardinality3507586006122362912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14679241748515679477.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,142055,0.241593,13872,2,2313,5,32268,6,0,1223,51661,0


Converting to forward existential form...Done !
original formula: AG((EX(E(AF((p146==0)) U (((p239==0)||(p272==1))||(p30==1)))) * ((EG((p118==0)) + (p43==0)) + (p8==1))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(E(!(EG(!((p146==0)))) U (((p239==0)||(p272==1))||(p30==1))))))] = FALSE * [(((FwdU(Ini...221
Reverse transition relation is NOT exact ! Due to transitions t18, t24, t45, t56, t91, t92, t126, t127, t128, t129, t145, t154, t188, t189, t190, t224, t22...282
(forward)formula 0,0,15.4025,470408,1,0,1005,3.36182e+06,590,545,6601,2.09542e+06,1324
FORMULA StigmergyElection-PT-02b-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 244 transition count 285
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 244 transition count 285
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 45 place count 233 transition count 274
Iterating global reduction 0 with 11 rules applied. Total rules applied 56 place count 233 transition count 274
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 230 transition count 271
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 230 transition count 271
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 228 transition count 269
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 228 transition count 269
Applied a total of 66 rules in 12 ms. Remains 228 /261 variables (removed 33) and now considering 269/302 (removed 33) transitions.
// Phase 1: matrix 269 rows 228 cols
[2024-05-29 18:16:21] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 18:16:21] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 18:16:21] [INFO ] Invariant cache hit.
[2024-05-29 18:16:21] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-29 18:16:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:16:24] [INFO ] Deduced a trap composed of 164 places in 59 ms of which 1 ms to minimize.
[2024-05-29 18:16:24] [INFO ] Deduced a trap composed of 164 places in 56 ms of which 2 ms to minimize.
[2024-05-29 18:16:25] [INFO ] Deduced a trap composed of 163 places in 64 ms of which 2 ms to minimize.
[2024-05-29 18:16:25] [INFO ] Deduced a trap composed of 162 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 268 unsolved
[2024-05-29 18:16:31] [INFO ] Deduced a trap composed of 162 places in 60 ms of which 2 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/497 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 8 (OVERLAPS) 0/497 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 497/497 variables, and 236 constraints, problems are : Problem set: 0 solved, 268 unsolved in 14992 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (OVERLAPS) 269/497 variables, 228/236 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/497 variables, 268/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/497 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 497/497 variables, and 504 constraints, problems are : Problem set: 0 solved, 268 unsolved in 11166 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 5/5 constraints]
After SMT, in 26192ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 26196ms
Starting structural reductions in LTL mode, iteration 1 : 228/261 places, 269/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26374 ms. Remains : 228/261 places, 269/302 transitions.
[2024-05-29 18:16:48] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:16:48] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:16:48] [INFO ] Input system was already deterministic with 269 transitions.
[2024-05-29 18:16:48] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:16:48] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:16:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality26530280478995057.gal : 2 ms
[2024-05-29 18:16:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality18152373848730375868.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/CTLCardinality26530280478995057.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18152373848730375868.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,130047,0.195103,11460,2,1866,5,26218,6,0,1183,36497,0


Converting to forward existential form...Done !
original formula: EG((EF((p269==1)) + AX(FALSE)))
=> equivalent forward existential formula: [FwdG(Init,(E(TRUE U (p269==1)) + !(EX(!(FALSE)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t121, t122, t124, t140, t149, t183, t184, t185, t218, t219, t221, t2...265
(forward)formula 0,0,2.77479,100604,1,0,500,416414,565,328,6773,461393,679
FORMULA StigmergyElection-PT-02b-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Graph (trivial) has 262 edges and 261 vertex of which 42 / 261 are part of one of the 6 SCC in 6 ms
Free SCC test removed 36 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 154 transitions
Trivial Post-agglo rules discarded 154 transitions
Performed 154 trivial Post agglomeration. Transition count delta: 154
Iterating post reduction 0 with 154 rules applied. Total rules applied 155 place count 224 transition count 107
Reduce places removed 154 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 158 rules applied. Total rules applied 313 place count 70 transition count 103
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 317 place count 68 transition count 101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 319 place count 66 transition count 101
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 319 place count 66 transition count 94
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 333 place count 59 transition count 94
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 342 place count 50 transition count 83
Iterating global reduction 4 with 9 rules applied. Total rules applied 351 place count 50 transition count 83
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 352 place count 50 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 353 place count 49 transition count 82
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 353 place count 49 transition count 80
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 357 place count 47 transition count 80
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 361 place count 43 transition count 70
Iterating global reduction 6 with 4 rules applied. Total rules applied 365 place count 43 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 366 place count 43 transition count 69
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 367 place count 42 transition count 68
Iterating global reduction 7 with 1 rules applied. Total rules applied 368 place count 42 transition count 68
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 376 place count 38 transition count 64
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 381 place count 33 transition count 54
Iterating global reduction 7 with 5 rules applied. Total rules applied 386 place count 33 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 388 place count 33 transition count 52
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 389 place count 32 transition count 51
Iterating global reduction 8 with 1 rules applied. Total rules applied 390 place count 32 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 392 place count 32 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 396 place count 30 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 397 place count 29 transition count 46
Applied a total of 397 rules in 31 ms. Remains 29 /261 variables (removed 232) and now considering 46/302 (removed 256) transitions.
[2024-05-29 18:16:51] [INFO ] Flow matrix only has 43 transitions (discarded 3 similar events)
// Phase 1: matrix 43 rows 29 cols
[2024-05-29 18:16:51] [INFO ] Computed 2 invariants in 0 ms
[2024-05-29 18:16:51] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 18:16:51] [INFO ] Flow matrix only has 43 transitions (discarded 3 similar events)
[2024-05-29 18:16:51] [INFO ] Invariant cache hit.
[2024-05-29 18:16:51] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 18:16:51] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-05-29 18:16:51] [INFO ] Redundant transitions in 0 ms returned []
Running 41 sub problems to find dead transitions.
[2024-05-29 18:16:51] [INFO ] Flow matrix only has 43 transitions (discarded 3 similar events)
[2024-05-29 18:16:51] [INFO ] Invariant cache hit.
[2024-05-29 18:16:51] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 18:16:51] [INFO ] Deduced a trap composed of 23 places in 23 ms of which 0 ms to minimize.
[2024-05-29 18:16:51] [INFO ] Deduced a trap composed of 23 places in 24 ms of which 0 ms to minimize.
[2024-05-29 18:16:51] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 1 ms to minimize.
[2024-05-29 18:16:51] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 42/71 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (OVERLAPS) 1/72 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 38 constraints, problems are : Problem set: 0 solved, 41 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (OVERLAPS) 42/71 variables, 29/35 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 41/78 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 9 (OVERLAPS) 1/72 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-29 18:16:52] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-05-29 18:16:52] [INFO ] Deduced a trap composed of 22 places in 20 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 12 (OVERLAPS) 0/72 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 81 constraints, problems are : Problem set: 0 solved, 41 unsolved in 606 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 6/6 constraints]
After SMT, in 1203ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1203ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/261 places, 46/302 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1304 ms. Remains : 29/261 places, 46/302 transitions.
[2024-05-29 18:16:52] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:16:52] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:16:52] [INFO ] Input system was already deterministic with 46 transitions.
[2024-05-29 18:16:52] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:16:52] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:16:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality15743604235102609803.gal : 1 ms
[2024-05-29 18:16:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality9594032061313600972.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/CTLCardinality15743604235102609803.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9594032061313600972.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,344,0.00693,3584,2,176,5,751,6,0,158,721,0


Converting to forward existential form...Done !
original formula: EG(((p42==0)||(p90==1)))
=> equivalent forward existential formula: [FwdG(Init,((p42==0)||(p90==1)))] != FALSE
Hit Full ! (commute/partial/dont) 42/0/4
Hit Full ! (commute/partial/dont) 0/0/4
Hit Full ! (commute/partial/dont) 0/0/4
Hit Full ! (commute/partial/dont) 0/0/4
Hit Full ! (commute/partial/dont) 0/0/4
Hit Full ! (commute/partial/dont) 0/0/4
(forward)formula 0,1,0.024269,4428,1,0,16,4443,19,4,766,4741,15
FORMULA StigmergyElection-PT-02b-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 246 transition count 287
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 246 transition count 287
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 40 place count 236 transition count 277
Iterating global reduction 0 with 10 rules applied. Total rules applied 50 place count 236 transition count 277
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 233 transition count 274
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 233 transition count 274
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 231 transition count 272
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 231 transition count 272
Applied a total of 60 rules in 8 ms. Remains 231 /261 variables (removed 30) and now considering 272/302 (removed 30) transitions.
// Phase 1: matrix 272 rows 231 cols
[2024-05-29 18:16:52] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 18:16:52] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-29 18:16:52] [INFO ] Invariant cache hit.
[2024-05-29 18:16:52] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-05-29 18:16:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-29 18:16:55] [INFO ] Deduced a trap composed of 162 places in 59 ms of which 2 ms to minimize.
[2024-05-29 18:16:55] [INFO ] Deduced a trap composed of 163 places in 75 ms of which 1 ms to minimize.
[2024-05-29 18:16:55] [INFO ] Deduced a trap composed of 164 places in 63 ms of which 2 ms to minimize.
[2024-05-29 18:16:55] [INFO ] Deduced a trap composed of 167 places in 64 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-29 18:16:56] [INFO ] Deduced a trap composed of 167 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:16:57] [INFO ] Deduced a trap composed of 166 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 272/503 variables, 231/240 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (OVERLAPS) 0/503 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 503/503 variables, and 240 constraints, problems are : Problem set: 0 solved, 271 unsolved in 12660 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/230 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 1/231 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 272/503 variables, 231/240 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 271/511 constraints. Problems are: Problem set: 0 solved, 271 unsolved
[2024-05-29 18:17:10] [INFO ] Deduced a trap composed of 165 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 8 (OVERLAPS) 0/503 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Int declared 503/503 variables, and 512 constraints, problems are : Problem set: 0 solved, 271 unsolved in 15221 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 231/231 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 7/7 constraints]
After SMT, in 27913ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 27917ms
Starting structural reductions in LTL mode, iteration 1 : 231/261 places, 272/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28112 ms. Remains : 231/261 places, 272/302 transitions.
[2024-05-29 18:17:20] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:17:20] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:17:20] [INFO ] Input system was already deterministic with 272 transitions.
[2024-05-29 18:17:20] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:17:20] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:17:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality12673089096547363119.gal : 1 ms
[2024-05-29 18:17:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality11147994496686896224.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/CTLCardinality12673089096547363119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11147994496686896224.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,132903,0.233717,11736,2,1941,5,27194,6,0,1198,37723,0


Converting to forward existential form...Done !
original formula: EX(A(AX(AX(((p174==0)||(p85==1)))) U !((!(AG((p153==1))) * AX((p147==0))))))
=> equivalent forward existential formula: [((EY(Init) * !(EG(!(!((!(!(E(TRUE U !((p153==1))))) * !(EX(!((p147==0)))))))))) * !(E(!(!((!(!(E(TRUE U !((p153...311
Reverse transition relation is NOT exact ! Due to transitions t43, t52, t86, t87, t88, t123, t124, t126, t142, t151, t185, t186, t187, t220, t221, t223, t2...265
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,17.061,532076,1,0,1075,3.92395e+06,578,738,7245,2.44171e+06,1342
FORMULA StigmergyElection-PT-02b-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 247 transition count 288
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 247 transition count 288
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 239 transition count 280
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 239 transition count 280
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 47 place count 236 transition count 277
Iterating global reduction 0 with 3 rules applied. Total rules applied 50 place count 236 transition count 277
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 234 transition count 275
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 234 transition count 275
Applied a total of 54 rules in 8 ms. Remains 234 /261 variables (removed 27) and now considering 275/302 (removed 27) transitions.
// Phase 1: matrix 275 rows 234 cols
[2024-05-29 18:17:37] [INFO ] Computed 3 invariants in 4 ms
[2024-05-29 18:17:37] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-29 18:17:37] [INFO ] Invariant cache hit.
[2024-05-29 18:17:37] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 274 sub problems to find dead transitions.
[2024-05-29 18:17:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-29 18:17:40] [INFO ] Deduced a trap composed of 164 places in 69 ms of which 2 ms to minimize.
[2024-05-29 18:17:40] [INFO ] Deduced a trap composed of 166 places in 62 ms of which 1 ms to minimize.
[2024-05-29 18:17:41] [INFO ] Deduced a trap composed of 168 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:17:41] [INFO ] Deduced a trap composed of 163 places in 64 ms of which 1 ms to minimize.
[2024-05-29 18:17:41] [INFO ] Deduced a trap composed of 164 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/509 variables, 234/242 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 6 (OVERLAPS) 0/509 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Real declared 509/509 variables, and 242 constraints, problems are : Problem set: 0 solved, 274 unsolved in 11566 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 274 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 4 (OVERLAPS) 275/509 variables, 234/242 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 274/516 constraints. Problems are: Problem set: 0 solved, 274 unsolved
[2024-05-29 18:17:53] [INFO ] Deduced a trap composed of 185 places in 61 ms of which 1 ms to minimize.
[2024-05-29 18:17:54] [INFO ] Deduced a trap composed of 167 places in 61 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
At refinement iteration 8 (OVERLAPS) 0/509 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 274 unsolved
No progress, stopping.
After SMT solving in domain Int declared 509/509 variables, and 518 constraints, problems are : Problem set: 0 solved, 274 unsolved in 12988 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 274/274 constraints, Known Traps: 7/7 constraints]
After SMT, in 24589ms problems are : Problem set: 0 solved, 274 unsolved
Search for dead transitions found 0 dead transitions in 24592ms
Starting structural reductions in LTL mode, iteration 1 : 234/261 places, 275/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24768 ms. Remains : 234/261 places, 275/302 transitions.
[2024-05-29 18:18:02] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:18:02] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:18:02] [INFO ] Input system was already deterministic with 275 transitions.
[2024-05-29 18:18:02] [INFO ] Flatten gal took : 7 ms
[2024-05-29 18:18:02] [INFO ] Flatten gal took : 6 ms
[2024-05-29 18:18:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality16751701211410945367.gal : 2 ms
[2024-05-29 18:18:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality7161352598069627311.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/CTLCardinality16751701211410945367.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7161352598069627311.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,145696,0.251677,13600,2,2559,5,31616,6,0,1213,49325,0


Converting to forward existential form...Done !
original formula: AF(((AG(((p280==1) + EX((p276==1)))) * (p202==1)) + ((p101==1)&&((p12==0)||(p64==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(((!(E(TRUE U !(((p280==1) + EX((p276==1)))))) * (p202==1)) + ((p101==1)&&((p12==0)||(p64==1))))))] ...162
Reverse transition relation is NOT exact ! Due to transitions t17, t24, t45, t54, t90, t91, t92, t125, t126, t127, t128, t144, t153, t187, t188, t189, t223...287
(forward)formula 0,0,7.5387,245540,1,0,659,1.19554e+06,580,445,6929,1.36284e+06,805
FORMULA StigmergyElection-PT-02b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Graph (trivial) has 264 edges and 261 vertex of which 42 / 261 are part of one of the 6 SCC in 2 ms
Free SCC test removed 36 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 158 place count 225 transition count 105
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 161 rules applied. Total rules applied 319 place count 68 transition count 101
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 322 place count 66 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 323 place count 65 transition count 100
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 323 place count 65 transition count 93
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 337 place count 58 transition count 93
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 346 place count 49 transition count 82
Iterating global reduction 4 with 9 rules applied. Total rules applied 355 place count 49 transition count 82
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 356 place count 49 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 357 place count 48 transition count 81
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 357 place count 48 transition count 79
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 361 place count 46 transition count 79
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 365 place count 42 transition count 69
Iterating global reduction 6 with 4 rules applied. Total rules applied 369 place count 42 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 371 place count 42 transition count 67
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 372 place count 41 transition count 66
Iterating global reduction 7 with 1 rules applied. Total rules applied 373 place count 41 transition count 66
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 381 place count 37 transition count 62
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 386 place count 32 transition count 52
Iterating global reduction 7 with 5 rules applied. Total rules applied 391 place count 32 transition count 52
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 394 place count 32 transition count 49
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 395 place count 31 transition count 48
Iterating global reduction 8 with 1 rules applied. Total rules applied 396 place count 31 transition count 48
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 398 place count 31 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 402 place count 29 transition count 44
Applied a total of 402 rules in 19 ms. Remains 29 /261 variables (removed 232) and now considering 44/302 (removed 258) transitions.
[2024-05-29 18:18:10] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
// Phase 1: matrix 41 rows 29 cols
[2024-05-29 18:18:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:18:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-29 18:18:10] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-29 18:18:10] [INFO ] Invariant cache hit.
[2024-05-29 18:18:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 18:18:10] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-29 18:18:10] [INFO ] Redundant transitions in 0 ms returned []
Running 43 sub problems to find dead transitions.
[2024-05-29 18:18:10] [INFO ] Flow matrix only has 41 transitions (discarded 3 similar events)
[2024-05-29 18:18:10] [INFO ] Invariant cache hit.
[2024-05-29 18:18:10] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-29 18:18:10] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:18:10] [INFO ] Deduced a trap composed of 22 places in 22 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 40/69 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 1/70 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/70 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 70/70 variables, and 38 constraints, problems are : Problem set: 0 solved, 43 unsolved in 610 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 40/69 variables, 29/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 43/80 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 23 places in 19 ms of which 1 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 1/70 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/70 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 70/70 variables, and 83 constraints, problems are : Problem set: 0 solved, 43 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 29/29 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 4/4 constraints]
After SMT, in 1341ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 1341ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/261 places, 44/302 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1423 ms. Remains : 29/261 places, 44/302 transitions.
[2024-05-29 18:18:11] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:18:11] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:18:11] [INFO ] Input system was already deterministic with 44 transitions.
[2024-05-29 18:18:11] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:18:11] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:18:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality7259473744340791542.gal : 0 ms
[2024-05-29 18:18:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality17839499170858038016.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/CTLCardinality7259473744340791542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17839499170858038016.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,299,0.00999,3572,2,228,5,1043,6,0,157,1057,0


Converting to forward existential form...Done !
original formula: AF(((p1==0)&&(p215==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((p1==0)&&(p215==1))))] = FALSE
Hit Full ! (commute/partial/dont) 40/0/4
(forward)formula 0,0,0.033352,4680,1,0,20,5436,20,4,766,4849,17
FORMULA StigmergyElection-PT-02b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Graph (trivial) has 260 edges and 261 vertex of which 40 / 261 are part of one of the 6 SCC in 1 ms
Free SCC test removed 34 places
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 157 transitions
Trivial Post-agglo rules discarded 157 transitions
Performed 157 trivial Post agglomeration. Transition count delta: 157
Iterating post reduction 0 with 157 rules applied. Total rules applied 158 place count 226 transition count 107
Reduce places removed 157 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 161 rules applied. Total rules applied 319 place count 69 transition count 103
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 322 place count 67 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 323 place count 66 transition count 102
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 323 place count 66 transition count 95
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 337 place count 59 transition count 95
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 345 place count 51 transition count 86
Iterating global reduction 4 with 8 rules applied. Total rules applied 353 place count 51 transition count 86
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 354 place count 51 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 355 place count 50 transition count 85
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 355 place count 50 transition count 83
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 359 place count 48 transition count 83
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 363 place count 44 transition count 73
Iterating global reduction 6 with 4 rules applied. Total rules applied 367 place count 44 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 369 place count 44 transition count 71
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 377 place count 40 transition count 67
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 381 place count 36 transition count 59
Iterating global reduction 7 with 4 rules applied. Total rules applied 385 place count 36 transition count 59
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 388 place count 36 transition count 56
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 391 place count 36 transition count 53
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 397 place count 33 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 398 place count 32 transition count 49
Applied a total of 398 rules in 16 ms. Remains 32 /261 variables (removed 229) and now considering 49/302 (removed 253) transitions.
[2024-05-29 18:18:11] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
// Phase 1: matrix 45 rows 32 cols
[2024-05-29 18:18:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-29 18:18:11] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-29 18:18:11] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
[2024-05-29 18:18:11] [INFO ] Invariant cache hit.
[2024-05-29 18:18:11] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-29 18:18:11] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-29 18:18:11] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2024-05-29 18:18:11] [INFO ] Flow matrix only has 45 transitions (discarded 4 similar events)
[2024-05-29 18:18:11] [INFO ] Invariant cache hit.
[2024-05-29 18:18:11] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 20 places in 21 ms of which 0 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 22 places in 18 ms of which 1 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 15 places in 16 ms of which 0 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 1 ms to minimize.
[2024-05-29 18:18:11] [INFO ] Deduced a trap composed of 24 places in 27 ms of which 1 ms to minimize.
[2024-05-29 18:18:12] [INFO ] Deduced a trap composed of 21 places in 18 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 44/76 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 1/77 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (OVERLAPS) 0/77 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 43 constraints, problems are : Problem set: 0 solved, 44 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (OVERLAPS) 2/32 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/32 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 44/76 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/76 variables, 44/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/76 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 1/77 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-05-29 18:18:12] [INFO ] Deduced a trap composed of 20 places in 27 ms of which 0 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/77 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/77 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 13 (OVERLAPS) 0/77 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 88 constraints, problems are : Problem set: 0 solved, 44 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 32/32 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 7/7 constraints]
After SMT, in 1541ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 1543ms
Starting structural reductions in SI_CTL mode, iteration 1 : 32/261 places, 49/302 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1637 ms. Remains : 32/261 places, 49/302 transitions.
[2024-05-29 18:18:13] [INFO ] Flatten gal took : 3 ms
[2024-05-29 18:18:13] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:18:13] [INFO ] Input system was already deterministic with 49 transitions.
[2024-05-29 18:18:13] [INFO ] Flatten gal took : 2 ms
[2024-05-29 18:18:13] [INFO ] Flatten gal took : 1 ms
[2024-05-29 18:18:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality17714924711196633870.gal : 0 ms
[2024-05-29 18:18:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality250742602760523226.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/CTLCardinality17714924711196633870.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality250742602760523226.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,362,0.00884,3612,2,226,5,998,6,0,172,1113,0


Converting to forward existential form...Done !
original formula: EG((AG(EF(((p238!=0)&&(p59!=1)))) + ((p159==0)&&(p247==1))))
=> equivalent forward existential formula: [FwdG(Init,(!(E(TRUE U !(E(TRUE U ((p238!=0)&&(p59!=1)))))) + ((p159==0)&&(p247==1))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t5, t6, t10, t13, t14, t25, t26, t27, t34, t42, t43, t44, t47, t48, Intersection with re...232
(forward)formula 0,0,0.075676,6832,1,0,136,17961,121,59,1093,16051,149
FORMULA StigmergyElection-PT-02b-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 261/261 places, 302/302 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 245 transition count 286
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 245 transition count 286
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 42 place count 235 transition count 276
Iterating global reduction 0 with 10 rules applied. Total rules applied 52 place count 235 transition count 276
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 232 transition count 273
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 232 transition count 273
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 230 transition count 271
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 230 transition count 271
Applied a total of 62 rules in 12 ms. Remains 230 /261 variables (removed 31) and now considering 271/302 (removed 31) transitions.
// Phase 1: matrix 271 rows 230 cols
[2024-05-29 18:18:13] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 18:18:13] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-29 18:18:13] [INFO ] Invariant cache hit.
[2024-05-29 18:18:13] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
Running 270 sub problems to find dead transitions.
[2024-05-29 18:18:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
[2024-05-29 18:18:16] [INFO ] Deduced a trap composed of 166 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:18:16] [INFO ] Deduced a trap composed of 165 places in 65 ms of which 2 ms to minimize.
[2024-05-29 18:18:16] [INFO ] Deduced a trap composed of 163 places in 62 ms of which 2 ms to minimize.
[2024-05-29 18:18:16] [INFO ] Deduced a trap composed of 164 places in 59 ms of which 2 ms to minimize.
[2024-05-29 18:18:16] [INFO ] Deduced a trap composed of 164 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (OVERLAPS) 0/501 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Real declared 501/501 variables, and 238 constraints, problems are : Problem set: 0 solved, 270 unsolved in 11311 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/229 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/230 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 271/501 variables, 230/238 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 270/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
At refinement iteration 7 (OVERLAPS) 0/501 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 270 unsolved
No progress, stopping.
After SMT solving in domain Int declared 501/501 variables, and 508 constraints, problems are : Problem set: 0 solved, 270 unsolved in 10150 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 230/230 constraints, PredecessorRefiner: 270/270 constraints, Known Traps: 5/5 constraints]
After SMT, in 21485ms problems are : Problem set: 0 solved, 270 unsolved
Search for dead transitions found 0 dead transitions in 21489ms
Starting structural reductions in LTL mode, iteration 1 : 230/261 places, 271/302 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21657 ms. Remains : 230/261 places, 271/302 transitions.
[2024-05-29 18:18:35] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:18:35] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:18:35] [INFO ] Input system was already deterministic with 271 transitions.
[2024-05-29 18:18:35] [INFO ] Flatten gal took : 4 ms
[2024-05-29 18:18:35] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:18:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality8113837397152486393.gal : 2 ms
[2024-05-29 18:18:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality5766394740653888077.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/CTLCardinality8113837397152486393.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5766394740653888077.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,131559,0.209517,11732,2,1908,5,26983,6,0,1193,38006,0


Converting to forward existential form...Done !
original formula: A(AX((EX((p151==1)) * AG(AF((p206==0))))) U ((AX(((EX((p24==0)) * EF(((p182==0)||(p70==1)))) * (p233==1))) + AG(E(((p256==0)||(p244==1)) ...222
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(!(((EX((p24==0)) * E(TRUE U ((p182==0)||(p70==1)))) * (p233==1))))) + !(E(TRUE U !(E(((p...731
Reverse transition relation is NOT exact ! Due to transitions t45, t54, t88, t89, t90, t123, t126, t127, t142, t151, t185, t186, t187, t220, t221, t223, t2...259
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,3.68563,131588,1,0,650,734055,588,384,7246,568879,1052
FORMULA StigmergyElection-PT-02b-CTLCardinality-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-29 18:18:38] [INFO ] Flatten gal took : 5 ms
[2024-05-29 18:18:38] [INFO ] Flatten gal took : 5 ms
Total runtime 441509 ms.

BK_STOP 1717006718851

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-02b"
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-02b, 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-171690531900257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-02b.tgz
mv StigmergyElection-PT-02b execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;