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.r202-smll-171649587400074.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 HirschbergSinclair-PT-15, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-171649587400074
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 13 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Apr 13 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 13 03:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 173K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716585105952

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-24 21:11:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 21:11:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 21:11:48] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-24 21:11:48] [INFO ] Transformed 330 places.
[2024-05-24 21:11:48] [INFO ] Transformed 296 transitions.
[2024-05-24 21:11:48] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Support contains 121 out of 330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 330/330 places, 296/296 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 315 transition count 296
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 21 place count 309 transition count 290
Iterating global reduction 1 with 6 rules applied. Total rules applied 27 place count 309 transition count 290
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 305 transition count 286
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 305 transition count 286
Applied a total of 35 rules in 244 ms. Remains 305 /330 variables (removed 25) and now considering 286/296 (removed 10) transitions.
// Phase 1: matrix 286 rows 305 cols
[2024-05-24 21:11:49] [INFO ] Computed 19 invariants in 31 ms
[2024-05-24 21:11:49] [INFO ] Implicit Places using invariants in 483 ms returned []
[2024-05-24 21:11:49] [INFO ] Invariant cache hit.
[2024-05-24 21:11:50] [INFO ] Implicit Places using invariants and state equation in 473 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
Running 271 sub problems to find dead transitions.
[2024-05-24 21:11:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 15/305 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 286/591 variables, 305/324 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/591 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 324 constraints, problems are : Problem set: 0 solved, 271 unsolved in 22613 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (OVERLAPS) 15/305 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 286/591 variables, 305/324 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/591 variables, 271/595 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 591/591 variables, and 595 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30038 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
After SMT, in 52882ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 52908ms
Starting structural reductions in LTL mode, iteration 1 : 305/330 places, 286/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54187 ms. Remains : 305/330 places, 286/296 transitions.
Support contains 121 out of 305 places after structural reductions.
[2024-05-24 21:12:43] [INFO ] Flatten gal took : 98 ms
[2024-05-24 21:12:43] [INFO ] Flatten gal took : 45 ms
[2024-05-24 21:12:43] [INFO ] Input system was already deterministic with 286 transitions.
Support contains 119 out of 305 places (down from 121) after GAL structural reductions.
RANDOM walk for 40000 steps (133 resets) in 2588 ms. (15 steps per ms) remains 7/84 properties
BEST_FIRST walk for 40003 steps (16 resets) in 244 ms. (163 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 158 ms. (251 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (20 resets) in 122 ms. (325 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (16 resets) in 212 ms. (187 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (20 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (16 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
[2024-05-24 21:12:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 239/270 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp75 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 286/556 variables, 270/289 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 0/289 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 35/591 variables, 35/324 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/591 variables, 0/324 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/591 variables, 0/324 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 591/591 variables, and 324 constraints, problems are : Problem set: 5 solved, 1 unsolved in 370 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 249/261 variables, 17/17 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/17 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 8/269 variables, 2/19 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/19 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 286/555 variables, 269/288 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/288 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 36/591 variables, 36/324 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/591 variables, 1/325 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/591 variables, 0/325 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/591 variables, 0/325 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 591/591 variables, and 325 constraints, problems are : Problem set: 5 solved, 1 unsolved in 382 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 305/305 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 771ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 12 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 286/286 transitions.
Graph (complete) has 569 edges and 305 vertex of which 303 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 80 rules applied. Total rules applied 81 place count 303 transition count 206
Reduce places removed 78 places and 0 transitions.
Graph (complete) has 396 edges and 225 vertex of which 211 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 79 rules applied. Total rules applied 160 place count 211 transition count 206
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 174 place count 211 transition count 192
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 186 place count 199 transition count 180
Iterating global reduction 3 with 12 rules applied. Total rules applied 198 place count 199 transition count 180
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 3 with 1 rules applied. Total rules applied 199 place count 199 transition count 179
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 352 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 201 place count 196 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 203 place count 196 transition count 177
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 211 place count 188 transition count 169
Iterating global reduction 6 with 8 rules applied. Total rules applied 219 place count 188 transition count 169
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 231 place count 188 transition count 157
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 243 place count 176 transition count 157
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 253 place count 166 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 254 place count 165 transition count 147
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 254 place count 165 transition count 138
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 8 with 18 rules applied. Total rules applied 272 place count 156 transition count 138
Applied a total of 272 rules in 114 ms. Remains 156 /305 variables (removed 149) and now considering 138/286 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 156/305 places, 138/286 transitions.
RANDOM walk for 40000 steps (256 resets) in 364 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (54 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1409519 steps, run timeout after 3001 ms. (steps per millisecond=469 ) properties seen :0 out of 1
Probabilistic random walk after 1409519 steps, saw 270745 distinct states, run finished after 3013 ms. (steps per millisecond=467 ) properties seen :0
// Phase 1: matrix 138 rows 156 cols
[2024-05-24 21:12:49] [INFO ] Computed 18 invariants in 3 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/140 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/146 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 134/280 variables, 146/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 14/294 variables, 10/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/294 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 127/140 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/140 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 6/146 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 134/280 variables, 146/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/294 variables, 10/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/294 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 12 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 138/138 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 156/156 places, 138/138 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 138/138 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2024-05-24 21:12:49] [INFO ] Invariant cache hit.
[2024-05-24 21:12:49] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-24 21:12:49] [INFO ] Invariant cache hit.
[2024-05-24 21:12:50] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2024-05-24 21:12:50] [INFO ] Redundant transitions in 3 ms returned []
Running 131 sub problems to find dead transitions.
[2024-05-24 21:12:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 7/156 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 138/294 variables, 156/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 174 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5543 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 7/156 variables, 14/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 138/294 variables, 156/174 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 131/305 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/294 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 305 constraints, problems are : Problem set: 0 solved, 131 unsolved in 9823 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 156/156 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 15400ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 15404ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15995 ms. Remains : 156/156 places, 138/138 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 153 transition count 121
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 136 transition count 121
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 37 place count 136 transition count 90
Deduced a syphon composed of 31 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 100 place count 104 transition count 90
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 101 place count 103 transition count 90
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 101 place count 103 transition count 89
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 102 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 104 place count 101 transition count 88
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 101 transition count 88
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 115 place count 96 transition count 83
Applied a total of 115 rules in 43 ms. Remains 96 /156 variables (removed 60) and now considering 83/138 (removed 55) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 83 rows 96 cols
[2024-05-24 21:13:05] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 21:13:05] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 21:13:05] [INFO ] [Real]Absence check using 1 positive and 12 generalized place invariants in 18 ms returned sat
[2024-05-24 21:13:05] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 21:13:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 21:13:05] [INFO ] [Nat]Absence check using 1 positive and 12 generalized place invariants in 17 ms returned sat
[2024-05-24 21:13:06] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-24 21:13:06] [INFO ] After 113ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-24 21:13:06] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 366 ms.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
[2024-05-24 21:13:06] [INFO ] Flatten gal took : 91 ms
[2024-05-24 21:13:06] [INFO ] Flatten gal took : 57 ms
[2024-05-24 21:13:06] [INFO ] Input system was already deterministic with 286 transitions.
Support contains 94 out of 305 places (down from 106) after GAL structural reductions.
FORMULA HirschbergSinclair-PT-15-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 305 stabilizing places and 286 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 305 transition count 286
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 305/305 places, 286/286 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 123 transitions
Trivial Post-agglo rules discarded 123 transitions
Performed 123 trivial Post agglomeration. Transition count delta: 123
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 291 transition count 149
Reduce places removed 123 places and 0 transitions.
Iterating post reduction 1 with 123 rules applied. Total rules applied 246 place count 168 transition count 149
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 257 place count 157 transition count 138
Iterating global reduction 2 with 11 rules applied. Total rules applied 268 place count 157 transition count 138
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 2 with 2 rules applied. Total rules applied 270 place count 157 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 272 place count 155 transition count 136
Applied a total of 272 rules in 44 ms. Remains 155 /305 variables (removed 150) and now considering 136/286 (removed 150) transitions.
// Phase 1: matrix 136 rows 155 cols
[2024-05-24 21:13:06] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 21:13:06] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-24 21:13:06] [INFO ] Invariant cache hit.
[2024-05-24 21:13:06] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 21:13:07] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-24 21:13:07] [INFO ] Redundant transitions in 4 ms returned []
Running 110 sub problems to find dead transitions.
[2024-05-24 21:13:07] [INFO ] Invariant cache hit.
[2024-05-24 21:13:07] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 3/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 113/245 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 0/245 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 245/291 variables, and 160 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4765 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 132/155 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 3/132 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 113/245 variables, 132/151 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/245 variables, 9/160 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 110/270 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (OVERLAPS) 0/245 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 245/291 variables, and 270 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4755 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 132/155 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 0/0 constraints]
After SMT, in 9537ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 9539ms
Starting structural reductions in SI_CTL mode, iteration 1 : 155/305 places, 136/286 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10115 ms. Remains : 155/305 places, 136/286 transitions.
[2024-05-24 21:13:16] [INFO ] Flatten gal took : 16 ms
[2024-05-24 21:13:16] [INFO ] Flatten gal took : 22 ms
[2024-05-24 21:13:16] [INFO ] Input system was already deterministic with 136 transitions.
[2024-05-24 21:13:16] [INFO ] Flatten gal took : 14 ms
[2024-05-24 21:13:16] [INFO ] Flatten gal took : 13 ms
[2024-05-24 21:13:16] [INFO ] Time to serialize gal into /tmp/CTLFireability6853708413255005305.gal : 7 ms
[2024-05-24 21:13:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17245602204937659755.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/CTLFireability6853708413255005305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17245602204937659755.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,4.06406e+12,0.153951,7060,2,2351,5,15793,6,0,729,12850,0


Converting to forward existential form...Done !
original formula: EF(EG((init2>=1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(init2>=1))] != FALSE
dead was empty
(forward)formula 0,0,3.23955,89744,1,0,159,428386,12,2,3472,336071,156
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 286/286 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 294 transition count 275
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 294 transition count 275
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 285 transition count 266
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 285 transition count 266
Applied a total of 40 rules in 31 ms. Remains 285 /305 variables (removed 20) and now considering 266/286 (removed 20) transitions.
// Phase 1: matrix 266 rows 285 cols
[2024-05-24 21:13:20] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 21:13:20] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-24 21:13:20] [INFO ] Invariant cache hit.
[2024-05-24 21:13:20] [INFO ] Implicit Places using invariants and state equation in 652 ms returned []
Implicit Place search using SMT with State Equation took 847 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-05-24 21:13:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 20318 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 50442ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 50445ms
Starting structural reductions in LTL mode, iteration 1 : 285/305 places, 266/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51325 ms. Remains : 285/305 places, 266/286 transitions.
[2024-05-24 21:14:11] [INFO ] Flatten gal took : 27 ms
[2024-05-24 21:14:11] [INFO ] Flatten gal took : 26 ms
[2024-05-24 21:14:11] [INFO ] Input system was already deterministic with 266 transitions.
[2024-05-24 21:14:11] [INFO ] Flatten gal took : 25 ms
[2024-05-24 21:14:11] [INFO ] Flatten gal took : 24 ms
[2024-05-24 21:14:11] [INFO ] Time to serialize gal into /tmp/CTLFireability14719175785199165200.gal : 7 ms
[2024-05-24 21:14:11] [INFO ] Time to serialize properties into /tmp/CTLFireability9412341872600812100.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14719175785199165200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9412341872600812100.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,7.70338e+16,1.21914,29612,2,22806,5,101989,6,0,1394,101779,0


