Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 37K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 125K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 27K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.6K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.7K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 6.3K May 11 18:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 11 18:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 11 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 11M May 12 08:13 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 gen-ReachabilityFireability-00
FORMULA_NAME gen-ReachabilityFireability-01
FORMULA_NAME gen-ReachabilityFireability-02
FORMULA_NAME gen-ReachabilityFireability-03
FORMULA_NAME gen-ReachabilityFireability-04
FORMULA_NAME gen-ReachabilityFireability-05
FORMULA_NAME gen-ReachabilityFireability-06
FORMULA_NAME gen-ReachabilityFireability-07
FORMULA_NAME gen-ReachabilityFireability-08
FORMULA_NAME gen-ReachabilityFireability-09
FORMULA_NAME gen-ReachabilityFireability-10
FORMULA_NAME gen-ReachabilityFireability-11
FORMULA_NAME gen-ReachabilityFireability-12
FORMULA_NAME gen-ReachabilityFireability-13
FORMULA_NAME gen-ReachabilityFireability-14
FORMULA_NAME gen-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621330306123

Running Version 0
[2021-05-18 09:31:47] [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]
[2021-05-18 09:31:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 09:31:48] [INFO ] Load time of PNML (sax parser for PT used): 348 ms
[2021-05-18 09:31:48] [INFO ] Transformed 5568 places.
[2021-05-18 09:31:48] [INFO ] Transformed 7799 transitions.
[2021-05-18 09:31:48] [INFO ] Parsed PT model containing 5568 places and 7799 transitions in 423 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 161 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 16) seen :1
FORMULA gen-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 283654 steps, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen :{}
Probabilistic random walk after 283654 steps, saw 133382 distinct states, run finished after 30004 ms. (steps per millisecond=9 ) properties seen :{}
Running SMT prover for 15 properties.
[2021-05-18 09:32:18] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2021-05-18 09:32:19] [INFO ] Computed 573 place invariants in 591 ms
[2021-05-18 09:32:21] [INFO ] [Real]Absence check using 50 positive place invariants in 24 ms returned sat
[2021-05-18 09:32:21] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 221 ms returned sat
[2021-05-18 09:32:21] [INFO ] SMT Verify possible in real domain returnedunsat :2 sat :0 real:13
[2021-05-18 09:32:22] [INFO ] [Nat]Absence check using 50 positive place invariants in 24 ms returned sat
[2021-05-18 09:32:23] [INFO ] [Nat]Absence check using 50 positive and 523 generalized place invariants in 220 ms returned sat
[2021-05-18 09:32:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:32:30] [INFO ] [Nat]Absence check using state equation in 6889 ms returned unsat :8 sat :7
[2021-05-18 09:32:30] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2021-05-18 09:32:30] [INFO ] [Nat]Added 2195 Read/Feed constraints in 106 ms returned sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-18 09:32:46] [INFO ] SMT Verify possible in nat domain returned unsat :8 sat :5
FORMULA gen-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 5 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.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 32 out of 5568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.30 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1606 transitions
Trivial Post-agglo rules discarded 1606 transitions
Performed 1606 trivial Post agglomeration. Transition count delta: 1606
Iterating post reduction 0 with 1606 rules applied. Total rules applied 1607 place count 5536 transition count 6193
Reduce places removed 1606 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 1630 rules applied. Total rules applied 3237 place count 3930 transition count 6169
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 3261 place count 3906 transition count 6169
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 201 Pre rules applied. Total rules applied 3261 place count 3906 transition count 5968
Deduced a syphon composed of 201 places in 6 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 3663 place count 3705 transition count 5968
Discarding 1423 places :
Symmetric choice reduction at 3 with 1423 rule applications. Total rules 5086 place count 2282 transition count 4545
Iterating global reduction 3 with 1423 rules applied. Total rules applied 6509 place count 2282 transition count 4545
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 6509 place count 2282 transition count 4537
Deduced a syphon composed of 8 places in 7 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 6525 place count 2274 transition count 4537
Discarding 230 places :
Symmetric choice reduction at 3 with 230 rule applications. Total rules 6755 place count 2044 transition count 3157
Iterating global reduction 3 with 230 rules applied. Total rules applied 6985 place count 2044 transition count 3157
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 7015 place count 2029 transition count 3142
Free-agglomeration rule (complex) applied 150 times.
Iterating global reduction 3 with 150 rules applied. Total rules applied 7165 place count 2029 transition count 4107
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 7315 place count 1879 transition count 4107
Partial Free-agglomeration rule applied 65 times.
Drop transitions removed 65 transitions
Iterating global reduction 4 with 65 rules applied. Total rules applied 7380 place count 1879 transition count 4107
Applied a total of 7380 rules in 2253 ms. Remains 1879 /5568 variables (removed 3689) and now considering 4107/7799 (removed 3692) transitions.
Finished structural reductions, in 1 iterations. Remains : 1879/5568 places, 4107/7799 transitions.
[2021-05-18 09:32:49] [INFO ] Flatten gal took : 441 ms
[2021-05-18 09:32:49] [INFO ] Flatten gal took : 217 ms
[2021-05-18 09:32:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18204510814883852933.gal : 60 ms
[2021-05-18 09:32:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5354855231245944879.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/ReachabilityCardinality18204510814883852933.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5354855231245944879.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/ReachabilityCardinality18204510814883852933.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5354855231245944879.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5354855231245944879.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :7 after 9
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :9 after 14
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :14 after 31
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :31 after 36
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :36 after 46
Detected timeout of ITS tools.
[2021-05-18 09:33:05] [INFO ] Flatten gal took : 200 ms
[2021-05-18 09:33:05] [INFO ] Applying decomposition
[2021-05-18 09:33:05] [INFO ] Flatten gal took : 194 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/graph15527077906572013275.txt, -o, /tmp/graph15527077906572013275.bin, -w, /tmp/graph15527077906572013275.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/graph15527077906572013275.bin, -l, -1, -v, -w, /tmp/graph15527077906572013275.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:33:05] [INFO ] Decomposing Gal with order
[2021-05-18 09:33:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:33:07] [INFO ] Removed a total of 4562 redundant transitions.
[2021-05-18 09:33:07] [INFO ] Flatten gal took : 1689 ms
[2021-05-18 09:33:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 5142 labels/synchronizations in 384 ms.
[2021-05-18 09:33:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12759477014169058757.gal : 37 ms
[2021-05-18 09:33:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12844865113515102799.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/ReachabilityCardinality12759477014169058757.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12844865113515102799.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/ReachabilityCardinality12759477014169058757.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12844865113515102799.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12844865113515102799.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7975036493453249511
[2021-05-18 09:33:23] [INFO ] Built C files in 82ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7975036493453249511
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/ltsmin7975036493453249511]
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/ltsmin7975036493453249511] 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/ltsmin7975036493453249511] 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 26355 resets, run finished after 17624 ms. (steps per millisecond=56 ) properties (out of 5) seen :2
FORMULA gen-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4856 resets, run finished after 3967 ms. (steps per millisecond=252 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4858 resets, run finished after 4282 ms. (steps per millisecond=233 ) properties (out of 3) seen :1
FORMULA gen-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 4853 resets, run finished after 3919 ms. (steps per millisecond=255 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-18 09:33:54] [INFO ] Flow matrix only has 3722 transitions (discarded 385 similar events)
// Phase 1: matrix 3722 rows 1879 cols
[2021-05-18 09:33:54] [INFO ] Computed 541 place invariants in 65 ms
[2021-05-18 09:33:54] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2021-05-18 09:33:54] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 94 ms returned sat
[2021-05-18 09:33:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:33:55] [INFO ] [Real]Absence check using state equation in 1068 ms returned sat
[2021-05-18 09:33:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:33:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 39 ms returned sat
[2021-05-18 09:33:56] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 89 ms returned sat
[2021-05-18 09:33:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:33:57] [INFO ] [Nat]Absence check using state equation in 998 ms returned sat
[2021-05-18 09:33:57] [INFO ] State equation strengthened by 2160 read => feed constraints.
[2021-05-18 09:34:00] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:34:03] [INFO ] [Nat]Added 2160 Read/Feed constraints in 5907 ms returned sat
[2021-05-18 09:34:07] [INFO ] Deduced a trap composed of 227 places in 4181 ms of which 2789 ms to minimize.
[2021-05-18 09:34:09] [INFO ] Deduced a trap composed of 399 places in 1367 ms of which 2 ms to minimize.
[2021-05-18 09:34:10] [INFO ] Deduced a trap composed of 234 places in 1496 ms of which 16 ms to minimize.
[2021-05-18 09:34:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 7688 ms
[2021-05-18 09:34:11] [INFO ] Computed and/alt/rep : 1679/4001/1679 causal constraints (skipped 2026 transitions) in 352 ms.
[2021-05-18 09:34:14] [INFO ] Added : 80 causal constraints over 17 iterations in 3762 ms. Result :sat
[2021-05-18 09:34:15] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2021-05-18 09:34:15] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 97 ms returned sat
[2021-05-18 09:34:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:34:16] [INFO ] [Real]Absence check using state equation in 972 ms returned sat
[2021-05-18 09:34:17] [INFO ] [Real]Added 2160 Read/Feed constraints in 935 ms returned sat
[2021-05-18 09:34:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:34:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 68 ms returned sat
[2021-05-18 09:34:17] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 113 ms returned sat
[2021-05-18 09:34:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:34:18] [INFO ] [Nat]Absence check using state equation in 1004 ms returned sat
[2021-05-18 09:34:21] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:34:24] [INFO ] [Nat]Added 2160 Read/Feed constraints in 5884 ms returned sat
[2021-05-18 09:34:25] [INFO ] Deduced a trap composed of 270 places in 1353 ms of which 2 ms to minimize.
[2021-05-18 09:34:27] [INFO ] Deduced a trap composed of 322 places in 1375 ms of which 2 ms to minimize.
[2021-05-18 09:34:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3148 ms
[2021-05-18 09:34:28] [INFO ] Computed and/alt/rep : 1679/4001/1679 causal constraints (skipped 2026 transitions) in 618 ms.
[2021-05-18 09:34:31] [INFO ] Added : 86 causal constraints over 18 iterations in 3970 ms. Result :sat
Incomplete Parikh walk after 19000 steps, including 1276 resets, run finished after 383 ms. (steps per millisecond=49 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 22500 steps, including 1382 resets, run finished after 435 ms. (steps per millisecond=51 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 4 out of 1879 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1879/1879 places, 4107/4107 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1879 transition count 4105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 1877 transition count 4105
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 1877 transition count 4102
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 1874 transition count 4102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 1871 transition count 4099
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 1871 transition count 4099
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 1871 transition count 4097
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 1869 transition count 4097
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 1867 transition count 4095
Free-agglomeration rule (complex) applied 19 times.
Iterating global reduction 2 with 19 rules applied. Total rules applied 43 place count 1867 transition count 4111
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 62 place count 1848 transition count 4111
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 1846 transition count 4109
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 1846 transition count 4109
Applied a total of 66 rules in 491 ms. Remains 1846 /1879 variables (removed 33) and now considering 4109/4107 (removed -2) transitions.
Finished structural reductions, in 1 iterations. Remains : 1846/1879 places, 4109/4107 transitions.
[2021-05-18 09:34:33] [INFO ] Flatten gal took : 197 ms
[2021-05-18 09:34:33] [INFO ] Flatten gal took : 195 ms
[2021-05-18 09:34:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10037072095867316223.gal : 28 ms
[2021-05-18 09:34:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11136531357723631224.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/ReachabilityCardinality10037072095867316223.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11136531357723631224.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/ReachabilityCardinality10037072095867316223.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11136531357723631224.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11136531357723631224.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 12
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :12 after 16
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :16 after 26
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :26 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 46
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :46 after 150
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :150 after 154
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :154 after 170
Detected timeout of ITS tools.
[2021-05-18 09:34:48] [INFO ] Flatten gal took : 174 ms
[2021-05-18 09:34:48] [INFO ] Applying decomposition
[2021-05-18 09:34:48] [INFO ] Flatten gal took : 177 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/graph15430633887312329694.txt, -o, /tmp/graph15430633887312329694.bin, -w, /tmp/graph15430633887312329694.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/graph15430633887312329694.bin, -l, -1, -v, -w, /tmp/graph15430633887312329694.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:34:49] [INFO ] Decomposing Gal with order
[2021-05-18 09:34:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:34:50] [INFO ] Removed a total of 7815 redundant transitions.
[2021-05-18 09:34:50] [INFO ] Flatten gal took : 904 ms
[2021-05-18 09:34:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 1852 labels/synchronizations in 160 ms.
[2021-05-18 09:34:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5098300357012519669.gal : 38 ms
[2021-05-18 09:34:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11511932343286400420.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/ReachabilityCardinality5098300357012519669.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11511932343286400420.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/ReachabilityCardinality5098300357012519669.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11511932343286400420.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11511932343286400420.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin357173807891401805
[2021-05-18 09:35:05] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin357173807891401805
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/ltsmin357173807891401805]
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/ltsmin357173807891401805] 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/ltsmin357173807891401805] 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 26664 resets, run finished after 18650 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4868 resets, run finished after 4001 ms. (steps per millisecond=249 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4864 resets, run finished after 4015 ms. (steps per millisecond=249 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 565773 steps, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 565773 steps, saw 246067 distinct states, run finished after 30001 ms. (steps per millisecond=18 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-18 09:36:03] [INFO ] Flow matrix only has 3712 transitions (discarded 397 similar events)
// Phase 1: matrix 3712 rows 1846 cols
[2021-05-18 09:36:03] [INFO ] Computed 541 place invariants in 69 ms
[2021-05-18 09:36:03] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2021-05-18 09:36:03] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 84 ms returned sat
[2021-05-18 09:36:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:36:04] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2021-05-18 09:36:05] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2021-05-18 09:36:05] [INFO ] [Real]Added 2195 Read/Feed constraints in 491 ms returned sat
[2021-05-18 09:36:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:36:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 36 ms returned sat
[2021-05-18 09:36:05] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 79 ms returned sat
[2021-05-18 09:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:36:07] [INFO ] [Nat]Absence check using state equation in 1133 ms returned sat
[2021-05-18 09:36:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:36:11] [INFO ] [Nat]Added 2195 Read/Feed constraints in 4698 ms returned sat
[2021-05-18 09:36:13] [INFO ] Deduced a trap composed of 326 places in 1235 ms of which 2 ms to minimize.
[2021-05-18 09:36:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2363 ms
[2021-05-18 09:36:14] [INFO ] Computed and/alt/rep : 1610/3887/1610 causal constraints (skipped 2085 transitions) in 227 ms.
[2021-05-18 09:36:16] [INFO ] Added : 51 causal constraints over 12 iterations in 2517 ms. Result :sat
[2021-05-18 09:36:17] [INFO ] [Real]Absence check using 33 positive place invariants in 34 ms returned sat
[2021-05-18 09:36:17] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 78 ms returned sat
[2021-05-18 09:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:36:18] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2021-05-18 09:36:19] [INFO ] [Real]Added 2195 Read/Feed constraints in 1312 ms returned sat
[2021-05-18 09:36:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:36:19] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2021-05-18 09:36:19] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 80 ms returned sat
[2021-05-18 09:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:36:20] [INFO ] [Nat]Absence check using state equation in 908 ms returned sat
[2021-05-18 09:36:23] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 09:36:25] [INFO ] [Nat]Added 2195 Read/Feed constraints in 4943 ms returned sat
[2021-05-18 09:36:26] [INFO ] Deduced a trap composed of 369 places in 1196 ms of which 2 ms to minimize.
[2021-05-18 09:36:28] [INFO ] Deduced a trap composed of 218 places in 1334 ms of which 2 ms to minimize.
[2021-05-18 09:36:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3234 ms
[2021-05-18 09:36:29] [INFO ] Computed and/alt/rep : 1610/3887/1610 causal constraints (skipped 2085 transitions) in 207 ms.
[2021-05-18 09:36:34] [INFO ] Added : 157 causal constraints over 32 iterations in 5925 ms. Result :sat
Incomplete Parikh walk after 12900 steps, including 1105 resets, run finished after 250 ms. (steps per millisecond=51 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 53500 steps, including 2220 resets, run finished after 1027 ms. (steps per millisecond=52 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 4 out of 1846 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1846/1846 places, 4109/4109 transitions.
Applied a total of 0 rules in 125 ms. Remains 1846 /1846 variables (removed 0) and now considering 4109/4109 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1846/1846 places, 4109/4109 transitions.
Starting structural reductions, iteration 0 : 1846/1846 places, 4109/4109 transitions.
Applied a total of 0 rules in 116 ms. Remains 1846 /1846 variables (removed 0) and now considering 4109/4109 (removed 0) transitions.
[2021-05-18 09:36:36] [INFO ] Flow matrix only has 3712 transitions (discarded 397 similar events)
// Phase 1: matrix 3712 rows 1846 cols
[2021-05-18 09:36:36] [INFO ] Computed 541 place invariants in 59 ms
[2021-05-18 09:36:40] [INFO ] Implicit Places using invariants in 3732 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 84, 98, 99, 100, 101, 102, 103, 104, 116, 126, 134, 140, 144, 146, 161, 167, 169, 170, 171, 172, 173, 174, 175, 177, 181, 187, 195, 205, 217, 230, 242, 243, 244, 245, 246, 247, 248, 258, 266, 272, 276, 278, 280, 295, 301, 303, 304, 305, 306, 307, 308, 309, 311, 313, 317, 323, 331, 341, 352, 362, 363, 364, 365, 366, 367, 368, 376, 382, 386, 388, 390, 392, 407, 413, 415, 416, 417, 418, 419, 420, 421, 423, 425, 427, 431, 437, 445, 454, 462, 463, 464, 465, 466, 467, 468, 474, 478, 480, 482, 484, 486, 501, 507, 509, 510, 511, 512, 513, 514, 515, 517, 519, 521, 524, 528, 534, 541, 547, 548, 549, 550, 551, 552, 553, 557, 559, 561, 563, 565, 567, 582, 588, 590, 591, 592, 593, 594, 595, 596, 598, 600, 602, 604, 606, 610, 615, 619, 620, 621, 622, 623, 624, 625, 627, 629, 631, 633, 635, 637, 652, 658, 660, 661, 662, 663, 664, 665, 666, 668, 670, 672, 674, 676, 678, 681, 683, 684, 685, 686, 687, 688, 689, 691, 693, 695, 697, 699, 701, 716, 722, 724, 725, 726, 727, 728, 729, 730, 732, 734, 736, 738, 740, 742, 744, 746, 747, 748, 749, 750, 751, 752, 754, 756, 758, 760, 762, 764, 779, 781, 784, 786, 787, 788, 789, 790, 791, 792, 794, 796, 798, 800, 802, 804, 806, 808, 809, 810, 811, 812, 813, 814, 816, 818, 820, 822, 824, 826, 841, 847, 849, 850, 851, 852, 853, 854, 855, 857, 859, 861, 863, 865, 867, 869, 871, 872, 873, 874, 875, 876, 877, 879, 881, 883, 885, 887, 889, 904, 910, 912, 913, 914, 915, 916, 917, 918, 920, 922, 924, 926, 928, 930, 932, 935, 936, 937, 938, 939, 940, 941, 943, 945, 947, 949, 951, 953, 968, 974, 976, 977, 978, 979, 980, 981, 982, 984, 986, 988, 990, 992, 994, 998, 1003, 1004, 1005, 1006, 1007, 1008, 1009, 1013, 1015, 1017, 1019, 1021, 1023, 1038, 1044, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1054, 1056, 1058, 1060, 1062, 1066, 1072, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1091, 1095, 1097, 1099, 1101, 1103, 1118, 1124, 1126, 1127, 1128, 1129, 1130, 1131, 1132, 1134, 1136, 1138, 1140, 1144, 1150, 1158, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1181, 1187, 1191, 1193, 1195, 1197, 1212, 1218, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1228, 1230, 1232, 1236, 1242, 1250, 1260, 1271, 1272, 1273, 1274, 1275, 1276, 1277, 1287, 1295, 1301, 1305, 1307, 1309, 1324, 1330, 1332, 1333, 1334, 1335, 1336, 1337, 1338, 1340, 1342, 1346, 1352, 1360, 1370, 1382, 1395, 1396, 1397, 1398, 1399, 1400, 1401, 1413, 1423, 1431, 1437, 1441, 1443, 1458, 1460, 1463, 1465, 1466, 1467, 1468, 1469, 1470, 1471, 1473, 1477, 1483, 1491, 1501, 1513, 1527, 1542, 1543, 1544, 1545, 1546, 1547, 1548, 1562, 1574, 1584, 1592, 1598, 1602, 1617]
Discarding 496 places :
Implicit Place search using SMT only with invariants took 3745 ms to find 496 implicit places.
[2021-05-18 09:36:40] [INFO ] Redundant transitions in 272 ms returned []
[2021-05-18 09:36:40] [INFO ] Flow matrix only has 3712 transitions (discarded 397 similar events)
// Phase 1: matrix 3712 rows 1350 cols
[2021-05-18 09:36:40] [INFO ] Computed 45 place invariants in 29 ms
[2021-05-18 09:36:42] [INFO ] Dead Transitions using invariants and state equation in 1686 ms returned []
Starting structural reductions, iteration 1 : 1350/1846 places, 4109/4109 transitions.
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 192 place count 1158 transition count 3917
Iterating global reduction 0 with 192 rules applied. Total rules applied 384 place count 1158 transition count 3917
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 576 place count 966 transition count 3725
Iterating global reduction 0 with 192 rules applied. Total rules applied 768 place count 966 transition count 3725
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 771 place count 966 transition count 3722
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 774 place count 963 transition count 3722
Applied a total of 774 rules in 241 ms. Remains 963 /1350 variables (removed 387) and now considering 3722/4109 (removed 387) transitions.
[2021-05-18 09:36:42] [INFO ] Flow matrix only has 3325 transitions (discarded 397 similar events)
// Phase 1: matrix 3325 rows 963 cols
[2021-05-18 09:36:42] [INFO ] Computed 45 place invariants in 28 ms
[2021-05-18 09:36:43] [INFO ] Implicit Places using invariants in 1014 ms returned []
[2021-05-18 09:36:43] [INFO ] Flow matrix only has 3325 transitions (discarded 397 similar events)
// Phase 1: matrix 3325 rows 963 cols
[2021-05-18 09:36:43] [INFO ] Computed 45 place invariants in 36 ms
[2021-05-18 09:36:44] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2021-05-18 09:36:44] [INFO ] Implicit Places using invariants and state equation in 1158 ms returned []
Implicit Place search using SMT with State Equation took 2175 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 963/1846 places, 3722/4109 transitions.
[2021-05-18 09:36:44] [INFO ] Flatten gal took : 127 ms
[2021-05-18 09:36:44] [INFO ] Flatten gal took : 129 ms
[2021-05-18 09:36:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6913167871040712317.gal : 14 ms
[2021-05-18 09:36:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7637936112911373722.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/ReachabilityCardinality6913167871040712317.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7637936112911373722.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/ReachabilityCardinality6913167871040712317.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7637936112911373722.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7637936112911373722.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 64
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :64 after 92
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
Detected timeout of ITS tools.
[2021-05-18 09:37:00] [INFO ] Flatten gal took : 113 ms
[2021-05-18 09:37:00] [INFO ] Applying decomposition
[2021-05-18 09:37:00] [INFO ] Flatten gal took : 116 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/graph5797949088456781370.txt, -o, /tmp/graph5797949088456781370.bin, -w, /tmp/graph5797949088456781370.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/graph5797949088456781370.bin, -l, -1, -v, -w, /tmp/graph5797949088456781370.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:37:00] [INFO ] Decomposing Gal with order
[2021-05-18 09:37:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:37:01] [INFO ] Removed a total of 6471 redundant transitions.
[2021-05-18 09:37:01] [INFO ] Flatten gal took : 619 ms
[2021-05-18 09:37:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 2819 labels/synchronizations in 124 ms.
[2021-05-18 09:37:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2378199577551607292.gal : 16 ms
[2021-05-18 09:37:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14098346510159476119.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/ReachabilityCardinality2378199577551607292.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14098346510159476119.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/ReachabilityCardinality2378199577551607292.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14098346510159476119.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14098346510159476119.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1410
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1410 after 1429
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3211667290279284336
[2021-05-18 09:37:16] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3211667290279284336
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/ltsmin3211667290279284336]
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/ltsmin3211667290279284336] 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/ltsmin3211667290279284336] 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 28287 resets, run finished after 17675 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3171 resets, run finished after 2682 ms. (steps per millisecond=372 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3630 resets, run finished after 2894 ms. (steps per millisecond=345 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 687708 steps, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 687708 steps, saw 284175 distinct states, run finished after 30001 ms. (steps per millisecond=22 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-18 09:38:10] [INFO ] Flow matrix only has 3325 transitions (discarded 397 similar events)
// Phase 1: matrix 3325 rows 963 cols
[2021-05-18 09:38:10] [INFO ] Computed 45 place invariants in 22 ms
[2021-05-18 09:38:10] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 09:38:10] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-18 09:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:38:11] [INFO ] [Real]Absence check using state equation in 625 ms returned sat
[2021-05-18 09:38:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:38:11] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 09:38:11] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-18 09:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:38:12] [INFO ] [Nat]Absence check using state equation in 669 ms returned sat
[2021-05-18 09:38:12] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2021-05-18 09:38:13] [INFO ] [Nat]Added 2195 Read/Feed constraints in 865 ms returned sat
[2021-05-18 09:38:13] [INFO ] Deduced a trap composed of 153 places in 430 ms of which 1 ms to minimize.
[2021-05-18 09:38:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 583 ms
[2021-05-18 09:38:13] [INFO ] Computed and/alt/rep : 1336/1923/1336 causal constraints (skipped 1927 transitions) in 193 ms.
[2021-05-18 09:38:14] [INFO ] Added : 15 causal constraints over 3 iterations in 701 ms. Result :sat
[2021-05-18 09:38:14] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 09:38:14] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-18 09:38:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:38:15] [INFO ] [Real]Absence check using state equation in 689 ms returned sat
[2021-05-18 09:38:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:38:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 09:38:15] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-18 09:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:38:16] [INFO ] [Nat]Absence check using state equation in 734 ms returned sat
[2021-05-18 09:38:17] [INFO ] [Nat]Added 2195 Read/Feed constraints in 906 ms returned sat
[2021-05-18 09:38:17] [INFO ] Deduced a trap composed of 178 places in 435 ms of which 1 ms to minimize.
[2021-05-18 09:38:18] [INFO ] Deduced a trap composed of 88 places in 512 ms of which 0 ms to minimize.
[2021-05-18 09:38:18] [INFO ] Deduced a trap composed of 96 places in 510 ms of which 1 ms to minimize.
[2021-05-18 09:38:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1773 ms
[2021-05-18 09:38:19] [INFO ] Computed and/alt/rep : 1336/1923/1336 causal constraints (skipped 1927 transitions) in 240 ms.
[2021-05-18 09:38:22] [INFO ] Added : 160 causal constraints over 32 iterations in 4113 ms. Result :sat
Incomplete Parikh walk after 4600 steps, including 642 resets, run finished after 86 ms. (steps per millisecond=53 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 58600 steps, including 2349 resets, run finished after 1073 ms. (steps per millisecond=54 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 4 out of 963 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 94 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 963/963 places, 3722/3722 transitions.
Starting structural reductions, iteration 0 : 963/963 places, 3722/3722 transitions.
Applied a total of 0 rules in 93 ms. Remains 963 /963 variables (removed 0) and now considering 3722/3722 (removed 0) transitions.
[2021-05-18 09:38:24] [INFO ] Flow matrix only has 3325 transitions (discarded 397 similar events)
// Phase 1: matrix 3325 rows 963 cols
[2021-05-18 09:38:24] [INFO ] Computed 45 place invariants in 22 ms
[2021-05-18 09:38:25] [INFO ] Implicit Places using invariants in 993 ms returned []
[2021-05-18 09:38:25] [INFO ] Flow matrix only has 3325 transitions (discarded 397 similar events)
// Phase 1: matrix 3325 rows 963 cols
[2021-05-18 09:38:25] [INFO ] Computed 45 place invariants in 21 ms
[2021-05-18 09:38:26] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2021-05-18 09:38:26] [INFO ] Implicit Places using invariants and state equation in 1042 ms returned []
Implicit Place search using SMT with State Equation took 2036 ms to find 0 implicit places.
[2021-05-18 09:38:26] [INFO ] Redundant transitions in 219 ms returned []
[2021-05-18 09:38:26] [INFO ] Flow matrix only has 3325 transitions (discarded 397 similar events)
// Phase 1: matrix 3325 rows 963 cols
[2021-05-18 09:38:26] [INFO ] Computed 45 place invariants in 22 ms
[2021-05-18 09:38:28] [INFO ] Dead Transitions using invariants and state equation in 1407 ms returned []
Finished structural reductions, in 1 iterations. Remains : 963/963 places, 3722/3722 transitions.
Incomplete random walk after 100000 steps, including 2829 resets, run finished after 1755 ms. (steps per millisecond=56 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-18 09:38:29] [INFO ] Flow matrix only has 3325 transitions (discarded 397 similar events)
// Phase 1: matrix 3325 rows 963 cols
[2021-05-18 09:38:29] [INFO ] Computed 45 place invariants in 22 ms
[2021-05-18 09:38:29] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 09:38:29] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-18 09:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:38:30] [INFO ] [Real]Absence check using state equation in 630 ms returned sat
[2021-05-18 09:38:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:38:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 16 ms returned sat
[2021-05-18 09:38:30] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 2 ms returned sat
[2021-05-18 09:38:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:38:31] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2021-05-18 09:38:31] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2021-05-18 09:38:32] [INFO ] [Nat]Added 2195 Read/Feed constraints in 843 ms returned sat
[2021-05-18 09:38:32] [INFO ] Deduced a trap composed of 153 places in 443 ms of which 1 ms to minimize.
[2021-05-18 09:38:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 599 ms
[2021-05-18 09:38:33] [INFO ] Computed and/alt/rep : 1336/1923/1336 causal constraints (skipped 1927 transitions) in 540 ms.
[2021-05-18 09:38:33] [INFO ] Added : 15 causal constraints over 3 iterations in 1053 ms. Result :sat
[2021-05-18 09:38:34] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 09:38:34] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-18 09:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:38:34] [INFO ] [Real]Absence check using state equation in 757 ms returned sat
[2021-05-18 09:38:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:38:35] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 09:38:35] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2021-05-18 09:38:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:38:35] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2021-05-18 09:38:36] [INFO ] [Nat]Added 2195 Read/Feed constraints in 893 ms returned sat
[2021-05-18 09:38:37] [INFO ] Deduced a trap composed of 178 places in 463 ms of which 0 ms to minimize.
[2021-05-18 09:38:37] [INFO ] Deduced a trap composed of 88 places in 513 ms of which 1 ms to minimize.
[2021-05-18 09:38:38] [INFO ] Deduced a trap composed of 96 places in 513 ms of which 1 ms to minimize.
[2021-05-18 09:38:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1793 ms
[2021-05-18 09:38:38] [INFO ] Computed and/alt/rep : 1336/1923/1336 causal constraints (skipped 1927 transitions) in 224 ms.
[2021-05-18 09:38:42] [INFO ] Added : 160 causal constraints over 32 iterations in 4009 ms. Result :sat
[2021-05-18 09:38:42] [INFO ] Flatten gal took : 111 ms
[2021-05-18 09:38:42] [INFO ] Flatten gal took : 131 ms
[2021-05-18 09:38:42] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality931576100161929666.gal : 11 ms
[2021-05-18 09:38:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10501742578120705496.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/ReachabilityCardinality931576100161929666.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10501742578120705496.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/ReachabilityCardinality931576100161929666.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10501742578120705496.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10501742578120705496.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :49 after 50
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :50 after 64
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :64 after 92
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :92 after 172
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :172 after 489
Detected timeout of ITS tools.
[2021-05-18 09:39:02] [INFO ] Flatten gal took : 114 ms
[2021-05-18 09:39:02] [INFO ] Applying decomposition
[2021-05-18 09:39:03] [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/graph3941380505727530412.txt, -o, /tmp/graph3941380505727530412.bin, -w, /tmp/graph3941380505727530412.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/graph3941380505727530412.bin, -l, -1, -v, -w, /tmp/graph3941380505727530412.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:39:03] [INFO ] Decomposing Gal with order
[2021-05-18 09:39:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:39:03] [INFO ] Removed a total of 6612 redundant transitions.
[2021-05-18 09:39:03] [INFO ] Flatten gal took : 521 ms
[2021-05-18 09:39:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2469 labels/synchronizations in 119 ms.
[2021-05-18 09:39:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality768651353694804065.gal : 15 ms
[2021-05-18 09:39:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18080510309715639615.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/ReachabilityCardinality768651353694804065.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18080510309715639615.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/ReachabilityCardinality768651353694804065.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18080510309715639615.prop --nowitness
Loading property file /tmp/ReachabilityCardinality18080510309715639615.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 100
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :100 after 305
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :305 after 546
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :546 after 735
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :735 after 1020
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :1020 after 1188
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1188 after 1317
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4019520688188467283
[2021-05-18 09:39:24] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4019520688188467283
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/ltsmin4019520688188467283]
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/ltsmin4019520688188467283] 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/ltsmin4019520688188467283] 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 1045 edges and 963 vertex of which 17 / 963 are part of one of the 1 SCC in 15 ms
Free SCC test removed 16 places
Drop transitions removed 298 transitions
Ensure Unique test removed 371 transitions
Reduce isomorphic transitions removed 669 transitions.
Graph (complete) has 4265 edges and 947 vertex of which 934 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 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 97 transitions
Trivial Post-agglo rules discarded 97 transitions
Performed 97 trivial Post agglomeration. Transition count delta: 97
Iterating post reduction 0 with 99 rules applied. Total rules applied 101 place count 917 transition count 2954
Reduce places removed 97 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 97 transitions.
Drop transitions removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 1 with 290 rules applied. Total rules applied 391 place count 820 transition count 2761
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 263 rules applied. Total rules applied 654 place count 724 transition count 2594
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 3 with 211 rules applied. Total rules applied 865 place count 653 transition count 2454
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 20 transitions
Ensure Unique test removed 49 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 4 with 187 rules applied. Total rules applied 1052 place count 584 transition count 2336
Reduce places removed 49 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 49 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 5 with 145 rules applied. Total rules applied 1197 place count 535 transition count 2240
Reduce places removed 47 places and 0 transitions.
Drop transitions removed 15 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 47 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 6 with 126 rules applied. Total rules applied 1323 place count 488 transition count 2161
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1417 place count 456 transition count 2099
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 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 8 with 78 rules applied. Total rules applied 1495 place count 426 transition count 2051
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1547 place count 408 transition count 2017
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1587 place count 392 transition count 1993
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 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 11 with 22 rules applied. Total rules applied 1609 place count 384 transition count 1979
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1623 place count 378 transition count 1971
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1628 place count 376 transition count 1968
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1630 place count 375 transition count 1967
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 12 Pre rules applied. Total rules applied 1630 place count 375 transition count 1955
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 15 with 24 rules applied. Total rules applied 1654 place count 363 transition count 1955
Discarding 284 places :
Symmetric choice reduction at 15 with 284 rule applications. Total rules 1938 place count 79 transition count 331
Iterating global reduction 15 with 284 rules applied. Total rules applied 2222 place count 79 transition count 331
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 252 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 15 with 263 rules applied. Total rules applied 2485 place count 79 transition count 68
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 12 rules applied. Total rules applied 2497 place count 68 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2498 place count 67 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2498 place count 67 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2500 place count 66 transition count 66
Discarding 11 places :
Symmetric choice reduction at 18 with 11 rule applications. Total rules 2511 place count 55 transition count 55
Iterating global reduction 18 with 11 rules applied. Total rules applied 2522 place count 55 transition count 55
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 18 with 6 rules applied. Total rules applied 2528 place count 52 transition count 52
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 2529 place count 52 transition count 51
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 2530 place count 52 transition count 50
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 19 with 13 rules applied. Total rules applied 2543 place count 52 transition count 37
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 19 with 13 rules applied. Total rules applied 2556 place count 39 transition count 37
Applied a total of 2556 rules in 392 ms. Remains 39 /963 variables (removed 924) and now considering 37/3722 (removed 3685) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 37 rows 39 cols
[2021-05-18 09:39:26] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-18 09:39:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-18 09:39:26] [INFO ] [Real]Absence check using 4 positive and 12 generalized place invariants in 1 ms returned sat
[2021-05-18 09:39:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:39:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-18 09:39:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:39:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-18 09:39:26] [INFO ] [Nat]Absence check using 4 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-18 09:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:39:26] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-18 09:39:26] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 24 transitions) in 1 ms.
[2021-05-18 09:39:26] [INFO ] Added : 2 causal constraints over 2 iterations in 9 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-18 09:39:26] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-18 09:39:26] [INFO ] [Real]Absence check using 4 positive and 12 generalized place invariants in 1 ms returned sat
[2021-05-18 09:39:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 09:39:26] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-18 09:39:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 09:39:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2021-05-18 09:39:26] [INFO ] [Nat]Absence check using 4 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-18 09:39:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 09:39:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-18 09:39:26] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 24 transitions) in 2 ms.
[2021-05-18 09:39:26] [INFO ] Added : 2 causal constraints over 2 iterations in 10 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 0 ms.
[2021-05-18 09:39:26] [INFO ] Flatten gal took : 128 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11074846327566577378
[2021-05-18 09:39:26] [INFO ] Too many transitions (3722) to apply POR reductions. Disabling POR matrices.
[2021-05-18 09:39:26] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11074846327566577378
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/ltsmin11074846327566577378]
[2021-05-18 09:39:26] [INFO ] Applying decomposition
[2021-05-18 09:39:27] [INFO ] Flatten gal took : 157 ms
[2021-05-18 09:39:27] [INFO ] Flatten gal took : 333 ms
[2021-05-18 09:39:27] [INFO ] Input system was already deterministic with 3722 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/graph15943786854183698160.txt, -o, /tmp/graph15943786854183698160.bin, -w, /tmp/graph15943786854183698160.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/graph15943786854183698160.bin, -l, -1, -v, -w, /tmp/graph15943786854183698160.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 09:39:27] [INFO ] Decomposing Gal with order
[2021-05-18 09:39:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 09:39:28] [INFO ] Removed a total of 6524 redundant transitions.
[2021-05-18 09:39:28] [INFO ] Flatten gal took : 605 ms
[2021-05-18 09:39:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2339 labels/synchronizations in 117 ms.
[2021-05-18 09:39:29] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4036519115530381108.gal : 1523 ms
[2021-05-18 09:39:29] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17185960548985658361.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/ReachabilityFireability4036519115530381108.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability17185960548985658361.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/ReachabilityFireability4036519115530381108.gal -t CGAL -reachable-file /tmp/ReachabilityFireability17185960548985658361.prop --nowitness
Loading property file /tmp/ReachabilityFireability17185960548985658361.prop.
[2021-05-18 09:39:30] [INFO ] Ran tautology test, simplified 0 / 2 in 3555 ms.
[2021-05-18 09:39:30] [INFO ] BMC solution for property gen-ReachabilityFireability-02(UNSAT) depth K=0 took 25 ms
[2021-05-18 09:39:30] [INFO ] BMC solution for property gen-ReachabilityFireability-11(UNSAT) depth K=0 took 4 ms
[2021-05-18 09:39:30] [INFO ] BMC solution for property gen-ReachabilityFireability-02(UNSAT) depth K=1 took 19 ms
[2021-05-18 09:39:30] [INFO ] BMC solution for property gen-ReachabilityFireability-11(UNSAT) depth K=1 took 15 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 3325 out of 3722 initially.
// Phase 1: matrix 3325 rows 963 cols
[2021-05-18 09:39:31] [INFO ] Computed 45 place invariants in 22 ms
inv : Node7IsActive + NodesCanDetectThatNode7HasCrashed = 1
inv : Node12IsActive + NodesCanDetectThatNode12HasCrashed = 1
inv : Node3IsActive + NodesCanDetectThatNode3HasCrashed = 1
inv : Node5NotifyThatHeIsActive + NodesCanDetectThatNode5HasCrashed = 1
inv : Rx0IsAtTheRightExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet - Rx4IsActiveAndNotInTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node4NotifyThatHeIsActive + NodesCanDetectThatNode4HasCrashed = 1
inv : Node14IsActive + NodesCanDetectThatNode14HasCrashed = 1
inv : CrashReservoir - NoCrashIsHappening + Lx1IsAtTheLeftExtremityOfTheLeafSet + 2*Lx2IsAtTheLeftExtremityOfTheLeafSet + 3*Lx3IsAtTheLeftExtremityOfTheLeafSet + 4*Lx4IsAtTheLeftExtremityOfTheLeafSet - 6*Lx5IsActiveAndNotInTheLeafSet + 5*Lx5IsAtTheLeftExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + 2*Rx2IsAtTheRightExtremityOfTheLeafSet + 3*Rx3IsAtTheRightExtremityOfTheLeafSet - 6*Rx4IsActiveAndNotInTheLeafSet + 4*Rx4IsAtTheRightExtremityOfTheLeafSet - Rx5IsAtTheRightExtremityOfTheLeafSet = -7
inv : NoCrashIsHappening + Node0HasDetectedCrashOfNode1 + Node0HasDetectedCrashOfNode2 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node0HasDetectedCrashOfNode3 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node0HasDetectedCrashOfNode4 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode4 + Node0HasDetectedCrashOfNode5 + 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 + Node0HasDetectedCrashOfNode13 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode13 + Node0HasDetectedCrashOfNode14 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode14 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node0HasDetectedCrashOfNode15 + Node0HasDetectedCrashOfNode16 + RequestOfNode0IsSentToLx0 + RequestOfNode0IsSentToRx0 + RequestOfNode0IsSentToLx1 + RequestOfNode0IsSentToRx1 + RequestOfNode0IsSentToLx2 + RequestOfNode0IsSentToRx2 + RequestOfNode0IsSentToLx3 + RequestOfNode0IsSentToRx3 + RequestOfNode0IsSentToLx4 + RequestOfNode0IsSentToRx4 + RequestOfNode0IsSentToLx5 + RequestOfNode0IsSentToRx5 + Node1HasDetectedCrashOfNode0 + Node1HasDetectedCrashOfNode2 + Node1HasDetectedCrashOfNode3 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node1HasDetectedCrashOfNode4 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node1HasDetectedCrashOfNode5 + 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 + Node1DontAnswerToAnyNode + Node2HasDetectedCrashOfNode0 + Node2HasDetectedCrashOfNode1 + Node2HasDetectedCrashOfNode3 + Node2HasDetectedCrashOfNode4 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node2HasDetectedCrashOfNode5 + 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 + 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 + 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 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node13HasDetectedCrashOfNode6 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node13HasDetectedCrashOfNode7 + 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 + 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 + 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 + 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 + Node16HasDetectedCrashOfNode0 + Node16HasDetectedCrashOfNode1 + Node16HasDetectedCrashOfNode2 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node16HasDetectedCrashOfNode3 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node16HasDetectedCrashOfNode4 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node16HasDetectedCrashOfNode5 + 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 + Lx4HasReceivedTheRequestOfNode0 + Lx5HasReceivedTheRequestOfNode0 + Rx0HasReceivedTheRequestOfNode0 + Rx1HasReceivedTheRequestOfNode0 + Rx2HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode0 + Rx4HasReceivedTheRequestOfNode0 + Rx5HasReceivedTheRequestOfNode0 = 1
inv : Lx0IsAtTheLeftExtremityOfTheLeafSet + Lx1IsAtTheLeftExtremityOfTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet - Lx5IsActiveAndNotInTheLeafSet + Lx5IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Rx3IsActiveAndNotInTheLeafSet - Rx4IsActiveAndNotInTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node15IsActive + NodesCanDetectThatNode15HasCrashed = 1
inv : Lx3IsActiveAndNotInTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet - Lx5IsActiveAndNotInTheLeafSet + Lx5IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node1NotifyThatHeIsActive + NodesCanDetectThatNode1HasCrashed = 1
inv : Node10IsActive + NodesCanDetectThatNode10HasCrashed = 1
inv : Node9NotifyThatHeIsActive + NodesCanDetectThatNode9HasCrashed = 1
inv : Node3NotifyThatHeIsActive + NodesCanDetectThatNode3HasCrashed = 1
inv : Node4IsActive + NodesCanDetectThatNode4HasCrashed = 1
inv : Lx0IsActiveAndNotInTheLeafSet + Lx1IsAtTheLeftExtremityOfTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet - Lx5IsActiveAndNotInTheLeafSet + Lx5IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Lx2IsActiveAndNotInTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet - Lx5IsActiveAndNotInTheLeafSet + Lx5IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Rx0IsActiveAndNotInTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet - Rx4IsActiveAndNotInTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node7NotifyThatHeIsActive + NodesCanDetectThatNode7HasCrashed = 1
inv : Node9IsActive + NodesCanDetectThatNode9HasCrashed = 1
inv : Rx1IsActiveAndNotInTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet - Rx4IsActiveAndNotInTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node15NotifyThatHeIsActive + NodesCanDetectThatNode15HasCrashed = 1
inv : Node1IsActive + NodesCanDetectThatNode1HasCrashed = 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 + 4*Lx4IsAtTheLeftExtremityOfTheLeafSet - 6*Lx5IsActiveAndNotInTheLeafSet + 5*Lx5IsAtTheLeftExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + 2*Rx2IsAtTheRightExtremityOfTheLeafSet + 3*Rx3IsAtTheRightExtremityOfTheLeafSet - 6*Rx4IsActiveAndNotInTheLeafSet + 4*Rx4IsAtTheRightExtremityOfTheLeafSet - Rx5IsAtTheRightExtremityOfTheLeafSet = -10
inv : Node10NotifyThatHeIsActive + NodesCanDetectThatNode10HasCrashed = 1
inv : Node2IsActive + NodesCanDetectThatNode2HasCrashed = 1
inv : Lx4IsActiveAndNotInTheLeafSet - Lx5IsActiveAndNotInTheLeafSet + Lx5IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node13NotifyThatHeIsActive + NodesCanDetectThatNode13HasCrashed = 1
inv : Node13IsActive + NodesCanDetectThatNode13HasCrashed = 1
inv : Rx2IsActiveAndNotInTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet - Rx4IsActiveAndNotInTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node6IsActive + NodesCanDetectThatNode6HasCrashed = 1
inv : Node0IsTheNodeMaster + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode4 + 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 + 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 + 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 + 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 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node5ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node6IsTheNodeMaster + Node6ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node7IsTheNodeMaster + Node8IsTheNodeMaster + Node9IsTheNodeMaster + Node10IsTheNodeMaster + Node10ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node11IsTheNodeMaster + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node11ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node12IsTheNodeMaster + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node13IsTheNodeMaster + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode6 + 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 + 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 + 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 + 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 : Node6NotifyThatHeIsActive + NodesCanDetectThatNode6HasCrashed = 1
inv : Node14NotifyThatHeIsActive + NodesCanDetectThatNode14HasCrashed = 1
inv : -Rx4IsActiveAndNotInTheLeafSet + Rx5IsActiveAndNotInTheLeafSet - Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Lx1IsActiveAndNotInTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet - Lx5IsActiveAndNotInTheLeafSet + Lx5IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node11IsActive + NodesCanDetectThatNode11HasCrashed = 1
inv : Node5IsActive + NodesCanDetectThatNode5HasCrashed = 1
inv : NoCrashIsHappening + ThereIsAMasterInTheLeafSet + Node0AsksIsThereANodeMaster + RequestOfNode0IsSentToLx0 + RequestOfNode0IsSentToRx0 + RequestOfNode0IsSentToLx1 + RequestOfNode0IsSentToRx1 + RequestOfNode0IsSentToLx2 + RequestOfNode0IsSentToRx2 + RequestOfNode0IsSentToLx3 + RequestOfNode0IsSentToRx3 + RequestOfNode0IsSentToLx4 + RequestOfNode0IsSentToRx4 + RequestOfNode0IsSentToLx5 + RequestOfNode0IsSentToRx5 + Node1AsksIsThereANodeMaster + 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 + Node15DontAnswerToAnyNode + Node16AsksIsThereANodeMaster + Lx0HasReceivedTheRequestOfNode0 + Lx1HasReceivedTheRequestOfNode0 + Lx2HasReceivedTheRequestOfNode0 + Lx3HasReceivedTheRequestOfNode0 + Lx4HasReceivedTheRequestOfNode0 + Lx5HasReceivedTheRequestOfNode0 + Rx0HasReceivedTheRequestOfNode0 + Rx1HasReceivedTheRequestOfNode0 + Rx2HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode0 + Rx4HasReceivedTheRequestOfNode0 + Rx5HasReceivedTheRequestOfNode0 = 1
inv : Node12NotifyThatHeIsActive + NodesCanDetectThatNode12HasCrashed = 1
inv : Node2NotifyThatHeIsActive + NodesCanDetectThatNode2HasCrashed = 1
inv : Node11NotifyThatHeIsActive + NodesCanDetectThatNode11HasCrashed = 1
Total of 45 invariants.
[2021-05-18 09:39:31] [INFO ] Computed 45 place invariants in 41 ms
[2021-05-18 09:39:47] [INFO ] Proved 963 variables to be positive in 16122 ms
[2021-05-18 09:39:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityFireability-02
[2021-05-18 09:39:48] [INFO ] KInduction solution for property gen-ReachabilityFireability-02(SAT) depth K=0 took 503 ms
[2021-05-18 09:39:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityFireability-11
[2021-05-18 09:39:49] [INFO ] KInduction solution for property gen-ReachabilityFireability-11(SAT) depth K=0 took 732 ms
[2021-05-18 09:39:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityFireability-02
[2021-05-18 09:39:56] [INFO ] KInduction solution for property gen-ReachabilityFireability-02(SAT) depth K=1 took 7211 ms
[2021-05-18 09:40:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityFireability-11
[2021-05-18 09:40:07] [INFO ] KInduction solution for property gen-ReachabilityFireability-11(SAT) depth K=1 took 11013 ms
[2021-05-18 09:40:21] [INFO ] BMC solution for property gen-ReachabilityFireability-02(UNSAT) depth K=2 took 50888 ms
Compilation finished in 56510 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11074846327566577378]
Link finished in 62 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, genReachabilityFireability02==true], workingDir=/tmp/ltsmin11074846327566577378]
[2021-05-18 09:42:39] [INFO ] BMC solution for property gen-ReachabilityFireability-11(UNSAT) depth K=2 took 137503 ms
LTSmin run took 963968 ms.
Invariant validated
FORMULA gen-ReachabilityFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
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, genReachabilityFireability11==true], workingDir=/tmp/ltsmin11074846327566577378]
Detected timeout of ITS tools.
[2021-05-18 10:02:03] [INFO ] Applying decomposition
[2021-05-18 10:02:04] [INFO ] Flatten gal took : 363 ms
[2021-05-18 10:02:04] [INFO ] Decomposing Gal with order
[2021-05-18 10:02:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 10:02:06] [INFO ] Removed a total of 6612 redundant transitions.
[2021-05-18 10:02:06] [INFO ] Flatten gal took : 1582 ms
[2021-05-18 10:02:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 2469 labels/synchronizations in 370 ms.
[2021-05-18 10:02:06] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11486600613494334175.gal : 62 ms
[2021-05-18 10:02:06] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4997841684041517428.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/ReachabilityFireability11486600613494334175.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability4997841684041517428.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/ReachabilityFireability11486600613494334175.gal -t CGAL -reachable-file /tmp/ReachabilityFireability4997841684041517428.prop --nowitness
Loading property file /tmp/ReachabilityFireability4997841684041517428.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 104
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :104 after 382
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :382 after 574
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :574 after 756
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :756 after 1029
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1029 after 1185
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1185 after 1317
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1317 after 4163
LTSmin run took 958263 ms.
Invariant validated
FORMULA gen-ReachabilityFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
[2021-05-18 10:12:25] [WARNING] Interrupting SMT solver.
[2021-05-18 10:12:25] [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)
[2021-05-18 10:12:25] [WARNING] Unexpected error occurred while running SMT. Was verifying gen-ReachabilityFireability-02 SMT depth 3
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
[2021-05-18 10:12:25] [INFO ] During BMC, SMT solver timed out at depth 3
[2021-05-18 10:12:25] [INFO ] BMC solving timed out (3600000 secs) at depth 3
[2021-05-18 10:12:25] [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)
[2021-05-18 10:12:25] [WARNING] Unexpected error occurred while running SMT. Was verifying gen-ReachabilityFireability-02 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
[2021-05-18 10:12:25] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1621332746941

--------------------
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-S16C06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, 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 r292-tall-162124156700607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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