Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r143-tall-165271830400255.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r143-tall-165271830400255
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.1M
-rw-r--r-- 1 mcc users 11K Apr 29 16:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 16:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 16:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 29 16:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.1K May 9 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 29 16:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 29 16:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 29 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 29 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 4.6M May 10 09:34 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 MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655069591940

Running Version 0
[2022-06-12 21:33:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:33:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:33:13] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2022-06-12 21:33:13] [INFO ] Transformed 4914 places.
[2022-06-12 21:33:13] [INFO ] Transformed 6913 transitions.
[2022-06-12 21:33:13] [INFO ] Parsed PT model containing 4914 places and 6913 transitions in 365 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 192 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 16) seen :3
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 13) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-06-12 21:33:14] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2022-06-12 21:33:15] [INFO ] Computed 535 place invariants in 781 ms
[2022-06-12 21:33:17] [INFO ] [Real]Absence check using 48 positive place invariants in 38 ms returned sat
[2022-06-12 21:33:17] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 253 ms returned sat
[2022-06-12 21:33:17] [INFO ] SMT Verify possible in real domain returnedunsat :2 sat :0 real:8
[2022-06-12 21:33:18] [INFO ] [Nat]Absence check using 48 positive place invariants in 25 ms returned sat
[2022-06-12 21:33:18] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 233 ms returned sat
[2022-06-12 21:33:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:26] [INFO ] [Nat]Absence check using state equation in 7244 ms returned unsat :3 sat :7
[2022-06-12 21:33:26] [INFO ] State equation strengthened by 1923 read => feed constraints.
[2022-06-12 21:33:26] [INFO ] [Nat]Added 1923 Read/Feed constraints in 89 ms returned sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-06-12 21:33:42] [INFO ] SMT Verify possible in nat domain returned unsat :5 sat :3
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 3 different solutions.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 67 out of 4914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.25 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions removed 1320 transitions
Trivial Post-agglo rules discarded 1320 transitions
Performed 1320 trivial Post agglomeration. Transition count delta: 1320
Iterating post reduction 0 with 1320 rules applied. Total rules applied 1321 place count 4884 transition count 5593
Reduce places removed 1320 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 1352 rules applied. Total rules applied 2673 place count 3564 transition count 5561
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 2705 place count 3532 transition count 5561
Performed 164 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 164 Pre rules applied. Total rules applied 2705 place count 3532 transition count 5397
Deduced a syphon composed of 164 places in 25 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 328 rules applied. Total rules applied 3033 place count 3368 transition count 5397
Discarding 1178 places :
Symmetric choice reduction at 3 with 1178 rule applications. Total rules 4211 place count 2190 transition count 4219
Iterating global reduction 3 with 1178 rules applied. Total rules applied 5389 place count 2190 transition count 4219
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 5389 place count 2190 transition count 4216
Deduced a syphon composed of 3 places in 7 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 5395 place count 2187 transition count 4216
Discarding 223 places :
Symmetric choice reduction at 3 with 223 rule applications. Total rules 5618 place count 1964 transition count 3101
Iterating global reduction 3 with 223 rules applied. Total rules applied 5841 place count 1964 transition count 3101
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 5865 place count 1952 transition count 3089
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 3 with 79 rules applied. Total rules applied 5944 place count 1952 transition count 3010
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 3 with 79 rules applied. Total rules applied 6023 place count 1873 transition count 3010
Partial Free-agglomeration rule applied 115 times.
Drop transitions removed 115 transitions
Iterating global reduction 4 with 115 rules applied. Total rules applied 6138 place count 1873 transition count 3010
Applied a total of 6138 rules in 2337 ms. Remains 1873 /4914 variables (removed 3041) and now considering 3010/6913 (removed 3903) transitions.
Finished structural reductions, in 1 iterations. Remains : 1873/4914 places, 3010/6913 transitions.
[2022-06-12 21:33:45] [INFO ] Flatten gal took : 476 ms
[2022-06-12 21:33:46] [INFO ] Flatten gal took : 339 ms
[2022-06-12 21:33:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9118781337328801971.gal : 79 ms
[2022-06-12 21:33:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13018658870894299336.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality9118781337328801971.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13018658870894299336.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality9118781337328801971.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13018658870894299336.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13018658870894299336.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 11
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :11 after 17
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :17 after 27
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :27 after 55
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :55 after 217
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :217 after 223
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :223 after 233
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :233 after 258
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :258 after 306
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :306 after 436
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :436 after 549
Detected timeout of ITS tools.
[2022-06-12 21:34:01] [INFO ] Flatten gal took : 240 ms
[2022-06-12 21:34:01] [INFO ] Applying decomposition
[2022-06-12 21:34:01] [INFO ] Flatten gal took : 125 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5585137518530775753.txt, -o, /tmp/graph5585137518530775753.bin, -w, /tmp/graph5585137518530775753.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5585137518530775753.bin, -l, -1, -v, -w, /tmp/graph5585137518530775753.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:34:02] [INFO ] Decomposing Gal with order
[2022-06-12 21:34:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:34:03] [INFO ] Removed a total of 2345 redundant transitions.
[2022-06-12 21:34:03] [INFO ] Flatten gal took : 859 ms
[2022-06-12 21:34:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 1984 labels/synchronizations in 285 ms.
[2022-06-12 21:34:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality976074648019022630.gal : 40 ms
[2022-06-12 21:34:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9216504603446871618.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality976074648019022630.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9216504603446871618.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality976074648019022630.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9216504603446871618.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9216504603446871618.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 18
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :18 after 19
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :19 after 21
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :21 after 26
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :26 after 42
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :42 after 191
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :191 after 209
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :209 after 251
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13692271656076448756
[2022-06-12 21:34:19] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13692271656076448756
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13692271656076448756]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13692271656076448756] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin13692271656076448756] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 27089 resets, run finished after 7284 ms. (steps per millisecond=137 ) properties (out of 3) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5497 resets, run finished after 2371 ms. (steps per millisecond=421 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-12 21:34:29] [INFO ] Flow matrix only has 2659 transitions (discarded 351 similar events)
// Phase 1: matrix 2659 rows 1873 cols
[2022-06-12 21:34:30] [INFO ] Computed 505 place invariants in 186 ms
[2022-06-12 21:34:30] [INFO ] [Real]Absence check using 33 positive place invariants in 52 ms returned sat
[2022-06-12 21:34:30] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 85 ms returned sat
[2022-06-12 21:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:31] [INFO ] [Real]Absence check using state equation in 1107 ms returned sat
[2022-06-12 21:34:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:34:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 39 ms returned sat
[2022-06-12 21:34:32] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 111 ms returned sat
[2022-06-12 21:34:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:33] [INFO ] [Nat]Absence check using state equation in 1270 ms returned sat
[2022-06-12 21:34:33] [INFO ] State equation strengthened by 1031 read => feed constraints.
[2022-06-12 21:34:34] [INFO ] [Nat]Added 1031 Read/Feed constraints in 1192 ms returned sat
[2022-06-12 21:34:35] [INFO ] Deduced a trap composed of 279 places in 1028 ms of which 9 ms to minimize.
[2022-06-12 21:34:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1230 ms
[2022-06-12 21:34:36] [INFO ] Computed and/alt/rep : 1803/2920/1803 causal constraints (skipped 839 transitions) in 251 ms.
[2022-06-12 21:34:43] [INFO ] Deduced a trap composed of 268 places in 988 ms of which 2 ms to minimize.
[2022-06-12 21:34:44] [INFO ] Deduced a trap composed of 223 places in 983 ms of which 2 ms to minimize.
[2022-06-12 21:34:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2382 ms
[2022-06-12 21:34:45] [INFO ] Added : 139 causal constraints over 28 iterations in 9502 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
Incomplete Parikh walk after 20600 steps, including 1305 resets, run finished after 158 ms. (steps per millisecond=130 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 16 out of 1873 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1873/1873 places, 3010/3010 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1873 transition count 3004
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 1867 transition count 3004
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 1867 transition count 2998
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 1861 transition count 2998
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 31 place count 1854 transition count 2979
Iterating global reduction 2 with 7 rules applied. Total rules applied 38 place count 1854 transition count 2979
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 38 place count 1854 transition count 2978
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 40 place count 1853 transition count 2978
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 1849 transition count 2958
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 1849 transition count 2958
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 56 place count 1845 transition count 2954
Free-agglomeration rule (complex) applied 80 times.
Iterating global reduction 2 with 80 rules applied. Total rules applied 136 place count 1845 transition count 3770
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 2 with 80 rules applied. Total rules applied 216 place count 1765 transition count 3770
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 221 place count 1760 transition count 3765
Iterating global reduction 3 with 5 rules applied. Total rules applied 226 place count 1760 transition count 3765
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 228 place count 1760 transition count 3765
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 229 place count 1759 transition count 3764
Iterating global reduction 3 with 1 rules applied. Total rules applied 230 place count 1759 transition count 3764
Applied a total of 230 rules in 697 ms. Remains 1759 /1873 variables (removed 114) and now considering 3764/3010 (removed -754) transitions.
Finished structural reductions, in 1 iterations. Remains : 1759/1873 places, 3764/3010 transitions.
[2022-06-12 21:34:46] [INFO ] Flatten gal took : 178 ms
[2022-06-12 21:34:46] [INFO ] Flatten gal took : 175 ms
[2022-06-12 21:34:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5933845946984538712.gal : 22 ms
[2022-06-12 21:34:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18385697962145008247.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5933845946984538712.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18385697962145008247.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality5933845946984538712.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18385697962145008247.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18385697962145008247.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :16 after 27
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :27 after 41
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :41 after 58
Detected timeout of ITS tools.
[2022-06-12 21:35:01] [INFO ] Flatten gal took : 149 ms
[2022-06-12 21:35:02] [INFO ] Applying decomposition
[2022-06-12 21:35:02] [INFO ] Flatten gal took : 152 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12475351627017669884.txt, -o, /tmp/graph12475351627017669884.bin, -w, /tmp/graph12475351627017669884.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph12475351627017669884.bin, -l, -1, -v, -w, /tmp/graph12475351627017669884.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:35:02] [INFO ] Decomposing Gal with order
[2022-06-12 21:35:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:35:03] [INFO ] Removed a total of 4361 redundant transitions.
[2022-06-12 21:35:03] [INFO ] Flatten gal took : 731 ms
[2022-06-12 21:35:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 3887 labels/synchronizations in 179 ms.
[2022-06-12 21:35:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality422793386310386190.gal : 36 ms
[2022-06-12 21:35:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15462536342094979445.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality422793386310386190.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15462536342094979445.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality422793386310386190.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15462536342094979445.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15462536342094979445.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 86
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :86 after 130
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :130 after 169
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7322208054997802169
[2022-06-12 21:35:18] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7322208054997802169
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7322208054997802169]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7322208054997802169] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7322208054997802169] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 31706 resets, run finished after 15078 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5656 resets, run finished after 3918 ms. (steps per millisecond=255 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 615231 steps, run timeout after 30001 ms. (steps per millisecond=20 ) properties seen :{}
Probabilistic random walk after 615231 steps, saw 268545 distinct states, run finished after 30008 ms. (steps per millisecond=20 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 21:36:08] [INFO ] Flow matrix only has 3377 transitions (discarded 387 similar events)
// Phase 1: matrix 3377 rows 1759 cols
[2022-06-12 21:36:08] [INFO ] Computed 505 place invariants in 65 ms
[2022-06-12 21:36:09] [INFO ] [Real]Absence check using 33 positive place invariants in 56 ms returned sat
[2022-06-12 21:36:09] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 159 ms returned sat
[2022-06-12 21:36:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:10] [INFO ] [Real]Absence check using state equation in 1110 ms returned sat
[2022-06-12 21:36:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:36:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2022-06-12 21:36:10] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 105 ms returned sat
[2022-06-12 21:36:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:12] [INFO ] [Nat]Absence check using state equation in 1205 ms returned sat
[2022-06-12 21:36:12] [INFO ] State equation strengthened by 1899 read => feed constraints.
[2022-06-12 21:36:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-12 21:36:18] [INFO ] [Nat]Added 1899 Read/Feed constraints in 6175 ms returned unknown
Support contains 16 out of 1759 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1759/1759 places, 3764/3764 transitions.
Applied a total of 0 rules in 117 ms. Remains 1759 /1759 variables (removed 0) and now considering 3764/3764 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1759/1759 places, 3764/3764 transitions.
Starting structural reductions, iteration 0 : 1759/1759 places, 3764/3764 transitions.
Applied a total of 0 rules in 96 ms. Remains 1759 /1759 variables (removed 0) and now considering 3764/3764 (removed 0) transitions.
[2022-06-12 21:36:18] [INFO ] Flow matrix only has 3377 transitions (discarded 387 similar events)
// Phase 1: matrix 3377 rows 1759 cols
[2022-06-12 21:36:18] [INFO ] Computed 505 place invariants in 56 ms
[2022-06-12 21:36:22] [INFO ] Implicit Places using invariants in 3396 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 43, 55, 69, 84, 98, 99, 100, 102, 103, 115, 125, 135, 141, 145, 147, 160, 166, 168, 169, 170, 173, 174, 177, 181, 187, 196, 206, 218, 231, 243, 244, 245, 246, 247, 248, 258, 266, 272, 276, 278, 280, 293, 299, 301, 302, 303, 304, 305, 306, 308, 310, 314, 321, 329, 339, 350, 360, 361, 362, 363, 364, 365, 373, 379, 383, 385, 387, 389, 402, 408, 410, 411, 412, 413, 414, 415, 417, 419, 421, 426, 432, 440, 449, 457, 458, 459, 460, 461, 462, 468, 472, 474, 476, 478, 480, 493, 499, 501, 502, 503, 504, 505, 506, 508, 510, 512, 515, 519, 525, 532, 538, 539, 540, 541, 542, 543, 547, 549, 551, 553, 555, 557, 570, 577, 579, 580, 581, 582, 583, 584, 586, 588, 590, 592, 594, 598, 603, 607, 608, 609, 610, 611, 612, 614, 616, 618, 620, 622, 624, 637, 643, 645, 646, 647, 648, 649, 650, 652, 654, 656, 658, 660, 662, 665, 667, 668, 669, 670, 671, 672, 674, 676, 678, 680, 682, 684, 697, 703, 705, 706, 707, 708, 709, 710, 712, 714, 716, 718, 720, 722, 724, 726, 727, 728, 729, 730, 731, 733, 735, 737, 739, 741, 743, 756, 758, 761, 763, 764, 765, 766, 767, 768, 770, 772, 774, 776, 778, 780, 782, 784, 785, 786, 787, 788, 789, 791, 793, 795, 797, 799, 801, 814, 820, 822, 823, 824, 825, 826, 827, 829, 831, 833, 835, 837, 839, 841, 843, 844, 845, 846, 847, 848, 850, 852, 854, 856, 858, 860, 873, 879, 881, 882, 883, 884, 885, 886, 888, 890, 892, 894, 896, 898, 900, 903, 904, 905, 906, 907, 908, 910, 912, 914, 916, 918, 920, 933, 939, 941, 942, 943, 944, 945, 946, 948, 950, 952, 954, 956, 958, 962, 967, 968, 969, 970, 971, 972, 976, 978, 980, 982, 984, 986, 999, 1005, 1007, 1008, 1009, 1010, 1011, 1012, 1014, 1016, 1018, 1020, 1023, 1027, 1033, 1040, 1041, 1042, 1043, 1044, 1045, 1051, 1055, 1057, 1059, 1061, 1063, 1076, 1082, 1084, 1085, 1086, 1087, 1088, 1089, 1091, 1093, 1095, 1097, 1102, 1108, 1117, 1126, 1127, 1128, 1129, 1130, 1131, 1139, 1145, 1149, 1151, 1153, 1155, 1168, 1174, 1176, 1177, 1178, 1179, 1180, 1181, 1183, 1185, 1187, 1191, 1198, 1206, 1216, 1227, 1228, 1229, 1230, 1231, 1232, 1242, 1250, 1256, 1260, 1262, 1264, 1277, 1283, 1285, 1286, 1287, 1288, 1289, 1290, 1292, 1294, 1298, 1304, 1313, 1323, 1335, 1349, 1350, 1351, 1352, 1353, 1354, 1366, 1376, 1384, 1390, 1394, 1396, 1409, 1411, 1414, 1417, 1418, 1419, 1420, 1421, 1422, 1424, 1428, 1434, 1442, 1453, 1465, 1479, 1494, 1495, 1496, 1497, 1498, 1499, 1513, 1525, 1535, 1543, 1549, 1553, 1566]
Discarding 460 places :
Implicit Place search using SMT only with invariants took 3420 ms to find 460 implicit places.
[2022-06-12 21:36:22] [INFO ] Redundant transitions in 213 ms returned []
[2022-06-12 21:36:22] [INFO ] Flow matrix only has 3377 transitions (discarded 387 similar events)
// Phase 1: matrix 3377 rows 1299 cols
[2022-06-12 21:36:22] [INFO ] Computed 45 place invariants in 37 ms
[2022-06-12 21:36:23] [INFO ] Dead Transitions using invariants and state equation in 1497 ms returned []
Starting structural reductions, iteration 1 : 1299/1759 places, 3764/3764 transitions.
Discarding 158 places :
Symmetric choice reduction at 0 with 158 rule applications. Total rules 158 place count 1141 transition count 3606
Iterating global reduction 0 with 158 rules applied. Total rules applied 316 place count 1141 transition count 3606
Discarding 158 places :
Symmetric choice reduction at 0 with 158 rule applications. Total rules 474 place count 983 transition count 3448
Iterating global reduction 0 with 158 rules applied. Total rules applied 632 place count 983 transition count 3448
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 634 place count 983 transition count 3446
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 636 place count 981 transition count 3446
Applied a total of 636 rules in 233 ms. Remains 981 /1299 variables (removed 318) and now considering 3446/3764 (removed 318) transitions.
[2022-06-12 21:36:23] [INFO ] Flow matrix only has 3059 transitions (discarded 387 similar events)
// Phase 1: matrix 3059 rows 981 cols
[2022-06-12 21:36:24] [INFO ] Computed 45 place invariants in 45 ms
[2022-06-12 21:36:25] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2022-06-12 21:36:25] [INFO ] Flow matrix only has 3059 transitions (discarded 387 similar events)
// Phase 1: matrix 3059 rows 981 cols
[2022-06-12 21:36:25] [INFO ] Computed 45 place invariants in 42 ms
[2022-06-12 21:36:25] [INFO ] State equation strengthened by 1899 read => feed constraints.
[2022-06-12 21:36:56] [INFO ] Performed 757/981 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-06-12 21:37:04] [INFO ] Implicit Places using invariants and state equation in 39365 ms returned []
Implicit Place search using SMT with State Equation took 40518 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 981/1759 places, 3446/3764 transitions.
[2022-06-12 21:37:04] [INFO ] Flatten gal took : 129 ms
[2022-06-12 21:37:04] [INFO ] Flatten gal took : 101 ms
[2022-06-12 21:37:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6533864536367724589.gal : 22 ms
[2022-06-12 21:37:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8383959528170654193.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6533864536367724589.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8383959528170654193.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6533864536367724589.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8383959528170654193.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8383959528170654193.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :24 after 26
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :26 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 38
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :38 after 73
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :73 after 76
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :76 after 117
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :117 after 180
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :180 after 295
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :295 after 586
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :586 after 1016
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1016 after 2099
Detected timeout of ITS tools.
[2022-06-12 21:37:19] [INFO ] Flatten gal took : 113 ms
[2022-06-12 21:37:19] [INFO ] Applying decomposition
[2022-06-12 21:37:20] [INFO ] Flatten gal took : 119 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4026792044187359241.txt, -o, /tmp/graph4026792044187359241.bin, -w, /tmp/graph4026792044187359241.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4026792044187359241.bin, -l, -1, -v, -w, /tmp/graph4026792044187359241.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:37:20] [INFO ] Decomposing Gal with order
[2022-06-12 21:37:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:37:20] [INFO ] Removed a total of 5692 redundant transitions.
[2022-06-12 21:37:20] [INFO ] Flatten gal took : 462 ms
[2022-06-12 21:37:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 2725 labels/synchronizations in 134 ms.
[2022-06-12 21:37:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17504878649252517326.gal : 23 ms
[2022-06-12 21:37:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14740626197077339529.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality17504878649252517326.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14740626197077339529.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality17504878649252517326.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14740626197077339529.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14740626197077339529.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 44
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :44 after 53
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :53 after 108
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :108 after 191
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :191 after 288
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :288 after 351
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :351 after 759
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :759 after 1198
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1198 after 1881
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1446872519784229890
[2022-06-12 21:37:36] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1446872519784229890
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1446872519784229890]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1446872519784229890] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1446872519784229890] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 32905 resets, run finished after 14009 ms. (steps per millisecond=71 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4679 resets, run finished after 3081 ms. (steps per millisecond=324 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 720422 steps, run timeout after 30001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 720422 steps, saw 297258 distinct states, run finished after 30002 ms. (steps per millisecond=24 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 21:38:24] [INFO ] Flow matrix only has 3059 transitions (discarded 387 similar events)
// Phase 1: matrix 3059 rows 981 cols
[2022-06-12 21:38:24] [INFO ] Computed 45 place invariants in 38 ms
[2022-06-12 21:38:24] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-06-12 21:38:24] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2022-06-12 21:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:38:25] [INFO ] [Real]Absence check using state equation in 769 ms returned sat
[2022-06-12 21:38:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:38:25] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-06-12 21:38:25] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2022-06-12 21:38:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:38:26] [INFO ] [Nat]Absence check using state equation in 858 ms returned sat
[2022-06-12 21:38:26] [INFO ] State equation strengthened by 1899 read => feed constraints.
[2022-06-12 21:38:28] [INFO ] [Nat]Added 1899 Read/Feed constraints in 2012 ms returned sat
[2022-06-12 21:38:29] [INFO ] Deduced a trap composed of 98 places in 754 ms of which 2 ms to minimize.
[2022-06-12 21:38:30] [INFO ] Deduced a trap composed of 225 places in 428 ms of which 0 ms to minimize.
[2022-06-12 21:38:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2003 ms
[2022-06-12 21:38:30] [INFO ] Computed and/alt/rep : 1401/2103/1401 causal constraints (skipped 1611 transitions) in 193 ms.
[2022-06-12 21:38:31] [INFO ] Added : 34 causal constraints over 7 iterations in 1318 ms. Result :sat
Incomplete Parikh walk after 6500 steps, including 860 resets, run finished after 100 ms. (steps per millisecond=65 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 16 out of 981 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 981/981 places, 3446/3446 transitions.
Applied a total of 0 rules in 79 ms. Remains 981 /981 variables (removed 0) and now considering 3446/3446 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 3446/3446 transitions.
Starting structural reductions, iteration 0 : 981/981 places, 3446/3446 transitions.
Applied a total of 0 rules in 86 ms. Remains 981 /981 variables (removed 0) and now considering 3446/3446 (removed 0) transitions.
[2022-06-12 21:38:32] [INFO ] Flow matrix only has 3059 transitions (discarded 387 similar events)
// Phase 1: matrix 3059 rows 981 cols
[2022-06-12 21:38:32] [INFO ] Computed 45 place invariants in 36 ms
[2022-06-12 21:38:33] [INFO ] Implicit Places using invariants in 1079 ms returned []
[2022-06-12 21:38:33] [INFO ] Flow matrix only has 3059 transitions (discarded 387 similar events)
// Phase 1: matrix 3059 rows 981 cols
[2022-06-12 21:38:33] [INFO ] Computed 45 place invariants in 38 ms
[2022-06-12 21:38:33] [INFO ] State equation strengthened by 1899 read => feed constraints.
[2022-06-12 21:39:04] [INFO ] Performed 802/981 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2022-06-12 21:39:08] [INFO ] Implicit Places using invariants and state equation in 35700 ms returned []
Implicit Place search using SMT with State Equation took 36786 ms to find 0 implicit places.
[2022-06-12 21:39:08] [INFO ] Redundant transitions in 119 ms returned []
[2022-06-12 21:39:08] [INFO ] Flow matrix only has 3059 transitions (discarded 387 similar events)
// Phase 1: matrix 3059 rows 981 cols
[2022-06-12 21:39:08] [INFO ] Computed 45 place invariants in 34 ms
[2022-06-12 21:39:10] [INFO ] Dead Transitions using invariants and state equation in 1328 ms returned []
Finished structural reductions, in 1 iterations. Remains : 981/981 places, 3446/3446 transitions.
Incomplete random walk after 100000 steps, including 3290 resets, run finished after 1265 ms. (steps per millisecond=79 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-12 21:39:11] [INFO ] Flow matrix only has 3059 transitions (discarded 387 similar events)
// Phase 1: matrix 3059 rows 981 cols
[2022-06-12 21:39:11] [INFO ] Computed 45 place invariants in 41 ms
[2022-06-12 21:39:11] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2022-06-12 21:39:11] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 5 ms returned sat
[2022-06-12 21:39:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:12] [INFO ] [Real]Absence check using state equation in 805 ms returned sat
[2022-06-12 21:39:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:12] [INFO ] [Nat]Absence check using 31 positive place invariants in 20 ms returned sat
[2022-06-12 21:39:12] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2022-06-12 21:39:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:13] [INFO ] [Nat]Absence check using state equation in 872 ms returned sat
[2022-06-12 21:39:13] [INFO ] State equation strengthened by 1899 read => feed constraints.
[2022-06-12 21:39:15] [INFO ] [Nat]Added 1899 Read/Feed constraints in 2047 ms returned sat
[2022-06-12 21:39:16] [INFO ] Deduced a trap composed of 98 places in 493 ms of which 2 ms to minimize.
[2022-06-12 21:39:17] [INFO ] Deduced a trap composed of 225 places in 414 ms of which 0 ms to minimize.
[2022-06-12 21:39:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1726 ms
[2022-06-12 21:39:17] [INFO ] Computed and/alt/rep : 1401/2103/1401 causal constraints (skipped 1611 transitions) in 262 ms.
[2022-06-12 21:39:18] [INFO ] Added : 34 causal constraints over 7 iterations in 1369 ms. Result :sat
[2022-06-12 21:39:18] [INFO ] Flatten gal took : 111 ms
[2022-06-12 21:39:19] [INFO ] Flatten gal took : 110 ms
[2022-06-12 21:39:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10415389967118727602.gal : 14 ms
[2022-06-12 21:39:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16416835151265892958.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10415389967118727602.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16416835151265892958.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10415389967118727602.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16416835151265892958.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16416835151265892958.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :24 after 26
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :26 after 31
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :31 after 38
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :38 after 73
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :73 after 76
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :76 after 117
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :117 after 180
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :180 after 295
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :295 after 586
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :586 after 1016
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1016 after 2099
Detected timeout of ITS tools.
[2022-06-12 21:39:39] [INFO ] Flatten gal took : 115 ms
[2022-06-12 21:39:39] [INFO ] Applying decomposition
[2022-06-12 21:39:39] [INFO ] Flatten gal took : 115 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11725417042286898772.txt, -o, /tmp/graph11725417042286898772.bin, -w, /tmp/graph11725417042286898772.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11725417042286898772.bin, -l, -1, -v, -w, /tmp/graph11725417042286898772.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:39:39] [INFO ] Decomposing Gal with order
[2022-06-12 21:39:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:39:40] [INFO ] Removed a total of 5691 redundant transitions.
[2022-06-12 21:39:40] [INFO ] Flatten gal took : 457 ms
[2022-06-12 21:39:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 2686 labels/synchronizations in 141 ms.
[2022-06-12 21:39:40] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6764130068785074593.gal : 39 ms
[2022-06-12 21:39:40] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5989648357490497143.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality6764130068785074593.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5989648357490497143.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6764130068785074593.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5989648357490497143.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5989648357490497143.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 177
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :177 after 196
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :196 after 773
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin941644938277170869
[2022-06-12 21:40:00] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin941644938277170869
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin941644938277170869]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin941644938277170869] killed by timeout after 2 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin941644938277170869] killed by timeout after 2 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Graph (trivial) has 1038 edges and 981 vertex of which 16 / 981 are part of one of the 1 SCC in 7 ms
Free SCC test removed 15 places
Drop transitions removed 258 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 649 transitions.
Graph (complete) has 4012 edges and 966 vertex of which 956 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Ensure Unique test removed 16 places
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition Node6DetectsThatNode9CanReplaceNode8.Node9IsBecomingTheNewNodeMaster and 1 places that fell out of Prefix Of Interest.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 88 rules applied. Total rules applied 90 place count 939 transition count 2709
Reduce places removed 86 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 81 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 1 with 247 rules applied. Total rules applied 337 place count 853 transition count 2548
Reduce places removed 80 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 76 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 2 with 213 rules applied. Total rules applied 550 place count 773 transition count 2415
Reduce places removed 57 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 52 transitions
Reduce isomorphic transitions removed 53 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 3 with 162 rules applied. Total rules applied 712 place count 716 transition count 2310
Reduce places removed 52 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 4 with 134 rules applied. Total rules applied 846 place count 664 transition count 2228
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 5 with 97 rules applied. Total rules applied 943 place count 629 transition count 2166
Reduce places removed 31 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 6 with 75 rules applied. Total rules applied 1018 place count 598 transition count 2122
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 7 with 44 rules applied. Total rules applied 1062 place count 580 transition count 2096
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 8 with 26 rules applied. Total rules applied 1088 place count 567 transition count 2083
Reduce places removed 5 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 9 with 16 rules applied. Total rules applied 1104 place count 562 transition count 2072
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 12 rules applied. Total rules applied 1116 place count 551 transition count 2071
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 12 Pre rules applied. Total rules applied 1116 place count 551 transition count 2059
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 11 with 24 rules applied. Total rules applied 1140 place count 539 transition count 2059
Discarding 224 places :
Symmetric choice reduction at 11 with 224 rule applications. Total rules 1364 place count 315 transition count 1009
Iterating global reduction 11 with 224 rules applied. Total rules applied 1588 place count 315 transition count 1009
Ensure Unique test removed 183 transitions
Reduce isomorphic transitions removed 183 transitions.
Iterating post reduction 11 with 183 rules applied. Total rules applied 1771 place count 315 transition count 826
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 1771 place count 315 transition count 825
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 1773 place count 314 transition count 825
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 1777 place count 310 transition count 816
Iterating global reduction 12 with 4 rules applied. Total rules applied 1781 place count 310 transition count 816
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 1783 place count 308 transition count 814
Iterating global reduction 12 with 2 rules applied. Total rules applied 1785 place count 308 transition count 814
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Deduced a syphon composed of 159 places in 0 ms
Reduce places removed 159 places and 0 transitions.
Iterating global reduction 12 with 318 rules applied. Total rules applied 2103 place count 149 transition count 655
Drop transitions removed 146 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 12 with 150 rules applied. Total rules applied 2253 place count 149 transition count 505
Discarding 40 places :
Symmetric choice reduction at 13 with 40 rule applications. Total rules 2293 place count 109 transition count 269
Iterating global reduction 13 with 40 rules applied. Total rules applied 2333 place count 109 transition count 269
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 13 with 27 rules applied. Total rules applied 2360 place count 109 transition count 242
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 6 rules applied. Total rules applied 2366 place count 106 transition count 250
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 2368 place count 104 transition count 243
Iterating global reduction 14 with 2 rules applied. Total rules applied 2370 place count 104 transition count 243
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 2374 place count 104 transition count 239
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 15 with 27 rules applied. Total rules applied 2401 place count 104 transition count 212
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 15 with 7 rules applied. Total rules applied 2408 place count 104 transition count 205
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 8 rules applied. Total rules applied 2416 place count 97 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2417 place count 96 transition count 204
Discarding 11 places :
Symmetric choice reduction at 18 with 11 rule applications. Total rules 2428 place count 85 transition count 149
Iterating global reduction 18 with 11 rules applied. Total rules applied 2439 place count 85 transition count 149
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 18 with 18 rules applied. Total rules applied 2457 place count 85 transition count 131
Discarding 1 places :
Symmetric choice reduction at 19 with 1 rule applications. Total rules 2458 place count 84 transition count 129
Iterating global reduction 19 with 1 rules applied. Total rules applied 2459 place count 84 transition count 129
Free-agglomeration rule applied 1 times.
Iterating global reduction 19 with 1 rules applied. Total rules applied 2460 place count 84 transition count 128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 19 with 1 rules applied. Total rules applied 2461 place count 83 transition count 128
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 20 with 3 rules applied. Total rules applied 2464 place count 83 transition count 125
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 20 with 3 rules applied. Total rules applied 2467 place count 80 transition count 125
Partial Free-agglomeration rule applied 46 times.
Drop transitions removed 46 transitions
Iterating global reduction 21 with 46 rules applied. Total rules applied 2513 place count 80 transition count 125
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 21 with 2 rules applied. Total rules applied 2515 place count 80 transition count 125
Applied a total of 2515 rules in 814 ms. Remains 80 /981 variables (removed 901) and now considering 125/3446 (removed 3321) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 125 rows 80 cols
[2022-06-12 21:40:03] [INFO ] Computed 19 place invariants in 1 ms
[2022-06-12 21:40:03] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-06-12 21:40:03] [INFO ] [Real]Absence check using 7 positive and 12 generalized place invariants in 3 ms returned sat
[2022-06-12 21:40:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:40:03] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2022-06-12 21:40:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:40:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-06-12 21:40:03] [INFO ] [Nat]Absence check using 7 positive and 12 generalized place invariants in 2 ms returned sat
[2022-06-12 21:40:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:40:03] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2022-06-12 21:40:03] [INFO ] Computed and/alt/rep : 36/113/36 causal constraints (skipped 57 transitions) in 9 ms.
[2022-06-12 21:40:03] [INFO ] Added : 2 causal constraints over 1 iterations in 27 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-12 21:40:03] [INFO ] Flatten gal took : 119 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12649037011624727635
[2022-06-12 21:40:03] [INFO ] Too many transitions (3446) to apply POR reductions. Disabling POR matrices.
[2022-06-12 21:40:03] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12649037011624727635
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin12649037011624727635]
[2022-06-12 21:40:03] [INFO ] Applying decomposition
[2022-06-12 21:40:03] [INFO ] Flatten gal took : 245 ms
[2022-06-12 21:40:04] [INFO ] Flatten gal took : 159 ms
[2022-06-12 21:40:04] [INFO ] Input system was already deterministic with 3446 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11492047611754379781.txt, -o, /tmp/graph11492047611754379781.bin, -w, /tmp/graph11492047611754379781.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11492047611754379781.bin, -l, -1, -v, -w, /tmp/graph11492047611754379781.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:40:04] [INFO ] Decomposing Gal with order
[2022-06-12 21:40:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:40:04] [INFO ] Removed a total of 5712 redundant transitions.
[2022-06-12 21:40:04] [INFO ] Flatten gal took : 443 ms
[2022-06-12 21:40:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2443 labels/synchronizations in 112 ms.
[2022-06-12 21:40:05] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability14548299686452742334.gal : 18 ms
[2022-06-12 21:40:05] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability10409123850626239919.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability14548299686452742334.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability10409123850626239919.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability14548299686452742334.gal -t CGAL -reachable-file /tmp/ReachabilityFireability10409123850626239919.prop --nowitness
[2022-06-12 21:40:05] [INFO ] Ran tautology test, simplified 0 / 1 in 1212 ms.
[2022-06-12 21:40:05] [INFO ] BMC solution for property MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14(UNSAT) depth K=0 took 45 ms
[2022-06-12 21:40:05] [INFO ] BMC solution for property MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14(UNSAT) depth K=1 took 61 ms
Loading property file /tmp/ReachabilityFireability10409123850626239919.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 3059 out of 3446 initially.
// Phase 1: matrix 3059 rows 981 cols
[2022-06-12 21:40:06] [INFO ] Computed 45 place invariants in 72 ms
inv : -Rx2IsActiveAndNotInTheLeafSet + Rx3IsActiveAndNotInTheLeafSet - Rx3IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node10IsActive + NodesCanDetectThatNode10HasCrashed = 1
inv : Node2NotifyThatHeIsActive + NodesCanDetectThatNode2HasCrashed = 1
inv : Lx3IsActiveAndNotInTheLeafSet - Lx4IsActiveAndNotInTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node3IsActive + NodesCanDetectThatNode3HasCrashed = 1
inv : Rx0IsAtTheRightExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet - Rx2IsActiveAndNotInTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet = 0
inv : Lx0IsActiveAndNotInTheLeafSet + Lx1IsAtTheLeftExtremityOfTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet - Lx4IsActiveAndNotInTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node9NotifyThatHeIsActive + NodesCanDetectThatNode9HasCrashed = 1
inv : Node1HasAskedItsLeafSetToLx3ToReplaceNode0 + Node1HasAskedItsLeafSetToLx3ToReplaceNode2 - RequestOfNode1IsSentToLx3 - Lx3HasReceivedTheRequestOfNode1 = 0
inv : Node2IsActive + NodesCanDetectThatNode2HasCrashed = 1
inv : Node13NotifyThatHeIsActive + NodesCanDetectThatNode13HasCrashed = 1
inv : Node7IsActive + NodesCanDetectThatNode7HasCrashed = 1
inv : Node0IsTheNodeMaster + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode14 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node1IsTheNodeMaster + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node2IsTheNodeMaster + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node3IsTheNodeMaster + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node4IsTheNodeMaster + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node5IsTheNodeMaster + Node5IsNotifiedThatHeIsTheNewMaster + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node5ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node6IsTheNodeMaster + Node6ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node7IsTheNodeMaster + Node8IsTheNodeMaster + Node9IsTheNodeMaster + Node10IsTheNodeMaster + Node10ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node11IsTheNodeMaster + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node11ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node12IsTheNodeMaster + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node13IsTheNodeMaster + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode9ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node14IsTheNodeMaster + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node15IsTheNodeMaster + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node16IsTheNodeMaster + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode14 = 1
inv : Node9IsActive + NodesCanDetectThatNode9HasCrashed = 1
inv : Node14NotifyThatHeIsActive + NodesCanDetectThatNode14HasCrashed = 1
inv : Node7NotifyThatHeIsActive + NodesCanDetectThatNode7HasCrashed = 1
inv : Node13IsActive + NodesCanDetectThatNode13HasCrashed = 1
inv : Node3NotifyThatHeIsActive + NodesCanDetectThatNode3HasCrashed = 1
inv : Lx1IsActiveAndNotInTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet - Lx4IsActiveAndNotInTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node14IsActive + NodesCanDetectThatNode14HasCrashed = 1
inv : Rx1IsActiveAndNotInTheLeafSet - Rx2IsActiveAndNotInTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet = 0
inv : NoCrashIsHappening + Node0HasDetectedCrashOfNode1 + Node0HasDetectedCrashOfNode2 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node0HasDetectedCrashOfNode3 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node0HasDetectedCrashOfNode4 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode4 + Node0HasDetectedCrashOfNode5 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode5 + Node0HasDetectedCrashOfNode6 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode6 + Node0HasDetectedCrashOfNode7 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode7 + Node0HasDetectedCrashOfNode8 + Node0ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode8 + Node0HasDetectedCrashOfNode9 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode9 + Node0HasDetectedCrashOfNode10 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode10 + Node0HasDetectedCrashOfNode11 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode11 + Node0HasDetectedCrashOfNode12 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode12 + Node0HasTheLeafSetOfRx3ToReplaceNode12 + Node0HasDetectedCrashOfNode13 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode13 + Node0HasDetectedCrashOfNode14 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode14 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node0HasDetectedCrashOfNode15 + Node0HasDetectedCrashOfNode16 + RequestOfNode0IsSentToLx0 + RequestOfNode0IsSentToRx0 + RequestOfNode0IsSentToLx1 + RequestOfNode0IsSentToRx1 + RequestOfNode0IsSentToLx2 + RequestOfNode0IsSentToRx2 + RequestOfNode0IsSentToLx3 + RequestOfNode0IsSentToRx3 + RequestOfNode0IsSentToLx4 + RequestOfNode0IsSentToRx4 + Node0DontAnswerToAnyNode + Node1HasDetectedCrashOfNode0 + Node1HasTheLeafSetOfLx3ToReplaceNode0 + Node1HasDetectedCrashOfNode2 + Node1HasDetectedCrashOfNode3 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node1HasDetectedCrashOfNode4 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node1HasDetectedCrashOfNode5 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node1HasDetectedCrashOfNode6 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node1HasDetectedCrashOfNode7 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node1HasDetectedCrashOfNode8 + Node1ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node1HasDetectedCrashOfNode9 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node1HasDetectedCrashOfNode10 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node1HasDetectedCrashOfNode11 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node1HasDetectedCrashOfNode12 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node1HasDetectedCrashOfNode13 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node1HasDetectedCrashOfNode14 + Node1HasDetectedCrashOfNode15 + Node1HasDetectedCrashOfNode16 + RequestOfNode1IsSentToLx3 + RequestOfNode1IsSentToRx3 + Node1DontAnswerToAnyNode + Node2HasDetectedCrashOfNode0 + Node2HasDetectedCrashOfNode1 + Node2HasDetectedCrashOfNode3 + Node2HasDetectedCrashOfNode4 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node2HasDetectedCrashOfNode5 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node2HasDetectedCrashOfNode6 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node2HasDetectedCrashOfNode7 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node2HasDetectedCrashOfNode8 + Node2ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node2HasDetectedCrashOfNode9 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node2HasDetectedCrashOfNode10 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node2HasDetectedCrashOfNode11 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node2HasDetectedCrashOfNode12 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node2HasDetectedCrashOfNode13 + Node2HasDetectedCrashOfNode14 + Node2HasDetectedCrashOfNode15 + Node2HasDetectedCrashOfNode16 + Node2DontAnswerToAnyNode + Node3HasDetectedCrashOfNode0 + Node3HasDetectedCrashOfNode1 + Node3HasDetectedCrashOfNode2 + Node3HasDetectedCrashOfNode4 + Node3HasDetectedCrashOfNode5 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node3HasDetectedCrashOfNode6 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node3HasDetectedCrashOfNode7 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node3HasDetectedCrashOfNode8 + Node3ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node3HasDetectedCrashOfNode9 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node3HasDetectedCrashOfNode10 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node3HasDetectedCrashOfNode11 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node3HasDetectedCrashOfNode12 + Node3HasDetectedCrashOfNode13 + Node3HasDetectedCrashOfNode14 + Node3HasDetectedCrashOfNode15 + Node3HasDetectedCrashOfNode16 + Node3DontAnswerToAnyNode + Node4HasDetectedCrashOfNode0 + Node4HasDetectedCrashOfNode1 + Node4HasDetectedCrashOfNode2 + Node4HasDetectedCrashOfNode3 + Node4HasDetectedCrashOfNode5 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node4HasDetectedCrashOfNode6 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node4HasDetectedCrashOfNode7 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node4HasDetectedCrashOfNode8 + Node4ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node4HasDetectedCrashOfNode9 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node4HasDetectedCrashOfNode10 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node4HasDetectedCrashOfNode11 + Node4HasDetectedCrashOfNode12 + Node4HasDetectedCrashOfNode13 + Node4HasDetectedCrashOfNode14 + Node4HasDetectedCrashOfNode15 + Node4HasDetectedCrashOfNode16 + Node4DontAnswerToAnyNode + Node5HasDetectedCrashOfNode0 + Node5HasDetectedCrashOfNode1 + Node5HasDetectedCrashOfNode2 + Node5HasDetectedCrashOfNode3 + Node5HasDetectedCrashOfNode4 + Node5HasDetectedCrashOfNode6 + Node5HasDetectedCrashOfNode7 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node5HasDetectedCrashOfNode8 + Node5ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node5HasDetectedCrashOfNode9 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node5HasDetectedCrashOfNode10 + Node5HasDetectedCrashOfNode11 + Node5HasDetectedCrashOfNode12 + Node5HasDetectedCrashOfNode13 + Node5HasDetectedCrashOfNode14 + Node5HasDetectedCrashOfNode15 + Node5HasDetectedCrashOfNode16 + Node5DontAnswerToAnyNode + Node6HasDetectedCrashOfNode0 + Node6HasDetectedCrashOfNode1 + Node6HasDetectedCrashOfNode2 + Node6HasDetectedCrashOfNode3 + Node6HasDetectedCrashOfNode4 + Node6HasDetectedCrashOfNode5 + Node6HasDetectedCrashOfNode7 + Node6HasDetectedCrashOfNode8 + Node6ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node6HasDetectedCrashOfNode9 + Node6HasDetectedCrashOfNode10 + Node6HasDetectedCrashOfNode11 + Node6HasDetectedCrashOfNode12 + Node6HasDetectedCrashOfNode13 + Node6HasDetectedCrashOfNode14 + Node6HasDetectedCrashOfNode15 + Node6HasDetectedCrashOfNode16 + Node6DontAnswerToAnyNode + Node7HasDetectedCrashOfNode0 + Node7HasDetectedCrashOfNode1 + Node7HasDetectedCrashOfNode2 + Node7HasDetectedCrashOfNode3 + Node7HasDetectedCrashOfNode4 + Node7HasDetectedCrashOfNode5 + Node7HasDetectedCrashOfNode6 + Node7HasDetectedCrashOfNode8 + Node7HasDetectedCrashOfNode9 + Node7HasDetectedCrashOfNode10 + Node7HasDetectedCrashOfNode11 + Node7HasDetectedCrashOfNode12 + Node7HasDetectedCrashOfNode13 + Node7HasDetectedCrashOfNode14 + Node7HasDetectedCrashOfNode15 + Node7HasDetectedCrashOfNode16 + Node7DontAnswerToAnyNode + Node8HasDetectedCrashOfNode0 + Node8HasDetectedCrashOfNode1 + Node8HasDetectedCrashOfNode2 + Node8HasDetectedCrashOfNode3 + Node8HasDetectedCrashOfNode4 + Node8HasDetectedCrashOfNode5 + Node8HasDetectedCrashOfNode6 + Node8HasDetectedCrashOfNode7 + Node8HasDetectedCrashOfNode9 + Node8HasDetectedCrashOfNode10 + Node8HasDetectedCrashOfNode11 + Node8HasDetectedCrashOfNode12 + Node8HasDetectedCrashOfNode13 + Node8HasDetectedCrashOfNode14 + Node8HasDetectedCrashOfNode15 + Node8HasDetectedCrashOfNode16 + Node9HasDetectedCrashOfNode0 + Node9HasDetectedCrashOfNode1 + Node9HasDetectedCrashOfNode2 + Node9HasDetectedCrashOfNode3 + Node9HasDetectedCrashOfNode4 + Node9HasDetectedCrashOfNode5 + Node9HasDetectedCrashOfNode6 + Node9HasDetectedCrashOfNode7 + Node9HasDetectedCrashOfNode8 + Node9HasDetectedCrashOfNode10 + Node9HasDetectedCrashOfNode11 + Node9HasDetectedCrashOfNode12 + Node9HasDetectedCrashOfNode13 + Node9HasDetectedCrashOfNode14 + Node9HasDetectedCrashOfNode15 + Node9HasDetectedCrashOfNode16 + Node9DontAnswerToAnyNode + Node10HasDetectedCrashOfNode0 + Node10HasDetectedCrashOfNode1 + Node10HasDetectedCrashOfNode2 + Node10HasDetectedCrashOfNode3 + Node10HasDetectedCrashOfNode4 + Node10HasDetectedCrashOfNode5 + Node10HasDetectedCrashOfNode6 + Node10HasDetectedCrashOfNode7 + Node10HasDetectedCrashOfNode8 + Node10ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node10HasDetectedCrashOfNode9 + Node10HasDetectedCrashOfNode11 + Node10HasDetectedCrashOfNode12 + Node10HasDetectedCrashOfNode13 + Node10HasDetectedCrashOfNode14 + Node10HasDetectedCrashOfNode15 + Node10HasDetectedCrashOfNode16 + Node10DontAnswerToAnyNode + Node11HasDetectedCrashOfNode0 + Node11HasDetectedCrashOfNode1 + Node11HasDetectedCrashOfNode2 + Node11HasDetectedCrashOfNode3 + Node11HasDetectedCrashOfNode4 + Node11HasDetectedCrashOfNode5 + Node11HasDetectedCrashOfNode6 + Node11HasDetectedCrashOfNode7 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node11HasDetectedCrashOfNode8 + Node11ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node11HasDetectedCrashOfNode9 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node11HasDetectedCrashOfNode10 + Node11HasDetectedCrashOfNode12 + Node11HasDetectedCrashOfNode13 + Node11HasDetectedCrashOfNode14 + Node11HasDetectedCrashOfNode15 + Node11HasDetectedCrashOfNode16 + Node11DontAnswerToAnyNode + Node12HasDetectedCrashOfNode0 + Node12HasDetectedCrashOfNode1 + Node12HasDetectedCrashOfNode2 + Node12HasDetectedCrashOfNode3 + Node12HasDetectedCrashOfNode4 + Node12HasDetectedCrashOfNode5 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node12HasDetectedCrashOfNode6 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node12HasDetectedCrashOfNode7 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node12HasDetectedCrashOfNode8 + Node12ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node12HasDetectedCrashOfNode9 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node12HasDetectedCrashOfNode10 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node12HasDetectedCrashOfNode11 + Node12HasDetectedCrashOfNode13 + Node12HasDetectedCrashOfNode14 + Node12HasDetectedCrashOfNode15 + Node12HasDetectedCrashOfNode16 + Node12DontAnswerToAnyNode + Node13HasDetectedCrashOfNode0 + Node13HasDetectedCrashOfNode1 + Node13HasDetectedCrashOfNode2 + Node13HasDetectedCrashOfNode3 + Node13HasDetectedCrashOfNode4 + Node13HasDetectedCrashOfNode5 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node13HasDetectedCrashOfNode6 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node13HasDetectedCrashOfNode7 + Node13ThinksNode9ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node13HasDetectedCrashOfNode8 + Node13ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node13HasDetectedCrashOfNode9 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node13HasDetectedCrashOfNode10 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node13HasDetectedCrashOfNode11 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node13HasDetectedCrashOfNode12 + Node13HasDetectedCrashOfNode14 + Node13HasDetectedCrashOfNode15 + Node13HasDetectedCrashOfNode16 + Node13DontAnswerToAnyNode + Node14HasDetectedCrashOfNode0 + Node14HasDetectedCrashOfNode1 + Node14HasDetectedCrashOfNode2 + Node14HasDetectedCrashOfNode3 + Node14HasDetectedCrashOfNode4 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node14HasDetectedCrashOfNode5 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node14HasDetectedCrashOfNode6 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node14HasDetectedCrashOfNode7 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node14HasDetectedCrashOfNode8 + Node14ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node14HasDetectedCrashOfNode9 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node14HasDetectedCrashOfNode10 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node14HasDetectedCrashOfNode11 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node14HasDetectedCrashOfNode12 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node14HasDetectedCrashOfNode13 + Node14HasDetectedCrashOfNode15 + Node14HasDetectedCrashOfNode16 + Node14DontAnswerToAnyNode + Node15HasDetectedCrashOfNode0 + Node15HasDetectedCrashOfNode1 + Node15HasDetectedCrashOfNode2 + Node15HasDetectedCrashOfNode3 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node15HasDetectedCrashOfNode4 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node15HasDetectedCrashOfNode5 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node15HasDetectedCrashOfNode6 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node15HasDetectedCrashOfNode7 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node15ManageTheCrashOfNode8 + Node15HasDetectedCrashOfNode8 + Node15ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node15HasDetectedCrashOfNode9 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node15HasDetectedCrashOfNode10 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node15HasDetectedCrashOfNode11 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node15HasDetectedCrashOfNode12 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node15HasDetectedCrashOfNode13 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node15HasDetectedCrashOfNode14 + Node15HasDetectedCrashOfNode16 + Node15DontAnswerToAnyNode + Node16ManageTheCrashOfNode0 + Node16HasDetectedCrashOfNode0 + Node16HasDetectedCrashOfNode1 + Node16HasDetectedCrashOfNode2 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node16HasDetectedCrashOfNode3 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node16HasDetectedCrashOfNode4 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node16HasDetectedCrashOfNode5 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode5 + Node16HasDetectedCrashOfNode6 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode6 + Node16HasDetectedCrashOfNode7 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode7 + Node16HasDetectedCrashOfNode8 + Node16ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode8 + Node16HasDetectedCrashOfNode9 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode9 + Node16HasDetectedCrashOfNode10 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode10 + Node16HasDetectedCrashOfNode11 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode11 + Node16HasDetectedCrashOfNode12 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode12 + Node16HasDetectedCrashOfNode13 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode13 + Node16HasDetectedCrashOfNode14 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode14 + Node16HasDetectedCrashOfNode15 + Lx0HasReceivedTheRequestOfNode0 + Lx1HasReceivedTheRequestOfNode0 + Lx2HasReceivedTheRequestOfNode0 + Lx3HasReceivedTheRequestOfNode0 + Lx3HasReceivedTheRequestOfNode1 + Lx4HasReceivedTheRequestOfNode0 + Rx0HasReceivedTheRequestOfNode0 + Rx1HasReceivedTheRequestOfNode0 + Rx2HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode1 + Rx4HasReceivedTheRequestOfNode0 + ANodeFromTheLeafSetOfLx3IsACtiveInTheLeafSet + ANodeFromTheLeafSetOfRx3IsACtiveInTheLeafSet = 1
inv : Node10NotifyThatHeIsActive + NodesCanDetectThatNode10HasCrashed = 1
inv : Node5IsActive + NodesCanDetectThatNode5HasCrashed = 1
inv : NoCrashIsHappening + ThereIsAMasterInTheLeafSet + Node0AsksIsThereANodeMaster + Node0HasTheLeafSetOfRx3ToReplaceNode12 + RequestOfNode0IsSentToLx0 + RequestOfNode0IsSentToRx0 + RequestOfNode0IsSentToLx1 + RequestOfNode0IsSentToRx1 + RequestOfNode0IsSentToLx2 + RequestOfNode0IsSentToRx2 + RequestOfNode0IsSentToLx3 + RequestOfNode0IsSentToRx3 + RequestOfNode0IsSentToLx4 + RequestOfNode0IsSentToRx4 + Node0DontAnswerToAnyNode + Node1AsksIsThereANodeMaster + Node1HasTheLeafSetOfLx3ToReplaceNode0 + RequestOfNode1IsSentToLx3 + RequestOfNode1IsSentToRx3 + Node1DontAnswerToAnyNode + Node2AsksIsThereANodeMaster + Node2DontAnswerToAnyNode + Node3AsksIsThereANodeMaster + Node3DontAnswerToAnyNode + Node4AsksIsThereANodeMaster + Node4DontAnswerToAnyNode + Node5AsksIsThereANodeMaster + Node5DontAnswerToAnyNode + Node6AsksIsThereANodeMaster + Node6DontAnswerToAnyNode + Node7AsksIsThereANodeMaster + Node7DontAnswerToAnyNode + Node8AsksIsThereANodeMaster + Node9AsksIsThereANodeMaster + Node9DontAnswerToAnyNode + Node10AsksIsThereANodeMaster + Node10DontAnswerToAnyNode + Node11AsksIsThereANodeMaster + Node11DontAnswerToAnyNode + Node12AsksIsThereANodeMaster + Node12DontAnswerToAnyNode + Node13AsksIsThereANodeMaster + Node13DontAnswerToAnyNode + Node14AsksIsThereANodeMaster + Node14DontAnswerToAnyNode + Node15AsksIsThereANodeMaster + Node15ManageTheCrashOfNode8 + Node15DontAnswerToAnyNode + Node16AsksIsThereANodeMaster + Node16ManageTheCrashOfNode0 + Lx0HasReceivedTheRequestOfNode0 + Lx1HasReceivedTheRequestOfNode0 + Lx2HasReceivedTheRequestOfNode0 + Lx3HasReceivedTheRequestOfNode0 + Lx3HasReceivedTheRequestOfNode1 + Lx4HasReceivedTheRequestOfNode0 + Rx0HasReceivedTheRequestOfNode0 + Rx1HasReceivedTheRequestOfNode0 + Rx2HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode1 + Rx4HasReceivedTheRequestOfNode0 + ANodeFromTheLeafSetOfLx3IsACtiveInTheLeafSet + ANodeFromTheLeafSetOfRx3IsACtiveInTheLeafSet = 1
inv : Node6NotifyThatHeIsActive + NodesCanDetectThatNode6HasCrashed = 1
inv : Node5NotifyThatHeIsActive + NodesCanDetectThatNode5HasCrashed = 1
inv : Node4IsActive + NodesCanDetectThatNode4HasCrashed = 1
inv : Node6IsActive + NodesCanDetectThatNode6HasCrashed = 1
inv : Node4NotifyThatHeIsActive + NodesCanDetectThatNode4HasCrashed = 1
inv : Node15NotifyThatHeIsActive + NodesCanDetectThatNode15HasCrashed = 1
inv : Node1NotifyThatHeIsActive + NodesCanDetectThatNode1HasCrashed = 1
inv : CrashReservoir - NoCrashIsHappening + Lx1IsAtTheLeftExtremityOfTheLeafSet + 2*Lx2IsAtTheLeftExtremityOfTheLeafSet + 3*Lx3IsAtTheLeftExtremityOfTheLeafSet - 5*Lx4IsActiveAndNotInTheLeafSet + 4*Lx4IsAtTheLeftExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet - 5*Rx2IsActiveAndNotInTheLeafSet + 2*Rx2IsAtTheRightExtremityOfTheLeafSet - 2*Rx3IsAtTheRightExtremityOfTheLeafSet - Rx4IsAtTheRightExtremityOfTheLeafSet = -6
inv : Node15IsActive + NodesCanDetectThatNode15HasCrashed = 1
inv : Node1IsActive + NodesCanDetectThatNode1HasCrashed = 1
inv : Node12NotifyThatHeIsActive + NodesCanDetectThatNode12HasCrashed = 1
inv : Rx0IsActiveAndNotInTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet - Rx2IsActiveAndNotInTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node11IsActive + NodesCanDetectThatNode11HasCrashed = 1
inv : -NoCrashIsHappening + Node0IsActive - NodesCanDetectThatNode1HasCrashed - NodesCanDetectThatNode2HasCrashed - NodesCanDetectThatNode3HasCrashed - NodesCanDetectThatNode4HasCrashed - NodesCanDetectThatNode5HasCrashed - NodesCanDetectThatNode6HasCrashed - NodesCanDetectThatNode7HasCrashed + Node8IsActive - NodesCanDetectThatNode9HasCrashed - NodesCanDetectThatNode10HasCrashed - NodesCanDetectThatNode11HasCrashed - NodesCanDetectThatNode12HasCrashed - NodesCanDetectThatNode13HasCrashed - NodesCanDetectThatNode14HasCrashed - NodesCanDetectThatNode15HasCrashed + Node16IsActive + Lx1IsAtTheLeftExtremityOfTheLeafSet + 2*Lx2IsAtTheLeftExtremityOfTheLeafSet + 3*Lx3IsAtTheLeftExtremityOfTheLeafSet - 5*Lx4IsActiveAndNotInTheLeafSet + 4*Lx4IsAtTheLeftExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet - 5*Rx2IsActiveAndNotInTheLeafSet + 2*Rx2IsAtTheRightExtremityOfTheLeafSet - 2*Rx3IsAtTheRightExtremityOfTheLeafSet - Rx4IsAtTheRightExtremityOfTheLeafSet = -8
inv : -Rx2IsActiveAndNotInTheLeafSet - Rx3IsAtTheRightExtremityOfTheLeafSet + Rx4IsActiveAndNotInTheLeafSet - Rx4IsAtTheRightExtremityOfTheLeafSet = 0
inv : Lx0IsAtTheLeftExtremityOfTheLeafSet + Lx1IsAtTheLeftExtremityOfTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet - Lx4IsActiveAndNotInTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node12IsActive + NodesCanDetectThatNode12HasCrashed = 1
inv : Node0HasAskedItsLeafSetToRx3ToReplaceNode9 + Node0HasAskedItsLeafSetToRx3ToReplaceNode12 - RequestOfNode0IsSentToRx3 - Rx3HasReceivedTheRequestOfNode0 = 0
inv : Lx2IsActiveAndNotInTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet - Lx4IsActiveAndNotInTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node11NotifyThatHeIsActive + NodesCanDetectThatNode11HasCrashed = 1
Total of 45 invariants.
[2022-06-12 21:40:06] [INFO ] Computed 45 place invariants in 86 ms
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 228
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :228 after 245
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :245 after 392
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :392 after 396
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :396 after 396
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :396 after 396
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :396 after 396
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :396 after 396
[2022-06-12 21:40:16] [INFO ] Proved 981 variables to be positive in 10107 ms
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :396 after 511
[2022-06-12 21:40:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14
[2022-06-12 21:40:16] [INFO ] KInduction solution for property MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14(SAT) depth K=0 took 454 ms
[2022-06-12 21:40:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14
[2022-06-12 21:40:28] [INFO ] KInduction solution for property MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14(SAT) depth K=1 took 11121 ms
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :511 after 1981
Compilation finished in 51505 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12649037011624727635]
Link finished in 88 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, MultiCrashLeafsetExtensionPTS16C05ReachabilityFireability14==true], workingDir=/tmp/ltsmin12649037011624727635]
[2022-06-12 21:41:16] [INFO ] BMC solution for property MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14(UNSAT) depth K=2 took 70596 ms
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1981 after 4630
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4630 after 7143
[2022-06-12 21:56:47] [INFO ] BMC solution for property MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14(UNSAT) depth K=3 took 930816 ms
Detected timeout of ITS tools.
[2022-06-12 22:02:21] [INFO ] Applying decomposition
[2022-06-12 22:02:22] [INFO ] Flatten gal took : 354 ms
[2022-06-12 22:02:22] [INFO ] Decomposing Gal with order
[2022-06-12 22:02:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:02:23] [INFO ] Removed a total of 5691 redundant transitions.
[2022-06-12 22:02:23] [INFO ] Flatten gal took : 1300 ms
[2022-06-12 22:02:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 2686 labels/synchronizations in 398 ms.
[2022-06-12 22:02:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability32833875315698973.gal : 52 ms
[2022-06-12 22:02:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability5611736375164126034.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability32833875315698973.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability5611736375164126034.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability32833875315698973.gal -t CGAL -reachable-file /tmp/ReachabilityFireability5611736375164126034.prop --nowitness
Loading property file /tmp/ReachabilityFireability5611736375164126034.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 267
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :267 after 283
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :283 after 800
LTSmin run took 1328965 ms.
Invariant validated
FORMULA MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
[2022-06-12 22:03:04] [WARNING] Interrupting SMT solver.
java.lang.InterruptedException
at java.base/java.lang.Object.wait(Native Method)
at java.base/java.lang.Thread.join(Thread.java:1305)
at java.base/java.lang.Thread.join(Thread.java:1380)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.checkProperties(Gal2SMTFrontEnd.java:184)
at fr.lip6.move.gal.application.SMTRunner$2.run(SMTRunner.java:103)
at java.base/java.lang.Thread.run(Thread.java:834)
ITS tools runner thread asked to quit. Dying gracefully.
[2022-06-12 22:03:04] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-12 22:03:04] [WARNING] Unexpected error occurred while running SMT. Was verifying MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14 SMT depth 4
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 3 more
[2022-06-12 22:03:04] [INFO ] During BMC, SMT solver timed out at depth 4
[2022-06-12 22:03:04] [INFO ] BMC solving timed out (3600000 secs) at depth 4
[2022-06-12 22:03:04] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
[2022-06-12 22:03:04] [WARNING] Unexpected error occurred while running SMT. Was verifying MultiCrashLeafsetExtension-PT-S16C05-ReachabilityFireability-14 K-induction depth 2
Exception in thread "Thread-27" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 3 more

BK_STOP 1655071385604

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r143-tall-165271830400255"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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