Converting to forward existential form...Done !
original formula: !(A(AG((!(EF(((newmsg6>=1)&&(election_15_4_9_to_left_7>=1)))) * AX((rcv_left_election_15_4_4_4<1)))) U !(AX(AF(((newmsg15>=1)&&(reply_15_...176
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(EX(!(!(EG(!(((newmsg15>=1)&&(reply_15_3_to_left_1>=1))))))))))) * !(!(E(TRUE U !((!(E(TRUE U...423
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t24, t26...380
Detected timeout of ITS tools.
[2024-05-24 21:14:41] [INFO ] Flatten gal took : 15 ms
[2024-05-24 21:14:41] [INFO ] Applying decomposition
[2024-05-24 21:14:41] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9830124728967899549.txt' '-o' '/tmp/graph9830124728967899549.bin' '-w' '/tmp/graph9830124728967899549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9830124728967899549.bin' '-l' '-1' '-v' '-w' '/tmp/graph9830124728967899549.weights' '-q' '0' '-e' '0.001'
[2024-05-24 21:14:41] [INFO ] Decomposing Gal with order
[2024-05-24 21:14:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 21:14:42] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-24 21:14:42] [INFO ] Flatten gal took : 122 ms
[2024-05-24 21:14:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2024-05-24 21:14:42] [INFO ] Time to serialize gal into /tmp/CTLFireability12685742132995744939.gal : 14 ms
[2024-05-24 21:14:42] [INFO ] Time to serialize properties into /tmp/CTLFireability12062063324320214228.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/CTLFireability12685742132995744939.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12062063324320214228.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.70338e+16,5.17586,113532,5188,2772,189966,57122,725,339495,250,257661,0


Converting to forward existential form...Done !
original formula: !(A(AG((!(EF(((i5.u5.newmsg6>=1)&&(i6.u29.election_15_4_9_to_left_7>=1)))) * AX((i4.u31.rcv_left_election_15_4_4_4<1)))) U !(AX(AF(((i3.u...210
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(EX(!(!(EG(!(((i3.u12.newmsg15>=1)&&(i3.u12.reply_15_3_to_left_1>=1))))))))))) * !(!(E(TRUE U...485
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t5, t6, t7, t8, t9, t11, t13, t14, t24, t40, t48, t220, t265, i0.t20, i0.u1.t...533
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 286/286 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 294 transition count 275
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 294 transition count 275
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 285 transition count 266
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 285 transition count 266
Applied a total of 40 rules in 27 ms. Remains 285 /305 variables (removed 20) and now considering 266/286 (removed 20) transitions.
[2024-05-24 21:15:12] [INFO ] Invariant cache hit.
[2024-05-24 21:15:12] [INFO ] Implicit Places using invariants in 368 ms returned []
[2024-05-24 21:15:12] [INFO ] Invariant cache hit.
[2024-05-24 21:15:13] [INFO ] Implicit Places using invariants and state equation in 946 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-05-24 21:15:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 21125 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 51244ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 51250ms
Starting structural reductions in LTL mode, iteration 1 : 285/305 places, 266/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52595 ms. Remains : 285/305 places, 266/286 transitions.
[2024-05-24 21:16:04] [INFO ] Flatten gal took : 23 ms
[2024-05-24 21:16:04] [INFO ] Flatten gal took : 20 ms
[2024-05-24 21:16:04] [INFO ] Input system was already deterministic with 266 transitions.
[2024-05-24 21:16:04] [INFO ] Flatten gal took : 18 ms
[2024-05-24 21:16:04] [INFO ] Flatten gal took : 17 ms
[2024-05-24 21:16:04] [INFO ] Time to serialize gal into /tmp/CTLFireability8559079029122008321.gal : 8 ms
[2024-05-24 21:16:04] [INFO ] Time to serialize properties into /tmp/CTLFireability9789127982934453121.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/CTLFireability8559079029122008321.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9789127982934453121.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,7.70338e+16,1.09827,29380,2,22806,5,101989,6,0,1394,101779,0


Converting to forward existential form...Done !
original formula: AF(EG(A(EG((rcv_left_reply_15_3_13>=1)) U !(EX((rcv_right_election_15_4_1_14>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((E(!(!(EX((rcv_right_election_15_4_1_14>=1)))) U (!(EG((rcv_left_reply_15_3_13>=1))) * !(!(EX(...257
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t24, t26...380
Detected timeout of ITS tools.
[2024-05-24 21:16:35] [INFO ] Flatten gal took : 13 ms
[2024-05-24 21:16:35] [INFO ] Applying decomposition
[2024-05-24 21:16:35] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4118511458316495317.txt' '-o' '/tmp/graph4118511458316495317.bin' '-w' '/tmp/graph4118511458316495317.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4118511458316495317.bin' '-l' '-1' '-v' '-w' '/tmp/graph4118511458316495317.weights' '-q' '0' '-e' '0.001'
[2024-05-24 21:16:35] [INFO ] Decomposing Gal with order
[2024-05-24 21:16:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 21:16:35] [INFO ] Removed a total of 36 redundant transitions.
[2024-05-24 21:16:35] [INFO ] Flatten gal took : 61 ms
[2024-05-24 21:16:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 21:16:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17472468904923438209.gal : 6 ms
[2024-05-24 21:16:35] [INFO ] Time to serialize properties into /tmp/CTLFireability9051937524750021085.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/CTLFireability17472468904923438209.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9051937524750021085.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.70338e+16,1.74794,49412,2755,3108,69093,35586,726,143150,242,155891,0


Converting to forward existential form...Done !
original formula: AF(EG(A(EG((i8.u11.rcv_left_reply_15_3_13>=1)) U !(EX((i8.u29.rcv_right_election_15_4_1_14>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((E(!(!(EX((i8.u29.rcv_right_election_15_4_1_14>=1)))) U (!(EG((i8.u11.rcv_left_reply_15_3_13>=...285
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t7, t8, t10, t12, t13, t14, t24, t48, t220, t265, i0.t20, i0.u1.t18, i1.t...550
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 286/286 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 295 transition count 276
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 295 transition count 276
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 287 transition count 268
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 287 transition count 268
Applied a total of 36 rules in 12 ms. Remains 287 /305 variables (removed 18) and now considering 268/286 (removed 18) transitions.
// Phase 1: matrix 268 rows 287 cols
[2024-05-24 21:17:05] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 21:17:05] [INFO ] Implicit Places using invariants in 219 ms returned []
[2024-05-24 21:17:05] [INFO ] Invariant cache hit.
[2024-05-24 21:17:06] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1290 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-24 21:17:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 22159 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 52265ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 52269ms
Starting structural reductions in LTL mode, iteration 1 : 287/305 places, 268/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53572 ms. Remains : 287/305 places, 268/286 transitions.
[2024-05-24 21:17:58] [INFO ] Flatten gal took : 15 ms
[2024-05-24 21:17:58] [INFO ] Flatten gal took : 10 ms
[2024-05-24 21:17:58] [INFO ] Input system was already deterministic with 268 transitions.
[2024-05-24 21:17:58] [INFO ] Flatten gal took : 9 ms
[2024-05-24 21:17:59] [INFO ] Flatten gal took : 10 ms
[2024-05-24 21:17:59] [INFO ] Time to serialize gal into /tmp/CTLFireability7856266227324141049.gal : 3 ms
[2024-05-24 21:17:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14388233951312555542.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7856266227324141049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14388233951312555542.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,9.80696e+16,1.25401,30656,2,23673,5,107363,6,0,1404,106892,0


Converting to forward existential form...Done !
original formula: AF((((newmsg7>=1)&&(election_8_0_1_to_left_8>=1)) * (((!(E((rcv_left_election_15_4_8_8<1) U ((rcv_right_election_15_4_3_12>=1)||(rcv_left...420
=> equivalent forward existential formula: [FwdG(Init,!((((newmsg7>=1)&&(election_8_0_1_to_left_8>=1)) * (((!(E((rcv_left_election_15_4_8_8<1) U ((rcv_righ...636
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t24, t26...380
Detected timeout of ITS tools.
[2024-05-24 21:18:29] [INFO ] Flatten gal took : 17 ms
[2024-05-24 21:18:29] [INFO ] Applying decomposition
[2024-05-24 21:18:29] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12340810917110051965.txt' '-o' '/tmp/graph12340810917110051965.bin' '-w' '/tmp/graph12340810917110051965.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12340810917110051965.bin' '-l' '-1' '-v' '-w' '/tmp/graph12340810917110051965.weights' '-q' '0' '-e' '0.001'
[2024-05-24 21:18:29] [INFO ] Decomposing Gal with order
[2024-05-24 21:18:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 21:18:29] [INFO ] Removed a total of 34 redundant transitions.
[2024-05-24 21:18:29] [INFO ] Flatten gal took : 34 ms
[2024-05-24 21:18:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2024-05-24 21:18:29] [INFO ] Time to serialize gal into /tmp/CTLFireability16993545244005814688.gal : 9 ms
[2024-05-24 21:18:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1504244710508498064.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability16993545244005814688.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1504244710508498064.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.80696e+16,3.73059,86736,3215,3017,136014,50060,820,310451,280,237549,0


Converting to forward existential form...Done !
original formula: AF((((i5.i0.u14.newmsg7>=1)&&(i5.i0.u14.election_8_0_1_to_left_8>=1)) * (((!(E((i3.u29.rcv_left_election_15_4_8_8<1) U ((i1.i0.u6.rcv_rig...521
=> equivalent forward existential formula: [FwdG(Init,!((((i5.i0.u14.newmsg7>=1)&&(i5.i0.u14.election_8_0_1_to_left_8>=1)) * (((!(E((i3.u29.rcv_left_electi...761
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t7, t9, t10, t12, t13, t14, t24, t46, t222, t267, i0.u0.t20, i0.u1.t18, i...577
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 305/305 places, 286/286 transitions.
Reduce places removed 15 places and 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 290 transition count 149
Reduce places removed 122 places and 0 transitions.
Iterating post reduction 1 with 122 rules applied. Total rules applied 244 place count 168 transition count 149
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 254 place count 158 transition count 139
Iterating global reduction 2 with 10 rules applied. Total rules applied 264 place count 158 transition count 139
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 2 with 2 rules applied. Total rules applied 266 place count 158 transition count 137
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 268 place count 156 transition count 137
Applied a total of 268 rules in 18 ms. Remains 156 /305 variables (removed 149) and now considering 137/286 (removed 149) transitions.
// Phase 1: matrix 137 rows 156 cols
[2024-05-24 21:18:59] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 21:18:59] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-24 21:18:59] [INFO ] Invariant cache hit.
[2024-05-24 21:19:00] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2024-05-24 21:19:00] [INFO ] Redundant transitions in 6 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-24 21:19:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 112/241 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (OVERLAPS) 2/243 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/243 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/243 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/293 variables, and 150 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6382 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 131/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 2/129 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 112/241 variables, 129/148 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 108/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 2/243 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 9 (OVERLAPS) 0/243 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/293 variables, and 258 constraints, problems are : Problem set: 0 solved, 108 unsolved in 6987 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 131/156 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 13387ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 13389ms
Starting structural reductions in SI_CTL mode, iteration 1 : 156/305 places, 137/286 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14106 ms. Remains : 156/305 places, 137/286 transitions.
[2024-05-24 21:19:13] [INFO ] Flatten gal took : 8 ms
[2024-05-24 21:19:13] [INFO ] Flatten gal took : 7 ms
[2024-05-24 21:19:13] [INFO ] Input system was already deterministic with 137 transitions.
[2024-05-24 21:19:13] [INFO ] Flatten gal took : 7 ms
[2024-05-24 21:19:13] [INFO ] Flatten gal took : 7 ms
[2024-05-24 21:19:13] [INFO ] Time to serialize gal into /tmp/CTLFireability11010135951124744476.gal : 3 ms
[2024-05-24 21:19:13] [INFO ] Time to serialize properties into /tmp/CTLFireability10944120679292621314.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/CTLFireability11010135951124744476.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10944120679292621314.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,6.38745e+12,0.121001,6904,2,2096,5,14360,6,0,733,11193,0


Converting to forward existential form...Done !
original formula: EG((rcv_left_election_12_0_1_13<1))
=> equivalent forward existential formula: [FwdG(Init,(rcv_left_election_12_0_1_13<1))] != FALSE
Hit Full ! (commute/partial/dont) 135/0/2
(forward)formula 0,1,3.34301,84192,1,0,161,408424,18,4,3736,320150,158
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-04 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 : 305/305 places, 286/286 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 295 transition count 276
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 295 transition count 276
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 29 place count 286 transition count 267
Iterating global reduction 0 with 9 rules applied. Total rules applied 38 place count 286 transition count 267
Applied a total of 38 rules in 12 ms. Remains 286 /305 variables (removed 19) and now considering 267/286 (removed 19) transitions.
// Phase 1: matrix 267 rows 286 cols
[2024-05-24 21:19:16] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 21:19:17] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-24 21:19:17] [INFO ] Invariant cache hit.
[2024-05-24 21:19:18] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-24 21:19:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 305 constraints, problems are : Problem set: 0 solved, 252 unsolved in 23690 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 252/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 557 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 53811ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 53816ms
Starting structural reductions in LTL mode, iteration 1 : 286/305 places, 267/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55075 ms. Remains : 286/305 places, 267/286 transitions.
[2024-05-24 21:20:11] [INFO ] Flatten gal took : 11 ms
[2024-05-24 21:20:12] [INFO ] Flatten gal took : 11 ms
[2024-05-24 21:20:12] [INFO ] Input system was already deterministic with 267 transitions.
[2024-05-24 21:20:12] [INFO ] Flatten gal took : 11 ms
[2024-05-24 21:20:12] [INFO ] Flatten gal took : 11 ms
[2024-05-24 21:20:12] [INFO ] Time to serialize gal into /tmp/CTLFireability17144467383800861119.gal : 3 ms
[2024-05-24 21:20:12] [INFO ] Time to serialize properties into /tmp/CTLFireability17745532704588524838.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/CTLFireability17144467383800861119.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17745532704588524838.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,9.19073e+16,1.18899,29548,2,22773,5,102605,6,0,1399,102143,0


Converting to forward existential form...Done !
original formula: EG(EF(EX((((rcv_right_election_15_4_9_6<1) * AF(((newmsg8>=1)&&(election_15_4_8_to_right_7>=1)))) * A(((newmsg9>=1)&&(reply_15_3_to_right...216
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX((((rcv_right_election_15_4_9_6<1) * !(EG(!(((newmsg8>=1)&&(election_15_4_8_to_right_7>=1)...392
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t24, t26...380
Detected timeout of ITS tools.
[2024-05-24 21:20:42] [INFO ] Flatten gal took : 8 ms
[2024-05-24 21:20:42] [INFO ] Applying decomposition
[2024-05-24 21:20:42] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14542162124853308441.txt' '-o' '/tmp/graph14542162124853308441.bin' '-w' '/tmp/graph14542162124853308441.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14542162124853308441.bin' '-l' '-1' '-v' '-w' '/tmp/graph14542162124853308441.weights' '-q' '0' '-e' '0.001'
[2024-05-24 21:20:42] [INFO ] Decomposing Gal with order
[2024-05-24 21:20:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 21:20:42] [INFO ] Removed a total of 21 redundant transitions.
[2024-05-24 21:20:42] [INFO ] Flatten gal took : 18 ms
[2024-05-24 21:20:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 21:20:42] [INFO ] Time to serialize gal into /tmp/CTLFireability10856418070236611821.gal : 7 ms
[2024-05-24 21:20:42] [INFO ] Time to serialize properties into /tmp/CTLFireability2516290892857587197.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/CTLFireability10856418070236611821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2516290892857587197.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.19073e+16,3.20596,76336,2479,3819,96307,80144,754,212919,285,371544,0


Converting to forward existential form...Done !
original formula: EG(EF(EX((((i7.u5.rcv_right_election_15_4_9_6<1) * AF(((i2.u7.newmsg8>=1)&&(i2.u7.election_15_4_8_to_right_7>=1)))) * A(((i3.u8.newmsg9>=...258
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX((((i7.u5.rcv_right_election_15_4_9_6<1) * !(EG(!(((i2.u7.newmsg8>=1)&&(i2.u7.election_15_...458
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t7, t8, t10, t12, t13, t14, t24, t32, t221, t266, i0.t20, i0.u1.t18, ...555
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 305/305 places, 286/286 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 291 transition count 161
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 180 transition count 161
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 233 place count 169 transition count 150
Iterating global reduction 2 with 11 rules applied. Total rules applied 244 place count 169 transition count 150
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 2 with 2 rules applied. Total rules applied 246 place count 169 transition count 148
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 248 place count 167 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 249 place count 166 transition count 147
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 166 transition count 147
Applied a total of 250 rules in 37 ms. Remains 166 /305 variables (removed 139) and now considering 147/286 (removed 139) transitions.
// Phase 1: matrix 147 rows 166 cols
[2024-05-24 21:21:12] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 21:21:12] [INFO ] Implicit Places using invariants in 330 ms returned []
[2024-05-24 21:21:12] [INFO ] Invariant cache hit.
[2024-05-24 21:21:13] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2024-05-24 21:21:13] [INFO ] Redundant transitions in 8 ms returned []
Running 121 sub problems to find dead transitions.
[2024-05-24 21:21:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/267 variables, 143/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/313 variables, and 162 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6472 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 143/166 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/267 variables, 143/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 121/283 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/313 variables, and 283 constraints, problems are : Problem set: 0 solved, 121 unsolved in 5849 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 143/166 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 12345ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 12348ms
Starting structural reductions in SI_CTL mode, iteration 1 : 166/305 places, 147/286 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13267 ms. Remains : 166/305 places, 147/286 transitions.
[2024-05-24 21:21:25] [INFO ] Flatten gal took : 4 ms
[2024-05-24 21:21:25] [INFO ] Flatten gal took : 4 ms
[2024-05-24 21:21:25] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-24 21:21:25] [INFO ] Flatten gal took : 4 ms
[2024-05-24 21:21:25] [INFO ] Flatten gal took : 4 ms
[2024-05-24 21:21:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16254104471849879904.gal : 1 ms
[2024-05-24 21:21:25] [INFO ] Time to serialize properties into /tmp/CTLFireability11447593578795756041.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/CTLFireability16254104471849879904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11447593578795756041.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.46255e+12,0.19102,7232,2,2544,5,16337,6,0,786,12507,0


Converting to forward existential form...Done !
original formula: A(EF((rcv_right_election_15_1_1_14<1)) U ((newmsg2>=1)&&(election_15_4_2_to_right_1>=1)))
=> equivalent forward existential formula: [((Init * !(EG(!(((newmsg2>=1)&&(election_15_4_2_to_right_1>=1)))))) * !(E(!(((newmsg2>=1)&&(election_15_4_2_to_...284
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t7, t8, t10, t12, t14, t16, t18, t20, t22, t24, t26, t28, t114, t131, Inters...248
(forward)formula 0,0,7.32444,197112,1,0,1027,1.09779e+06,322,459,4880,962861,1089
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 286/286 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 294 transition count 275
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 294 transition count 275
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 285 transition count 266
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 285 transition count 266
Applied a total of 40 rules in 13 ms. Remains 285 /305 variables (removed 20) and now considering 266/286 (removed 20) transitions.
// Phase 1: matrix 266 rows 285 cols
[2024-05-24 21:21:32] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 21:21:33] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-24 21:21:33] [INFO ] Invariant cache hit.
[2024-05-24 21:21:33] [INFO ] Implicit Places using invariants and state equation in 673 ms returned []
Implicit Place search using SMT with State Equation took 867 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-05-24 21:21:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 20415 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 50533ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 50539ms
Starting structural reductions in LTL mode, iteration 1 : 285/305 places, 266/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51420 ms. Remains : 285/305 places, 266/286 transitions.
[2024-05-24 21:22:24] [INFO ] Flatten gal took : 12 ms
[2024-05-24 21:22:24] [INFO ] Flatten gal took : 10 ms
[2024-05-24 21:22:24] [INFO ] Input system was already deterministic with 266 transitions.
[2024-05-24 21:22:24] [INFO ] Flatten gal took : 9 ms
[2024-05-24 21:22:24] [INFO ] Flatten gal took : 9 ms
[2024-05-24 21:22:24] [INFO ] Time to serialize gal into /tmp/CTLFireability10776258363616084192.gal : 3 ms
[2024-05-24 21:22:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13654645250824405707.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/CTLFireability10776258363616084192.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13654645250824405707.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,7.70338e+16,1.38097,29384,2,22806,5,101989,6,0,1394,101779,0


Converting to forward existential form...Done !
original formula: AX(AX(EF(((rcv_left_election_15_1_1_1>=1)||(init8>=1)))))
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U ((rcv_left_election_15_1_1_1>=1)||(init8>=1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t24, t26...380
(forward)formula 0,1,27.2239,654196,1,0,515,3.43121e+06,553,277,8616,1.88072e+06,557
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-08 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 : 305/305 places, 286/286 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 294 transition count 275
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 294 transition count 275
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 285 transition count 266
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 285 transition count 266
Applied a total of 40 rules in 13 ms. Remains 285 /305 variables (removed 20) and now considering 266/286 (removed 20) transitions.
[2024-05-24 21:22:52] [INFO ] Invariant cache hit.
[2024-05-24 21:22:52] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-24 21:22:52] [INFO ] Invariant cache hit.
[2024-05-24 21:22:53] [INFO ] Implicit Places using invariants and state equation in 1018 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-05-24 21:22:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 22625 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 52745ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 52752ms
Starting structural reductions in LTL mode, iteration 1 : 285/305 places, 266/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54054 ms. Remains : 285/305 places, 266/286 transitions.
[2024-05-24 21:23:46] [INFO ] Flatten gal took : 12 ms
[2024-05-24 21:23:46] [INFO ] Flatten gal took : 11 ms
[2024-05-24 21:23:46] [INFO ] Input system was already deterministic with 266 transitions.
[2024-05-24 21:23:46] [INFO ] Flatten gal took : 12 ms
[2024-05-24 21:23:46] [INFO ] Flatten gal took : 11 ms
[2024-05-24 21:23:46] [INFO ] Time to serialize gal into /tmp/CTLFireability12932494590410123063.gal : 4 ms
[2024-05-24 21:23:46] [INFO ] Time to serialize properties into /tmp/CTLFireability11174844129736217228.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/CTLFireability12932494590410123063.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11174844129736217228.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,7.70338e+16,1.34387,29364,2,22806,5,101989,6,0,1394,101779,0


Converting to forward existential form...Done !
original formula: (AF((EG(AX((rcv_right_reply_15_3_1<1))) * (rcv_right_election_15_3_5_10>=1))) + !(A((rcv_left_reply_15_3_11>=1) U AG(!(EF((rcv_right_repl...173
=> equivalent forward existential formula: [FwdG((Init * !(!(!((E(!(!(E(TRUE U !(!(E(TRUE U (rcv_right_reply_15_1_1>=1))))))) U (!((rcv_left_reply_15_3_11>...386
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t24, t26...380
Detected timeout of ITS tools.
[2024-05-24 21:24:16] [INFO ] Flatten gal took : 8 ms
[2024-05-24 21:24:16] [INFO ] Applying decomposition
[2024-05-24 21:24:16] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph14100314152686089586.txt' '-o' '/tmp/graph14100314152686089586.bin' '-w' '/tmp/graph14100314152686089586.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph14100314152686089586.bin' '-l' '-1' '-v' '-w' '/tmp/graph14100314152686089586.weights' '-q' '0' '-e' '0.001'
[2024-05-24 21:24:16] [INFO ] Decomposing Gal with order
[2024-05-24 21:24:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 21:24:16] [INFO ] Removed a total of 30 redundant transitions.
[2024-05-24 21:24:16] [INFO ] Flatten gal took : 17 ms
[2024-05-24 21:24:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 21:24:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8816683584591092102.gal : 4 ms
[2024-05-24 21:24:16] [INFO ] Time to serialize properties into /tmp/CTLFireability694033644392949728.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/CTLFireability8816683584591092102.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability694033644392949728.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.70338e+16,2.12212,54188,2648,3023,73037,52909,766,132543,267,229330,0


Converting to forward existential form...Done !
original formula: (AF((EG(AX((i0.u0.rcv_right_reply_15_3_1<1))) * (i3.i1.u9.rcv_right_election_15_3_5_10>=1))) + !(A((i4.u28.rcv_left_reply_15_3_11>=1) U A...201
=> equivalent forward existential formula: [FwdG((Init * !(!(!((E(!(!(E(TRUE U !(!(E(TRUE U (i0.u0.rcv_right_reply_15_1_1>=1))))))) U (!((i4.u28.rcv_left_r...426
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t5, t7, t10, t12, t13, t14, t32, t220, t265, i0.t1, i0.u0.t20, i0.u1.t18, i0....576
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 286/286 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 294 transition count 275
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 294 transition count 275
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 286 transition count 267
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 286 transition count 267
Applied a total of 38 rules in 12 ms. Remains 286 /305 variables (removed 19) and now considering 267/286 (removed 19) transitions.
// Phase 1: matrix 267 rows 286 cols
[2024-05-24 21:24:46] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 21:24:46] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-24 21:24:46] [INFO ] Invariant cache hit.
[2024-05-24 21:24:47] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
Running 252 sub problems to find dead transitions.
[2024-05-24 21:24:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/553 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 553/553 variables, and 305 constraints, problems are : Problem set: 0 solved, 252 unsolved in 22167 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (OVERLAPS) 15/286 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 267/553 variables, 286/305 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 252/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 553/553 variables, and 557 constraints, problems are : Problem set: 0 solved, 252 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 52248ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 52251ms
Starting structural reductions in LTL mode, iteration 1 : 286/305 places, 267/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53164 ms. Remains : 286/305 places, 267/286 transitions.
[2024-05-24 21:25:39] [INFO ] Flatten gal took : 7 ms
[2024-05-24 21:25:39] [INFO ] Flatten gal took : 7 ms
[2024-05-24 21:25:39] [INFO ] Input system was already deterministic with 267 transitions.
[2024-05-24 21:25:39] [INFO ] Flatten gal took : 7 ms
[2024-05-24 21:25:39] [INFO ] Flatten gal took : 7 ms
[2024-05-24 21:25:39] [INFO ] Time to serialize gal into /tmp/CTLFireability9867917039659426622.gal : 5 ms
[2024-05-24 21:25:39] [INFO ] Time to serialize properties into /tmp/CTLFireability2476475022625520722.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/CTLFireability9867917039659426622.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2476475022625520722.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.18726e+16,1.20425,29724,2,22852,5,102939,6,0,1399,102251,0


Converting to forward existential form...Done !
original formula: A(((newmsg14>=1)&&(elected_15_to_left15>=1)) U EG(!((AF(((newmsg10>=1)&&(election_9_0_1_to_right_9>=1))) + (AF((rcv_right_reply_15_3_15>=...180
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!((!(EG(!(((newmsg10>=1)&&(election_9_0_1_to_right_9>=1))))) + (!(EG(!((rcv_right_reply_15_3...521
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t24, t26...380
Detected timeout of ITS tools.
[2024-05-24 21:26:09] [INFO ] Flatten gal took : 12 ms
[2024-05-24 21:26:09] [INFO ] Applying decomposition
[2024-05-24 21:26:09] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11025077524414977608.txt' '-o' '/tmp/graph11025077524414977608.bin' '-w' '/tmp/graph11025077524414977608.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11025077524414977608.bin' '-l' '-1' '-v' '-w' '/tmp/graph11025077524414977608.weights' '-q' '0' '-e' '0.001'
[2024-05-24 21:26:09] [INFO ] Decomposing Gal with order
[2024-05-24 21:26:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 21:26:09] [INFO ] Removed a total of 15 redundant transitions.
[2024-05-24 21:26:09] [INFO ] Flatten gal took : 28 ms
[2024-05-24 21:26:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-24 21:26:09] [INFO ] Time to serialize gal into /tmp/CTLFireability5048097376231580982.gal : 5 ms
[2024-05-24 21:26:09] [INFO ] Time to serialize properties into /tmp/CTLFireability10216812223501539145.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/CTLFireability5048097376231580982.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10216812223501539145.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.18726e+16,3.72454,88988,2713,4751,111580,83991,707,257455,296,426031,0


Converting to forward existential form...Done !
original formula: A(((i3.u8.newmsg14>=1)&&(i8.u23.elected_15_to_left15>=1)) U EG(!((AF(((i7.u4.newmsg10>=1)&&(i7.u4.election_9_0_1_to_right_9>=1))) + (AF((...218
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!((!(EG(!(((i7.u4.newmsg10>=1)&&(i7.u4.election_9_0_1_to_right_9>=1))))) + (!(EG(!((i4.u9.rc...609
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t4, t5, t6, t7, t8, t10, t12, t13, t14, t24, t40, t48, t251, t266, i0.t28, i0.t3, i0....539
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 286/286 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 295 transition count 276
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 295 transition count 276
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 287 transition count 268
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 287 transition count 268
Applied a total of 36 rules in 20 ms. Remains 287 /305 variables (removed 18) and now considering 268/286 (removed 18) transitions.
// Phase 1: matrix 268 rows 287 cols
[2024-05-24 21:26:39] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 21:26:40] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-24 21:26:40] [INFO ] Invariant cache hit.
[2024-05-24 21:26:41] [INFO ] Implicit Places using invariants and state equation in 1012 ms returned []
Implicit Place search using SMT with State Equation took 1371 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-24 21:26:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 22664 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 52789ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 52794ms
Starting structural reductions in LTL mode, iteration 1 : 287/305 places, 268/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54188 ms. Remains : 287/305 places, 268/286 transitions.
[2024-05-24 21:27:34] [INFO ] Flatten gal took : 11 ms
[2024-05-24 21:27:34] [INFO ] Flatten gal took : 12 ms
[2024-05-24 21:27:34] [INFO ] Input system was already deterministic with 268 transitions.
[2024-05-24 21:27:34] [INFO ] Flatten gal took : 11 ms
[2024-05-24 21:27:34] [INFO ] Flatten gal took : 14 ms
[2024-05-24 21:27:34] [INFO ] Time to serialize gal into /tmp/CTLFireability14367065450535998098.gal : 2 ms
[2024-05-24 21:27:34] [INFO ] Time to serialize properties into /tmp/CTLFireability16396442152928973541.ctl : 80 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/CTLFireability14367065450535998098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16396442152928973541.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,9.80409e+16,1.36297,29348,2,22193,5,100306,6,0,1404,101740,0


Converting to forward existential form...Done !
original formula: (EF(((((AG(E((rcv_left_election_2_0_1_3>=1) U (init9>=1))) + (newmsg1<1)) + (election_15_1_1_to_right_15<1)) * (newmsg7>=1)) * (election_...387
=> equivalent forward existential formula: [((EY((Init * E(TRUE U ((((!(E(TRUE U !(E((rcv_left_election_2_0_1_3>=1) U (init9>=1))))) + (newmsg1<1)) + (elec...746
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t26, t28...380
Detected timeout of ITS tools.
[2024-05-24 21:28:04] [INFO ] Flatten gal took : 8 ms
[2024-05-24 21:28:04] [INFO ] Applying decomposition
[2024-05-24 21:28:04] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5361889087172510510.txt' '-o' '/tmp/graph5361889087172510510.bin' '-w' '/tmp/graph5361889087172510510.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5361889087172510510.bin' '-l' '-1' '-v' '-w' '/tmp/graph5361889087172510510.weights' '-q' '0' '-e' '0.001'
[2024-05-24 21:28:04] [INFO ] Decomposing Gal with order
[2024-05-24 21:28:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 21:28:04] [INFO ] Removed a total of 32 redundant transitions.
[2024-05-24 21:28:04] [INFO ] Flatten gal took : 18 ms
[2024-05-24 21:28:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 21:28:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9851307616979344374.gal : 13 ms
[2024-05-24 21:28:04] [INFO ] Time to serialize properties into /tmp/CTLFireability3725973903512714772.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/CTLFireability9851307616979344374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3725973903512714772.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,9.80409e+16,2.95079,67596,2689,3201,91417,51433,696,223191,261,232937,0


Converting to forward existential form...Done !
original formula: (EF(((((AG(E((i1.u2.rcv_left_election_2_0_1_3>=1) U (i7.u7.init9>=1))) + (i0.u0.newmsg1<1)) + (i0.u0.election_15_1_1_to_right_15<1)) * (i...464
=> equivalent forward existential formula: [((EY((Init * E(TRUE U ((((!(E(TRUE U !(E((i1.u2.rcv_left_election_2_0_1_3>=1) U (i7.u7.init9>=1))))) + (i0.u0.n...863
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t6, t7, t8, t10, t12, t13, t14, t34, t50, t252, t267, i0.t20, i0.u0.t222, i0....547
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 286/286 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 295 transition count 276
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 295 transition count 276
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 287 transition count 268
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 287 transition count 268
Applied a total of 36 rules in 15 ms. Remains 287 /305 variables (removed 18) and now considering 268/286 (removed 18) transitions.
// Phase 1: matrix 268 rows 287 cols
[2024-05-24 21:28:34] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 21:28:34] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-24 21:28:34] [INFO ] Invariant cache hit.
[2024-05-24 21:28:35] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2024-05-24 21:28:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 0/555 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 306 constraints, problems are : Problem set: 0 solved, 253 unsolved in 23114 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/272 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/272 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 2 (OVERLAPS) 15/287 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 4 (OVERLAPS) 268/555 variables, 287/306 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 253/559 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 555/555 variables, and 559 constraints, problems are : Problem set: 0 solved, 253 unsolved in 30055 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 0/0 constraints]
After SMT, in 53235ms problems are : Problem set: 0 solved, 253 unsolved
Search for dead transitions found 0 dead transitions in 53238ms
Starting structural reductions in LTL mode, iteration 1 : 287/305 places, 268/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53997 ms. Remains : 287/305 places, 268/286 transitions.
[2024-05-24 21:29:28] [INFO ] Flatten gal took : 11 ms
[2024-05-24 21:29:28] [INFO ] Flatten gal took : 12 ms
[2024-05-24 21:29:28] [INFO ] Input system was already deterministic with 268 transitions.
[2024-05-24 21:29:28] [INFO ] Flatten gal took : 11 ms
[2024-05-24 21:29:28] [INFO ] Flatten gal took : 11 ms
[2024-05-24 21:29:28] [INFO ] Time to serialize gal into /tmp/CTLFireability1092624317448153418.gal : 3 ms
[2024-05-24 21:29:28] [INFO ] Time to serialize properties into /tmp/CTLFireability12918589286809879985.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/CTLFireability1092624317448153418.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12918589286809879985.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08206e+17,1.47983,30708,2,24433,5,106339,6,0,1404,106292,0


Converting to forward existential form...Done !
original formula: A(((!(A(EX((rcv_right_election_15_4_6_9>=1)) U AF(((newmsg9>=1)&&(elected_15_to_left_10>=1))))) + (newmsg7<1)) + ((election_15_3_8_to_lef...562
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(EG(!((((rcv_right_election_15_3_7_8<1)||((newmsg14>=1)&&(election_15_2_1_to_left_15>=1)))|...2343
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t21, t23, t25, t27...380
Detected timeout of ITS tools.
[2024-05-24 21:29:58] [INFO ] Flatten gal took : 7 ms
[2024-05-24 21:29:58] [INFO ] Applying decomposition
[2024-05-24 21:29:58] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17100516631628856551.txt' '-o' '/tmp/graph17100516631628856551.bin' '-w' '/tmp/graph17100516631628856551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17100516631628856551.bin' '-l' '-1' '-v' '-w' '/tmp/graph17100516631628856551.weights' '-q' '0' '-e' '0.001'
[2024-05-24 21:29:58] [INFO ] Decomposing Gal with order
[2024-05-24 21:29:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 21:29:58] [INFO ] Removed a total of 33 redundant transitions.
[2024-05-24 21:29:58] [INFO ] Flatten gal took : 17 ms
[2024-05-24 21:29:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2024-05-24 21:29:58] [INFO ] Time to serialize gal into /tmp/CTLFireability18053422541165544428.gal : 5 ms
[2024-05-24 21:29:58] [INFO ] Time to serialize properties into /tmp/CTLFireability15175283755632490645.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/CTLFireability18053422541165544428.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15175283755632490645.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.08206e+17,3.21376,86676,2691,3302,129465,59200,763,296833,257,282298,0


Converting to forward existential form...Done !
original formula: A(((!(A(EX((i3.u5.rcv_right_election_15_4_6_9>=1)) U AF(((i3.u5.newmsg9>=1)&&(i8.i0.u34.elected_15_to_left_10>=1))))) + (i5.u15.newmsg7<1...691
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(EG(!((((i5.u4.rcv_right_election_15_3_7_8<1)||((i4.u9.newmsg14>=1)&&(i7.u10.election_15_2_...2876
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t7, t9, t10, t12, t13, t58, t252, t267, i0.t1, i0.u0.t222, i0.u11.t18, i0.u11...554
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 286/286 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 294 transition count 275
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 294 transition count 275
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 285 transition count 266
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 285 transition count 266
Applied a total of 40 rules in 13 ms. Remains 285 /305 variables (removed 20) and now considering 266/286 (removed 20) transitions.
// Phase 1: matrix 266 rows 285 cols
[2024-05-24 21:30:28] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 21:30:28] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-24 21:30:28] [INFO ] Invariant cache hit.
[2024-05-24 21:30:29] [INFO ] Implicit Places using invariants and state equation in 585 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
Running 251 sub problems to find dead transitions.
[2024-05-24 21:30:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 6 (OVERLAPS) 0/551 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 304 constraints, problems are : Problem set: 0 solved, 251 unsolved in 17295 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 251 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/270 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/270 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 2 (OVERLAPS) 15/285 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 4 (OVERLAPS) 266/551 variables, 285/304 constraints. Problems are: Problem set: 0 solved, 251 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 251/555 constraints. Problems are: Problem set: 0 solved, 251 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/551 variables, and 555 constraints, problems are : Problem set: 0 solved, 251 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 251/251 constraints, Known Traps: 0/0 constraints]
After SMT, in 47391ms problems are : Problem set: 0 solved, 251 unsolved
Search for dead transitions found 0 dead transitions in 47396ms
Starting structural reductions in LTL mode, iteration 1 : 285/305 places, 266/286 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48184 ms. Remains : 285/305 places, 266/286 transitions.
[2024-05-24 21:31:16] [INFO ] Flatten gal took : 8 ms
[2024-05-24 21:31:16] [INFO ] Flatten gal took : 8 ms
[2024-05-24 21:31:16] [INFO ] Input system was already deterministic with 266 transitions.
[2024-05-24 21:31:16] [INFO ] Flatten gal took : 12 ms
[2024-05-24 21:31:16] [INFO ] Flatten gal took : 10 ms
[2024-05-24 21:31:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14955206446479971015.gal : 3 ms
[2024-05-24 21:31:16] [INFO ] Time to serialize properties into /tmp/CTLFireability16076973481784167692.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/CTLFireability14955206446479971015.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16076973481784167692.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,7.70338e+16,1.22898,29360,2,22806,5,101989,6,0,1394,101779,0


Converting to forward existential form...Done !
original formula: AF((E((((EF((rcv_right_election_15_4_10_5>=1)) + EG((rcv_left_election_15_4_5_5>=1))) * (rcv_right_reply_15_1_15>=1)) * ((!((newmsg15>=1)...453
=> equivalent forward existential formula: [FwdG(Init,!((E((((E(TRUE U (rcv_right_election_15_4_10_5>=1)) + EG((rcv_left_election_15_4_5_5>=1))) * (rcv_rig...621
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t20, t22, t24, t26...380
Detected timeout of ITS tools.
[2024-05-24 21:31:47] [INFO ] Flatten gal took : 11 ms
[2024-05-24 21:31:47] [INFO ] Applying decomposition
[2024-05-24 21:31:47] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8426157854379266239.txt' '-o' '/tmp/graph8426157854379266239.bin' '-w' '/tmp/graph8426157854379266239.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8426157854379266239.bin' '-l' '-1' '-v' '-w' '/tmp/graph8426157854379266239.weights' '-q' '0' '-e' '0.001'
[2024-05-24 21:31:47] [INFO ] Decomposing Gal with order
[2024-05-24 21:31:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 21:31:47] [INFO ] Removed a total of 37 redundant transitions.
[2024-05-24 21:31:47] [INFO ] Flatten gal took : 27 ms
[2024-05-24 21:31:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-24 21:31:47] [INFO ] Time to serialize gal into /tmp/CTLFireability11738250078251454691.gal : 6 ms
[2024-05-24 21:31:47] [INFO ] Time to serialize properties into /tmp/CTLFireability5089956898614525198.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/CTLFireability11738250078251454691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5089956898614525198.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.70338e+16,3.7155,77156,4339,2656,125447,31718,712,239957,240,156512,0


Converting to forward existential form...Done !
original formula: AF((E((((EF((i7.u3.rcv_right_election_15_4_10_5>=1)) + EG((i7.u33.rcv_left_election_15_4_5_5>=1))) * (i6.u12.rcv_right_reply_15_1_15>=1))...559
=> equivalent forward existential formula: [FwdG(Init,!((E((((E(TRUE U (i7.u3.rcv_right_election_15_4_10_5>=1)) + EG((i7.u33.rcv_left_election_15_4_5_5>=1)...753
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t4, t6, t8, t10, t12, t13, t32, t220, t265, i0.t24, i0.t1, i0.u0.t20, i0.u1.t18, ...545
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 305/305 places, 286/286 transitions.
Reduce places removed 14 places and 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 113 transitions
Trivial Post-agglo rules discarded 113 transitions
Performed 113 trivial Post agglomeration. Transition count delta: 113
Iterating post reduction 0 with 113 rules applied. Total rules applied 113 place count 291 transition count 159
Reduce places removed 113 places and 0 transitions.
Iterating post reduction 1 with 113 rules applied. Total rules applied 226 place count 178 transition count 159
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 236 place count 168 transition count 149
Iterating global reduction 2 with 10 rules applied. Total rules applied 246 place count 168 transition count 149
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 2 with 2 rules applied. Total rules applied 248 place count 168 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 250 place count 166 transition count 147
Applied a total of 250 rules in 35 ms. Remains 166 /305 variables (removed 139) and now considering 147/286 (removed 139) transitions.
// Phase 1: matrix 147 rows 166 cols
[2024-05-24 21:32:17] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 21:32:17] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-24 21:32:17] [INFO ] Invariant cache hit.
[2024-05-24 21:32:17] [INFO ] Implicit Places using invariants and state equation in 396 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-05-24 21:32:17] [INFO ] Redundant transitions in 2 ms returned []
Running 121 sub problems to find dead transitions.
[2024-05-24 21:32:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 125/268 variables, 143/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 1/269 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/269 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 269/313 variables, and 163 constraints, problems are : Problem set: 0 solved, 121 unsolved in 6410 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 144/166 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (OVERLAPS) 3/143 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 125/268 variables, 143/162 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 121/283 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (OVERLAPS) 1/269 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/269 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 269/313 variables, and 284 constraints, problems are : Problem set: 0 solved, 121 unsolved in 9953 ms.
Refiners :[Generalized P Invariants (flows): 19/19 constraints, State Equation: 144/166 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 16386ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 16389ms
Starting structural reductions in SI_CTL mode, iteration 1 : 166/305 places, 147/286 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17071 ms. Remains : 166/305 places, 147/286 transitions.
[2024-05-24 21:32:34] [INFO ] Flatten gal took : 4 ms
[2024-05-24 21:32:34] [INFO ] Flatten gal took : 4 ms
[2024-05-24 21:32:34] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-24 21:32:34] [INFO ] Flatten gal took : 7 ms
[2024-05-24 21:32:34] [INFO ] Flatten gal took : 4 ms
[2024-05-24 21:32:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7398013883504127164.gal : 1 ms
[2024-05-24 21:32:34] [INFO ] Time to serialize properties into /tmp/CTLFireability15201443300210751121.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/CTLFireability7398013883504127164.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15201443300210751121.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.22712e+13,0.154745,7232,2,2536,5,16288,6,0,787,12982,0


Converting to forward existential form...Done !
original formula: AF((((rcv_right_reply_15_2_3>=1) + EF((rcv_left_reply_10_0_10>=1))) + (A(EG((rcv_right_reply_15_3_6>=1)) U AF((rcv_left_election_15_4_8_8...218
=> equivalent forward existential formula: [FwdG(Init,!((((rcv_right_reply_15_2_3>=1) + E(TRUE U (rcv_left_reply_10_0_10>=1))) + (!((E(!(!(EG(!((rcv_left_e...392
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t4, t6, t8, t11, t12, t13, t15, t16, t18, t23, t24, t26, t28, t30, t113, t131, Inter...249
(forward)formula 0,1,8.39915,209656,1,0,1015,1.19245e+06,334,564,4858,1.06766e+06,1196
FORMULA HirschbergSinclair-PT-15-CTLFireability-2023-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2024-05-24 21:32:42] [INFO ] Flatten gal took : 8 ms
[2024-05-24 21:32:42] [INFO ] Flatten gal took : 7 ms
[2024-05-24 21:32:42] [INFO ] Applying decomposition
[2024-05-24 21:32:42] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5473320059100391943.txt' '-o' '/tmp/graph5473320059100391943.bin' '-w' '/tmp/graph5473320059100391943.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5473320059100391943.bin' '-l' '-1' '-v' '-w' '/tmp/graph5473320059100391943.weights' '-q' '0' '-e' '0.001'
[2024-05-24 21:32:42] [INFO ] Decomposing Gal with order
[2024-05-24 21:32:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 21:32:42] [INFO ] Removed a total of 23 redundant transitions.
[2024-05-24 21:32:42] [INFO ] Flatten gal took : 18 ms
[2024-05-24 21:32:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-24 21:32:42] [INFO ] Time to serialize gal into /tmp/CTLFireability10959765540008658394.gal : 4 ms
[2024-05-24 21:32:42] [INFO ] Time to serialize properties into /tmp/CTLFireability15895372698613059945.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability10959765540008658394.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15895372698613059945.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.59796e+17,2.69247,67516,2697,3789,83933,71703,753,181798,287,334769,0


Converting to forward existential form...Done !
original formula: !(A(AG((!(EF(((i2.u5.newmsg6>=1)&&(i2.u5.election_15_4_9_to_left_7>=1)))) * AX((i1.u3.rcv_left_election_15_4_4_4<1)))) U !(AX(AF(((i7.u13...207
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(EX(!(!(EG(!(((i7.u13.newmsg15>=1)&&(i0.u0.reply_15_3_to_left_1>=1))))))))))) * !(!(E(TRUE U ...480
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t49, t58, t285, i0.u1.t18, i0.u1...554
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2024-05-24 21:36:38] [INFO ] Flatten gal took : 8 ms
[2024-05-24 21:36:38] [INFO ] Time to serialize gal into /tmp/CTLFireability13491505816508909798.gal : 5 ms
[2024-05-24 21:36:38] [INFO ] Time to serialize properties into /tmp/CTLFireability4989338613393126703.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13491505816508909798.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4989338613393126703.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 9 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.59796e+17,1.18024,33236,2,25974,5,120681,6,0,1494,115428,0


Converting to forward existential form...Done !
original formula: !(A(AG((!(EF(((newmsg6>=1)&&(election_15_4_9_to_left_7>=1)))) * AX((rcv_left_election_15_4_4_4<1)))) U !(AX(AF(((newmsg15>=1)&&(reply_15_...176
=> equivalent forward existential formula: ([((FwdU(Init,!(!(!(EX(!(!(EG(!(((newmsg15>=1)&&(reply_15_3_to_left_1>=1))))))))))) * !(!(E(TRUE U !((!(E(TRUE U...423
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t18, t22, t24, t28, t30...380
(forward)formula 0,1,212.19,2815464,1,0,1344,1.76764e+07,23,763,5668,1.72841e+07,1318
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF(EG(A(EG((rcv_left_reply_15_3_13>=1)) U !(EX((rcv_right_election_15_4_1_14>=1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((E(!(!(EX((rcv_right_election_15_4_1_14>=1)))) U (!(EG((rcv_left_reply_15_3_13>=1))) * !(!(EX(...257
dead was empty
(forward)formula 1,1,213.552,2854536,1,0,1422,1.79347e+07,34,967,5668,1.76912e+07,1566
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: AF((((newmsg7>=1)&&(election_8_0_1_to_left_8>=1)) * (((!(E((rcv_left_election_15_4_8_8<1) U ((rcv_right_election_15_4_3_12>=1)||(rcv_left...420
=> equivalent forward existential formula: [FwdG(Init,!((((newmsg7>=1)&&(election_8_0_1_to_left_8>=1)) * (((!(E((rcv_left_election_15_4_8_8<1) U ((rcv_righ...636
(forward)formula 2,1,322.829,3137216,1,0,1569,1.98654e+07,35,1033,5678,2.13274e+07,1462
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: EG(EF(EX((((rcv_right_election_15_4_9_6<1) * AF(((newmsg8>=1)&&(election_15_4_8_to_right_7>=1)))) * A(((newmsg9>=1)&&(reply_15_3_to_right...216
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX((((rcv_right_election_15_4_9_6<1) * !(EG(!(((newmsg8>=1)&&(election_15_4_8_to_right_7>=1)...392
dead was empty
(forward)formula 3,0,508.389,3783744,1,0,2074,2.59288e+07,13,1043,4944,2.57393e+07,70
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (AF((EG(AX((rcv_right_reply_15_3_1<1))) * (rcv_right_election_15_3_5_10>=1))) + !(A((rcv_left_reply_15_3_11>=1) U AG(!(EF((rcv_right_repl...173
=> equivalent forward existential formula: [FwdG((Init * !(!(!((E(!(!(E(TRUE U !(!(E(TRUE U (rcv_right_reply_15_1_1>=1))))))) U (!((rcv_left_reply_15_3_11>...386
(forward)formula 4,1,531.303,3783744,1,0,2074,2.59288e+07,28,1043,5174,2.57393e+07,589
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

original formula: A(((newmsg14>=1)&&(elected_15_to_left15>=1)) U EG(!((AF(((newmsg10>=1)&&(election_9_0_1_to_right_9>=1))) + (AF((rcv_right_reply_15_3_15>=...180
=> equivalent forward existential formula: [((Init * !(EG(!(EG(!((!(EG(!(((newmsg10>=1)&&(election_9_0_1_to_right_9>=1))))) + (!(EG(!((rcv_right_reply_15_3...521
(forward)formula 5,0,748.829,4375724,1,0,2453,3.04062e+07,25,1602,4819,2.91825e+07,2230
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: (EF(((((AG(E((rcv_left_election_2_0_1_3>=1) U (init9>=1))) + (newmsg1<1)) + (election_15_1_1_to_right_15<1)) * (newmsg7>=1)) * (election_...387
=> equivalent forward existential formula: [((EY((Init * E(TRUE U ((((!(E(TRUE U !(E((rcv_left_election_2_0_1_3>=1) U (init9>=1))))) + (newmsg1<1)) + (elec...746
(forward)formula 6,0,773.106,4375724,1,0,2453,3.04062e+07,40,1602,5184,2.91825e+07,2334
FORMULA HirschbergSinclair-PT-15-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: A(((!(A(EX((rcv_right_election_15_4_6_9>=1)) U AF(((newmsg9>=1)&&(elected_15_to_left_10>=1))))) + (newmsg7<1)) + ((election_15_3_8_to_lef...562
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(EG(!((((rcv_right_election_15_3_7_8<1)||((newmsg14>=1)&&(election_15_2_1_to_left_15>=1)))|...2343
(forward)formula 7,0,892.747,4814652,1,0,2587,3.35219e+07,37,1611,4847,3.16747e+07,1616
FORMULA HirschbergSinclair-PT-15-CTLFireability-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

original formula: AF((E((((EF((rcv_right_election_15_4_10_5>=1)) + EG((rcv_left_election_15_4_5_5>=1))) * (rcv_right_reply_15_1_15>=1)) * ((!((newmsg15>=1)...453
=> equivalent forward existential formula: [FwdG(Init,!((E((((E(TRUE U (rcv_right_election_15_4_10_5>=1)) + EG((rcv_left_election_15_4_5_5>=1))) * (rcv_rig...621
(forward)formula 8,1,917.445,4814652,1,0,2587,3.35219e+07,70,1611,5217,3.16747e+07,2114
FORMULA HirschbergSinclair-PT-15-CTLFireability-2023-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2409403 ms.

BK_STOP 1716587518021

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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="HirschbergSinclair-PT-15"
export BK_EXAMINATION="CTLFireability"
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 HirschbergSinclair-PT-15, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r202-smll-171649587400074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-15.tgz
mv HirschbergSinclair-PT-15 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;