About the Execution of ITS-Tools for MultiCrashLeafsetExtension-PT-S16C05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 14101.144 | 1941317.00 | 5106318.00 | 42735.30 | FTFTTTFFFFFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156700599.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S16C05, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156700599
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.7M
-rw-r--r-- 1 mcc users 54K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 189K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 45K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 154K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.0K May 12 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K May 12 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K May 12 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 12 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 6.2K May 11 18:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 11 18:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 11 15:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 11 15:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 7 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 9.1M May 12 08:13 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME gen-ReachabilityFireability-00
FORMULA_NAME gen-ReachabilityFireability-01
FORMULA_NAME gen-ReachabilityFireability-02
FORMULA_NAME gen-ReachabilityFireability-03
FORMULA_NAME gen-ReachabilityFireability-04
FORMULA_NAME gen-ReachabilityFireability-05
FORMULA_NAME gen-ReachabilityFireability-06
FORMULA_NAME gen-ReachabilityFireability-07
FORMULA_NAME gen-ReachabilityFireability-08
FORMULA_NAME gen-ReachabilityFireability-09
FORMULA_NAME gen-ReachabilityFireability-10
FORMULA_NAME gen-ReachabilityFireability-11
FORMULA_NAME gen-ReachabilityFireability-12
FORMULA_NAME gen-ReachabilityFireability-13
FORMULA_NAME gen-ReachabilityFireability-14
FORMULA_NAME gen-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1621326865181
Running Version 0
[2021-05-18 08:34:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-18 08:34:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 08:34:35] [INFO ] Load time of PNML (sax parser for PT used): 361 ms
[2021-05-18 08:34:35] [INFO ] Transformed 4914 places.
[2021-05-18 08:34:35] [INFO ] Transformed 6913 transitions.
[2021-05-18 08:34:35] [INFO ] Parsed PT model containing 4914 places and 6913 transitions in 431 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 193 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 16) seen :1
FORMULA gen-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :1
FORMULA gen-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 14 properties.
[2021-05-18 08:34:36] [INFO ] Flow matrix only has 6641 transitions (discarded 272 similar events)
// Phase 1: matrix 6641 rows 4914 cols
[2021-05-18 08:34:36] [INFO ] Computed 535 place invariants in 449 ms
[2021-05-18 08:34:38] [INFO ] [Real]Absence check using 48 positive place invariants in 23 ms returned sat
[2021-05-18 08:34:38] [INFO ] [Real]Absence check using 48 positive and 487 generalized place invariants in 196 ms returned sat
[2021-05-18 08:34:38] [INFO ] SMT Verify possible in real domain returnedunsat :2 sat :0 real:12
[2021-05-18 08:34:40] [INFO ] [Nat]Absence check using 48 positive place invariants in 21 ms returned sat
[2021-05-18 08:34:40] [INFO ] [Nat]Absence check using 48 positive and 487 generalized place invariants in 196 ms returned sat
[2021-05-18 08:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:35:01] [INFO ] [Nat]Absence check using state equation in 11449 ms returned unsat :5 sat :9
[2021-05-18 08:35:01] [INFO ] State equation strengthened by 1923 read => feed constraints.
[2021-05-18 08:35:01] [INFO ] [Nat]Added 1923 Read/Feed constraints in 112 ms returned sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-18 08:35:03] [INFO ] SMT Verify possible in nat domain returned unsat :7 sat :6
FORMULA gen-ReachabilityFireability-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA gen-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 14 Parikh solutions to 5 different solutions.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 29 out of 4914 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 4914/4914 places, 6913/6913 transitions.
Graph (complete) has 15675 edges and 4914 vertex of which 4884 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.23 ms
Discarding 30 places :
Also discarding 0 output transitions
Drop transitions removed 1333 transitions
Trivial Post-agglo rules discarded 1333 transitions
Performed 1333 trivial Post agglomeration. Transition count delta: 1333
Iterating post reduction 0 with 1333 rules applied. Total rules applied 1334 place count 4884 transition count 5580
Reduce places removed 1333 places and 0 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 1 with 1357 rules applied. Total rules applied 2691 place count 3551 transition count 5556
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 2715 place count 3527 transition count 5556
Performed 167 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 167 Pre rules applied. Total rules applied 2715 place count 3527 transition count 5389
Deduced a syphon composed of 167 places in 6 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 3 with 334 rules applied. Total rules applied 3049 place count 3360 transition count 5389
Discarding 1184 places :
Symmetric choice reduction at 3 with 1184 rule applications. Total rules 4233 place count 2176 transition count 4205
Iterating global reduction 3 with 1184 rules applied. Total rules applied 5417 place count 2176 transition count 4205
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 5417 place count 2176 transition count 4199
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 5429 place count 2170 transition count 4199
Discarding 229 places :
Symmetric choice reduction at 3 with 229 rule applications. Total rules 5658 place count 1941 transition count 3054
Iterating global reduction 3 with 229 rules applied. Total rules applied 5887 place count 1941 transition count 3054
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 5917 place count 1926 transition count 3039
Free-agglomeration rule (complex) applied 152 times.
Iterating global reduction 3 with 152 rules applied. Total rules applied 6069 place count 1926 transition count 3803
Reduce places removed 152 places and 0 transitions.
Iterating post reduction 3 with 152 rules applied. Total rules applied 6221 place count 1774 transition count 3803
Partial Free-agglomeration rule applied 65 times.
Drop transitions removed 65 transitions
Iterating global reduction 4 with 65 rules applied. Total rules applied 6286 place count 1774 transition count 3803
Applied a total of 6286 rules in 1807 ms. Remains 1774 /4914 variables (removed 3140) and now considering 3803/6913 (removed 3110) transitions.
Finished structural reductions, in 1 iterations. Remains : 1774/4914 places, 3803/6913 transitions.
[2021-05-18 08:35:06] [INFO ] Flatten gal took : 390 ms
[2021-05-18 08:35:06] [INFO ] Flatten gal took : 209 ms
[2021-05-18 08:35:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1615588591950165173.gal : 57 ms
[2021-05-18 08:35:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16438403253625034931.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/ReachabilityCardinality1615588591950165173.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16438403253625034931.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/ReachabilityCardinality1615588591950165173.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16438403253625034931.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16438403253625034931.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :7 after 11
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :11 after 15
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :15 after 45
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :45 after 147
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :147 after 165
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :165 after 177
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :177 after 182
Detected timeout of ITS tools.
[2021-05-18 08:35:21] [INFO ] Flatten gal took : 190 ms
[2021-05-18 08:35:21] [INFO ] Applying decomposition
[2021-05-18 08:35:22] [INFO ] Flatten gal took : 212 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/graph5671060801013550177.txt, -o, /tmp/graph5671060801013550177.bin, -w, /tmp/graph5671060801013550177.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/graph5671060801013550177.bin, -l, -1, -v, -w, /tmp/graph5671060801013550177.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:35:22] [INFO ] Decomposing Gal with order
[2021-05-18 08:35:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:35:24] [INFO ] Removed a total of 4169 redundant transitions.
[2021-05-18 08:35:24] [INFO ] Flatten gal took : 1432 ms
[2021-05-18 08:35:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 4154 labels/synchronizations in 304 ms.
[2021-05-18 08:35:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14665721453807302882.gal : 39 ms
[2021-05-18 08:35:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16253436952809709162.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/ReachabilityCardinality14665721453807302882.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16253436952809709162.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/ReachabilityCardinality14665721453807302882.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16253436952809709162.prop --nowitness
Loading property file /tmp/ReachabilityCardinality16253436952809709162.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 71
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :71 after 73
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :73 after 74
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :74 after 75
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :75 after 78
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :78 after 89
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :89 after 101
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :101 after 123
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10199315750098781787
[2021-05-18 08:35:40] [INFO ] Built C files in 64ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10199315750098781787
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/ltsmin10199315750098781787]
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/ltsmin10199315750098781787] 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/ltsmin10199315750098781787] 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 31663 resets, run finished after 15674 ms. (steps per millisecond=63 ) properties (out of 5) seen :3
FORMULA gen-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA gen-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 5660 resets, run finished after 3394 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5667 resets, run finished after 3646 ms. (steps per millisecond=274 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2021-05-18 08:36:03] [INFO ] Flow matrix only has 3419 transitions (discarded 384 similar events)
// Phase 1: matrix 3419 rows 1774 cols
[2021-05-18 08:36:03] [INFO ] Computed 505 place invariants in 53 ms
[2021-05-18 08:36:04] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2021-05-18 08:36:04] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 85 ms returned sat
[2021-05-18 08:36:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:36:05] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2021-05-18 08:36:05] [INFO ] State equation strengthened by 1923 read => feed constraints.
[2021-05-18 08:36:05] [INFO ] [Real]Added 1923 Read/Feed constraints in 473 ms returned sat
[2021-05-18 08:36:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:36:06] [INFO ] [Nat]Absence check using 33 positive place invariants in 41 ms returned sat
[2021-05-18 08:36:06] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 85 ms returned sat
[2021-05-18 08:36:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:36:07] [INFO ] [Nat]Absence check using state equation in 875 ms returned sat
[2021-05-18 08:36:10] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 08:36:11] [INFO ] [Nat]Added 1923 Read/Feed constraints in 4196 ms returned sat
[2021-05-18 08:36:12] [INFO ] Deduced a trap composed of 181 places in 1371 ms of which 5 ms to minimize.
[2021-05-18 08:36:14] [INFO ] Deduced a trap composed of 201 places in 1276 ms of which 2 ms to minimize.
[2021-05-18 08:36:16] [INFO ] Deduced a trap composed of 284 places in 1432 ms of which 2 ms to minimize.
[2021-05-18 08:36:18] [INFO ] Deduced a trap composed of 250 places in 1227 ms of which 2 ms to minimize.
[2021-05-18 08:36:20] [INFO ] Deduced a trap composed of 281 places in 1217 ms of which 1 ms to minimize.
[2021-05-18 08:36:22] [INFO ] Deduced a trap composed of 173 places in 1259 ms of which 1 ms to minimize.
[2021-05-18 08:36:25] [INFO ] Deduced a trap composed of 166 places in 1236 ms of which 2 ms to minimize.
[2021-05-18 08:36:28] [INFO ] Deduced a trap composed of 166 places in 1216 ms of which 1 ms to minimize.
[2021-05-18 08:36:30] [INFO ] Deduced a trap composed of 170 places in 1215 ms of which 2 ms to minimize.
[2021-05-18 08:36:31] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 19861 ms
[2021-05-18 08:36:31] [INFO ] Computed and/alt/rep : 1648/3784/1648 causal constraints (skipped 1754 transitions) in 305 ms.
[2021-05-18 08:36:34] [INFO ] Added : 75 causal constraints over 15 iterations in 3028 ms. Result :sat
[2021-05-18 08:36:34] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2021-05-18 08:36:34] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 80 ms returned sat
[2021-05-18 08:36:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:36:35] [INFO ] [Real]Absence check using state equation in 961 ms returned sat
[2021-05-18 08:36:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:36:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 32 ms returned sat
[2021-05-18 08:36:35] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 79 ms returned sat
[2021-05-18 08:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:36:36] [INFO ] [Nat]Absence check using state equation in 928 ms returned sat
[2021-05-18 08:36:40] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 08:36:40] [INFO ] [Nat]Added 1923 Read/Feed constraints in 3204 ms returned sat
[2021-05-18 08:36:41] [INFO ] Deduced a trap composed of 249 places in 1089 ms of which 1 ms to minimize.
[2021-05-18 08:36:42] [INFO ] Deduced a trap composed of 256 places in 1235 ms of which 2 ms to minimize.
[2021-05-18 08:36:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 3561 ms
[2021-05-18 08:36:44] [INFO ] Computed and/alt/rep : 1648/3784/1648 causal constraints (skipped 1754 transitions) in 526 ms.
[2021-05-18 08:36:46] [INFO ] Added : 85 causal constraints over 17 iterations in 3225 ms. Result :sat
Incomplete Parikh walk after 18700 steps, including 1328 resets, run finished after 337 ms. (steps per millisecond=55 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 24700 steps, including 1512 resets, run finished after 408 ms. (steps per millisecond=60 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 12 out of 1774 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1774/1774 places, 3803/3803 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1774 transition count 3800
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1771 transition count 3800
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 1771 transition count 3797
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 1768 transition count 3797
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 1765 transition count 3794
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 1765 transition count 3794
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 1765 transition count 3792
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 1763 transition count 3792
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 1763 transition count 3788
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 30 place count 1759 transition count 3788
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 33 place count 1756 transition count 3785
Iterating global reduction 3 with 3 rules applied. Total rules applied 36 place count 1756 transition count 3785
Applied a total of 36 rules in 512 ms. Remains 1756 /1774 variables (removed 18) and now considering 3785/3803 (removed 18) transitions.
Finished structural reductions, in 1 iterations. Remains : 1756/1774 places, 3785/3803 transitions.
[2021-05-18 08:36:48] [INFO ] Flatten gal took : 186 ms
[2021-05-18 08:36:48] [INFO ] Flatten gal took : 184 ms
[2021-05-18 08:36:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4106890030273446731.gal : 18 ms
[2021-05-18 08:36:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2073663055118987787.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/ReachabilityCardinality4106890030273446731.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2073663055118987787.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/ReachabilityCardinality4106890030273446731.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2073663055118987787.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2073663055118987787.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :8 after 11
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :11 after 14
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :14 after 33
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :33 after 34
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :34 after 41
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :41 after 150
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :150 after 175
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :175 after 191
Detected timeout of ITS tools.
[2021-05-18 08:37:03] [INFO ] Flatten gal took : 168 ms
[2021-05-18 08:37:03] [INFO ] Applying decomposition
[2021-05-18 08:37:04] [INFO ] Flatten gal took : 192 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/graph9646716802285198942.txt, -o, /tmp/graph9646716802285198942.bin, -w, /tmp/graph9646716802285198942.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/graph9646716802285198942.bin, -l, -1, -v, -w, /tmp/graph9646716802285198942.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:37:04] [INFO ] Decomposing Gal with order
[2021-05-18 08:37:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:37:05] [INFO ] Removed a total of 6516 redundant transitions.
[2021-05-18 08:37:05] [INFO ] Flatten gal took : 925 ms
[2021-05-18 08:37:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 2122 labels/synchronizations in 228 ms.
[2021-05-18 08:37:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2476351548139430073.gal : 38 ms
[2021-05-18 08:37:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15933945227113361638.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/ReachabilityCardinality2476351548139430073.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15933945227113361638.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/ReachabilityCardinality2476351548139430073.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15933945227113361638.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15933945227113361638.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 51
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin505041447112198412
[2021-05-18 08:37:21] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin505041447112198412
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/ltsmin505041447112198412]
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/ltsmin505041447112198412] 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/ltsmin505041447112198412] 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 31841 resets, run finished after 15894 ms. (steps per millisecond=62 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5668 resets, run finished after 3459 ms. (steps per millisecond=289 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5671 resets, run finished after 3543 ms. (steps per millisecond=282 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 633696 steps, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 633696 steps, saw 276349 distinct states, run finished after 30003 ms. (steps per millisecond=21 ) properties seen :{}
Running SMT prover for 2 properties.
[2021-05-18 08:38:14] [INFO ] Flow matrix only has 3401 transitions (discarded 384 similar events)
// Phase 1: matrix 3401 rows 1756 cols
[2021-05-18 08:38:14] [INFO ] Computed 505 place invariants in 74 ms
[2021-05-18 08:38:15] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2021-05-18 08:38:15] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 72 ms returned sat
[2021-05-18 08:38:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:38:16] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2021-05-18 08:38:16] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:38:16] [INFO ] [Nat]Absence check using 33 positive place invariants in 31 ms returned sat
[2021-05-18 08:38:16] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 76 ms returned sat
[2021-05-18 08:38:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:38:17] [INFO ] [Nat]Absence check using state equation in 1011 ms returned sat
[2021-05-18 08:38:17] [INFO ] State equation strengthened by 1923 read => feed constraints.
[2021-05-18 08:38:20] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 08:38:23] [INFO ] [Nat]Added 1923 Read/Feed constraints in 5965 ms returned sat
[2021-05-18 08:38:24] [INFO ] Deduced a trap composed of 185 places in 1195 ms of which 2 ms to minimize.
[2021-05-18 08:38:26] [INFO ] Deduced a trap composed of 213 places in 1257 ms of which 2 ms to minimize.
[2021-05-18 08:38:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4053 ms
[2021-05-18 08:38:27] [INFO ] Computed and/alt/rep : 1631/3747/1631 causal constraints (skipped 1753 transitions) in 188 ms.
[2021-05-18 08:38:30] [INFO ] Added : 99 causal constraints over 20 iterations in 3267 ms. Result :sat
[2021-05-18 08:38:31] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2021-05-18 08:38:31] [INFO ] [Real]Absence check using 33 positive and 472 generalized place invariants in 85 ms returned sat
[2021-05-18 08:38:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:38:32] [INFO ] [Real]Absence check using state equation in 903 ms returned sat
[2021-05-18 08:38:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:38:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 30 ms returned sat
[2021-05-18 08:38:32] [INFO ] [Nat]Absence check using 33 positive and 472 generalized place invariants in 78 ms returned sat
[2021-05-18 08:38:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:38:33] [INFO ] [Nat]Absence check using state equation in 973 ms returned sat
[2021-05-18 08:38:35] [INFO ] [Nat]Added 1923 Read/Feed constraints in 2522 ms returned sat
[2021-05-18 08:38:37] [INFO ] Deduced a trap composed of 262 places in 1072 ms of which 1 ms to minimize.
[2021-05-18 08:38:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1326 ms
[2021-05-18 08:38:37] [INFO ] Computed and/alt/rep : 1631/3747/1631 causal constraints (skipped 1753 transitions) in 232 ms.
[2021-05-18 08:38:42] [INFO ] Added : 153 causal constraints over 31 iterations in 4716 ms. Result :sat
Incomplete Parikh walk after 24500 steps, including 1541 resets, run finished after 402 ms. (steps per millisecond=60 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 37800 steps, including 1926 resets, run finished after 596 ms. (steps per millisecond=63 ) properties (out of 2) seen :1 could not realise parikh vector
FORMULA gen-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 1756 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1756/1756 places, 3785/3785 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1755 transition count 3784
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 0 with 11 rules applied. Total rules applied 13 place count 1755 transition count 3773
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 24 place count 1744 transition count 3773
Applied a total of 24 rules in 291 ms. Remains 1744 /1756 variables (removed 12) and now considering 3773/3785 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 1744/1756 places, 3773/3785 transitions.
[2021-05-18 08:38:43] [INFO ] Flatten gal took : 165 ms
[2021-05-18 08:38:43] [INFO ] Flatten gal took : 167 ms
[2021-05-18 08:38:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality690212267266720840.gal : 16 ms
[2021-05-18 08:38:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15584016013709746321.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/ReachabilityCardinality690212267266720840.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15584016013709746321.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/ReachabilityCardinality690212267266720840.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15584016013709746321.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15584016013709746321.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :7 after 9
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :9 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 34
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :34 after 41
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :41 after 58
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :58 after 208
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :208 after 228
Detected timeout of ITS tools.
[2021-05-18 08:38:59] [INFO ] Flatten gal took : 164 ms
[2021-05-18 08:38:59] [INFO ] Applying decomposition
[2021-05-18 08:38:59] [INFO ] Flatten gal took : 167 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/graph8070210704754544688.txt, -o, /tmp/graph8070210704754544688.bin, -w, /tmp/graph8070210704754544688.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/graph8070210704754544688.bin, -l, -1, -v, -w, /tmp/graph8070210704754544688.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:38:59] [INFO ] Decomposing Gal with order
[2021-05-18 08:38:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:39:00] [INFO ] Removed a total of 5420 redundant transitions.
[2021-05-18 08:39:00] [INFO ] Flatten gal took : 855 ms
[2021-05-18 08:39:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 3084 labels/synchronizations in 243 ms.
[2021-05-18 08:39:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7378026262643879154.gal : 29 ms
[2021-05-18 08:39:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15455966653700290740.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/ReachabilityCardinality7378026262643879154.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15455966653700290740.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/ReachabilityCardinality7378026262643879154.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15455966653700290740.prop --nowitness
Loading property file /tmp/ReachabilityCardinality15455966653700290740.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 49
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :49 after 233
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :233 after 241
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :241 after 283
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8052471868669062904
[2021-05-18 08:39:15] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8052471868669062904
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/ltsmin8052471868669062904]
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/ltsmin8052471868669062904] 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/ltsmin8052471868669062904] 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 31851 resets, run finished after 15497 ms. (steps per millisecond=64 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 5668 resets, run finished after 3448 ms. (steps per millisecond=290 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 634685 steps, run timeout after 30001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 634685 steps, saw 276753 distinct states, run finished after 30001 ms. (steps per millisecond=21 ) properties seen :{}
Running SMT prover for 1 properties.
[2021-05-18 08:40:05] [INFO ] Flow matrix only has 3379 transitions (discarded 394 similar events)
// Phase 1: matrix 3379 rows 1744 cols
[2021-05-18 08:40:05] [INFO ] Computed 505 place invariants in 50 ms
[2021-05-18 08:40:06] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2021-05-18 08:40:06] [INFO ] [Real]Absence check using 31 positive and 474 generalized place invariants in 77 ms returned sat
[2021-05-18 08:40:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:07] [INFO ] [Real]Absence check using state equation in 1049 ms returned sat
[2021-05-18 08:40:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:40:07] [INFO ] [Nat]Absence check using 31 positive place invariants in 25 ms returned sat
[2021-05-18 08:40:07] [INFO ] [Nat]Absence check using 31 positive and 474 generalized place invariants in 74 ms returned sat
[2021-05-18 08:40:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:40:08] [INFO ] [Nat]Absence check using state equation in 1094 ms returned sat
[2021-05-18 08:40:08] [INFO ] State equation strengthened by 1923 read => feed constraints.
[2021-05-18 08:40:11] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-18 08:40:13] [INFO ] [Nat]Added 1923 Read/Feed constraints in 5004 ms returned sat
[2021-05-18 08:40:14] [INFO ] Deduced a trap composed of 168 places in 1193 ms of which 1 ms to minimize.
[2021-05-18 08:40:16] [INFO ] Deduced a trap composed of 107 places in 1182 ms of which 1 ms to minimize.
[2021-05-18 08:40:53] [INFO ] Deduced a trap composed of 2 places in 1285 ms of which 1 ms to minimize.
[2021-05-18 08:40:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
Support contains 3 out of 1744 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1744/1744 places, 3773/3773 transitions.
Applied a total of 0 rules in 115 ms. Remains 1744 /1744 variables (removed 0) and now considering 3773/3773 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1744/1744 places, 3773/3773 transitions.
Starting structural reductions, iteration 0 : 1744/1744 places, 3773/3773 transitions.
Applied a total of 0 rules in 114 ms. Remains 1744 /1744 variables (removed 0) and now considering 3773/3773 (removed 0) transitions.
[2021-05-18 08:40:53] [INFO ] Flow matrix only has 3379 transitions (discarded 394 similar events)
// Phase 1: matrix 3379 rows 1744 cols
[2021-05-18 08:40:53] [INFO ] Computed 505 place invariants in 47 ms
[2021-05-18 08:40:57] [INFO ] Implicit Places using invariants in 3258 ms returned [4, 7, 9, 10, 11, 12, 13, 14, 18, 24, 32, 42, 54, 68, 83, 97, 98, 99, 100, 101, 102, 114, 124, 132, 138, 143, 145, 158, 164, 166, 167, 168, 169, 170, 171, 173, 177, 183, 191, 201, 213, 226, 238, 239, 240, 241, 242, 243, 253, 261, 267, 271, 274, 276, 289, 295, 297, 298, 299, 300, 301, 302, 304, 306, 310, 316, 324, 334, 345, 355, 356, 357, 358, 359, 360, 368, 374, 378, 380, 382, 384, 397, 403, 405, 406, 407, 408, 409, 410, 412, 414, 416, 420, 426, 434, 443, 451, 452, 453, 454, 455, 456, 462, 466, 468, 470, 472, 474, 487, 493, 495, 496, 497, 498, 499, 500, 502, 504, 506, 508, 512, 518, 525, 531, 532, 533, 534, 535, 536, 540, 542, 544, 546, 548, 550, 563, 569, 571, 572, 573, 574, 575, 576, 578, 580, 582, 584, 586, 590, 595, 599, 600, 601, 602, 603, 604, 606, 608, 610, 612, 614, 616, 629, 635, 637, 638, 639, 640, 641, 642, 644, 646, 648, 650, 652, 654, 657, 659, 660, 661, 662, 663, 664, 666, 668, 670, 672, 674, 676, 689, 695, 697, 698, 699, 700, 701, 702, 704, 706, 708, 710, 712, 714, 716, 718, 719, 720, 721, 722, 723, 725, 727, 729, 731, 733, 735, 748, 750, 753, 755, 756, 757, 758, 759, 760, 762, 764, 766, 768, 770, 772, 774, 776, 777, 778, 779, 780, 781, 783, 785, 787, 789, 791, 793, 806, 812, 814, 815, 816, 817, 818, 819, 821, 823, 825, 827, 829, 831, 833, 835, 836, 837, 838, 839, 840, 842, 844, 846, 848, 850, 852, 865, 871, 873, 874, 875, 876, 877, 878, 880, 882, 884, 886, 888, 890, 892, 895, 896, 897, 898, 899, 900, 902, 904, 906, 908, 910, 912, 925, 931, 933, 934, 935, 936, 937, 938, 940, 942, 944, 946, 948, 950, 954, 959, 960, 961, 962, 963, 964, 968, 970, 972, 974, 976, 978, 991, 997, 999, 1000, 1001, 1002, 1003, 1004, 1006, 1008, 1010, 1012, 1014, 1018, 1024, 1031, 1032, 1033, 1034, 1035, 1036, 1042, 1046, 1048, 1050, 1052, 1054, 1067, 1073, 1075, 1076, 1077, 1078, 1079, 1080, 1082, 1084, 1086, 1088, 1092, 1098, 1106, 1115, 1116, 1117, 1118, 1119, 1120, 1128, 1134, 1138, 1140, 1142, 1144, 1157, 1164, 1166, 1167, 1168, 1169, 1170, 1171, 1173, 1175, 1177, 1181, 1187, 1195, 1205, 1216, 1217, 1218, 1219, 1220, 1221, 1231, 1239, 1245, 1249, 1251, 1253, 1266, 1272, 1274, 1275, 1276, 1277, 1278, 1279, 1281, 1283, 1287, 1293, 1301, 1311, 1323, 1336, 1337, 1338, 1339, 1340, 1341, 1353, 1363, 1371, 1377, 1381, 1384, 1397, 1399, 1402, 1404, 1405, 1406, 1407, 1408, 1409, 1411, 1415, 1421, 1429, 1439, 1451, 1465, 1480, 1481, 1482, 1483, 1484, 1485, 1499, 1511, 1521, 1529, 1535, 1540, 1553]
Discarding 462 places :
Implicit Place search using SMT only with invariants took 3274 ms to find 462 implicit places.
[2021-05-18 08:40:57] [INFO ] Redundant transitions in 240 ms returned []
[2021-05-18 08:40:57] [INFO ] Flow matrix only has 3379 transitions (discarded 394 similar events)
// Phase 1: matrix 3379 rows 1282 cols
[2021-05-18 08:40:57] [INFO ] Computed 43 place invariants in 25 ms
[2021-05-18 08:40:58] [INFO ] Dead Transitions using invariants and state equation in 1495 ms returned []
Starting structural reductions, iteration 1 : 1282/1744 places, 3773/3773 transitions.
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 160 place count 1122 transition count 3613
Iterating global reduction 0 with 160 rules applied. Total rules applied 320 place count 1122 transition count 3613
Discarding 160 places :
Symmetric choice reduction at 0 with 160 rule applications. Total rules 480 place count 962 transition count 3453
Iterating global reduction 0 with 160 rules applied. Total rules applied 640 place count 962 transition count 3453
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 643 place count 962 transition count 3450
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 646 place count 959 transition count 3450
Applied a total of 646 rules in 252 ms. Remains 959 /1282 variables (removed 323) and now considering 3450/3773 (removed 323) transitions.
[2021-05-18 08:40:59] [INFO ] Flow matrix only has 3056 transitions (discarded 394 similar events)
// Phase 1: matrix 3056 rows 959 cols
[2021-05-18 08:40:59] [INFO ] Computed 43 place invariants in 24 ms
[2021-05-18 08:41:00] [INFO ] Implicit Places using invariants in 952 ms returned []
[2021-05-18 08:41:00] [INFO ] Flow matrix only has 3056 transitions (discarded 394 similar events)
// Phase 1: matrix 3056 rows 959 cols
[2021-05-18 08:41:00] [INFO ] Computed 43 place invariants in 28 ms
[2021-05-18 08:41:00] [INFO ] State equation strengthened by 1923 read => feed constraints.
[2021-05-18 08:41:30] [INFO ] Performed 658/959 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2021-05-18 08:41:41] [INFO ] Implicit Places using invariants and state equation in 41512 ms returned []
Implicit Place search using SMT with State Equation took 42465 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 959/1744 places, 3450/3773 transitions.
[2021-05-18 08:41:41] [INFO ] Flatten gal took : 111 ms
[2021-05-18 08:41:41] [INFO ] Flatten gal took : 110 ms
[2021-05-18 08:41:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15173468776705650479.gal : 10 ms
[2021-05-18 08:41:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6790233155191432572.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/ReachabilityCardinality15173468776705650479.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6790233155191432572.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/ReachabilityCardinality15173468776705650479.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6790233155191432572.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality6790233155191432572.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 33
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :33 after 37
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :37 after 72
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :72 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 106
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :106 after 150
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :150 after 175
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :175 after 285
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :285 after 432
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :432 after 702
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :702 after 1158
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1158 after 2201
Detected timeout of ITS tools.
[2021-05-18 08:42:01] [INFO ] Flatten gal took : 140 ms
[2021-05-18 08:42:01] [INFO ] Applying decomposition
[2021-05-18 08:42:02] [INFO ] Flatten gal took : 107 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph12182575545899429223.txt, -o, /tmp/graph12182575545899429223.bin, -w, /tmp/graph12182575545899429223.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/graph12182575545899429223.bin, -l, -1, -v, -w, /tmp/graph12182575545899429223.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:42:02] [INFO ] Decomposing Gal with order
[2021-05-18 08:42:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:42:02] [INFO ] Removed a total of 5797 redundant transitions.
[2021-05-18 08:42:02] [INFO ] Flatten gal took : 504 ms
[2021-05-18 08:42:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 2181 labels/synchronizations in 104 ms.
[2021-05-18 08:42:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13523406690238564479.gal : 18 ms
[2021-05-18 08:42:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10851042302781229480.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/ReachabilityCardinality13523406690238564479.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10851042302781229480.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/ReachabilityCardinality13523406690238564479.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10851042302781229480.prop --nowitness
Loading property file /tmp/ReachabilityCardinality10851042302781229480.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 63
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :63 after 98
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :98 after 98
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :98 after 98
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :98 after 98
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :98 after 98
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :98 after 672
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :672 after 672
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17710455582626614006
[2021-05-18 08:42:23] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17710455582626614006
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/ltsmin17710455582626614006]
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/ltsmin17710455582626614006] 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/ltsmin17710455582626614006] 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)
Incomplete random walk after 1000000 steps, including 34076 resets, run finished after 14806 ms. (steps per millisecond=67 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4647 resets, run finished after 2624 ms. (steps per millisecond=381 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 756207 steps, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 756207 steps, saw 311472 distinct states, run finished after 30001 ms. (steps per millisecond=25 ) properties seen :{}
Running SMT prover for 1 properties.
[2021-05-18 08:43:12] [INFO ] Flow matrix only has 3056 transitions (discarded 394 similar events)
// Phase 1: matrix 3056 rows 959 cols
[2021-05-18 08:43:12] [INFO ] Computed 43 place invariants in 36 ms
[2021-05-18 08:43:12] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 08:43:12] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 3 ms returned sat
[2021-05-18 08:43:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:13] [INFO ] [Real]Absence check using state equation in 525 ms returned sat
[2021-05-18 08:43:13] [INFO ] State equation strengthened by 1923 read => feed constraints.
[2021-05-18 08:43:15] [INFO ] [Real]Added 1923 Read/Feed constraints in 2594 ms returned sat
[2021-05-18 08:43:15] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:43:16] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 08:43:16] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-18 08:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:16] [INFO ] [Nat]Absence check using state equation in 525 ms returned sat
[2021-05-18 08:43:19] [INFO ] [Nat]Added 1923 Read/Feed constraints in 2784 ms returned sat
[2021-05-18 08:43:19] [INFO ] Deduced a trap composed of 72 places in 483 ms of which 1 ms to minimize.
[2021-05-18 08:43:21] [INFO ] Deduced a trap composed of 86 places in 488 ms of which 1 ms to minimize.
[2021-05-18 08:43:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1819 ms
[2021-05-18 08:43:21] [INFO ] Computed and/alt/rep : 1356/1972/1356 causal constraints (skipped 1638 transitions) in 179 ms.
[2021-05-18 08:43:23] [INFO ] Added : 67 causal constraints over 14 iterations in 1852 ms. Result :sat
Incomplete Parikh walk after 18600 steps, including 1228 resets, run finished after 287 ms. (steps per millisecond=64 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 3 out of 959 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 959/959 places, 3450/3450 transitions.
Applied a total of 0 rules in 91 ms. Remains 959 /959 variables (removed 0) and now considering 3450/3450 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 959/959 places, 3450/3450 transitions.
Starting structural reductions, iteration 0 : 959/959 places, 3450/3450 transitions.
Applied a total of 0 rules in 92 ms. Remains 959 /959 variables (removed 0) and now considering 3450/3450 (removed 0) transitions.
[2021-05-18 08:43:23] [INFO ] Flow matrix only has 3056 transitions (discarded 394 similar events)
// Phase 1: matrix 3056 rows 959 cols
[2021-05-18 08:43:23] [INFO ] Computed 43 place invariants in 22 ms
[2021-05-18 08:43:24] [INFO ] Implicit Places using invariants in 960 ms returned []
[2021-05-18 08:43:24] [INFO ] Flow matrix only has 3056 transitions (discarded 394 similar events)
// Phase 1: matrix 3056 rows 959 cols
[2021-05-18 08:43:24] [INFO ] Computed 43 place invariants in 22 ms
[2021-05-18 08:43:25] [INFO ] State equation strengthened by 1923 read => feed constraints.
[2021-05-18 08:43:55] [INFO ] Implicit Places using invariants and state equation in 30527 ms returned []
Implicit Place search using SMT with State Equation took 31488 ms to find 0 implicit places.
[2021-05-18 08:43:55] [INFO ] Redundant transitions in 191 ms returned []
[2021-05-18 08:43:55] [INFO ] Flow matrix only has 3056 transitions (discarded 394 similar events)
// Phase 1: matrix 3056 rows 959 cols
[2021-05-18 08:43:55] [INFO ] Computed 43 place invariants in 21 ms
[2021-05-18 08:43:56] [INFO ] Dead Transitions using invariants and state equation in 1404 ms returned []
Finished structural reductions, in 1 iterations. Remains : 959/959 places, 3450/3450 transitions.
Incomplete random walk after 100000 steps, including 3408 resets, run finished after 1789 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2021-05-18 08:43:58] [INFO ] Flow matrix only has 3056 transitions (discarded 394 similar events)
// Phase 1: matrix 3056 rows 959 cols
[2021-05-18 08:43:58] [INFO ] Computed 43 place invariants in 21 ms
[2021-05-18 08:43:58] [INFO ] [Real]Absence check using 31 positive place invariants in 19 ms returned sat
[2021-05-18 08:43:58] [INFO ] [Real]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-18 08:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:43:59] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2021-05-18 08:43:59] [INFO ] State equation strengthened by 1923 read => feed constraints.
[2021-05-18 08:44:01] [INFO ] [Real]Added 1923 Read/Feed constraints in 2607 ms returned sat
[2021-05-18 08:44:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:44:02] [INFO ] [Nat]Absence check using 31 positive place invariants in 15 ms returned sat
[2021-05-18 08:44:02] [INFO ] [Nat]Absence check using 31 positive and 12 generalized place invariants in 2 ms returned sat
[2021-05-18 08:44:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:44:02] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2021-05-18 08:44:05] [INFO ] [Nat]Added 1923 Read/Feed constraints in 2806 ms returned sat
[2021-05-18 08:44:05] [INFO ] Deduced a trap composed of 72 places in 489 ms of which 1 ms to minimize.
[2021-05-18 08:44:07] [INFO ] Deduced a trap composed of 86 places in 507 ms of which 0 ms to minimize.
[2021-05-18 08:44:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1858 ms
[2021-05-18 08:44:07] [INFO ] Computed and/alt/rep : 1356/1972/1356 causal constraints (skipped 1638 transitions) in 235 ms.
[2021-05-18 08:44:09] [INFO ] Added : 67 causal constraints over 14 iterations in 1902 ms. Result :sat
[2021-05-18 08:44:09] [INFO ] Flatten gal took : 112 ms
[2021-05-18 08:44:09] [INFO ] Flatten gal took : 144 ms
[2021-05-18 08:44:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9384032925319945674.gal : 10 ms
[2021-05-18 08:44:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4232738094075518803.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/ReachabilityCardinality9384032925319945674.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4232738094075518803.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/ReachabilityCardinality9384032925319945674.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4232738094075518803.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4232738094075518803.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 33
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :33 after 37
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :37 after 72
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :72 after 74
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :74 after 106
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :106 after 150
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :150 after 175
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :175 after 285
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :285 after 432
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :432 after 702
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :702 after 1158
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :1158 after 2201
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2201 after 4685
Detected timeout of ITS tools.
[2021-05-18 08:44:34] [INFO ] Flatten gal took : 110 ms
[2021-05-18 08:44:34] [INFO ] Applying decomposition
[2021-05-18 08:44:34] [INFO ] Flatten gal took : 111 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph1825246249570846515.txt, -o, /tmp/graph1825246249570846515.bin, -w, /tmp/graph1825246249570846515.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/graph1825246249570846515.bin, -l, -1, -v, -w, /tmp/graph1825246249570846515.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:44:34] [INFO ] Decomposing Gal with order
[2021-05-18 08:44:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:44:35] [INFO ] Removed a total of 5775 redundant transitions.
[2021-05-18 08:44:35] [INFO ] Flatten gal took : 550 ms
[2021-05-18 08:44:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 2644 labels/synchronizations in 109 ms.
[2021-05-18 08:44:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18144939169303830465.gal : 17 ms
[2021-05-18 08:44:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5309720073395580739.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/ReachabilityCardinality18144939169303830465.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5309720073395580739.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/ReachabilityCardinality18144939169303830465.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5309720073395580739.prop --nowitness
Loading property file /tmp/ReachabilityCardinality5309720073395580739.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 16
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :16 after 22
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :22 after 22
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :22 after 22
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :22 after 60
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :60 after 80
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :80 after 190
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :190 after 558
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :558 after 919
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11681357427652771628
[2021-05-18 08:45:00] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11681357427652771628
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/ltsmin11681357427652771628]
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/ltsmin11681357427652771628] 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/ltsmin11681357427652771628] 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 1014 edges and 959 vertex of which 16 / 959 are part of one of the 1 SCC in 13 ms
Free SCC test removed 15 places
Drop transitions removed 271 transitions
Ensure Unique test removed 373 transitions
Reduce isomorphic transitions removed 644 transitions.
Graph (complete) has 4010 edges and 944 vertex of which 930 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 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 913 transition count 2727
Reduce places removed 77 places and 0 transitions.
Drop transitions removed 1 transitions
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 66 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 1 with 208 rules applied. Total rules applied 289 place count 836 transition count 2596
Reduce places removed 65 places and 0 transitions.
Drop transitions removed 16 transitions
Ensure Unique test removed 38 transitions
Reduce isomorphic transitions removed 54 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 2 with 155 rules applied. Total rules applied 444 place count 771 transition count 2506
Reduce places removed 36 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 3 with 84 rules applied. Total rules applied 528 place count 735 transition count 2458
Reduce places removed 23 places and 0 transitions.
Drop transitions removed 10 transitions
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 4 with 59 rules applied. Total rules applied 587 place count 712 transition count 2422
Reduce places removed 13 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 5 with 37 rules applied. Total rules applied 624 place count 699 transition count 2398
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 6 with 27 rules applied. Total rules applied 651 place count 688 transition count 2382
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 7 with 13 rules applied. Total rules applied 664 place count 683 transition count 2374
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 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 8 with 7 rules applied. Total rules applied 671 place count 680 transition count 2370
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 9 with 6 rules applied. Total rules applied 677 place count 679 transition count 2365
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 681 place count 675 transition count 2365
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 10 Pre rules applied. Total rules applied 681 place count 675 transition count 2355
Deduced a syphon composed of 10 places in 23 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 701 place count 665 transition count 2355
Discarding 229 places :
Symmetric choice reduction at 11 with 229 rule applications. Total rules 930 place count 436 transition count 1269
Iterating global reduction 11 with 229 rules applied. Total rules applied 1159 place count 436 transition count 1269
Ensure Unique test removed 182 transitions
Reduce isomorphic transitions removed 182 transitions.
Iterating post reduction 11 with 182 rules applied. Total rules applied 1341 place count 436 transition count 1087
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1342 place count 435 transition count 1085
Iterating global reduction 12 with 1 rules applied. Total rules applied 1343 place count 435 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 1344 place count 434 transition count 1084
Iterating global reduction 12 with 1 rules applied. Total rules applied 1345 place count 434 transition count 1084
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 0 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 12 with 626 rules applied. Total rules applied 1971 place count 121 transition count 771
Drop transitions removed 311 transitions
Reduce isomorphic transitions removed 311 transitions.
Iterating post reduction 12 with 311 rules applied. Total rules applied 2282 place count 121 transition count 460
Discarding 47 places :
Symmetric choice reduction at 13 with 47 rule applications. Total rules 2329 place count 74 transition count 178
Iterating global reduction 13 with 47 rules applied. Total rules applied 2376 place count 74 transition count 178
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 13 with 20 rules applied. Total rules applied 2396 place count 74 transition count 158
Discarding 7 places :
Symmetric choice reduction at 14 with 7 rule applications. Total rules 2403 place count 67 transition count 123
Iterating global reduction 14 with 7 rules applied. Total rules applied 2410 place count 67 transition count 123
Discarding 7 places :
Symmetric choice reduction at 14 with 7 rule applications. Total rules 2417 place count 60 transition count 116
Iterating global reduction 14 with 7 rules applied. Total rules applied 2424 place count 60 transition count 116
Drop transitions removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 14 with 17 rules applied. Total rules applied 2441 place count 60 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 2441 place count 60 transition count 98
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 2443 place count 59 transition count 98
Discarding 9 places :
Symmetric choice reduction at 14 with 9 rule applications. Total rules 2452 place count 50 transition count 53
Iterating global reduction 14 with 9 rules applied. Total rules applied 2461 place count 50 transition count 53
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 14 with 11 rules applied. Total rules applied 2472 place count 50 transition count 42
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2473 place count 49 transition count 40
Iterating global reduction 15 with 1 rules applied. Total rules applied 2474 place count 49 transition count 40
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 15 with 3 rules applied. Total rules applied 2477 place count 49 transition count 37
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 2479 place count 47 transition count 35
Iterating global reduction 15 with 2 rules applied. Total rules applied 2481 place count 47 transition count 35
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 2483 place count 45 transition count 33
Iterating global reduction 15 with 2 rules applied. Total rules applied 2485 place count 45 transition count 33
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 15 with 11 rules applied. Total rules applied 2496 place count 45 transition count 22
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 15 with 11 rules applied. Total rules applied 2507 place count 34 transition count 22
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2508 place count 33 transition count 21
Iterating global reduction 16 with 1 rules applied. Total rules applied 2509 place count 33 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 2510 place count 33 transition count 21
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 2511 place count 32 transition count 20
Iterating global reduction 16 with 1 rules applied. Total rules applied 2512 place count 32 transition count 20
Applied a total of 2512 rules in 785 ms. Remains 32 /959 variables (removed 927) and now considering 20/3450 (removed 3430) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 20 rows 32 cols
[2021-05-18 08:45:03] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-18 08:45:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2021-05-18 08:45:03] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 1 ms returned sat
[2021-05-18 08:45:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 08:45:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-18 08:45:03] [INFO ] Computed and/alt/rep : 13/74/13 causal constraints (skipped 0 transitions) in 2 ms.
[2021-05-18 08:45:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 08:45:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2021-05-18 08:45:03] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 1 ms returned sat
[2021-05-18 08:45:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 08:45:03] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-18 08:45:03] [INFO ] Computed and/alt/rep : 13/74/13 causal constraints (skipped 0 transitions) in 1 ms.
[2021-05-18 08:45:03] [INFO ] Added : 9 causal constraints over 2 iterations in 10 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 1 ms.
[2021-05-18 08:45:03] [INFO ] Flatten gal took : 115 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4605477924177453694
[2021-05-18 08:45:03] [INFO ] Too many transitions (3450) to apply POR reductions. Disabling POR matrices.
[2021-05-18 08:45:03] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4605477924177453694
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/ltsmin4605477924177453694]
[2021-05-18 08:45:03] [INFO ] Applying decomposition
[2021-05-18 08:45:03] [INFO ] Flatten gal took : 143 ms
[2021-05-18 08:45:04] [INFO ] Input system was already deterministic with 3450 transitions.
[2021-05-18 08:45:04] [INFO ] Flatten gal took : 153 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10596965918097984499.txt, -o, /tmp/graph10596965918097984499.bin, -w, /tmp/graph10596965918097984499.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/graph10596965918097984499.bin, -l, -1, -v, -w, /tmp/graph10596965918097984499.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-18 08:45:11] [INFO ] Decomposing Gal with order
[2021-05-18 08:45:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-18 08:45:12] [INFO ] Removed a total of 5820 redundant transitions.
[2021-05-18 08:45:12] [INFO ] Flatten gal took : 530 ms
[2021-05-18 08:45:12] [INFO ] Ran tautology test, simplified 0 / 1 in 8497 ms.
[2021-05-18 08:45:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 2296 labels/synchronizations in 100 ms.
[2021-05-18 08:45:12] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability11746678687515626797.gal : 20 ms
[2021-05-18 08:45:12] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability17069068492370994091.prop : 5 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/ReachabilityFireability11746678687515626797.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability17069068492370994091.prop, --nowitness], workingDir=/home/mcc/execution]
[2021-05-18 08:45:12] [INFO ] BMC solution for property gen-ReachabilityFireability-06(UNSAT) depth K=0 took 53 ms
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/ReachabilityFireability11746678687515626797.gal -t CGAL -reachable-file /tmp/ReachabilityFireability17069068492370994091.prop --nowitness
[2021-05-18 08:45:12] [INFO ] BMC solution for property gen-ReachabilityFireability-06(UNSAT) depth K=1 took 53 ms
Loading property file /tmp/ReachabilityFireability17069068492370994091.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 3056 out of 3450 initially.
// Phase 1: matrix 3056 rows 959 cols
[2021-05-18 08:45:13] [INFO ] Computed 43 place invariants in 22 ms
inv : Node9IsActive + NodesCanDetectThatNode9HasCrashed = 1
inv : Lx0IsAtTheLeftExtremityOfTheLeafSet + Lx1IsAtTheLeftExtremityOfTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet - Lx3IsActiveAndNotInTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node11IsActive + NodesCanDetectThatNode11HasCrashed = 1
inv : Node3IsActive + NodesCanDetectThatNode3HasCrashed = 1
inv : Node11NotifyThatHeIsActive + NodesCanDetectThatNode11HasCrashed = 1
inv : Rx3IsActiveAndNotInTheLeafSet - Rx4IsActiveAndNotInTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet = 0
inv : Rx0IsAtTheRightExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet - Rx4IsActiveAndNotInTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node4NotifyThatHeIsActive + NodesCanDetectThatNode4HasCrashed = 1
inv : Node13NotifyThatHeIsActive + NodesCanDetectThatNode13HasCrashed = 1
inv : Node5IsActive + NodesCanDetectThatNode5HasCrashed = 1
inv : Node15IsActive + NodesCanDetectThatNode15HasCrashed = 1
inv : -NoCrashIsHappening + Node0IsActive - NodesCanDetectThatNode1HasCrashed - NodesCanDetectThatNode2HasCrashed - NodesCanDetectThatNode3HasCrashed - NodesCanDetectThatNode4HasCrashed - NodesCanDetectThatNode5HasCrashed - NodesCanDetectThatNode6HasCrashed - NodesCanDetectThatNode7HasCrashed + Node8IsActive - NodesCanDetectThatNode9HasCrashed - NodesCanDetectThatNode10HasCrashed - NodesCanDetectThatNode11HasCrashed - NodesCanDetectThatNode12HasCrashed - NodesCanDetectThatNode13HasCrashed - NodesCanDetectThatNode14HasCrashed - NodesCanDetectThatNode15HasCrashed + Node16IsActive + Lx1IsAtTheLeftExtremityOfTheLeafSet + 2*Lx2IsAtTheLeftExtremityOfTheLeafSet - 5*Lx3IsActiveAndNotInTheLeafSet + 3*Lx3IsAtTheLeftExtremityOfTheLeafSet - Lx4IsAtTheLeftExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + 2*Rx2IsAtTheRightExtremityOfTheLeafSet + 3*Rx3IsAtTheRightExtremityOfTheLeafSet - 5*Rx4IsActiveAndNotInTheLeafSet + 4*Rx4IsAtTheRightExtremityOfTheLeafSet = -8
inv : Node3NotifyThatHeIsActive + NodesCanDetectThatNode3HasCrashed = 1
inv : Node4IsActive + NodesCanDetectThatNode4HasCrashed = 1
inv : Node6IsActive + NodesCanDetectThatNode6HasCrashed = 1
inv : Node6NotifyThatHeIsActive + NodesCanDetectThatNode6HasCrashed = 1
inv : Node15NotifyThatHeIsActive + NodesCanDetectThatNode15HasCrashed = 1
inv : Node5NotifyThatHeIsActive + NodesCanDetectThatNode5HasCrashed = 1
inv : CrashReservoir - NoCrashIsHappening + Lx1IsAtTheLeftExtremityOfTheLeafSet + 2*Lx2IsAtTheLeftExtremityOfTheLeafSet - 5*Lx3IsActiveAndNotInTheLeafSet + 3*Lx3IsAtTheLeftExtremityOfTheLeafSet - Lx4IsAtTheLeftExtremityOfTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + 2*Rx2IsAtTheRightExtremityOfTheLeafSet + 3*Rx3IsAtTheRightExtremityOfTheLeafSet - 5*Rx4IsActiveAndNotInTheLeafSet + 4*Rx4IsAtTheRightExtremityOfTheLeafSet = -6
inv : -Lx3IsActiveAndNotInTheLeafSet + Lx4IsActiveAndNotInTheLeafSet - Lx4IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node2IsActive + NodesCanDetectThatNode2HasCrashed = 1
inv : Lx0IsActiveAndNotInTheLeafSet + Lx1IsAtTheLeftExtremityOfTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet - Lx3IsActiveAndNotInTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Lx2IsActiveAndNotInTheLeafSet - Lx3IsActiveAndNotInTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node12NotifyThatHeIsActive + NodesCanDetectThatNode12HasCrashed = 1
inv : Node12IsActive + NodesCanDetectThatNode12HasCrashed = 1
inv : Node14NotifyThatHeIsActive + NodesCanDetectThatNode14HasCrashed = 1
inv : Rx1IsActiveAndNotInTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet - Rx4IsActiveAndNotInTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node14IsActive + NodesCanDetectThatNode14HasCrashed = 1
inv : Rx2IsActiveAndNotInTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet - Rx4IsActiveAndNotInTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node10NotifyThatHeIsActive + NodesCanDetectThatNode10HasCrashed = 1
inv : Node13IsActive + NodesCanDetectThatNode13HasCrashed = 1
inv : NoCrashIsHappening + Node0HasDetectedCrashOfNode1 + Node0HasDetectedCrashOfNode2 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode2 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode2 + Node0HasDetectedCrashOfNode3 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode3 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode3 + Node0HasDetectedCrashOfNode4 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode4 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode4 + Node0HasDetectedCrashOfNode5 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode5 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode5 + Node0HasDetectedCrashOfNode6 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode6 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode6 + Node0HasDetectedCrashOfNode7 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode7 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode7 + Node0HasDetectedCrashOfNode8 + Node0ThinksNode9ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode8 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode8 + Node0HasDetectedCrashOfNode9 + Node0ThinksNode6ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode10ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode9 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode9 + Node0HasDetectedCrashOfNode10 + Node0ThinksNode5ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode11ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode10 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode10 + Node0HasDetectedCrashOfNode11 + Node0ThinksNode4ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode12ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode11 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode11 + Node0HasDetectedCrashOfNode12 + Node0ThinksNode3ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode13ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode12 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode12 + Node0HasDetectedCrashOfNode13 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode14ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode13 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode13 + Node0HasDetectedCrashOfNode14 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode14 + Node0ThinksNode1ShouldBeNodeMasterToReplaceNode14 + Node0ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node0HasDetectedCrashOfNode15 + Node0HasDetectedCrashOfNode16 + RequestOfNode0IsSentToLx0 + RequestOfNode0IsSentToRx0 + RequestOfNode0IsSentToLx1 + RequestOfNode0IsSentToRx1 + RequestOfNode0IsSentToLx2 + RequestOfNode0IsSentToRx2 + RequestOfNode0IsSentToLx3 + RequestOfNode0IsSentToRx3 + RequestOfNode0IsSentToLx4 + RequestOfNode0IsSentToRx4 + 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 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode14 + 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 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode14 + 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 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode14 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode14 + Node16HasDetectedCrashOfNode15 + Lx0HasReceivedTheRequestOfNode0 + Lx1HasReceivedTheRequestOfNode0 + Lx2HasReceivedTheRequestOfNode0 + Lx3HasReceivedTheRequestOfNode0 + Lx4HasReceivedTheRequestOfNode0 + Rx0HasReceivedTheRequestOfNode0 + Rx1HasReceivedTheRequestOfNode0 + Rx2HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode0 + Rx4HasReceivedTheRequestOfNode0 = 1
inv : NoCrashIsHappening + ThereIsAMasterInTheLeafSet + Node0AsksIsThereANodeMaster + RequestOfNode0IsSentToLx0 + RequestOfNode0IsSentToRx0 + RequestOfNode0IsSentToLx1 + RequestOfNode0IsSentToRx1 + RequestOfNode0IsSentToLx2 + RequestOfNode0IsSentToRx2 + RequestOfNode0IsSentToLx3 + RequestOfNode0IsSentToRx3 + RequestOfNode0IsSentToLx4 + RequestOfNode0IsSentToRx4 + 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 + Rx0HasReceivedTheRequestOfNode0 + Rx1HasReceivedTheRequestOfNode0 + Rx2HasReceivedTheRequestOfNode0 + Rx3HasReceivedTheRequestOfNode0 + Rx4HasReceivedTheRequestOfNode0 = 1
inv : Node10IsActive + NodesCanDetectThatNode10HasCrashed = 1
inv : Rx0IsActiveAndNotInTheLeafSet + Rx1IsAtTheRightExtremityOfTheLeafSet + Rx2IsAtTheRightExtremityOfTheLeafSet + Rx3IsAtTheRightExtremityOfTheLeafSet - Rx4IsActiveAndNotInTheLeafSet + Rx4IsAtTheRightExtremityOfTheLeafSet = 0
inv : Node1IsActive + NodesCanDetectThatNode1HasCrashed = 1
inv : Lx1IsActiveAndNotInTheLeafSet + Lx2IsAtTheLeftExtremityOfTheLeafSet - Lx3IsActiveAndNotInTheLeafSet + Lx3IsAtTheLeftExtremityOfTheLeafSet = 0
inv : Node7IsActive + NodesCanDetectThatNode7HasCrashed = 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 + Node0ThinksNode2ShouldBeNodeMasterToReplaceNode14 + 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 + Node1ThinksNode2ShouldBeNodeMasterToReplaceNode14 + 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 + Node14IsNotifiedThatHeIsTheNewMaster + 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 + Node15ThinksNode2ShouldBeNodeMasterToReplaceNode14 + 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 + Node16ThinksNode2ShouldBeNodeMasterToReplaceNode14 + Node16ThinksNode15ShouldBeNodeMasterToReplaceNode14 + Node16ThinksNode1ShouldBeNodeMasterToReplaceNode14 = 1
inv : Node1NotifyThatHeIsActive + NodesCanDetectThatNode1HasCrashed = 1
inv : Node9NotifyThatHeIsActive + NodesCanDetectThatNode9HasCrashed = 1
inv : Node2NotifyThatHeIsActive + NodesCanDetectThatNode2HasCrashed = 1
inv : Node7NotifyThatHeIsActive + NodesCanDetectThatNode7HasCrashed = 1
Total of 43 invariants.
[2021-05-18 08:45:13] [INFO ] Computed 43 place invariants in 25 ms
[2021-05-18 08:45:21] [INFO ] Proved 959 variables to be positive in 8498 ms
[2021-05-18 08:45:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityFireability-06
[2021-05-18 08:45:22] [INFO ] KInduction solution for property gen-ReachabilityFireability-06(SAT) depth K=0 took 650 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 479
[2021-05-18 08:45:31] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityFireability-06
[2021-05-18 08:45:31] [INFO ] KInduction solution for property gen-ReachabilityFireability-06(SAT) depth K=1 took 8501 ms
[2021-05-18 08:45:54] [INFO ] BMC solution for property gen-ReachabilityFireability-06(UNSAT) depth K=2 took 41261 ms
Compilation finished in 51536 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4605477924177453694]
Link finished in 78 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, genReachabilityFireability06==true], workingDir=/tmp/ltsmin4605477924177453694]
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :479 after 3529
[2021-05-18 08:47:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesgen-ReachabilityFireability-06
[2021-05-18 08:47:08] [INFO ] KInduction solution for property gen-ReachabilityFireability-06(SAT) depth K=2 took 97182 ms
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3529 after 5029
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :5029 after 5184
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :5184 after 5200
LTSmin run took 1249662 ms.
Invariant validated
FORMULA gen-ReachabilityFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
[2021-05-18 09:06:45] [WARNING] Interrupting SMT solver.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-18 09:06:45] [WARNING] Unexpected error occurred while running SMT. Was verifying gen-ReachabilityFireability-06 SMT depth 3
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:411)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:357)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:164)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:385)
... 3 more
[2021-05-18 09:06:45] [INFO ] During BMC, SMT solver timed out at depth 3
[2021-05-18 09:06:45] [INFO ] BMC solving timed out (3600000 secs) at depth 3
[2021-05-18 09:06:45] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
[2021-05-18 09:06:45] [WARNING] Unexpected error occurred while running SMT. Was verifying gen-ReachabilityFireability-06 K-induction depth 3
Exception in thread "Thread-30" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:344)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:279)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Failed to check-sat")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:306)
... 3 more
[2021-05-18 09:06:45] [INFO ] SMT solved 0/ 1 properties. Interrupting SMT analysis.
ITS tools runner thread asked to quit. Dying gracefully.
BK_STOP 1621328806498
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MultiCrashLeafsetExtension-PT-S16C05"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S16C05, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156700599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MultiCrashLeafsetExtension-PT-S16C05.tgz
mv MultiCrashLeafsetExtension-PT-S16C05 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;