Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 12K Apr 29 16:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 29 16:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 16:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K May 9 08:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:15 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 9 08:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 24K Apr 29 16:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 29 16:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 29 16:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 29 16:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 5.2M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1655069606913

Running Version 0
[2022-06-12 21:33:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:33:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:33:28] [INFO ] Load time of PNML (sax parser for PT used): 298 ms
[2022-06-12 21:33:28] [INFO ] Transformed 5568 places.
[2022-06-12 21:33:28] [INFO ] Transformed 7799 transitions.
[2022-06-12 21:33:28] [INFO ] Parsed PT model containing 5568 places and 7799 transitions in 380 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 160 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 16) seen :5
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 11) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :1
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2022-06-12 21:33:29] [INFO ] Flow matrix only has 7527 transitions (discarded 272 similar events)
// Phase 1: matrix 7527 rows 5568 cols
[2022-06-12 21:33:30] [INFO ] Computed 573 place invariants in 899 ms
[2022-06-12 21:33:32] [INFO ] [Real]Absence check using 50 positive place invariants in 34 ms returned sat
[2022-06-12 21:33:32] [INFO ] [Real]Absence check using 50 positive and 523 generalized place invariants in 254 ms returned sat
[2022-06-12 21:33:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:37] [INFO ] SMT Verify possible in real domain returnedunsat :1 sat :0 real:7
[2022-06-12 21:33:38] [INFO ] [Nat]Absence check using 50 positive place invariants in 30 ms returned sat
[2022-06-12 21:33:39] [INFO ] [Nat]Absence check using 50 positive and 523 generalized place invariants in 252 ms returned sat
[2022-06-12 21:33:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:53] [INFO ] [Nat]Absence check using state equation in 13720 ms returned unsat :3 sat :5
[2022-06-12 21:33:53] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2022-06-12 21:33:53] [INFO ] [Nat]Added 2195 Read/Feed constraints in 104 ms returned sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 21:34:03] [INFO ] SMT Verify possible in nat domain returned unsat :3 sat :3
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 3000 steps, including 882 resets, run finished after 31 ms. (steps per millisecond=96 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 6800 steps, including 1015 resets, run finished after 65 ms. (steps per millisecond=104 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11500 steps, including 1089 resets, run finished after 101 ms. (steps per millisecond=113 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 11200 steps, including 1088 resets, run finished after 96 ms. (steps per millisecond=116 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 7 out of 5568 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5568/5568 places, 7799/7799 transitions.
Graph (complete) has 17461 edges and 5568 vertex of which 5536 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.22 ms
Discarding 32 places :
Also discarding 0 output transitions
Drop transitions removed 1623 transitions
Trivial Post-agglo rules discarded 1623 transitions
Performed 1623 trivial Post agglomeration. Transition count delta: 1623
Iterating post reduction 0 with 1623 rules applied. Total rules applied 1624 place count 5536 transition count 6176
Reduce places removed 1623 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 1631 rules applied. Total rules applied 3255 place count 3913 transition count 6168
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 3263 place count 3905 transition count 6168
Performed 203 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 203 Pre rules applied. Total rules applied 3263 place count 3905 transition count 5965
Deduced a syphon composed of 203 places in 9 ms
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 3 with 406 rules applied. Total rules applied 3669 place count 3702 transition count 5965
Discarding 1426 places :
Symmetric choice reduction at 3 with 1426 rule applications. Total rules 5095 place count 2276 transition count 4539
Iterating global reduction 3 with 1426 rules applied. Total rules applied 6521 place count 2276 transition count 4539
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 6521 place count 2276 transition count 4528
Deduced a syphon composed of 11 places in 7 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 6543 place count 2265 transition count 4528
Discarding 236 places :
Symmetric choice reduction at 3 with 236 rule applications. Total rules 6779 place count 2029 transition count 3112
Iterating global reduction 3 with 236 rules applied. Total rules applied 7015 place count 2029 transition count 3112
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 5 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 7049 place count 2012 transition count 3095
Free-agglomeration rule (complex) applied 162 times.
Iterating global reduction 3 with 162 rules applied. Total rules applied 7211 place count 2012 transition count 4113
Reduce places removed 162 places and 0 transitions.
Iterating post reduction 3 with 162 rules applied. Total rules applied 7373 place count 1850 transition count 4113
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 7389 place count 1850 transition count 4113
Applied a total of 7389 rules in 1772 ms. Remains 1850 /5568 variables (removed 3718) and now considering 4113/7799 (removed 3686) transitions.
Finished structural reductions, in 1 iterations. Remains : 1850/5568 places, 4113/7799 transitions.
[2022-06-12 21:34:05] [INFO ] Flatten gal took : 485 ms
[2022-06-12 21:34:06] [INFO ] Flatten gal took : 258 ms
[2022-06-12 21:34:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12550328023274724773.gal : 82 ms
[2022-06-12 21:34:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2925766941950251682.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/ReachabilityCardinality12550328023274724773.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2925766941950251682.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/ReachabilityCardinality12550328023274724773.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2925766941950251682.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2925766941950251682.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :8 after 11
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :12 after 15
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :15 after 31
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :31 after 41
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :41 after 158
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :158 after 187
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :187 after 197
Detected timeout of ITS tools.
[2022-06-12 21:34:21] [INFO ] Flatten gal took : 293 ms
[2022-06-12 21:34:21] [INFO ] Applying decomposition
[2022-06-12 21:34:21] [INFO ] Flatten gal took : 204 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/graph6101084890068255325.txt, -o, /tmp/graph6101084890068255325.bin, -w, /tmp/graph6101084890068255325.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/graph6101084890068255325.bin, -l, -1, -v, -w, /tmp/graph6101084890068255325.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:34:22] [INFO ] Decomposing Gal with order
[2022-06-12 21:34:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:34:24] [INFO ] Removed a total of 5035 redundant transitions.
[2022-06-12 21:34:24] [INFO ] Flatten gal took : 1707 ms
[2022-06-12 21:34:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4482 labels/synchronizations in 348 ms.
[2022-06-12 21:34:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5110061491359252872.gal : 42 ms
[2022-06-12 21:34:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2174267545627473367.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/ReachabilityCardinality5110061491359252872.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2174267545627473367.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/ReachabilityCardinality5110061491359252872.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2174267545627473367.prop --nowitness
Loading property file /tmp/ReachabilityCardinality2174267545627473367.prop.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5582257337833663337
[2022-06-12 21:34:40] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5582257337833663337
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/ltsmin5582257337833663337]
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/ltsmin5582257337833663337] 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/ltsmin5582257337833663337] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 26664 resets, run finished after 15882 ms. (steps per millisecond=62 ) properties (out of 3) seen :2
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 4864 resets, run finished after 3417 ms. (steps per millisecond=292 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-12 21:35:00] [INFO ] Flow matrix only has 3715 transitions (discarded 398 similar events)
// Phase 1: matrix 3715 rows 1850 cols
[2022-06-12 21:35:00] [INFO ] Computed 541 place invariants in 74 ms
[2022-06-12 21:35:00] [INFO ] [Real]Absence check using 33 positive place invariants in 45 ms returned sat
[2022-06-12 21:35:01] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 140 ms returned sat
[2022-06-12 21:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:35:02] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2022-06-12 21:35:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:35:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2022-06-12 21:35:02] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 88 ms returned sat
[2022-06-12 21:35:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:35:03] [INFO ] [Nat]Absence check using state equation in 1175 ms returned sat
[2022-06-12 21:35:03] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2022-06-12 21:35:07] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-12 21:35:10] [INFO ] [Nat]Added 2195 Read/Feed constraints in 6241 ms returned unknown
Support contains 2 out of 1850 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1850/1850 places, 4113/4113 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1850 transition count 4112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1849 transition count 4112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 1849 transition count 4111
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 1848 transition count 4111
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 1847 transition count 4110
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 1847 transition count 4110
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 1847 transition count 4109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 1846 transition count 4109
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 1845 transition count 4108
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 1845 transition count 4108
Applied a total of 10 rules in 821 ms. Remains 1845 /1850 variables (removed 5) and now considering 4108/4113 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 1845/1850 places, 4108/4113 transitions.
[2022-06-12 21:35:11] [INFO ] Flatten gal took : 306 ms
[2022-06-12 21:35:11] [INFO ] Flatten gal took : 380 ms
[2022-06-12 21:35:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3673758548094789986.gal : 55 ms
[2022-06-12 21:35:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality709027722519483002.prop : 12 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/ReachabilityCardinality3673758548094789986.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality709027722519483002.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/ReachabilityCardinality3673758548094789986.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality709027722519483002.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality709027722519483002.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :8 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 15
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :15 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31 after 41
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :41 after 162
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :162 after 187
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :187 after 197
Detected timeout of ITS tools.
[2022-06-12 21:35:26] [INFO ] Flatten gal took : 176 ms
[2022-06-12 21:35:26] [INFO ] Applying decomposition
[2022-06-12 21:35:27] [INFO ] Flatten gal took : 321 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/graph14056428730366181067.txt, -o, /tmp/graph14056428730366181067.bin, -w, /tmp/graph14056428730366181067.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/graph14056428730366181067.bin, -l, -1, -v, -w, /tmp/graph14056428730366181067.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:35:27] [INFO ] Decomposing Gal with order
[2022-06-12 21:35:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:35:28] [INFO ] Removed a total of 4749 redundant transitions.
[2022-06-12 21:35:28] [INFO ] Flatten gal took : 989 ms
[2022-06-12 21:35:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 4589 labels/synchronizations in 191 ms.
[2022-06-12 21:35:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7440759811588555380.gal : 65 ms
[2022-06-12 21:35:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10472020000064285049.prop : 8 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/ReachabilityCardinality7440759811588555380.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10472020000064285049.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/ReachabilityCardinality7440759811588555380.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10472020000064285049.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10472020000064285049.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 82
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :82 after 104
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15805375392828681771
[2022-06-12 21:35:44] [INFO ] Built C files in 55ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15805375392828681771
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/ltsmin15805375392828681771]
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/ltsmin15805375392828681771] 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/ltsmin15805375392828681771] 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 26663 resets, run finished after 15418 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4864 resets, run finished after 3429 ms. (steps per millisecond=291 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 563634 steps, run timeout after 30001 ms. (steps per millisecond=18 ) properties seen :{}
Probabilistic random walk after 563634 steps, saw 245159 distinct states, run finished after 30006 ms. (steps per millisecond=18 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 21:36:34] [INFO ] Flow matrix only has 3710 transitions (discarded 398 similar events)
// Phase 1: matrix 3710 rows 1845 cols
[2022-06-12 21:36:34] [INFO ] Computed 541 place invariants in 68 ms
[2022-06-12 21:36:34] [INFO ] [Real]Absence check using 33 positive place invariants in 31 ms returned sat
[2022-06-12 21:36:34] [INFO ] [Real]Absence check using 33 positive and 508 generalized place invariants in 77 ms returned sat
[2022-06-12 21:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:35] [INFO ] [Real]Absence check using state equation in 1055 ms returned sat
[2022-06-12 21:36:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:36:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 35 ms returned sat
[2022-06-12 21:36:36] [INFO ] [Nat]Absence check using 33 positive and 508 generalized place invariants in 91 ms returned sat
[2022-06-12 21:36:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:36:37] [INFO ] [Nat]Absence check using state equation in 1035 ms returned sat
[2022-06-12 21:36:37] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2022-06-12 21:36:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-12 21:36:43] [INFO ] [Nat]Added 2195 Read/Feed constraints in 6192 ms returned unknown
Support contains 2 out of 1845 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1845/1845 places, 4108/4108 transitions.
Applied a total of 0 rules in 126 ms. Remains 1845 /1845 variables (removed 0) and now considering 4108/4108 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1845/1845 places, 4108/4108 transitions.
Starting structural reductions, iteration 0 : 1845/1845 places, 4108/4108 transitions.
Applied a total of 0 rules in 113 ms. Remains 1845 /1845 variables (removed 0) and now considering 4108/4108 (removed 0) transitions.
[2022-06-12 21:36:43] [INFO ] Flow matrix only has 3710 transitions (discarded 398 similar events)
// Phase 1: matrix 3710 rows 1845 cols
[2022-06-12 21:36:43] [INFO ] Computed 541 place invariants in 78 ms
[2022-06-12 21:36:47] [INFO ] Implicit Places using invariants in 4043 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 15, 19, 25, 33, 43, 55, 69, 84, 98, 99, 100, 101, 102, 103, 104, 116, 126, 134, 140, 144, 146, 161, 167, 169, 170, 171, 172, 173, 174, 175, 177, 181, 187, 195, 205, 217, 230, 242, 243, 244, 245, 246, 247, 248, 258, 266, 272, 276, 278, 280, 295, 301, 303, 304, 305, 306, 307, 308, 309, 311, 313, 317, 323, 331, 341, 352, 362, 363, 364, 365, 366, 367, 368, 376, 382, 386, 388, 390, 392, 407, 413, 415, 416, 417, 418, 419, 420, 421, 423, 425, 427, 431, 437, 445, 454, 462, 463, 464, 465, 466, 467, 468, 474, 478, 480, 482, 484, 486, 501, 507, 509, 510, 511, 512, 513, 514, 515, 517, 519, 521, 523, 527, 533, 540, 546, 547, 548, 549, 550, 551, 552, 556, 558, 560, 562, 564, 566, 581, 587, 589, 590, 591, 592, 593, 594, 595, 597, 599, 601, 603, 605, 609, 614, 618, 619, 620, 621, 622, 623, 624, 626, 628, 630, 632, 634, 636, 651, 657, 659, 660, 661, 662, 663, 664, 665, 667, 669, 671, 673, 675, 677, 680, 682, 683, 684, 685, 686, 687, 688, 690, 692, 694, 696, 698, 700, 715, 721, 723, 724, 725, 726, 727, 728, 729, 731, 733, 735, 737, 739, 741, 743, 745, 746, 747, 748, 749, 750, 751, 753, 755, 757, 759, 761, 763, 778, 780, 783, 785, 786, 787, 788, 789, 790, 791, 793, 795, 797, 799, 801, 803, 805, 807, 808, 809, 810, 811, 812, 813, 815, 817, 819, 821, 823, 825, 840, 846, 848, 849, 850, 851, 852, 853, 854, 856, 858, 860, 862, 864, 866, 868, 870, 871, 872, 873, 874, 875, 876, 878, 880, 882, 884, 886, 888, 903, 909, 911, 912, 913, 914, 915, 916, 917, 919, 921, 923, 925, 927, 929, 931, 934, 935, 936, 937, 938, 939, 940, 942, 944, 946, 948, 950, 952, 967, 973, 975, 976, 977, 978, 979, 980, 981, 983, 985, 987, 989, 991, 993, 997, 1002, 1003, 1004, 1005, 1006, 1007, 1008, 1012, 1014, 1016, 1018, 1020, 1022, 1037, 1043, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1053, 1055, 1057, 1059, 1061, 1065, 1071, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1090, 1094, 1096, 1098, 1100, 1102, 1117, 1123, 1125, 1126, 1127, 1128, 1129, 1130, 1131, 1133, 1135, 1137, 1139, 1143, 1149, 1157, 1166, 1167, 1168, 1169, 1170, 1171, 1172, 1180, 1186, 1190, 1192, 1194, 1196, 1211, 1217, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1227, 1229, 1231, 1235, 1241, 1249, 1259, 1270, 1271, 1272, 1273, 1274, 1275, 1276, 1286, 1294, 1300, 1304, 1306, 1308, 1323, 1329, 1331, 1332, 1333, 1334, 1335, 1336, 1337, 1339, 1341, 1345, 1351, 1359, 1369, 1381, 1394, 1395, 1396, 1397, 1398, 1399, 1400, 1412, 1422, 1430, 1436, 1440, 1442, 1457, 1459, 1462, 1464, 1465, 1466, 1467, 1468, 1469, 1470, 1472, 1476, 1482, 1490, 1500, 1512, 1526, 1541, 1542, 1543, 1544, 1545, 1546, 1547, 1561, 1573, 1583, 1591, 1597, 1601, 1616]
Discarding 496 places :
Implicit Place search using SMT only with invariants took 4059 ms to find 496 implicit places.
[2022-06-12 21:36:47] [INFO ] Redundant transitions in 274 ms returned []
[2022-06-12 21:36:47] [INFO ] Flow matrix only has 3710 transitions (discarded 398 similar events)
// Phase 1: matrix 3710 rows 1349 cols
[2022-06-12 21:36:47] [INFO ] Computed 45 place invariants in 56 ms
[2022-06-12 21:36:49] [INFO ] Dead Transitions using invariants and state equation in 1700 ms returned []
Starting structural reductions, iteration 1 : 1349/1845 places, 4108/4108 transitions.
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 192 place count 1157 transition count 3916
Iterating global reduction 0 with 192 rules applied. Total rules applied 384 place count 1157 transition count 3916
Discarding 192 places :
Symmetric choice reduction at 0 with 192 rule applications. Total rules 576 place count 965 transition count 3724
Iterating global reduction 0 with 192 rules applied. Total rules applied 768 place count 965 transition count 3724
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 771 place count 965 transition count 3721
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 774 place count 962 transition count 3721
Applied a total of 774 rules in 231 ms. Remains 962 /1349 variables (removed 387) and now considering 3721/4108 (removed 387) transitions.
[2022-06-12 21:36:49] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 962 cols
[2022-06-12 21:36:49] [INFO ] Computed 45 place invariants in 32 ms
[2022-06-12 21:36:50] [INFO ] Implicit Places using invariants in 1063 ms returned []
[2022-06-12 21:36:50] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 962 cols
[2022-06-12 21:36:50] [INFO ] Computed 45 place invariants in 27 ms
[2022-06-12 21:36:51] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2022-06-12 21:36:51] [INFO ] Implicit Places using invariants and state equation in 1040 ms returned []
Implicit Place search using SMT with State Equation took 2113 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 962/1845 places, 3721/4108 transitions.
[2022-06-12 21:36:52] [INFO ] Flatten gal took : 116 ms
[2022-06-12 21:36:52] [INFO ] Flatten gal took : 117 ms
[2022-06-12 21:36:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15758281901897169349.gal : 11 ms
[2022-06-12 21:36:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15928595045679184189.prop : 2 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/ReachabilityCardinality15758281901897169349.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15928595045679184189.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/ReachabilityCardinality15758281901897169349.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15928595045679184189.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15928595045679184189.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :49 after 50
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :50 after 64
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :64 after 92
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :92 after 172
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :172 after 489
Detected timeout of ITS tools.
[2022-06-12 21:37:07] [INFO ] Flatten gal took : 116 ms
[2022-06-12 21:37:07] [INFO ] Applying decomposition
[2022-06-12 21:37:07] [INFO ] Flatten gal took : 119 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16136214168170961133.txt, -o, /tmp/graph16136214168170961133.bin, -w, /tmp/graph16136214168170961133.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/graph16136214168170961133.bin, -l, -1, -v, -w, /tmp/graph16136214168170961133.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:37:07] [INFO ] Decomposing Gal with order
[2022-06-12 21:37:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:37:08] [INFO ] Removed a total of 6609 redundant transitions.
[2022-06-12 21:37:08] [INFO ] Flatten gal took : 488 ms
[2022-06-12 21:37:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 2446 labels/synchronizations in 112 ms.
[2022-06-12 21:37:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4612373328981069436.gal : 19 ms
[2022-06-12 21:37:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12198779566646750232.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/ReachabilityCardinality4612373328981069436.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality12198779566646750232.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/ReachabilityCardinality4612373328981069436.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality12198779566646750232.prop --nowitness
Loading property file /tmp/ReachabilityCardinality12198779566646750232.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1124
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1807815424025858690
[2022-06-12 21:37:23] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1807815424025858690
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/ltsmin1807815424025858690]
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/ltsmin1807815424025858690] 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/ltsmin1807815424025858690] 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 28280 resets, run finished after 14524 ms. (steps per millisecond=68 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3622 resets, run finished after 2517 ms. (steps per millisecond=397 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 681186 steps, run timeout after 30001 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 681186 steps, saw 281482 distinct states, run finished after 30001 ms. (steps per millisecond=22 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 21:38:11] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 962 cols
[2022-06-12 21:38:11] [INFO ] Computed 45 place invariants in 28 ms
[2022-06-12 21:38:11] [INFO ] [Real]Absence check using 31 positive place invariants in 16 ms returned sat
[2022-06-12 21:38:11] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2022-06-12 21:38:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:38:12] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2022-06-12 21:38:12] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2022-06-12 21:38:15] [INFO ] [Real]Added 2195 Read/Feed constraints in 2957 ms returned sat
[2022-06-12 21:38:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:38:15] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2022-06-12 21:38:15] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 2 ms returned sat
[2022-06-12 21:38:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:38:16] [INFO ] [Nat]Absence check using state equation in 572 ms returned sat
[2022-06-12 21:38:17] [INFO ] [Nat]Added 2195 Read/Feed constraints in 1296 ms returned sat
[2022-06-12 21:38:18] [INFO ] Deduced a trap composed of 230 places in 475 ms of which 1 ms to minimize.
[2022-06-12 21:38:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 643 ms
[2022-06-12 21:38:18] [INFO ] Computed and/alt/rep : 1334/1920/1334 causal constraints (skipped 1927 transitions) in 298 ms.
[2022-06-12 21:38:20] [INFO ] Added : 85 causal constraints over 17 iterations in 2685 ms. Result :sat
Incomplete Parikh walk after 24000 steps, including 1385 resets, run finished after 386 ms. (steps per millisecond=62 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 2 out of 962 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 962/962 places, 3721/3721 transitions.
Applied a total of 0 rules in 90 ms. Remains 962 /962 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 962/962 places, 3721/3721 transitions.
Starting structural reductions, iteration 0 : 962/962 places, 3721/3721 transitions.
Applied a total of 0 rules in 89 ms. Remains 962 /962 variables (removed 0) and now considering 3721/3721 (removed 0) transitions.
[2022-06-12 21:38:21] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 962 cols
[2022-06-12 21:38:21] [INFO ] Computed 45 place invariants in 29 ms
[2022-06-12 21:38:22] [INFO ] Implicit Places using invariants in 1051 ms returned []
[2022-06-12 21:38:22] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 962 cols
[2022-06-12 21:38:22] [INFO ] Computed 45 place invariants in 26 ms
[2022-06-12 21:38:23] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2022-06-12 21:38:23] [INFO ] Implicit Places using invariants and state equation in 985 ms returned []
Implicit Place search using SMT with State Equation took 2044 ms to find 0 implicit places.
[2022-06-12 21:38:23] [INFO ] Redundant transitions in 212 ms returned []
[2022-06-12 21:38:23] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 962 cols
[2022-06-12 21:38:23] [INFO ] Computed 45 place invariants in 19 ms
[2022-06-12 21:38:24] [INFO ] Dead Transitions using invariants and state equation in 1197 ms returned []
Finished structural reductions, in 1 iterations. Remains : 962/962 places, 3721/3721 transitions.
Incomplete random walk after 100000 steps, including 2826 resets, run finished after 1505 ms. (steps per millisecond=66 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-12 21:38:26] [INFO ] Flow matrix only has 3323 transitions (discarded 398 similar events)
// Phase 1: matrix 3323 rows 962 cols
[2022-06-12 21:38:26] [INFO ] Computed 45 place invariants in 29 ms
[2022-06-12 21:38:26] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2022-06-12 21:38:26] [INFO ] [Real]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2022-06-12 21:38:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:38:27] [INFO ] [Real]Absence check using state equation in 592 ms returned sat
[2022-06-12 21:38:27] [INFO ] State equation strengthened by 2195 read => feed constraints.
[2022-06-12 21:38:30] [INFO ] [Real]Added 2195 Read/Feed constraints in 3049 ms returned sat
[2022-06-12 21:38:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:38:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 19 ms returned sat
[2022-06-12 21:38:30] [INFO ] [Nat]Absence check using 31 positive and 14 generalized place invariants in 3 ms returned sat
[2022-06-12 21:38:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:38:31] [INFO ] [Nat]Absence check using state equation in 586 ms returned sat
[2022-06-12 21:38:32] [INFO ] [Nat]Added 2195 Read/Feed constraints in 1369 ms returned sat
[2022-06-12 21:38:33] [INFO ] Deduced a trap composed of 230 places in 450 ms of which 2 ms to minimize.
[2022-06-12 21:38:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 623 ms
[2022-06-12 21:38:33] [INFO ] Computed and/alt/rep : 1334/1920/1334 causal constraints (skipped 1927 transitions) in 525 ms.
[2022-06-12 21:38:36] [INFO ] Added : 85 causal constraints over 17 iterations in 2875 ms. Result :sat
[2022-06-12 21:38:36] [INFO ] Flatten gal took : 115 ms
[2022-06-12 21:38:36] [INFO ] Flatten gal took : 115 ms
[2022-06-12 21:38:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14892810669661116945.gal : 11 ms
[2022-06-12 21:38:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10080254984894828024.prop : 2 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/ReachabilityCardinality14892810669661116945.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10080254984894828024.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/ReachabilityCardinality14892810669661116945.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10080254984894828024.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10080254984894828024.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :40 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 42
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :42 after 43
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :43 after 49
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :49 after 50
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :50 after 64
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :64 after 92
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :92 after 172
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :172 after 489
Detected timeout of ITS tools.
[2022-06-12 21:38:56] [INFO ] Flatten gal took : 116 ms
[2022-06-12 21:38:56] [INFO ] Applying decomposition
[2022-06-12 21:38:56] [INFO ] Flatten gal took : 118 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/graph3546957356427354676.txt, -o, /tmp/graph3546957356427354676.bin, -w, /tmp/graph3546957356427354676.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/graph3546957356427354676.bin, -l, -1, -v, -w, /tmp/graph3546957356427354676.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:38:56] [INFO ] Decomposing Gal with order
[2022-06-12 21:38:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:38:57] [INFO ] Removed a total of 6607 redundant transitions.
[2022-06-12 21:38:57] [INFO ] Flatten gal took : 482 ms
[2022-06-12 21:38:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2371 labels/synchronizations in 105 ms.
[2022-06-12 21:38:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16302893693221197832.gal : 19 ms
[2022-06-12 21:38:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1285351865796504796.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/ReachabilityCardinality16302893693221197832.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1285351865796504796.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/ReachabilityCardinality16302893693221197832.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1285351865796504796.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1285351865796504796.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 499
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13996177181606355363
[2022-06-12 21:39:17] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13996177181606355363
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/ltsmin13996177181606355363]
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/ltsmin13996177181606355363] 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/ltsmin13996177181606355363] 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 1047 edges and 962 vertex of which 17 / 962 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 4261 edges and 946 vertex of which 932 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 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 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 98 rules applied. Total rules applied 100 place count 915 transition count 2953
Reduce places removed 96 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 96 transitions.
Drop transitions removed 95 transitions
Trivial Post-agglo rules discarded 95 transitions
Performed 95 trivial Post agglomeration. Transition count delta: 95
Iterating post reduction 1 with 287 rules applied. Total rules applied 387 place count 819 transition count 2762
Reduce places removed 95 places and 0 transitions.
Drop transitions removed 24 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 95 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 2 with 261 rules applied. Total rules applied 648 place count 724 transition count 2596
Reduce places removed 71 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 69 transitions
Reduce isomorphic transitions removed 71 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 3 with 211 rules applied. Total rules applied 859 place count 653 transition count 2456
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 19 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 69 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 4 with 188 rules applied. Total rules applied 1047 place count 584 transition count 2337
Reduce places removed 50 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 50 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 5 with 148 rules applied. Total rules applied 1195 place count 534 transition count 2239
Reduce places removed 48 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 48 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 128 rules applied. Total rules applied 1323 place count 486 transition count 2159
Reduce places removed 32 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 7 with 94 rules applied. Total rules applied 1417 place count 454 transition count 2097
Reduce places removed 30 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 8 with 78 rules applied. Total rules applied 1495 place count 424 transition count 2049
Reduce places removed 18 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 18 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 9 with 52 rules applied. Total rules applied 1547 place count 406 transition count 2015
Reduce places removed 16 places and 0 transitions.
Drop transitions removed 8 transitions
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 10 with 40 rules applied. Total rules applied 1587 place count 390 transition count 1991
Reduce places removed 8 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 22 rules applied. Total rules applied 1609 place count 382 transition count 1977
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 14 rules applied. Total rules applied 1623 place count 376 transition count 1969
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 13 with 5 rules applied. Total rules applied 1628 place count 374 transition count 1966
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 1630 place count 373 transition count 1965
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 12 Pre rules applied. Total rules applied 1630 place count 373 transition count 1953
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 15 with 24 rules applied. Total rules applied 1654 place count 361 transition count 1953
Discarding 285 places :
Symmetric choice reduction at 15 with 285 rule applications. Total rules 1939 place count 76 transition count 323
Iterating global reduction 15 with 285 rules applied. Total rules applied 2224 place count 76 transition count 323
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 15 with 265 rules applied. Total rules applied 2489 place count 76 transition count 58
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 16 with 13 rules applied. Total rules applied 2502 place count 64 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 2503 place count 63 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 2503 place count 63 transition count 56
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 2505 place count 62 transition count 56
Discarding 12 places :
Symmetric choice reduction at 18 with 12 rule applications. Total rules 2517 place count 50 transition count 44
Iterating global reduction 18 with 12 rules applied. Total rules applied 2529 place count 50 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 2533 place count 48 transition count 42
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 18 with 1 rules applied. Total rules applied 2534 place count 48 transition count 41
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 2535 place count 48 transition count 40
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 19 with 13 rules applied. Total rules applied 2548 place count 48 transition count 27
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 19 with 13 rules applied. Total rules applied 2561 place count 35 transition count 27
Applied a total of 2561 rules in 454 ms. Remains 35 /962 variables (removed 927) and now considering 27/3721 (removed 3694) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 27 rows 35 cols
[2022-06-12 21:39:20] [INFO ] Computed 15 place invariants in 0 ms
[2022-06-12 21:39:20] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-06-12 21:39:20] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 14 ms returned sat
[2022-06-12 21:39:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:20] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2022-06-12 21:39:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:39:20] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-06-12 21:39:20] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 2 ms returned sat
[2022-06-12 21:39:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:39:20] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2022-06-12 21:39:20] [INFO ] Computed and/alt/rep : 4/21/4 causal constraints (skipped 16 transitions) in 2 ms.
[2022-06-12 21:39:20] [INFO ] Added : 2 causal constraints over 2 iterations in 10 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2022-06-12 21:39:20] [INFO ] Flatten gal took : 115 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12984791617698647531
[2022-06-12 21:39:20] [INFO ] Too many transitions (3721) to apply POR reductions. Disabling POR matrices.
[2022-06-12 21:39:20] [INFO ] Applying decomposition
[2022-06-12 21:39:20] [INFO ] Built C files in 111ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12984791617698647531
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/ltsmin12984791617698647531]
[2022-06-12 21:39:20] [INFO ] Flatten gal took : 294 ms
[2022-06-12 21:39:20] [INFO ] Flatten gal took : 188 ms
[2022-06-12 21:39:21] [INFO ] Input system was already deterministic with 3721 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8159291436387813050.txt, -o, /tmp/graph8159291436387813050.bin, -w, /tmp/graph8159291436387813050.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/graph8159291436387813050.bin, -l, -1, -v, -w, /tmp/graph8159291436387813050.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:39:21] [INFO ] Decomposing Gal with order
[2022-06-12 21:39:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:39:22] [INFO ] Removed a total of 6610 redundant transitions.
[2022-06-12 21:39:22] [INFO ] Flatten gal took : 612 ms
[2022-06-12 21:39:22] [INFO ] Ran tautology test, simplified 0 / 1 in 1587 ms.
[2022-06-12 21:39:22] [INFO ] BMC solution for property MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12(UNSAT) depth K=0 took 39 ms
[2022-06-12 21:39:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 2372 labels/synchronizations in 168 ms.
[2022-06-12 21:39:22] [INFO ] BMC solution for property MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12(UNSAT) depth K=1 took 42 ms
[2022-06-12 21:39:22] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability720424940754329959.gal : 95 ms
[2022-06-12 21:39:22] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability8019114547280772261.prop : 7 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/ReachabilityFireability720424940754329959.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability8019114547280772261.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/ReachabilityFireability720424940754329959.gal -t CGAL -reachable-file /tmp/ReachabilityFireability8019114547280772261.prop --nowitness
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 3323 out of 3721 initially.
// Phase 1: matrix 3323 rows 962 cols
[2022-06-12 21:39:23] [INFO ] Computed 45 place invariants in 23 ms
inv : Node9IsActive + NodesCanDetectThatNode9HasCrashed = 1
inv : Node11IsActive + NodesCanDetectThatNode11HasCrashed = 1
inv : Node3IsActive + NodesCanDetectThatNode3HasCrashed = 1
inv : Node11NotifyThatHeIsActive + NodesCanDetectThatNode11HasCrashed = 1
inv : Lx0IsActiveAndNotInTheLeafSet + Lx1IsAtTheLeftExtremityOfTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet - Lx4IsActiveAndNotInTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Lx0IsAtTheLeftExtremityOfTheLeafSet + Lx1IsAtTheLeftExtremityOfTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet - Lx4IsActiveAndNotInTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node15IsActive + NodesCanDetectThatNode15HasCrashed = 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 : Node4NotifyThatHeIsActive + NodesCanDetectThatNode4HasCrashed = 1
inv : NoCrashIsHappening + ThereIsAMasterInTheLeafSet + Node0AsksIsThereANodeMaster + RequestOfNode0IsSentToLx0 + RequestOfNode0IsSentToRx0 + RequestOfNode0IsSentToLx1 + RequestOfNode0IsSentToRx1 + RequestOfNode0IsSentToLx2 + RequestOfNode0IsSentToRx2 + RequestOfNode0IsSentToLx3 + RequestOfNode0IsSentToRx3 + RequestOfNode0IsSentToLx4 + RequestOfNode0IsSentToRx4 + RequestOfNode0IsSentToLx5 + RequestOfNode0IsSentToRx5 + Node1AsksIsThereANodeMaster + Node1DontAnswerToAnyNode + Node2AsksIsThereANodeMaster + Node2DontAnswerToAnyNode + Node3AsksIsThereANodeMaster + Node3DontAnswerToAnyNode + Node4AsksIsThereANodeMaster + Node4DontAnswerToAnyNode + Node5AsksIsThereANodeMaster + Node5DontAnswerToAnyNode + Node6AsksIsThereANodeMaster + Node6DontAnswerToAnyNode + Node7AsksIsThereANodeMaster + Node7DontAnswerToAnyNode + Node8AsksIsThereANodeMaster + Node9AsksIsThereANodeMaster + Node9DontAnswerToAnyNode + Node10AsksIsThereANodeMaster + Node10DontAnswerToAnyNode + Node11AsksIsThereANodeMaster + Node11DontAnswerToAnyNode + Node12AsksIsThereANodeMaster + Node12DontAnswerToAnyNode + Node13AsksIsThereANodeMaster + Node13DontAnswerToAnyNode + Node14AsksIsThereANodeMaster + Node14DontAnswerToAnyNode + Node15AsksIsThereANodeMaster + Node15DontAnswerToAnyNode + Node16AsksIsThereANodeMaster + Lx0HasReceivedTheRequestOfNode0 + Lx1HasReceivedTheRequestOfNode0 + Lx2HasReceivedTheRequestOfNode0 + Lx3HasReceivedTheRequestOfNode0 + Lx4HasReceivedTheRequestOfNode0 + Lx5HasReceivedTheRequestOfNode0 + Rx0HasReceivedTheRequestOfNode0 + Rx1HasReceivedTheRequestOfNode0 + Rx2HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode0 + Rx4HasReceivedTheRequestOfNode0 + Rx5HasReceivedTheRequestOfNode0 = 1
inv : Node13NotifyThatHeIsActive + NodesCanDetectThatNode13HasCrashed = 1
inv : Node5IsActive + NodesCanDetectThatNode5HasCrashed = 1
inv : Node1NotifyThatHeIsActive + NodesCanDetectThatNode1HasCrashed = 1
inv : Rx3IsActiveAndNotInTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet - Rx5IsActiveAndNotInTheLeafSet + Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node3NotifyThatHeIsActive + NodesCanDetectThatNode3HasCrashed = 1
inv : Node4IsActive + NodesCanDetectThatNode4HasCrashed = 1
inv : Node6IsActive + NodesCanDetectThatNode6HasCrashed = 1
inv : Rx0IsAtTheRightExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet - Rx5IsActiveAndNotInTheLeafSet + Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node6NotifyThatHeIsActive + NodesCanDetectThatNode6HasCrashed = 1
inv : Rx0IsActiveAndNotInTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet - Rx5IsActiveAndNotInTheLeafSet + Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node5NotifyThatHeIsActive + NodesCanDetectThatNode5HasCrashed = 1
inv : Node1IsActive + NodesCanDetectThatNode1HasCrashed = 1
inv : -Lx4IsActiveAndNotInTheLeafSet + Lx5IsActiveAndNotInTheLeafSet - Lx5IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node2IsActive + NodesCanDetectThatNode2HasCrashed = 1
inv : Lx1IsActiveAndNotInTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet - Lx4IsActiveAndNotInTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Lx3IsActiveAndNotInTheLeafSet - Lx4IsActiveAndNotInTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node12NotifyThatHeIsActive + NodesCanDetectThatNode12HasCrashed = 1
inv : Node12IsActive + NodesCanDetectThatNode12HasCrashed = 1
inv : Node14NotifyThatHeIsActive + NodesCanDetectThatNode14HasCrashed = 1
inv : Rx4IsActiveAndNotInTheLeafSet - Rx5IsActiveAndNotInTheLeafSet + Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Rx1IsActiveAndNotInTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet - Rx5IsActiveAndNotInTheLeafSet + Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node14IsActive + NodesCanDetectThatNode14HasCrashed = 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 + RequestOfNode0IsSentToLx4 + RequestOfNode0IsSentToRx4 + RequestOfNode0IsSentToLx5 + RequestOfNode0IsSentToRx5 + Node1HasDetectedCrashOfNode0 + Node1HasDetectedCrashOfNode2 + Node1HasDetectedCrashOfNode3 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node1HasDetectedCrashOfNode4 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node1HasDetectedCrashOfNode5 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node1HasDetectedCrashOfNode6 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node1HasDetectedCrashOfNode7 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node1HasDetectedCrashOfNode8 + Node1ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node1HasDetectedCrashOfNode9 + Node1ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node1HasDetectedCrashOfNode10 + Node1ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node1HasDetectedCrashOfNode11 + Node1ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node1HasDetectedCrashOfNode12 + Node1ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node1HasDetectedCrashOfNode13 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node1ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node1HasDetectedCrashOfNode14 + Node1HasDetectedCrashOfNode15 + Node1HasDetectedCrashOfNode16 + Node1DontAnswerToAnyNode + Node2HasDetectedCrashOfNode0 + Node2HasDetectedCrashOfNode1 + Node2HasDetectedCrashOfNode3 + Node2HasDetectedCrashOfNode4 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node2HasDetectedCrashOfNode5 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node2HasDetectedCrashOfNode6 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node2HasDetectedCrashOfNode7 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node2HasDetectedCrashOfNode8 + Node2ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node2HasDetectedCrashOfNode9 + Node2ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node2HasDetectedCrashOfNode10 + Node2ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node2HasDetectedCrashOfNode11 + Node2ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node2HasDetectedCrashOfNode12 + Node2ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node2ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node2HasDetectedCrashOfNode13 + Node2HasDetectedCrashOfNode14 + Node2HasDetectedCrashOfNode15 + Node2HasDetectedCrashOfNode16 + Node2DontAnswerToAnyNode + Node3HasDetectedCrashOfNode0 + Node3HasDetectedCrashOfNode1 + Node3HasDetectedCrashOfNode2 + Node3HasDetectedCrashOfNode4 + Node3HasDetectedCrashOfNode5 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node3HasDetectedCrashOfNode6 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node3HasDetectedCrashOfNode7 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node3HasDetectedCrashOfNode8 + Node3ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node3HasDetectedCrashOfNode9 + Node3ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node3HasDetectedCrashOfNode10 + Node3ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node3HasDetectedCrashOfNode11 + Node3ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node3ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node3HasDetectedCrashOfNode12 + Node3HasDetectedCrashOfNode13 + Node3HasDetectedCrashOfNode14 + Node3HasDetectedCrashOfNode15 + Node3HasDetectedCrashOfNode16 + Node3DontAnswerToAnyNode + Node4HasDetectedCrashOfNode0 + Node4HasDetectedCrashOfNode1 + Node4HasDetectedCrashOfNode2 + Node4HasDetectedCrashOfNode3 + Node4HasDetectedCrashOfNode5 + Node4HasDetectedCrashOfNode6 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node4HasDetectedCrashOfNode7 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node4HasDetectedCrashOfNode8 + Node4ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node4HasDetectedCrashOfNode9 + Node4ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node4HasDetectedCrashOfNode10 + Node4ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node4ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node4HasDetectedCrashOfNode11 + Node4HasDetectedCrashOfNode12 + Node4HasDetectedCrashOfNode13 + Node4HasDetectedCrashOfNode14 + Node4HasDetectedCrashOfNode15 + Node4HasDetectedCrashOfNode16 + Node4DontAnswerToAnyNode + Node5HasDetectedCrashOfNode0 + Node5HasDetectedCrashOfNode1 + Node5HasDetectedCrashOfNode2 + Node5HasDetectedCrashOfNode3 + Node5HasDetectedCrashOfNode4 + Node5HasDetectedCrashOfNode6 + Node5HasDetectedCrashOfNode7 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node5HasDetectedCrashOfNode8 + Node5ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node5HasDetectedCrashOfNode9 + Node5ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node5ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node5HasDetectedCrashOfNode10 + Node5HasDetectedCrashOfNode11 + Node5HasDetectedCrashOfNode12 + Node5HasDetectedCrashOfNode13 + Node5HasDetectedCrashOfNode14 + Node5HasDetectedCrashOfNode15 + Node5HasDetectedCrashOfNode16 + Node5DontAnswerToAnyNode + Node6HasDetectedCrashOfNode0 + Node6HasDetectedCrashOfNode1 + Node6HasDetectedCrashOfNode2 + Node6HasDetectedCrashOfNode3 + Node6HasDetectedCrashOfNode4 + Node6HasDetectedCrashOfNode5 + Node6HasDetectedCrashOfNode7 + Node6HasDetectedCrashOfNode8 + Node6ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node6HasDetectedCrashOfNode9 + Node6HasDetectedCrashOfNode10 + Node6HasDetectedCrashOfNode11 + Node6HasDetectedCrashOfNode12 + Node6HasDetectedCrashOfNode13 + Node6HasDetectedCrashOfNode14 + Node6HasDetectedCrashOfNode15 + Node6HasDetectedCrashOfNode16 + Node6DontAnswerToAnyNode + Node7HasDetectedCrashOfNode0 + Node7HasDetectedCrashOfNode1 + Node7HasDetectedCrashOfNode2 + Node7HasDetectedCrashOfNode3 + Node7HasDetectedCrashOfNode4 + Node7HasDetectedCrashOfNode5 + Node7HasDetectedCrashOfNode6 + Node7HasDetectedCrashOfNode8 + Node7HasDetectedCrashOfNode9 + Node7HasDetectedCrashOfNode10 + Node7HasDetectedCrashOfNode11 + Node7HasDetectedCrashOfNode12 + Node7HasDetectedCrashOfNode13 + Node7HasDetectedCrashOfNode14 + Node7HasDetectedCrashOfNode15 + Node7HasDetectedCrashOfNode16 + Node7DontAnswerToAnyNode + Node8HasDetectedCrashOfNode0 + Node8HasDetectedCrashOfNode1 + Node8HasDetectedCrashOfNode2 + Node8HasDetectedCrashOfNode3 + Node8HasDetectedCrashOfNode4 + Node8HasDetectedCrashOfNode5 + Node8HasDetectedCrashOfNode6 + Node8HasDetectedCrashOfNode7 + Node8HasDetectedCrashOfNode9 + Node8HasDetectedCrashOfNode10 + Node8HasDetectedCrashOfNode11 + Node8HasDetectedCrashOfNode12 + Node8HasDetectedCrashOfNode13 + Node8HasDetectedCrashOfNode14 + Node8HasDetectedCrashOfNode15 + Node8HasDetectedCrashOfNode16 + Node9HasDetectedCrashOfNode0 + Node9HasDetectedCrashOfNode1 + Node9HasDetectedCrashOfNode2 + Node9HasDetectedCrashOfNode3 + Node9HasDetectedCrashOfNode4 + Node9HasDetectedCrashOfNode5 + Node9HasDetectedCrashOfNode6 + Node9HasDetectedCrashOfNode7 + Node9HasDetectedCrashOfNode8 + Node9HasDetectedCrashOfNode10 + Node9HasDetectedCrashOfNode11 + Node9HasDetectedCrashOfNode12 + Node9HasDetectedCrashOfNode13 + Node9HasDetectedCrashOfNode14 + Node9HasDetectedCrashOfNode15 + Node9HasDetectedCrashOfNode16 + Node9DontAnswerToAnyNode + Node10HasDetectedCrashOfNode0 + Node10HasDetectedCrashOfNode1 + Node10HasDetectedCrashOfNode2 + Node10HasDetectedCrashOfNode3 + Node10HasDetectedCrashOfNode4 + Node10HasDetectedCrashOfNode5 + Node10HasDetectedCrashOfNode6 + Node10HasDetectedCrashOfNode7 + Node10HasDetectedCrashOfNode8 + Node10ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node10HasDetectedCrashOfNode9 + Node10HasDetectedCrashOfNode11 + Node10HasDetectedCrashOfNode12 + Node10HasDetectedCrashOfNode13 + Node10HasDetectedCrashOfNode14 + Node10HasDetectedCrashOfNode15 + Node10HasDetectedCrashOfNode16 + Node10DontAnswerToAnyNode + Node11HasDetectedCrashOfNode0 + Node11HasDetectedCrashOfNode1 + Node11HasDetectedCrashOfNode2 + Node11HasDetectedCrashOfNode3 + Node11HasDetectedCrashOfNode4 + Node11HasDetectedCrashOfNode5 + Node11HasDetectedCrashOfNode6 + Node11HasDetectedCrashOfNode7 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node11HasDetectedCrashOfNode8 + Node11ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node11HasDetectedCrashOfNode9 + Node11ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node11ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node11HasDetectedCrashOfNode10 + Node11HasDetectedCrashOfNode12 + Node11HasDetectedCrashOfNode13 + Node11HasDetectedCrashOfNode14 + Node11HasDetectedCrashOfNode15 + Node11HasDetectedCrashOfNode16 + Node11DontAnswerToAnyNode + Node12HasDetectedCrashOfNode0 + Node12HasDetectedCrashOfNode1 + Node12HasDetectedCrashOfNode2 + Node12HasDetectedCrashOfNode3 + Node12HasDetectedCrashOfNode4 + Node12HasDetectedCrashOfNode5 + Node12HasDetectedCrashOfNode6 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node12HasDetectedCrashOfNode7 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node12HasDetectedCrashOfNode8 + Node12ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node12HasDetectedCrashOfNode9 + Node12ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node12HasDetectedCrashOfNode10 + Node12ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node12ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node12HasDetectedCrashOfNode11 + Node12HasDetectedCrashOfNode13 + Node12HasDetectedCrashOfNode14 + Node12HasDetectedCrashOfNode15 + Node12HasDetectedCrashOfNode16 + Node12DontAnswerToAnyNode + Node13HasDetectedCrashOfNode0 + Node13HasDetectedCrashOfNode1 + Node13HasDetectedCrashOfNode2 + Node13HasDetectedCrashOfNode3 + Node13HasDetectedCrashOfNode4 + Node13HasDetectedCrashOfNode5 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node13HasDetectedCrashOfNode6 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node13HasDetectedCrashOfNode7 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node13HasDetectedCrashOfNode8 + Node13ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node13HasDetectedCrashOfNode9 + Node13ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node13HasDetectedCrashOfNode10 + Node13ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node13HasDetectedCrashOfNode11 + Node13ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node13ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node13HasDetectedCrashOfNode12 + Node13HasDetectedCrashOfNode14 + Node13HasDetectedCrashOfNode15 + Node13HasDetectedCrashOfNode16 + Node13DontAnswerToAnyNode + Node14HasDetectedCrashOfNode0 + Node14HasDetectedCrashOfNode1 + Node14HasDetectedCrashOfNode2 + Node14HasDetectedCrashOfNode3 + Node14HasDetectedCrashOfNode4 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node14HasDetectedCrashOfNode5 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node14HasDetectedCrashOfNode6 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node14HasDetectedCrashOfNode7 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node14HasDetectedCrashOfNode8 + Node14ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node14HasDetectedCrashOfNode9 + Node14ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node14HasDetectedCrashOfNode10 + Node14ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node14HasDetectedCrashOfNode11 + Node14ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node14HasDetectedCrashOfNode12 + Node14ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node14ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node14HasDetectedCrashOfNode13 + Node14HasDetectedCrashOfNode15 + Node14HasDetectedCrashOfNode16 + Node14DontAnswerToAnyNode + Node15HasDetectedCrashOfNode0 + Node15HasDetectedCrashOfNode1 + Node15HasDetectedCrashOfNode2 + Node15HasDetectedCrashOfNode3 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node15HasDetectedCrashOfNode4 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node15HasDetectedCrashOfNode5 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node15HasDetectedCrashOfNode6 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node15HasDetectedCrashOfNode7 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node15HasDetectedCrashOfNode8 + Node15ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node15HasDetectedCrashOfNode9 + Node15ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node15HasDetectedCrashOfNode10 + Node15ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node15HasDetectedCrashOfNode11 + Node15ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node15HasDetectedCrashOfNode12 + Node15ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node15HasDetectedCrashOfNode13 + Node15ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node15HasDetectedCrashOfNode14 + Node15HasDetectedCrashOfNode16 + Node15DontAnswerToAnyNode + Node16HasDetectedCrashOfNode0 + Node16HasDetectedCrashOfNode1 + Node16HasDetectedCrashOfNode2 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node16HasDetectedCrashOfNode3 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node16HasDetectedCrashOfNode4 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode4 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node16HasDetectedCrashOfNode5 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode5 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode5 + Node16HasDetectedCrashOfNode6 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode6 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode6 + Node16HasDetectedCrashOfNode7 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode7 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode7 + Node16HasDetectedCrashOfNode8 + Node16ThinksNode7ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode8 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode8 + Node16HasDetectedCrashOfNode9 + Node16ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode9 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode9 + Node16HasDetectedCrashOfNode10 + Node16ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode10 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode10 + Node16HasDetectedCrashOfNode11 + Node16ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode11 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode11 + Node16HasDetectedCrashOfNode12 + Node16ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode12 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode12 + Node16HasDetectedCrashOfNode13 + Node16ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode13 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode13 + Node16HasDetectedCrashOfNode14 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode14 + Node16HasDetectedCrashOfNode15 + Lx0HasReceivedTheRequestOfNode0 + Lx1HasReceivedTheRequestOfNode0 + Lx2HasReceivedTheRequestOfNode0 + Lx3HasReceivedTheRequestOfNode0 + Lx4HasReceivedTheRequestOfNode0 + Lx5HasReceivedTheRequestOfNode0 + Rx0HasReceivedTheRequestOfNode0 + Rx1HasReceivedTheRequestOfNode0 + Rx2HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode0 + Rx4HasReceivedTheRequestOfNode0 + Rx5HasReceivedTheRequestOfNode0 = 1
inv : -NoCrashIsHappening + Node0IsActive - NodesCanDetectThatNode1HasCrashed - NodesCanDetectThatNode2HasCrashed - NodesCanDetectThatNode3HasCrashed - NodesCanDetectThatNode4HasCrashed - NodesCanDetectThatNode5HasCrashed - NodesCanDetectThatNode6HasCrashed - NodesCanDetectThatNode7HasCrashed + Node8IsActive - NodesCanDetectThatNode9HasCrashed - NodesCanDetectThatNode10HasCrashed - NodesCanDetectThatNode11HasCrashed - NodesCanDetectThatNode12HasCrashed - NodesCanDetectThatNode13HasCrashed - NodesCanDetectThatNode14HasCrashed - NodesCanDetectThatNode15HasCrashed + Node16IsActive + Lx1IsAtTheLeftExtremityOfTheLeafSet + 2*Lx2IsAtTheLeftExtremityOfTheLeafSet + 3*Lx3IsAtTheLeftExtremityOfTheLeafSet - 6*Lx4IsActiveAndNotInTheLeafSet + 4*Lx4IsAtTheLeftExtremityOfTheLeafSet - Lx5IsAtTheLeftExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + 2*Rx2IsAtTheRightExtremityOfTheLeafSet + 3*Rx3IsAtTheRightExtremityOfTheLeafSet + 4*Rx4IsAtTheRightExtremityOfTheLeafSet - 6*Rx5IsActiveAndNotInTheLeafSet + 5*Rx5IsAtTheRightExtremityOfTheLeafSet = -10
inv : Node10NotifyThatHeIsActive + NodesCanDetectThatNode10HasCrashed = 1
inv : Node13IsActive + NodesCanDetectThatNode13HasCrashed = 1
inv : Rx2IsActiveAndNotInTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet - Rx5IsActiveAndNotInTheLeafSet + Rx5IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node10IsActive + NodesCanDetectThatNode10HasCrashed = 1
inv : Node15NotifyThatHeIsActive + NodesCanDetectThatNode15HasCrashed = 1
inv : CrashReservoir - NoCrashIsHappening + Lx1IsAtTheLeftExtremityOfTheLeafSet + 2*Lx2IsAtTheLeftExtremityOfTheLeafSet + 3*Lx3IsAtTheLeftExtremityOfTheLeafSet - 6*Lx4IsActiveAndNotInTheLeafSet + 4*Lx4IsAtTheLeftExtremityOfTheLeafSet - Lx5IsAtTheLeftExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + 2*Rx2IsAtTheRightExtremityOfTheLeafSet + 3*Rx3IsAtTheRightExtremityOfTheLeafSet + 4*Rx4IsAtTheRightExtremityOfTheLeafSet - 6*Rx5IsActiveAndNotInTheLeafSet + 5*Rx5IsAtTheRightExtremityOfTheLeafSet = -7
inv : Lx2IsActiveAndNotInTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet - Lx4IsActiveAndNotInTheLeafSet + Lx4IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node7IsActive + NodesCanDetectThatNode7HasCrashed = 1
inv : Node9NotifyThatHeIsActive + NodesCanDetectThatNode9HasCrashed = 1
inv : Node2NotifyThatHeIsActive + NodesCanDetectThatNode2HasCrashed = 1
inv : Node7NotifyThatHeIsActive + NodesCanDetectThatNode7HasCrashed = 1
Total of 45 invariants.
[2022-06-12 21:39:23] [INFO ] Computed 45 place invariants in 36 ms
Loading property file /tmp/ReachabilityFireability8019114547280772261.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 570
[2022-06-12 21:39:38] [INFO ] Proved 962 variables to be positive in 14650 ms
[2022-06-12 21:39:38] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12
[2022-06-12 21:39:38] [INFO ] KInduction solution for property MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12(SAT) depth K=0 took 481 ms
[2022-06-12 21:39:49] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesMultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12
[2022-06-12 21:39:49] [INFO ] KInduction solution for property MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12(SAT) depth K=1 took 10355 ms
[2022-06-12 21:40:01] [INFO ] BMC solution for property MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12(UNSAT) depth K=2 took 38887 ms
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :570 after 3026
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3026 after 3189
Compilation finished in 55420 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin12984791617698647531]
Link finished in 66 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, MultiCrashLeafsetExtensionPTS16C06ReachabilityFireability12==true], workingDir=/tmp/ltsmin12984791617698647531]
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :3189 after 11227
LTSmin run took 954316 ms.
Invariant validated
FORMULA MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
[2022-06-12 21:56:10] [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)
[2022-06-12 21:56:10] [WARNING] Unexpected error occurred while running SMT. Was verifying MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12 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
[2022-06-12 21:56:10] [INFO ] During BMC, SMT solver timed out at depth 3
[2022-06-12 21:56:10] [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)
[2022-06-12 21:56:10] [WARNING] Unexpected error occurred while running SMT. Was verifying MultiCrashLeafsetExtension-PT-S16C06-ReachabilityFireability-12 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
[2022-06-12 21:56:10] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1655070971590

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C06"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2021"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is MultiCrashLeafsetExtension-PT-S16C06, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r143-tall-165271830400258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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