About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10213.056 | 1180251.00 | 3096936.00 | 5937.80 | FTTFFFFTFTTTTFFF | normal |
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-162124156700591.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-S16C04, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156700591
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.5M
-rw-r--r-- 1 mcc users 53K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 185K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 31K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 4.4K May 11 18:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 11 18:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 11 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 11 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 8.0M 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 1621325304160
Running Version 0
[2021-05-18 08:08:25] [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 08:08:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 08:08:26] [INFO ] Load time of PNML (sax parser for PT used): 327 ms
[2021-05-18 08:08:26] [INFO ] Transformed 4260 places.
[2021-05-18 08:08:26] [INFO ] Transformed 6027 transitions.
[2021-05-18 08:08:26] [INFO ] Parsed PT model containing 4260 places and 6027 transitions in 399 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 238 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 16) seen :4
FORMULA gen-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :1
FORMULA gen-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 11) seen :1
FORMULA gen-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2021-05-18 08:08:26] [INFO ] Flow matrix only has 5755 transitions (discarded 272 similar events)
// Phase 1: matrix 5755 rows 4260 cols
[2021-05-18 08:08:27] [INFO ] Computed 497 place invariants in 621 ms
[2021-05-18 08:08:28] [INFO ] [Real]Absence check using 46 positive place invariants in 27 ms returned sat
[2021-05-18 08:08:28] [INFO ] [Real]Absence check using 46 positive and 451 generalized place invariants in 190 ms returned sat
[2021-05-18 08:08:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:08:32] [INFO ] SMT Verify possible in real domain returnedunsat :6 sat :0 real:4
[2021-05-18 08:08:33] [INFO ] [Nat]Absence check using 46 positive place invariants in 19 ms returned sat
[2021-05-18 08:08:33] [INFO ] [Nat]Absence check using 46 positive and 451 generalized place invariants in 174 ms returned sat
[2021-05-18 08:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:08:39] [INFO ] [Nat]Absence check using state equation in 6048 ms returned unsat :0 sat :10
[2021-05-18 08:08:39] [INFO ] State equation strengthened by 1651 read => feed constraints.
[2021-05-18 08:08:40] [INFO ] [Nat]Added 1651 Read/Feed constraints in 108 ms returned sat
Attempting to minimize the solution found.
Minimization took 1070 ms.
[2021-05-18 08:08:57] [INFO ] SMT Verify possible in nat domain returned unsat :1 sat :8
FORMULA gen-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-07 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-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 3 different solutions.
This parikh vector is obviously unfeasible : no match in initial state.
Incomplete Parikh walk after 7800 steps, including 1057 resets, run finished after 99 ms. (steps per millisecond=78 ) properties (out of 3) seen :0 could not realise parikh vector
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 8 out of 4260 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4260/4260 places, 6027/6027 transitions.
Graph (complete) has 13889 edges and 4260 vertex of which 4232 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.24 ms
Discarding 28 places :
Also discarding 0 output transitions
Drop transitions removed 1080 transitions
Trivial Post-agglo rules discarded 1080 transitions
Performed 1080 trivial Post agglomeration. Transition count delta: 1080
Iterating post reduction 0 with 1080 rules applied. Total rules applied 1081 place count 4232 transition count 4947
Reduce places removed 1080 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 1088 rules applied. Total rules applied 2169 place count 3152 transition count 4939
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 2177 place count 3144 transition count 4939
Performed 135 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 135 Pre rules applied. Total rules applied 2177 place count 3144 transition count 4804
Deduced a syphon composed of 135 places in 8 ms
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 3 with 270 rules applied. Total rules applied 2447 place count 3009 transition count 4804
Discarding 951 places :
Symmetric choice reduction at 3 with 951 rule applications. Total rules 3398 place count 2058 transition count 3853
Iterating global reduction 3 with 951 rules applied. Total rules applied 4349 place count 2058 transition count 3853
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 4349 place count 2058 transition count 3846
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 4363 place count 2051 transition count 3846
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 4599 place count 1815 transition count 2902
Iterating global reduction 3 with 236 rules applied. Total rules applied 4835 place count 1815 transition count 2902
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 4869 place count 1798 transition count 2885
Free-agglomeration rule (complex) applied 161 times.
Iterating global reduction 3 with 161 rules applied. Total rules applied 5030 place count 1798 transition count 3432
Reduce places removed 161 places and 0 transitions.
Iterating post reduction 3 with 161 rules applied. Total rules applied 5191 place count 1637 transition count 3432
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 5207 place count 1637 transition count 3432
Applied a total of 5207 rules in 1508 ms. Remains 1637 /4260 variables (removed 2623) and now considering 3432/6027 (removed 2595) transitions.
Finished structural reductions, in 1 iterations. Remains : 1637/4260 places, 3432/6027 transitions.
[2021-05-18 08:08:59] [INFO ] Flatten gal took : 401 ms
[2021-05-18 08:08:59] [INFO ] Flatten gal took : 226 ms
[2021-05-18 08:08:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3623351493273121580.gal : 53 ms
[2021-05-18 08:08:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6276798770117863429.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/ReachabilityCardinality3623351493273121580.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6276798770117863429.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/ReachabilityCardinality3623351493273121580.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6276798770117863429.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6276798770117863429.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :7 after 8
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :8 after 12
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :12 after 18
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :18 after 44
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :44 after 48
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :48 after 58
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :58 after 224
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :224 after 234
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :234 after 270
Detected timeout of ITS tools.
[2021-05-18 08:09:14] [INFO ] Flatten gal took : 182 ms
[2021-05-18 08:09:14] [INFO ] Applying decomposition
[2021-05-18 08:09:15] [INFO ] Flatten gal took : 186 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/graph18227839256459742081.txt, -o, /tmp/graph18227839256459742081.bin, -w, /tmp/graph18227839256459742081.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/graph18227839256459742081.bin, -l, -1, -v, -w, /tmp/graph18227839256459742081.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:09:15] [INFO ] Decomposing Gal with order
[2021-05-18 08:09:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:09:17] [INFO ] Removed a total of 5576 redundant transitions.
[2021-05-18 08:09:17] [INFO ] Flatten gal took : 1427 ms
[2021-05-18 08:09:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1863 labels/synchronizations in 320 ms.
[2021-05-18 08:09:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7858120056013290347.gal : 40 ms
[2021-05-18 08:09:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13994446676867212038.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/ReachabilityCardinality7858120056013290347.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13994446676867212038.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/ReachabilityCardinality7858120056013290347.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13994446676867212038.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13994446676867212038.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 97
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :97 after 97
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :97 after 107
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :107 after 114
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :114 after 129
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4808214817261325556
[2021-05-18 08:09:33] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4808214817261325556
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/ltsmin4808214817261325556]
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/ltsmin4808214817261325556] 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/ltsmin4808214817261325556] 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 39464 resets, run finished after 13877 ms. (steps per millisecond=72 ) properties (out of 3) seen :1
FORMULA gen-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 6883 resets, run finished after 3192 ms. (steps per millisecond=313 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6885 resets, run finished after 3226 ms. (steps per millisecond=309 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-18 08:09:54] [INFO ] Flow matrix only has 3034 transitions (discarded 398 similar events)
// Phase 1: matrix 3034 rows 1637 cols
[2021-05-18 08:09:54] [INFO ] Computed 469 place invariants in 84 ms
[2021-05-18 08:09:54] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2021-05-18 08:09:54] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 74 ms returned sat
[2021-05-18 08:09:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:09:55] [INFO ] [Real]Absence check using state equation in 809 ms returned sat
[2021-05-18 08:09:55] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:09:56] [INFO ] [Nat]Absence check using 33 positive place invariants in 127 ms returned sat
[2021-05-18 08:09:56] [INFO ] [Nat]Absence check using 33 positive and 436 generalized place invariants in 69 ms returned sat
[2021-05-18 08:09:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:09:57] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2021-05-18 08:09:57] [INFO ] State equation strengthened by 1651 read => feed constraints.
[2021-05-18 08:10:00] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 08:10:01] [INFO ] [Nat]Added 1651 Read/Feed constraints in 4062 ms returned sat
[2021-05-18 08:10:02] [INFO ] Deduced a trap composed of 147 places in 1172 ms of which 2 ms to minimize.
[2021-05-18 08:10:03] [INFO ] Deduced a trap composed of 264 places in 1086 ms of which 1 ms to minimize.
[2021-05-18 08:10:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2799 ms
[2021-05-18 08:10:04] [INFO ] Computed and/alt/rep : 1544/3352/1544 causal constraints (skipped 1473 transitions) in 243 ms.
[2021-05-18 08:10:06] [INFO ] Added : 72 causal constraints over 15 iterations in 2637 ms. Result :sat
[2021-05-18 08:10:06] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2021-05-18 08:10:06] [INFO ] [Real]Absence check using 33 positive and 436 generalized place invariants in 68 ms returned sat
[2021-05-18 08:10:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:10:07] [INFO ] [Real]Absence check using state equation in 859 ms returned sat
[2021-05-18 08:10:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:10:08] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2021-05-18 08:10:08] [INFO ] [Nat]Absence check using 33 positive and 436 generalized place invariants in 69 ms returned sat
[2021-05-18 08:10:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:10:09] [INFO ] [Nat]Absence check using state equation in 832 ms returned sat
[2021-05-18 08:10:12] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 08:10:12] [INFO ] [Nat]Added 1651 Read/Feed constraints in 3287 ms returned sat
[2021-05-18 08:10:13] [INFO ] Deduced a trap composed of 187 places in 1064 ms of which 2 ms to minimize.
[2021-05-18 08:10:14] [INFO ] Deduced a trap composed of 276 places in 1019 ms of which 2 ms to minimize.
[2021-05-18 08:10:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2502 ms
[2021-05-18 08:10:15] [INFO ] Computed and/alt/rep : 1544/3352/1544 causal constraints (skipped 1473 transitions) in 382 ms.
[2021-05-18 08:10:18] [INFO ] Added : 100 causal constraints over 21 iterations in 3443 ms. Result :sat
Incomplete Parikh walk after 25100 steps, including 1674 resets, run finished after 401 ms. (steps per millisecond=62 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 25800 steps, including 1672 resets, run finished after 397 ms. (steps per millisecond=64 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 6 out of 1637 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1637/1637 places, 3432/3432 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1637 transition count 3431
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1636 transition count 3431
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1635 transition count 3430
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1635 transition count 3430
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 4 place count 1635 transition count 3429
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 1634 transition count 3429
Applied a total of 6 rules in 212 ms. Remains 1634 /1637 variables (removed 3) and now considering 3429/3432 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 1634/1637 places, 3429/3432 transitions.
[2021-05-18 08:10:19] [INFO ] Flatten gal took : 163 ms
[2021-05-18 08:10:19] [INFO ] Flatten gal took : 173 ms
[2021-05-18 08:10:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14775937488752905531.gal : 21 ms
[2021-05-18 08:10:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10939342134441697087.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/ReachabilityCardinality14775937488752905531.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10939342134441697087.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/ReachabilityCardinality14775937488752905531.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10939342134441697087.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10939342134441697087.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 18
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :18 after 39
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :39 after 41
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :41 after 45
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :45 after 58
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :58 after 192
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :192 after 196
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :196 after 228
Detected timeout of ITS tools.
[2021-05-18 08:10:34] [INFO ] Flatten gal took : 150 ms
[2021-05-18 08:10:34] [INFO ] Applying decomposition
[2021-05-18 08:10:35] [INFO ] Flatten gal took : 153 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/graph11904959938428888278.txt, -o, /tmp/graph11904959938428888278.bin, -w, /tmp/graph11904959938428888278.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/graph11904959938428888278.bin, -l, -1, -v, -w, /tmp/graph11904959938428888278.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:10:37] [INFO ] Decomposing Gal with order
[2021-05-18 08:10:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:10:38] [INFO ] Removed a total of 3903 redundant transitions.
[2021-05-18 08:10:38] [INFO ] Flatten gal took : 766 ms
[2021-05-18 08:10:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 3863 labels/synchronizations in 154 ms.
[2021-05-18 08:10:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18195180832516778915.gal : 25 ms
[2021-05-18 08:10:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9743834800067846356.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/ReachabilityCardinality18195180832516778915.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9743834800067846356.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/ReachabilityCardinality18195180832516778915.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9743834800067846356.prop --nowitness
Loading property file /tmp/ReachabilityCardinality9743834800067846356.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 69
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :69 after 69
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :69 after 69
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :69 after 149
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :149 after 149
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :149 after 149
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :149 after 149
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17790698998791048195
[2021-05-18 08:10:54] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17790698998791048195
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/ltsmin17790698998791048195]
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/ltsmin17790698998791048195] 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/ltsmin17790698998791048195] 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 39527 resets, run finished after 14276 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 6885 resets, run finished after 3186 ms. (steps per millisecond=313 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 6885 resets, run finished after 3129 ms. (steps per millisecond=319 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 600006 steps, run timeout after 30001 ms. (steps per millisecond=19 ) properties seen :{}
Probabilistic random walk after 600006 steps, saw 262528 distinct states, run finished after 30003 ms. (steps per millisecond=19 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-18 08:11:45] [INFO ] Flow matrix only has 3031 transitions (discarded 398 similar events)
// Phase 1: matrix 3031 rows 1634 cols
[2021-05-18 08:11:45] [INFO ] Computed 469 place invariants in 54 ms
[2021-05-18 08:11:46] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2021-05-18 08:11:46] [INFO ] [Real]Absence check using 31 positive and 438 generalized place invariants in 78 ms returned sat
[2021-05-18 08:11:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:11:46] [INFO ] [Real]Absence check using state equation in 881 ms returned sat
[2021-05-18 08:11:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:11:47] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2021-05-18 08:11:47] [INFO ] [Nat]Absence check using 31 positive and 438 generalized place invariants in 80 ms returned sat
[2021-05-18 08:11:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:11:48] [INFO ] [Nat]Absence check using state equation in 836 ms returned sat
[2021-05-18 08:11:48] [INFO ] State equation strengthened by 1651 read => feed constraints.
[2021-05-18 08:11:51] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 08:11:52] [INFO ] [Nat]Added 1651 Read/Feed constraints in 4080 ms returned sat
[2021-05-18 08:11:53] [INFO ] Deduced a trap composed of 289 places in 954 ms of which 1 ms to minimize.
[2021-05-18 08:11:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1135 ms
[2021-05-18 08:11:53] [INFO ] Computed and/alt/rep : 1541/3341/1541 causal constraints (skipped 1473 transitions) in 183 ms.
[2021-05-18 08:11:54] [INFO ] Added : 20 causal constraints over 4 iterations in 945 ms. Result :sat
[2021-05-18 08:11:54] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2021-05-18 08:11:54] [INFO ] [Real]Absence check using 31 positive and 438 generalized place invariants in 74 ms returned sat
[2021-05-18 08:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:11:55] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2021-05-18 08:11:56] [INFO ] [Real]Added 1651 Read/Feed constraints in 449 ms returned sat
[2021-05-18 08:11:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:11:56] [INFO ] [Nat]Absence check using 31 positive place invariants in 24 ms returned sat
[2021-05-18 08:11:56] [INFO ] [Nat]Absence check using 31 positive and 438 generalized place invariants in 70 ms returned sat
[2021-05-18 08:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:11:57] [INFO ] [Nat]Absence check using state equation in 1022 ms returned sat
[2021-05-18 08:11:59] [INFO ] [Nat]Added 1651 Read/Feed constraints in 2129 ms returned sat
[2021-05-18 08:12:00] [INFO ] Deduced a trap composed of 157 places in 1020 ms of which 1 ms to minimize.
[2021-05-18 08:12:01] [INFO ] Deduced a trap composed of 290 places in 951 ms of which 2 ms to minimize.
[2021-05-18 08:12:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2370 ms
[2021-05-18 08:12:02] [INFO ] Computed and/alt/rep : 1541/3341/1541 causal constraints (skipped 1473 transitions) in 186 ms.
[2021-05-18 08:12:05] [INFO ] Added : 108 causal constraints over 22 iterations in 3142 ms. Result :sat
Incomplete Parikh walk after 4100 steps, including 471 resets, run finished after 68 ms. (steps per millisecond=60 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 25100 steps, including 1635 resets, run finished after 367 ms. (steps per millisecond=68 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 6 out of 1634 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1634/1634 places, 3429/3429 transitions.
Applied a total of 0 rules in 94 ms. Remains 1634 /1634 variables (removed 0) and now considering 3429/3429 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1634/1634 places, 3429/3429 transitions.
Starting structural reductions, iteration 0 : 1634/1634 places, 3429/3429 transitions.
Applied a total of 0 rules in 103 ms. Remains 1634 /1634 variables (removed 0) and now considering 3429/3429 (removed 0) transitions.
[2021-05-18 08:12:05] [INFO ] Flow matrix only has 3031 transitions (discarded 398 similar events)
// Phase 1: matrix 3031 rows 1634 cols
[2021-05-18 08:12:05] [INFO ] Computed 469 place invariants in 79 ms
[2021-05-18 08:12:08] [INFO ] Implicit Places using invariants in 2821 ms returned [4, 7, 9, 10, 11, 12, 13, 17, 23, 31, 41, 53, 67, 82, 96, 97, 98, 99, 100, 112, 122, 130, 136, 140, 142, 153, 159, 161, 162, 163, 164, 165, 167, 171, 177, 185, 195, 207, 220, 232, 233, 234, 235, 236, 246, 254, 260, 264, 266, 268, 279, 285, 287, 288, 289, 290, 291, 293, 295, 299, 305, 313, 323, 334, 344, 345, 346, 347, 348, 356, 362, 366, 368, 370, 372, 383, 389, 391, 392, 393, 394, 395, 397, 399, 401, 405, 411, 419, 428, 436, 437, 438, 439, 440, 446, 450, 452, 454, 456, 458, 469, 475, 477, 478, 479, 480, 481, 483, 485, 487, 489, 493, 499, 506, 512, 513, 514, 515, 516, 520, 522, 524, 526, 528, 530, 541, 547, 549, 550, 551, 552, 553, 555, 557, 559, 561, 563, 567, 572, 576, 577, 578, 579, 580, 582, 584, 586, 588, 590, 592, 603, 609, 611, 612, 613, 614, 615, 617, 619, 621, 623, 625, 627, 630, 632, 633, 634, 635, 636, 638, 640, 642, 644, 646, 648, 659, 665, 667, 668, 669, 670, 671, 673, 675, 677, 679, 681, 683, 685, 687, 688, 689, 690, 691, 693, 695, 697, 699, 701, 703, 714, 716, 719, 721, 722, 723, 724, 725, 727, 729, 731, 733, 735, 737, 739, 741, 742, 743, 744, 745, 747, 749, 751, 753, 755, 757, 768, 774, 776, 777, 778, 779, 780, 782, 784, 786, 788, 790, 792, 794, 796, 797, 798, 799, 800, 802, 804, 806, 808, 810, 812, 823, 829, 831, 832, 833, 834, 835, 837, 839, 841, 843, 845, 847, 849, 852, 853, 854, 855, 856, 858, 860, 862, 864, 866, 868, 879, 885, 887, 888, 889, 890, 891, 893, 895, 897, 899, 901, 903, 907, 912, 913, 914, 915, 916, 920, 922, 924, 926, 929, 931, 942, 948, 950, 951, 952, 953, 954, 956, 958, 960, 962, 964, 968, 974, 981, 982, 983, 984, 985, 991, 995, 997, 999, 1001, 1003, 1014, 1020, 1022, 1023, 1024, 1025, 1026, 1028, 1030, 1032, 1034, 1038, 1044, 1052, 1061, 1062, 1063, 1064, 1065, 1073, 1079, 1083, 1085, 1087, 1089, 1100, 1106, 1108, 1109, 1110, 1111, 1112, 1114, 1116, 1118, 1122, 1128, 1136, 1146, 1157, 1158, 1159, 1160, 1161, 1171, 1179, 1185, 1189, 1191, 1193, 1204, 1210, 1212, 1213, 1214, 1215, 1216, 1218, 1220, 1224, 1230, 1238, 1248, 1260, 1273, 1274, 1275, 1276, 1277, 1289, 1299, 1307, 1313, 1317, 1319, 1330, 1332, 1335, 1337, 1338, 1339, 1340, 1341, 1343, 1347, 1353, 1361, 1371, 1383, 1397, 1412, 1413, 1414, 1415, 1416, 1430, 1442, 1452, 1460, 1466, 1470, 1481]
Discarding 428 places :
Implicit Place search using SMT only with invariants took 2828 ms to find 428 implicit places.
[2021-05-18 08:12:08] [INFO ] Redundant transitions in 208 ms returned []
[2021-05-18 08:12:08] [INFO ] Flow matrix only has 3031 transitions (discarded 398 similar events)
// Phase 1: matrix 3031 rows 1206 cols
[2021-05-18 08:12:08] [INFO ] Computed 41 place invariants in 30 ms
[2021-05-18 08:12:10] [INFO ] Dead Transitions using invariants and state equation in 1418 ms returned []
Starting structural reductions, iteration 1 : 1206/1634 places, 3429/3429 transitions.
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 128 place count 1078 transition count 3301
Iterating global reduction 0 with 128 rules applied. Total rules applied 256 place count 1078 transition count 3301
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 384 place count 950 transition count 3173
Iterating global reduction 0 with 128 rules applied. Total rules applied 512 place count 950 transition count 3173
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 515 place count 950 transition count 3170
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 518 place count 947 transition count 3170
Applied a total of 518 rules in 212 ms. Remains 947 /1206 variables (removed 259) and now considering 3170/3429 (removed 259) transitions.
[2021-05-18 08:12:10] [INFO ] Flow matrix only has 2772 transitions (discarded 398 similar events)
// Phase 1: matrix 2772 rows 947 cols
[2021-05-18 08:12:10] [INFO ] Computed 41 place invariants in 22 ms
[2021-05-18 08:12:11] [INFO ] Implicit Places using invariants in 929 ms returned []
[2021-05-18 08:12:11] [INFO ] Flow matrix only has 2772 transitions (discarded 398 similar events)
// Phase 1: matrix 2772 rows 947 cols
[2021-05-18 08:12:11] [INFO ] Computed 41 place invariants in 19 ms
[2021-05-18 08:12:12] [INFO ] State equation strengthened by 1651 read => feed constraints.
[2021-05-18 08:12:12] [INFO ] Implicit Places using invariants and state equation in 885 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 947/1634 places, 3170/3429 transitions.
[2021-05-18 08:12:12] [INFO ] Flatten gal took : 104 ms
[2021-05-18 08:12:12] [INFO ] Flatten gal took : 108 ms
[2021-05-18 08:12:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8178366837926101083.gal : 11 ms
[2021-05-18 08:12:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2431284772684282090.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/ReachabilityCardinality8178366837926101083.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2431284772684282090.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/ReachabilityCardinality8178366837926101083.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2431284772684282090.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2431284772684282090.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :32 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 37
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 41
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 71
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :71 after 138
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :138 after 222
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :222 after 343
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :343 after 692
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :692 after 1168
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1168 after 2224
Detected timeout of ITS tools.
[2021-05-18 08:12:27] [INFO ] Flatten gal took : 102 ms
[2021-05-18 08:12:27] [INFO ] Applying decomposition
[2021-05-18 08:12:27] [INFO ] Flatten gal took : 111 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/graph2682061349827519435.txt, -o, /tmp/graph2682061349827519435.bin, -w, /tmp/graph2682061349827519435.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/graph2682061349827519435.bin, -l, -1, -v, -w, /tmp/graph2682061349827519435.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:12:28] [INFO ] Decomposing Gal with order
[2021-05-18 08:12:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:12:28] [INFO ] Removed a total of 5027 redundant transitions.
[2021-05-18 08:12:28] [INFO ] Flatten gal took : 507 ms
[2021-05-18 08:12:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 2264 labels/synchronizations in 107 ms.
[2021-05-18 08:12:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17507002366903430742.gal : 18 ms
[2021-05-18 08:12:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality832970595946145045.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/ReachabilityCardinality17507002366903430742.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality832970595946145045.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/ReachabilityCardinality17507002366903430742.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality832970595946145045.prop --nowitness
Loading property file /tmp/ReachabilityCardinality832970595946145045.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12778802945994511819
[2021-05-18 08:12:43] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12778802945994511819
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/ltsmin12778802945994511819]
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/ltsmin12778802945994511819] 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/ltsmin12778802945994511819] 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 42663 resets, run finished after 13766 ms. (steps per millisecond=72 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4024 resets, run finished after 2003 ms. (steps per millisecond=499 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4019 resets, run finished after 1965 ms. (steps per millisecond=508 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 718488 steps, run timeout after 30001 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 718488 steps, saw 295666 distinct states, run finished after 30001 ms. (steps per millisecond=23 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-18 08:13:32] [INFO ] Flow matrix only has 2772 transitions (discarded 398 similar events)
// Phase 1: matrix 2772 rows 947 cols
[2021-05-18 08:13:32] [INFO ] Computed 41 place invariants in 18 ms
[2021-05-18 08:13:32] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 08:13:32] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-18 08:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:13:33] [INFO ] [Real]Absence check using state equation in 551 ms returned sat
[2021-05-18 08:13:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:13:33] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 08:13:33] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-18 08:13:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:13:34] [INFO ] [Nat]Absence check using state equation in 558 ms returned sat
[2021-05-18 08:13:34] [INFO ] State equation strengthened by 1651 read => feed constraints.
[2021-05-18 08:13:35] [INFO ] [Nat]Added 1651 Read/Feed constraints in 1026 ms returned sat
[2021-05-18 08:13:35] [INFO ] Deduced a trap composed of 145 places in 416 ms of which 1 ms to minimize.
[2021-05-18 08:13:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 552 ms
[2021-05-18 08:13:35] [INFO ] Computed and/alt/rep : 1334/1919/1334 causal constraints (skipped 1376 transitions) in 167 ms.
[2021-05-18 08:13:37] [INFO ] Added : 53 causal constraints over 11 iterations in 1423 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2021-05-18 08:13:37] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 08:13:37] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-18 08:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:13:37] [INFO ] [Real]Absence check using state equation in 601 ms returned sat
[2021-05-18 08:13:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:13:38] [INFO ] [Nat]Absence check using 31 positive place invariants in 14 ms returned sat
[2021-05-18 08:13:38] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 1 ms returned sat
[2021-05-18 08:13:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:13:38] [INFO ] [Nat]Absence check using state equation in 622 ms returned sat
[2021-05-18 08:13:39] [INFO ] [Nat]Added 1651 Read/Feed constraints in 543 ms returned sat
[2021-05-18 08:13:39] [INFO ] Deduced a trap composed of 191 places in 415 ms of which 1 ms to minimize.
[2021-05-18 08:13:40] [INFO ] Deduced a trap composed of 83 places in 474 ms of which 1 ms to minimize.
[2021-05-18 08:13:40] [INFO ] Deduced a trap composed of 224 places in 467 ms of which 1 ms to minimize.
[2021-05-18 08:13:41] [INFO ] Deduced a trap composed of 70 places in 473 ms of which 8 ms to minimize.
[2021-05-18 08:13:41] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2280 ms
[2021-05-18 08:13:41] [INFO ] Computed and/alt/rep : 1334/1919/1334 causal constraints (skipped 1376 transitions) in 161 ms.
[2021-05-18 08:13:42] [INFO ] Added : 11 causal constraints over 3 iterations in 570 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
Incomplete Parikh walk after 16500 steps, including 1264 resets, run finished after 239 ms. (steps per millisecond=69 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 2800 steps, including 349 resets, run finished after 40 ms. (steps per millisecond=70 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 6 out of 947 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 947/947 places, 3170/3170 transitions.
Applied a total of 0 rules in 84 ms. Remains 947 /947 variables (removed 0) and now considering 3170/3170 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 947/947 places, 3170/3170 transitions.
Starting structural reductions, iteration 0 : 947/947 places, 3170/3170 transitions.
Applied a total of 0 rules in 80 ms. Remains 947 /947 variables (removed 0) and now considering 3170/3170 (removed 0) transitions.
[2021-05-18 08:13:42] [INFO ] Flow matrix only has 2772 transitions (discarded 398 similar events)
// Phase 1: matrix 2772 rows 947 cols
[2021-05-18 08:13:42] [INFO ] Computed 41 place invariants in 18 ms
[2021-05-18 08:13:43] [INFO ] Implicit Places using invariants in 907 ms returned []
[2021-05-18 08:13:43] [INFO ] Flow matrix only has 2772 transitions (discarded 398 similar events)
// Phase 1: matrix 2772 rows 947 cols
[2021-05-18 08:13:43] [INFO ] Computed 41 place invariants in 17 ms
[2021-05-18 08:13:44] [INFO ] State equation strengthened by 1651 read => feed constraints.
[2021-05-18 08:13:44] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1784 ms to find 0 implicit places.
[2021-05-18 08:13:44] [INFO ] Redundant transitions in 170 ms returned []
[2021-05-18 08:13:44] [INFO ] Flow matrix only has 2772 transitions (discarded 398 similar events)
// Phase 1: matrix 2772 rows 947 cols
[2021-05-18 08:13:44] [INFO ] Computed 41 place invariants in 18 ms
[2021-05-18 08:13:46] [INFO ] Dead Transitions using invariants and state equation in 1403 ms returned []
Finished structural reductions, in 1 iterations. Remains : 947/947 places, 3170/3170 transitions.
Incomplete random walk after 100000 steps, including 4266 resets, run finished after 1472 ms. (steps per millisecond=67 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-18 08:13:47] [INFO ] Flow matrix only has 2772 transitions (discarded 398 similar events)
// Phase 1: matrix 2772 rows 947 cols
[2021-05-18 08:13:47] [INFO ] Computed 41 place invariants in 17 ms
[2021-05-18 08:13:47] [INFO ] [Real]Absence check using 31 positive place invariants in 18 ms returned sat
[2021-05-18 08:13:47] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-18 08:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:13:48] [INFO ] [Real]Absence check using state equation in 572 ms returned sat
[2021-05-18 08:13:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:13:48] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 08:13:48] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-18 08:13:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:13:48] [INFO ] [Nat]Absence check using state equation in 560 ms returned sat
[2021-05-18 08:13:48] [INFO ] State equation strengthened by 1651 read => feed constraints.
[2021-05-18 08:13:50] [INFO ] [Nat]Added 1651 Read/Feed constraints in 1030 ms returned sat
[2021-05-18 08:13:50] [INFO ] Deduced a trap composed of 145 places in 434 ms of which 1 ms to minimize.
[2021-05-18 08:13:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 567 ms
[2021-05-18 08:13:50] [INFO ] Computed and/alt/rep : 1334/1919/1334 causal constraints (skipped 1376 transitions) in 353 ms.
[2021-05-18 08:13:52] [INFO ] Added : 53 causal constraints over 11 iterations in 1654 ms. Result :sat
[2021-05-18 08:13:52] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2021-05-18 08:13:52] [INFO ] [Real]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-18 08:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:13:52] [INFO ] [Real]Absence check using state equation in 610 ms returned sat
[2021-05-18 08:13:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:13:53] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 08:13:53] [INFO ] [Nat]Absence check using 31 positive and 10 generalized place invariants in 2 ms returned sat
[2021-05-18 08:13:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:13:53] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2021-05-18 08:13:54] [INFO ] [Nat]Added 1651 Read/Feed constraints in 549 ms returned sat
[2021-05-18 08:13:54] [INFO ] Deduced a trap composed of 191 places in 436 ms of which 1 ms to minimize.
[2021-05-18 08:13:55] [INFO ] Deduced a trap composed of 83 places in 544 ms of which 0 ms to minimize.
[2021-05-18 08:13:55] [INFO ] Deduced a trap composed of 224 places in 461 ms of which 1 ms to minimize.
[2021-05-18 08:13:56] [INFO ] Deduced a trap composed of 70 places in 465 ms of which 0 ms to minimize.
[2021-05-18 08:13:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2364 ms
[2021-05-18 08:13:56] [INFO ] Computed and/alt/rep : 1334/1919/1334 causal constraints (skipped 1376 transitions) in 165 ms.
[2021-05-18 08:13:57] [INFO ] Added : 11 causal constraints over 3 iterations in 609 ms. Result :sat
[2021-05-18 08:13:57] [INFO ] Flatten gal took : 100 ms
[2021-05-18 08:13:57] [INFO ] Flatten gal took : 107 ms
[2021-05-18 08:13:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13279224066816222581.gal : 11 ms
[2021-05-18 08:13:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4920625384099430783.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/ReachabilityCardinality13279224066816222581.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4920625384099430783.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/ReachabilityCardinality13279224066816222581.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4920625384099430783.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4920625384099430783.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :32 after 36
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :36 after 37
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :37 after 41
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :41 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 71
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :71 after 138
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :138 after 222
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :222 after 343
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :343 after 692
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :692 after 1168
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :1168 after 2224
Detected timeout of ITS tools.
[2021-05-18 08:14:17] [INFO ] Flatten gal took : 105 ms
[2021-05-18 08:14:17] [INFO ] Applying decomposition
[2021-05-18 08:14:17] [INFO ] Flatten gal took : 107 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/graph3625106492861027093.txt, -o, /tmp/graph3625106492861027093.bin, -w, /tmp/graph3625106492861027093.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/graph3625106492861027093.bin, -l, -1, -v, -w, /tmp/graph3625106492861027093.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:14:17] [INFO ] Decomposing Gal with order
[2021-05-18 08:14:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:14:18] [INFO ] Removed a total of 4983 redundant transitions.
[2021-05-18 08:14:18] [INFO ] Flatten gal took : 493 ms
[2021-05-18 08:14:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 2378 labels/synchronizations in 116 ms.
[2021-05-18 08:14:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17834871593386074298.gal : 19 ms
[2021-05-18 08:14:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17200357984100596662.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/ReachabilityCardinality17834871593386074298.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17200357984100596662.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/ReachabilityCardinality17834871593386074298.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17200357984100596662.prop --nowitness
Loading property file /tmp/ReachabilityCardinality17200357984100596662.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 211
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :211 after 297
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :297 after 298
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :298 after 298
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :298 after 298
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :298 after 298
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :298 after 1672
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5190199392754861647
[2021-05-18 08:14:38] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5190199392754861647
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/ltsmin5190199392754861647]
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/ltsmin5190199392754861647] 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/ltsmin5190199392754861647] 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 1042 edges and 947 vertex of which 17 / 947 are part of one of the 1 SCC in 5 ms
Free SCC test removed 16 places
Drop transitions removed 300 transitions
Ensure Unique test removed 370 transitions
Reduce isomorphic transitions removed 670 transitions.
Graph (complete) has 3687 edges and 931 vertex of which 919 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 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 902 transition count 2401
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 805 transition count 2208
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 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 2 with 264 rules applied. Total rules applied 655 place count 709 transition count 2040
Reduce places removed 72 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 70 transitions
Reduce isomorphic transitions removed 72 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 213 rules applied. Total rules applied 868 place count 637 transition count 1899
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 1055 place count 568 transition count 1781
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 1200 place count 519 transition count 1685
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 1326 place count 472 transition count 1606
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 1420 place count 440 transition count 1544
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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 8 with 77 rules applied. Total rules applied 1497 place count 410 transition count 1497
Reduce places removed 17 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 9 with 49 rules applied. Total rules applied 1546 place count 393 transition count 1465
Reduce places removed 15 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 15 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 38 rules applied. Total rules applied 1584 place count 378 transition count 1442
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 1606 place count 370 transition count 1428
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 1620 place count 364 transition count 1420
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 13 with 6 rules applied. Total rules applied 1626 place count 362 transition count 1416
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 1630 place count 360 transition count 1414
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 8 Pre rules applied. Total rules applied 1630 place count 360 transition count 1406
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 15 with 16 rules applied. Total rules applied 1646 place count 352 transition count 1406
Discarding 283 places :
Symmetric choice reduction at 15 with 283 rule applications. Total rules 1929 place count 69 transition count 322
Iterating global reduction 15 with 283 rules applied. Total rules applied 2212 place count 69 transition count 322
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 251 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 15 with 260 rules applied. Total rules applied 2472 place count 69 transition count 62
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 16 with 9 rules applied. Total rules applied 2481 place count 60 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 17 with 1 Pre rules applied. Total rules applied 2481 place count 60 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 2483 place count 59 transition count 61
Discarding 9 places :
Symmetric choice reduction at 17 with 9 rule applications. Total rules 2492 place count 50 transition count 52
Iterating global reduction 17 with 9 rules applied. Total rules applied 2501 place count 50 transition count 52
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 17 with 10 rules applied. Total rules applied 2511 place count 45 transition count 47
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 2512 place count 45 transition count 46
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 17 with 5 rules applied. Total rules applied 2517 place count 45 transition count 41
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 17 with 5 rules applied. Total rules applied 2522 place count 40 transition count 41
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 18 with 8 rules applied. Total rules applied 2530 place count 40 transition count 41
Applied a total of 2530 rules in 620 ms. Remains 40 /947 variables (removed 907) and now considering 41/3170 (removed 3129) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 41 rows 40 cols
[2021-05-18 08:14:41] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-18 08:14:41] [INFO ] [Real]Absence check using 5 positive place invariants in 20 ms returned sat
[2021-05-18 08:14:41] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 38 ms returned sat
[2021-05-18 08:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:14:41] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-18 08:14:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:14:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 37 ms returned sat
[2021-05-18 08:14:41] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 39 ms returned sat
[2021-05-18 08:14:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:14:41] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-18 08:14:41] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints (skipped 17 transitions) in 2 ms.
[2021-05-18 08:14:41] [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 08:14:41] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-18 08:14:41] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2021-05-18 08:14:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:14:41] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-18 08:14:41] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:14:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2021-05-18 08:14:41] [INFO ] [Nat]Absence check using 5 positive and 8 generalized place invariants in 1 ms returned sat
[2021-05-18 08:14:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:14:41] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-18 08:14:41] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints (skipped 17 transitions) in 2 ms.
[2021-05-18 08:14:41] [INFO ] Added : 2 causal constraints over 2 iterations in 35 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-18 08:14:41] [INFO ] Flatten gal took : 108 ms
Using solver Z3 to compute partial order matrices.
[2021-05-18 08:14:42] [INFO ] Flatten gal took : 113 ms
[2021-05-18 08:14:42] [INFO ] Input system was already deterministic with 3170 transitions.
Built C files in :
/tmp/ltsmin2026917135733445284
[2021-05-18 08:14:42] [INFO ] Too many transitions (3170) to apply POR reductions. Disabling POR matrices.
[2021-05-18 08:14:42] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2026917135733445284
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/ltsmin2026917135733445284]
[2021-05-18 08:14:42] [INFO ] Applying decomposition
[2021-05-18 08:14:42] [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/graph4858009510665347540.txt, -o, /tmp/graph4858009510665347540.bin, -w, /tmp/graph4858009510665347540.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/graph4858009510665347540.bin, -l, -1, -v, -w, /tmp/graph4858009510665347540.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:14:42] [INFO ] Decomposing Gal with order
[2021-05-18 08:14:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:14:43] [INFO ] Ran tautology test, simplified 0 / 2 in 1458 ms.
[2021-05-18 08:14:43] [INFO ] BMC solution for property gen-ReachabilityFireability-02(UNSAT) depth K=0 took 30 ms
[2021-05-18 08:14:43] [INFO ] Removed a total of 4973 redundant transitions.
[2021-05-18 08:14:43] [INFO ] BMC solution for property gen-ReachabilityFireability-14(UNSAT) depth K=0 took 3 ms
[2021-05-18 08:14:43] [INFO ] BMC solution for property gen-ReachabilityFireability-02(UNSAT) depth K=1 took 44 ms
[2021-05-18 08:14:43] [INFO ] Flatten gal took : 694 ms
[2021-05-18 08:14:43] [INFO ] BMC solution for property gen-ReachabilityFireability-14(UNSAT) depth K=1 took 36 ms
[2021-05-18 08:14:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 2329 labels/synchronizations in 192 ms.
[2021-05-18 08:14:44] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4985522489405272356.gal : 19 ms
[2021-05-18 08:14:44] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability6082252994334478653.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/ReachabilityFireability4985522489405272356.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability6082252994334478653.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/ReachabilityFireability4985522489405272356.gal -t CGAL -reachable-file /tmp/ReachabilityFireability6082252994334478653.prop --nowitness
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 2772 out of 3170 initially.
// Phase 1: matrix 2772 rows 947 cols
[2021-05-18 08:14:44] [INFO ] Computed 41 place invariants in 31 ms
inv : Node7IsActive + NodesCanDetectThatNode7HasCrashed = 1
inv : Node13IsActive + NodesCanDetectThatNode13HasCrashed = 1
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 + 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 + 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 + Node11ManageTheCrashOfNode14 + 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 + Rx0HasReceivedTheRequestOfNode0 + Rx1HasReceivedTheRequestOfNode0 + Rx2HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode0 = 1
inv : Node7NotifyThatHeIsActive + NodesCanDetectThatNode7HasCrashed = 1
inv : Node2IsActive + NodesCanDetectThatNode2HasCrashed = 1
inv : Lx0IsActiveAndNotInTheLeafSet + Lx1IsAtTheLeftExtremityOfTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet - Lx3IsActiveAndNotInTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Rx0IsAtTheRightExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet - Rx2IsActiveAndNotInTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet = 0
inv : -NoCrashIsHappening + Node0IsActive - NodesCanDetectThatNode1HasCrashed - NodesCanDetectThatNode2HasCrashed - NodesCanDetectThatNode3HasCrashed - NodesCanDetectThatNode4HasCrashed - NodesCanDetectThatNode5HasCrashed - NodesCanDetectThatNode6HasCrashed - NodesCanDetectThatNode7HasCrashed + Node8IsActive - NodesCanDetectThatNode9HasCrashed - NodesCanDetectThatNode10HasCrashed - NodesCanDetectThatNode11HasCrashed - NodesCanDetectThatNode12HasCrashed - NodesCanDetectThatNode13HasCrashed - NodesCanDetectThatNode14HasCrashed - NodesCanDetectThatNode15HasCrashed + Node16IsActive + Lx1IsAtTheLeftExtremityOfTheLeafSet + 2*Lx2IsAtTheLeftExtremityOfTheLeafSet - 4*Lx3IsActiveAndNotInTheLeafSet + 3*Lx3IsAtTheLeftExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet - 4*Rx2IsActiveAndNotInTheLeafSet + 2*Rx2IsAtTheRightExtremityOfTheLeafSet - Rx3IsAtTheRightExtremityOfTheLeafSet = -6
inv : -Rx2IsActiveAndNotInTheLeafSet + Rx3IsActiveAndNotInTheLeafSet - Rx3IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node2NotifyThatHeIsActive + NodesCanDetectThatNode2HasCrashed = 1
inv : Node5NotifyThatHeIsActive + NodesCanDetectThatNode5HasCrashed = 1
inv : Node14IsActive + NodesCanDetectThatNode14HasCrashed = 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 + 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 : Node3NotifyThatHeIsActive + NodesCanDetectThatNode3HasCrashed = 1
inv : CrashReservoir - NoCrashIsHappening + Lx1IsAtTheLeftExtremityOfTheLeafSet + 2*Lx2IsAtTheLeftExtremityOfTheLeafSet - 4*Lx3IsActiveAndNotInTheLeafSet + 3*Lx3IsAtTheLeftExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet - 4*Rx2IsActiveAndNotInTheLeafSet + 2*Rx2IsAtTheRightExtremityOfTheLeafSet - Rx3IsAtTheRightExtremityOfTheLeafSet = -5
inv : Node12NotifyThatHeIsActive + NodesCanDetectThatNode12HasCrashed = 1
inv : Lx0IsAtTheLeftExtremityOfTheLeafSet + Lx1IsAtTheLeftExtremityOfTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet - Lx3IsActiveAndNotInTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet = 0
inv : NoCrashIsHappening + ThereIsAMasterInTheLeafSet + Node0AsksIsThereANodeMaster + RequestOfNode0IsSentToLx0 + RequestOfNode0IsSentToRx0 + RequestOfNode0IsSentToLx1 + RequestOfNode0IsSentToRx1 + RequestOfNode0IsSentToLx2 + RequestOfNode0IsSentToRx2 + RequestOfNode0IsSentToLx3 + RequestOfNode0IsSentToRx3 + Node1AsksIsThereANodeMaster + Node1DontAnswerToAnyNode + Node2AsksIsThereANodeMaster + Node2DontAnswerToAnyNode + Node3AsksIsThereANodeMaster + Node3DontAnswerToAnyNode + Node4AsksIsThereANodeMaster + Node4DontAnswerToAnyNode + Node5AsksIsThereANodeMaster + Node5DontAnswerToAnyNode + Node6AsksIsThereANodeMaster + Node6DontAnswerToAnyNode + Node7AsksIsThereANodeMaster + Node7DontAnswerToAnyNode + Node8AsksIsThereANodeMaster + Node9AsksIsThereANodeMaster + Node9DontAnswerToAnyNode + Node10AsksIsThereANodeMaster + Node10DontAnswerToAnyNode + Node11AsksIsThereANodeMaster + Node11ManageTheCrashOfNode14 + Node11DontAnswerToAnyNode + Node12AsksIsThereANodeMaster + Node12DontAnswerToAnyNode + Node13AsksIsThereANodeMaster + Node13DontAnswerToAnyNode + Node14AsksIsThereANodeMaster + Node14DontAnswerToAnyNode + Node15AsksIsThereANodeMaster + Node15DontAnswerToAnyNode + Node16AsksIsThereANodeMaster + Lx0HasReceivedTheRequestOfNode0 + Lx1HasReceivedTheRequestOfNode0 + Lx2HasReceivedTheRequestOfNode0 + Lx3HasReceivedTheRequestOfNode0 + Rx0HasReceivedTheRequestOfNode0 + Rx1HasReceivedTheRequestOfNode0 + Rx2HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode0 = 1
inv : Rx1IsActiveAndNotInTheLeafSet - Rx2IsActiveAndNotInTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node12IsActive + NodesCanDetectThatNode12HasCrashed = 1
inv : Node10NotifyThatHeIsActive + NodesCanDetectThatNode10HasCrashed = 1
inv : Node14NotifyThatHeIsActive + NodesCanDetectThatNode14HasCrashed = 1
inv : Rx0IsActiveAndNotInTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet - Rx2IsActiveAndNotInTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node13NotifyThatHeIsActive + NodesCanDetectThatNode13HasCrashed = 1
inv : Lx2IsActiveAndNotInTheLeafSet - Lx3IsActiveAndNotInTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node10IsActive + NodesCanDetectThatNode10HasCrashed = 1
inv : Node4NotifyThatHeIsActive + NodesCanDetectThatNode4HasCrashed = 1
inv : Node9IsActive + NodesCanDetectThatNode9HasCrashed = 1
inv : Node15NotifyThatHeIsActive + NodesCanDetectThatNode15HasCrashed = 1
inv : Node1NotifyThatHeIsActive + NodesCanDetectThatNode1HasCrashed = 1
inv : Node9NotifyThatHeIsActive + NodesCanDetectThatNode9HasCrashed = 1
inv : Node4IsActive + NodesCanDetectThatNode4HasCrashed = 1
inv : Node3IsActive + NodesCanDetectThatNode3HasCrashed = 1
inv : Node6NotifyThatHeIsActive + NodesCanDetectThatNode6HasCrashed = 1
inv : Node1IsActive + NodesCanDetectThatNode1HasCrashed = 1
inv : Lx1IsActiveAndNotInTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet - Lx3IsActiveAndNotInTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node5IsActive + NodesCanDetectThatNode5HasCrashed = 1
inv : Node6IsActive + NodesCanDetectThatNode6HasCrashed = 1
inv : Node11NotifyThatHeIsActive + NodesCanDetectThatNode11HasCrashed = 1
inv : Node15IsActive + NodesCanDetectThatNode15HasCrashed = 1
inv : Node11IsActive + NodesCanDetectThatNode11HasCrashed = 1
Total of 41 invariants.
[2021-05-18 08:14:44] [INFO ] Computed 41 place invariants in 54 ms
Loading property file /tmp/ReachabilityFireability6082252994334478653.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 485
[2021-05-18 08:14:50] [INFO ] Proved 947 variables to be positive in 6337 ms
[2021-05-18 08:14:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityFireability-02
[2021-05-18 08:14:51] [INFO ] KInduction solution for property gen-ReachabilityFireability-02(SAT) depth K=0 took 291 ms
[2021-05-18 08:14:51] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityFireability-14
[2021-05-18 08:14:51] [INFO ] KInduction solution for property gen-ReachabilityFireability-14(SAT) depth K=0 took 459 ms
[2021-05-18 08:15:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityFireability-02
[2021-05-18 08:15:01] [INFO ] KInduction solution for property gen-ReachabilityFireability-02(SAT) depth K=1 took 9696 ms
[2021-05-18 08:15:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityFireability-14
[2021-05-18 08:15:07] [INFO ] KInduction solution for property gen-ReachabilityFireability-14(SAT) depth K=1 took 6000 ms
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :485 after 3585
[2021-05-18 08:15:20] [INFO ] BMC solution for property gen-ReachabilityFireability-02(UNSAT) depth K=2 took 36180 ms
Compilation finished in 43239 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin2026917135733445284]
Link finished in 114 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/ltsmin2026917135733445284]
[2021-05-18 08:16:53] [INFO ] BMC solution for property gen-ReachabilityFireability-14(UNSAT) depth K=2 took 93321 ms
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :3585 after 12849
LTSmin run took 396875 ms.
Invariant validated
FORMULA gen-ReachabilityFireability-02 TRUE 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, genReachabilityFireability14==true], workingDir=/tmp/ltsmin2026917135733445284]
LTSmin run took 360449 ms.
Invariant validated
FORMULA gen-ReachabilityFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
[2021-05-18 08:28:03] [WARNING] Interrupting SMT solver.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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 08:28:03] [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 "Solver has unexpectedly terminated")
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 "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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 08:28:03] [INFO ] During BMC, SMT solver timed out at depth 3
[2021-05-18 08:28:03] [INFO ] BMC solving timed out (3600000 secs) at depth 3
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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 08:28:03] [WARNING] Unexpected error occurred while running SMT. Was verifying gen-ReachabilityFireability-02 K-induction depth 2
Exception in thread "Thread-25" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
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 "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
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 08:28:03] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1621326484411
--------------------
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-S16C04"
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-S16C04, 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-162124156700591"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C04.tgz
mv MultiCrashLeafsetExtension-PT-S16C04 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 '
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 ;