Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.3K Apr 30 09:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 30 09:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 30 09:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Apr 30 09:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 30 09:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 30 09:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 30 09:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 30 09:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 45K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1655068460930

Running Version 0
[2022-06-12 21:14:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 21:14:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:14:22] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
[2022-06-12 21:14:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-06-12 21:14:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 516 ms
[2022-06-12 21:14:23] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 864 PT places and 1398.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-5-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-5-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-12 21:14:23] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2022-06-12 21:14:23] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_7939019374719762063.dot
Reduce places removed 2 places and 0 transitions.
Finished random walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
[2022-06-12 21:14:23] [INFO ] Flatten gal took : 40 ms
[2022-06-12 21:14:23] [INFO ] Flatten gal took : 2 ms
[2022-06-12 21:14:23] [INFO ] Unfolded HLPN to a Petri net with 864 places and 1302 transitions in 32 ms.
[2022-06-12 21:14:23] [INFO ] Unfolded HLPN properties in 2 ms.
Successfully produced net in file /tmp/petri1001_3042315977049549587.dot
[2022-06-12 21:14:23] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 30 places in 10 ms
Reduce places removed 30 places and 60 transitions.
FORMULA Peterson-COL-5-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 11) seen :8
FORMULA Peterson-COL-5-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-5-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 384 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 673 ms. (steps per millisecond=14 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-06-12 21:14:24] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-06-12 21:14:24] [INFO ] Computed 23 place invariants in 28 ms
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using 17 positive place invariants in 45 ms returned sat
[2022-06-12 21:14:25] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 12 ms returned sat
[2022-06-12 21:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:26] [INFO ] [Real]Absence check using state equation in 1250 ms returned sat
[2022-06-12 21:14:26] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-06-12 21:14:26] [INFO ] [Real]Added 230 Read/Feed constraints in 47 ms returned sat
[2022-06-12 21:14:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 29 ms returned sat
[2022-06-12 21:14:26] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 10 ms returned sat
[2022-06-12 21:14:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:28] [INFO ] [Nat]Absence check using state equation in 1187 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Nat]Added 230 Read/Feed constraints in 48 ms returned sat
[2022-06-12 21:14:28] [INFO ] Deduced a trap composed of 37 places in 333 ms of which 3 ms to minimize.
[2022-06-12 21:14:28] [INFO ] Deduced a trap composed of 11 places in 298 ms of which 2 ms to minimize.
[2022-06-12 21:14:29] [INFO ] Deduced a trap composed of 71 places in 239 ms of which 1 ms to minimize.
[2022-06-12 21:14:29] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 1 ms to minimize.
[2022-06-12 21:14:29] [INFO ] Deduced a trap composed of 15 places in 235 ms of which 2 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 167 places in 250 ms of which 2 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 11 places in 233 ms of which 0 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2612 ms
[2022-06-12 21:14:30] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 72 ms.
[2022-06-12 21:14:31] [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
[2022-06-12 21:14:31] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2022-06-12 21:14:31] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 9 ms returned sat
[2022-06-12 21:14:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:32] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2022-06-12 21:14:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2022-06-12 21:14:32] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 17 ms returned sat
[2022-06-12 21:14:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:33] [INFO ] [Nat]Absence check using state equation in 730 ms returned sat
[2022-06-12 21:14:33] [INFO ] [Nat]Added 230 Read/Feed constraints in 51 ms returned sat
[2022-06-12 21:14:33] [INFO ] Deduced a trap composed of 30 places in 205 ms of which 1 ms to minimize.
[2022-06-12 21:14:34] [INFO ] Deduced a trap composed of 56 places in 222 ms of which 1 ms to minimize.
[2022-06-12 21:14:34] [INFO ] Deduced a trap composed of 61 places in 210 ms of which 1 ms to minimize.
[2022-06-12 21:14:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 867 ms
[2022-06-12 21:14:34] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 74 ms.
[2022-06-12 21:14:37] [INFO ] Added : 215 causal constraints over 43 iterations in 3245 ms. Result :unknown
[2022-06-12 21:14:37] [INFO ] [Real]Absence check using 17 positive place invariants in 61 ms returned sat
[2022-06-12 21:14:37] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 19 ms returned sat
[2022-06-12 21:14:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:39] [INFO ] [Real]Absence check using state equation in 1763 ms returned sat
[2022-06-12 21:14:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:39] [INFO ] [Nat]Absence check using 17 positive place invariants in 192 ms returned sat
[2022-06-12 21:14:39] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 24 ms returned sat
[2022-06-12 21:14:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:41] [INFO ] [Nat]Absence check using state equation in 1888 ms returned sat
[2022-06-12 21:14:41] [INFO ] [Nat]Added 230 Read/Feed constraints in 72 ms returned sat
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 71 places in 235 ms of which 1 ms to minimize.
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 1 ms to minimize.
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 1 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 128 places in 243 ms of which 1 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 28 places in 232 ms of which 0 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 127 places in 217 ms of which 1 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 127 places in 230 ms of which 1 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 154 places in 164 ms of which 1 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 1 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:14:44] [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 2
Fused 3 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 118600 steps, including 1000 resets, run finished after 1191 ms. (steps per millisecond=99 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA Peterson-COL-5-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 654 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 53 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
[2022-06-12 21:14:46] [INFO ] Flatten gal took : 110 ms
[2022-06-12 21:14:46] [INFO ] Flatten gal took : 72 ms
[2022-06-12 21:14:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5180904927168527163.gal : 21 ms
[2022-06-12 21:14:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8264943572599845536.prop : 8 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality5180904927168527163.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8264943572599845536.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/ReachabilityCardinality5180904927168527163.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8264943572599845536.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8264943572599845536.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 18
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :18 after 36
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :36 after 42
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :42 after 214
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :214 after 268
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :268 after 488
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :488 after 1722
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :1722 after 4638
Detected timeout of ITS tools.
[2022-06-12 21:15:01] [INFO ] Flatten gal took : 62 ms
[2022-06-12 21:15:01] [INFO ] Applying decomposition
[2022-06-12 21:15:01] [INFO ] Flatten gal took : 55 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/graph198301504746300401.txt, -o, /tmp/graph198301504746300401.bin, -w, /tmp/graph198301504746300401.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/graph198301504746300401.bin, -l, -1, -v, -w, /tmp/graph198301504746300401.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:15:01] [INFO ] Decomposing Gal with order
[2022-06-12 21:15:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:15:02] [INFO ] Removed a total of 1033 redundant transitions.
[2022-06-12 21:15:02] [INFO ] Flatten gal took : 180 ms
[2022-06-12 21:15:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2022-06-12 21:15:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5806535219307767441.gal : 29 ms
[2022-06-12 21:15:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14721409484466546531.prop : 33 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/ReachabilityCardinality5806535219307767441.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality14721409484466546531.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/ReachabilityCardinality5806535219307767441.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality14721409484466546531.prop --nowitness
Loading property file /tmp/ReachabilityCardinality14721409484466546531.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 60
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :60 after 240
Invariant property Peterson-COL-5-ReachabilityFireability-03 does not hold.
FORMULA Peterson-COL-5-ReachabilityFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :240 after 261347
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13079014649070509363
[2022-06-12 21:15:17] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13079014649070509363
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/ltsmin13079014649070509363]
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/ltsmin13079014649070509363] 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/ltsmin13079014649070509363] 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 2 resets, run finished after 6656 ms. (steps per millisecond=150 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 77966 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=15 ) properties seen :{}
Interrupted probabilistic random walk after 6002801 steps, run timeout after 30001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 6002801 steps, saw 1002309 distinct states, run finished after 30001 ms. (steps per millisecond=200 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 21:16:00] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-06-12 21:16:00] [INFO ] Computed 23 place invariants in 15 ms
[2022-06-12 21:16:00] [INFO ] [Real]Absence check using 17 positive place invariants in 57 ms returned sat
[2022-06-12 21:16:00] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 23 ms returned sat
[2022-06-12 21:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:02] [INFO ] [Real]Absence check using state equation in 1682 ms returned sat
[2022-06-12 21:16:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 183 ms returned sat
[2022-06-12 21:16:02] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2022-06-12 21:16:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:04] [INFO ] [Nat]Absence check using state equation in 1857 ms returned sat
[2022-06-12 21:16:04] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-06-12 21:16:04] [INFO ] [Nat]Added 230 Read/Feed constraints in 67 ms returned sat
[2022-06-12 21:16:04] [INFO ] Deduced a trap composed of 71 places in 221 ms of which 1 ms to minimize.
[2022-06-12 21:16:04] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 1 ms to minimize.
[2022-06-12 21:16:05] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 1 ms to minimize.
[2022-06-12 21:16:05] [INFO ] Deduced a trap composed of 128 places in 222 ms of which 1 ms to minimize.
[2022-06-12 21:16:05] [INFO ] Deduced a trap composed of 28 places in 223 ms of which 1 ms to minimize.
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 127 places in 211 ms of which 0 ms to minimize.
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 127 places in 208 ms of which 0 ms to minimize.
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 154 places in 170 ms of which 0 ms to minimize.
[2022-06-12 21:16:06] [INFO ] Deduced a trap composed of 52 places in 165 ms of which 1 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 2 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 100 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 152 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:16:07] [INFO ] Deduced a trap composed of 122 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:16:08] [INFO ] Deduced a trap composed of 120 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:16:08] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:16:08] [INFO ] Deduced a trap composed of 96 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:16:08] [INFO ] Deduced a trap composed of 28 places in 181 ms of which 0 ms to minimize.
[2022-06-12 21:16:09] [INFO ] Deduced a trap composed of 98 places in 201 ms of which 1 ms to minimize.
[2022-06-12 21:16:09] [INFO ] Deduced a trap composed of 97 places in 186 ms of which 0 ms to minimize.
[2022-06-12 21:16:09] [INFO ] Deduced a trap composed of 75 places in 191 ms of which 0 ms to minimize.
[2022-06-12 21:16:09] [INFO ] Deduced a trap composed of 85 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 11 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 102 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 100 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:16:10] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
[2022-06-12 21:16:11] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 19 places in 170 ms of which 0 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 23 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 105 places in 162 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 130 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 158 places in 170 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 114 places in 169 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 78 places in 169 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 30 places in 162 ms of which 1 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 1 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 0 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 82 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 0 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 0 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 14 places in 219 ms of which 2 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 100 places in 211 ms of which 1 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 4 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 142 places in 225 ms of which 1 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 53 places in 240 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 39 places in 219 ms of which 1 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 1 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 78 places in 220 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 40 places in 216 ms of which 1 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 78 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 126 places in 153 ms of which 1 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 126 places in 157 ms of which 0 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 126 places in 151 ms of which 0 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 101 places in 148 ms of which 1 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 106 places in 158 ms of which 0 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 57 places in 225 ms of which 1 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 61 places in 228 ms of which 1 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 15 places in 246 ms of which 1 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 122 places in 232 ms of which 1 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 123 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 1 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 39 places in 244 ms of which 1 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 122 places in 214 ms of which 1 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 20 places in 220 ms of which 1 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 135 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 83 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 104 places in 196 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 80 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 131 places in 189 ms of which 1 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 1 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 104 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:16:24] [INFO ] Deduced a trap composed of 130 places in 171 ms of which 0 ms to minimize.
[2022-06-12 21:16:25] [INFO ] Deduced a trap composed of 140 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:16:25] [INFO ] Deduced a trap composed of 130 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:16:25] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 0 ms to minimize.
[2022-06-12 21:16:26] [INFO ] Deduced a trap composed of 110 places in 197 ms of which 0 ms to minimize.
[2022-06-12 21:16:26] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 1 ms to minimize.
[2022-06-12 21:16:26] [INFO ] Deduced a trap composed of 63 places in 201 ms of which 1 ms to minimize.
[2022-06-12 21:16:27] [INFO ] Deduced a trap composed of 22 places in 210 ms of which 0 ms to minimize.
[2022-06-12 21:16:27] [INFO ] Deduced a trap composed of 111 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:16:27] [INFO ] Deduced a trap composed of 111 places in 194 ms of which 1 ms to minimize.
[2022-06-12 21:16:27] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 0 ms to minimize.
[2022-06-12 21:16:28] [INFO ] Deduced a trap composed of 154 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:16:28] [INFO ] Deduced a trap composed of 175 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:16:28] [INFO ] Deduced a trap composed of 132 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 111 places in 210 ms of which 1 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 106 places in 199 ms of which 0 ms to minimize.
[2022-06-12 21:16:29] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 1 ms to minimize.
[2022-06-12 21:16:30] [INFO ] Deduced a trap composed of 11 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:16:30] [INFO ] Deduced a trap composed of 244 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:16:30] [INFO ] Deduced a trap composed of 119 places in 212 ms of which 1 ms to minimize.
[2022-06-12 21:16:31] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:16:31] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:16:31] [INFO ] Deduced a trap composed of 48 places in 196 ms of which 1 ms to minimize.
[2022-06-12 21:16:31] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 1 ms to minimize.
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 0 ms to minimize.
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 41 places in 190 ms of which 1 ms to minimize.
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 128 places in 189 ms of which 1 ms to minimize.
[2022-06-12 21:16:32] [INFO ] Deduced a trap composed of 93 places in 140 ms of which 1 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:16:33] [INFO ] Deduced a trap composed of 58 places in 211 ms of which 1 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 219 places in 188 ms of which 0 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 106 places in 168 ms of which 1 ms to minimize.
[2022-06-12 21:16:34] [INFO ] Deduced a trap composed of 111 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 37 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 63 places in 203 ms of which 1 ms to minimize.
[2022-06-12 21:16:35] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 1 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 0 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 95 places in 187 ms of which 1 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 89 places in 180 ms of which 0 ms to minimize.
[2022-06-12 21:16:36] [INFO ] Deduced a trap composed of 94 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:16:37] [INFO ] Deduced a trap composed of 30 places in 197 ms of which 1 ms to minimize.
[2022-06-12 21:16:37] [INFO ] Deduced a trap composed of 127 places in 189 ms of which 0 ms to minimize.
[2022-06-12 21:16:37] [INFO ] Deduced a trap composed of 37 places in 190 ms of which 0 ms to minimize.
[2022-06-12 21:16:38] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:16:39] [INFO ] Deduced a trap composed of 69 places in 198 ms of which 1 ms to minimize.
[2022-06-12 21:16:39] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 1 ms to minimize.
[2022-06-12 21:16:39] [INFO ] Deduced a trap composed of 100 places in 170 ms of which 0 ms to minimize.
[2022-06-12 21:16:40] [INFO ] Deduced a trap composed of 77 places in 170 ms of which 0 ms to minimize.
[2022-06-12 21:16:40] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 0 ms to minimize.
[2022-06-12 21:16:40] [INFO ] Deduced a trap composed of 71 places in 189 ms of which 1 ms to minimize.
[2022-06-12 21:16:40] [INFO ] Trap strengthening (SAT) tested/added 129/128 trap constraints in 36423 ms
[2022-06-12 21:16:40] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 59 ms.
[2022-06-12 21:16:47] [INFO ] Added : 350 causal constraints over 70 iterations in 6334 ms. Result :unknown
Incomplete Parikh walk after 536300 steps, including 1000 resets, run finished after 4277 ms. (steps per millisecond=125 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 648 out of 834 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 62 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
Starting structural reductions, iteration 0 : 834/834 places, 1242/1242 transitions.
Applied a total of 0 rules in 24 ms. Remains 834 /834 variables (removed 0) and now considering 1242/1242 (removed 0) transitions.
[2022-06-12 21:16:51] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-06-12 21:16:51] [INFO ] Computed 23 place invariants in 6 ms
[2022-06-12 21:16:51] [INFO ] Implicit Places using invariants in 123 ms returned []
[2022-06-12 21:16:51] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-06-12 21:16:51] [INFO ] Computed 23 place invariants in 6 ms
[2022-06-12 21:16:51] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-06-12 21:16:51] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2022-06-12 21:16:52] [INFO ] Redundant transitions in 79 ms returned []
[2022-06-12 21:16:52] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-06-12 21:16:52] [INFO ] Computed 23 place invariants in 8 ms
[2022-06-12 21:16:52] [INFO ] Dead Transitions using invariants and state equation in 472 ms returned []
Finished structural reductions, in 1 iterations. Remains : 834/834 places, 1242/1242 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 715 ms. (steps per millisecond=139 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-12 21:16:53] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2022-06-12 21:16:53] [INFO ] Computed 23 place invariants in 9 ms
[2022-06-12 21:16:53] [INFO ] [Real]Absence check using 17 positive place invariants in 60 ms returned sat
[2022-06-12 21:16:53] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 19 ms returned sat
[2022-06-12 21:16:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:55] [INFO ] [Real]Absence check using state equation in 1722 ms returned sat
[2022-06-12 21:16:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:55] [INFO ] [Nat]Absence check using 17 positive place invariants in 182 ms returned sat
[2022-06-12 21:16:55] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 22 ms returned sat
[2022-06-12 21:16:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:57] [INFO ] [Nat]Absence check using state equation in 1831 ms returned sat
[2022-06-12 21:16:57] [INFO ] State equation strengthened by 230 read => feed constraints.
[2022-06-12 21:16:57] [INFO ] [Nat]Added 230 Read/Feed constraints in 64 ms returned sat
[2022-06-12 21:16:57] [INFO ] Deduced a trap composed of 71 places in 215 ms of which 1 ms to minimize.
[2022-06-12 21:16:58] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 1 ms to minimize.
[2022-06-12 21:16:58] [INFO ] Deduced a trap composed of 54 places in 223 ms of which 1 ms to minimize.
[2022-06-12 21:16:58] [INFO ] Deduced a trap composed of 128 places in 241 ms of which 0 ms to minimize.
[2022-06-12 21:16:58] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 0 ms to minimize.
[2022-06-12 21:16:59] [INFO ] Deduced a trap composed of 127 places in 207 ms of which 1 ms to minimize.
[2022-06-12 21:16:59] [INFO ] Deduced a trap composed of 127 places in 211 ms of which 1 ms to minimize.
[2022-06-12 21:16:59] [INFO ] Deduced a trap composed of 154 places in 163 ms of which 0 ms to minimize.
[2022-06-12 21:16:59] [INFO ] Deduced a trap composed of 52 places in 163 ms of which 0 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 1 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 100 places in 185 ms of which 1 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 152 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:17:00] [INFO ] Deduced a trap composed of 122 places in 189 ms of which 0 ms to minimize.
[2022-06-12 21:17:01] [INFO ] Deduced a trap composed of 120 places in 173 ms of which 1 ms to minimize.
[2022-06-12 21:17:01] [INFO ] Deduced a trap composed of 44 places in 185 ms of which 0 ms to minimize.
[2022-06-12 21:17:01] [INFO ] Deduced a trap composed of 96 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:17:01] [INFO ] Deduced a trap composed of 28 places in 180 ms of which 1 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 98 places in 189 ms of which 0 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 97 places in 186 ms of which 0 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:17:02] [INFO ] Deduced a trap composed of 85 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:17:03] [INFO ] Deduced a trap composed of 77 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:17:03] [INFO ] Deduced a trap composed of 102 places in 183 ms of which 1 ms to minimize.
[2022-06-12 21:17:03] [INFO ] Deduced a trap composed of 100 places in 183 ms of which 0 ms to minimize.
[2022-06-12 21:17:03] [INFO ] Deduced a trap composed of 74 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:17:04] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 0 ms to minimize.
[2022-06-12 21:17:04] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 1 ms to minimize.
[2022-06-12 21:17:04] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 0 ms to minimize.
[2022-06-12 21:17:04] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 1 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 26 places in 169 ms of which 1 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 1 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 0 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 23 places in 158 ms of which 0 ms to minimize.
[2022-06-12 21:17:05] [INFO ] Deduced a trap composed of 105 places in 164 ms of which 1 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 130 places in 172 ms of which 0 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 158 places in 165 ms of which 1 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 114 places in 156 ms of which 0 ms to minimize.
[2022-06-12 21:17:06] [INFO ] Deduced a trap composed of 78 places in 156 ms of which 0 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 30 places in 152 ms of which 0 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 0 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:17:07] [INFO ] Deduced a trap composed of 82 places in 176 ms of which 1 ms to minimize.
[2022-06-12 21:17:08] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 0 ms to minimize.
[2022-06-12 21:17:08] [INFO ] Deduced a trap composed of 40 places in 222 ms of which 0 ms to minimize.
[2022-06-12 21:17:08] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 1 ms to minimize.
[2022-06-12 21:17:09] [INFO ] Deduced a trap composed of 100 places in 206 ms of which 0 ms to minimize.
[2022-06-12 21:17:09] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 1 ms to minimize.
[2022-06-12 21:17:09] [INFO ] Deduced a trap composed of 142 places in 225 ms of which 1 ms to minimize.
[2022-06-12 21:17:10] [INFO ] Deduced a trap composed of 53 places in 227 ms of which 1 ms to minimize.
[2022-06-12 21:17:10] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 1 ms to minimize.
[2022-06-12 21:17:10] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 1 ms to minimize.
[2022-06-12 21:17:10] [INFO ] Deduced a trap composed of 78 places in 210 ms of which 0 ms to minimize.
[2022-06-12 21:17:11] [INFO ] Deduced a trap composed of 40 places in 211 ms of which 0 ms to minimize.
[2022-06-12 21:17:11] [INFO ] Deduced a trap composed of 78 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:17:11] [INFO ] Deduced a trap composed of 126 places in 149 ms of which 1 ms to minimize.
[2022-06-12 21:17:11] [INFO ] Deduced a trap composed of 126 places in 152 ms of which 0 ms to minimize.
[2022-06-12 21:17:12] [INFO ] Deduced a trap composed of 126 places in 145 ms of which 1 ms to minimize.
[2022-06-12 21:17:12] [INFO ] Deduced a trap composed of 101 places in 149 ms of which 1 ms to minimize.
[2022-06-12 21:17:12] [INFO ] Deduced a trap composed of 106 places in 151 ms of which 0 ms to minimize.
[2022-06-12 21:17:12] [INFO ] Deduced a trap composed of 57 places in 228 ms of which 1 ms to minimize.
[2022-06-12 21:17:13] [INFO ] Deduced a trap composed of 61 places in 233 ms of which 1 ms to minimize.
[2022-06-12 21:17:13] [INFO ] Deduced a trap composed of 15 places in 227 ms of which 0 ms to minimize.
[2022-06-12 21:17:13] [INFO ] Deduced a trap composed of 122 places in 224 ms of which 0 ms to minimize.
[2022-06-12 21:17:14] [INFO ] Deduced a trap composed of 123 places in 174 ms of which 1 ms to minimize.
[2022-06-12 21:17:14] [INFO ] Deduced a trap composed of 63 places in 234 ms of which 1 ms to minimize.
[2022-06-12 21:17:14] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 1 ms to minimize.
[2022-06-12 21:17:14] [INFO ] Deduced a trap composed of 122 places in 202 ms of which 1 ms to minimize.
[2022-06-12 21:17:15] [INFO ] Deduced a trap composed of 20 places in 212 ms of which 3 ms to minimize.
[2022-06-12 21:17:15] [INFO ] Deduced a trap composed of 2 places in 266 ms of which 1 ms to minimize.
[2022-06-12 21:17:15] [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
[2022-06-12 21:17:15] [INFO ] Flatten gal took : 53 ms
[2022-06-12 21:17:15] [INFO ] Flatten gal took : 39 ms
[2022-06-12 21:17:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18105947529929705091.gal : 4 ms
[2022-06-12 21:17:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16631849184180458722.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality18105947529929705091.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16631849184180458722.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/ReachabilityCardinality18105947529929705091.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16631849184180458722.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16631849184180458722.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 17
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :17 after 18
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :18 after 36
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :36 after 42
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :42 after 214
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :214 after 268
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :268 after 488
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :488 after 1722
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1722 after 4638
Detected timeout of ITS tools.
[2022-06-12 21:17:30] [INFO ] Flatten gal took : 36 ms
[2022-06-12 21:17:30] [INFO ] Applying decomposition
[2022-06-12 21:17:30] [INFO ] Flatten gal took : 34 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/graph12338616973296676980.txt, -o, /tmp/graph12338616973296676980.bin, -w, /tmp/graph12338616973296676980.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/graph12338616973296676980.bin, -l, -1, -v, -w, /tmp/graph12338616973296676980.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:17:30] [INFO ] Decomposing Gal with order
[2022-06-12 21:17:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:17:30] [INFO ] Removed a total of 1035 redundant transitions.
[2022-06-12 21:17:30] [INFO ] Flatten gal took : 67 ms
[2022-06-12 21:17:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2022-06-12 21:17:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality560584972071317061.gal : 8 ms
[2022-06-12 21:17:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11587038735395168545.prop : 3 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/ReachabilityCardinality560584972071317061.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11587038735395168545.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/ReachabilityCardinality560584972071317061.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11587038735395168545.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11587038735395168545.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 3044
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3044 after 54650
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8486461093236330189
[2022-06-12 21:17:46] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8486461093236330189
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/ltsmin8486461093236330189]
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/ltsmin8486461093236330189] 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/ltsmin8486461093236330189] 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)
Ensure Unique test removed 120 transitions
Reduce isomorphic transitions removed 120 transitions.
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 834 transition count 1122
Applied a total of 120 rules in 38 ms. Remains 834 /834 variables (removed 0) and now considering 1122/1242 (removed 120) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1122 rows 834 cols
[2022-06-12 21:17:47] [INFO ] Computed 23 place invariants in 3 ms
[2022-06-12 21:17:47] [INFO ] [Real]Absence check using 17 positive place invariants in 63 ms returned sat
[2022-06-12 21:17:47] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 28 ms returned sat
[2022-06-12 21:17:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:49] [INFO ] [Real]Absence check using state equation in 1836 ms returned sat
[2022-06-12 21:17:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:49] [INFO ] [Nat]Absence check using 17 positive place invariants in 195 ms returned sat
[2022-06-12 21:17:49] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 14 ms returned sat
[2022-06-12 21:17:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:51] [INFO ] [Nat]Absence check using state equation in 1873 ms returned sat
[2022-06-12 21:17:51] [INFO ] Computed and/alt/rep : 1056/1717/1056 causal constraints (skipped 60 transitions) in 54 ms.
[2022-06-12 21:18:06] [INFO ] Added : 841 causal constraints over 169 iterations in 14732 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-06-12 21:18:06] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13696818831017238674
[2022-06-12 21:18:06] [INFO ] Computing symmetric may disable matrix : 1242 transitions.
[2022-06-12 21:18:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:18:06] [INFO ] Computing symmetric may enable matrix : 1242 transitions.
[2022-06-12 21:18:06] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:18:06] [INFO ] Flatten gal took : 52 ms
[2022-06-12 21:18:06] [INFO ] Applying decomposition
[2022-06-12 21:18:06] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-06-12 21:18:06] [INFO ] Flatten gal took : 79 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/graph11183980098380402806.txt, -o, /tmp/graph11183980098380402806.bin, -w, /tmp/graph11183980098380402806.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/graph11183980098380402806.bin, -l, -1, -v, -w, /tmp/graph11183980098380402806.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:18:06] [INFO ] Decomposing Gal with order
[2022-06-12 21:18:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:18:07] [INFO ] Removed a total of 1033 redundant transitions.
[2022-06-12 21:18:07] [INFO ] Computing Do-Not-Accords matrix : 1242 transitions.
[2022-06-12 21:18:07] [INFO ] Flatten gal took : 145 ms
[2022-06-12 21:18:07] [INFO ] Computation of Completed DNA matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:18:07] [INFO ] Built C files in 559ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13696818831017238674
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/ltsmin13696818831017238674]
[2022-06-12 21:18:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-06-12 21:18:07] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability5400594425631050471.gal : 7 ms
[2022-06-12 21:18:07] [INFO ] Ran tautology test, simplified 0 / 1 in 604 ms.
[2022-06-12 21:18:07] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2822248105909509559.prop : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityFireability5400594425631050471.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability2822248105909509559.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/ReachabilityFireability5400594425631050471.gal -t CGAL -reachable-file /tmp/ReachabilityFireability2822248105909509559.prop --nowitness
[2022-06-12 21:18:07] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityFireability-08(UNSAT) depth K=0 took 61 ms
Loading property file /tmp/ReachabilityFireability2822248105909509559.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 1122 out of 1242 initially.
// Phase 1: matrix 1122 rows 834 cols
[2022-06-12 21:18:07] [INFO ] Computed 23 place invariants in 3 ms
inv : Turn_24 + Turn_25 + Turn_26 + Turn_27 + Turn_28 + Turn_29 = 1
inv : Idle_4 + AskForSection_20 + AskForSection_21 + AskForSection_22 + AskForSection_23 + AskForSection_24 + TestTurn_20 + TestTurn_21 + TestTurn_22 + TestTurn_23 + TestTurn_24 + BeginLoop_120 + BeginLoop_121 + BeginLoop_122 + BeginLoop_123 + BeginLoop_124 + BeginLoop_125 + BeginLoop_126 + BeginLoop_127 + BeginLoop_128 + BeginLoop_129 + BeginLoop_130 + BeginLoop_131 + BeginLoop_132 + BeginLoop_133 + BeginLoop_134 + BeginLoop_135 + BeginLoop_136 + BeginLoop_137 + BeginLoop_138 + BeginLoop_139 + BeginLoop_140 + BeginLoop_141 + BeginLoop_142 + BeginLoop_143 + BeginLoop_144 + BeginLoop_145 + BeginLoop_146 + BeginLoop_147 + BeginLoop_148 + BeginLoop_149 + EndTurn_20 + EndTurn_21 + EndTurn_22 + EndTurn_23 + EndTurn_24 + CS_4 + TestIdentity_120 + TestIdentity_121 + TestIdentity_122 + TestIdentity_123 + TestIdentity_124 + TestIdentity_125 + TestIdentity_126 + TestIdentity_127 + TestIdentity_128 + TestIdentity_129 + TestIdentity_130 + TestIdentity_131 + TestIdentity_132 + TestIdentity_133 + TestIdentity_134 + TestIdentity_135 + TestIdentity_136 + TestIdentity_137 + TestIdentity_138 + TestIdentity_139 + TestIdentity_140 + TestIdentity_141 + TestIdentity_142 + TestIdentity_143 + TestIdentity_144 + TestIdentity_145 + TestIdentity_146 + TestIdentity_147 + TestIdentity_148 + TestIdentity_149 + TestAlone_120 + TestAlone_121 + TestAlone_122 + TestAlone_123 + TestAlone_125 + TestAlone_126 + TestAlone_127 + TestAlone_128 + TestAlone_129 + TestAlone_131 + TestAlone_132 + TestAlone_133 + TestAlone_134 + TestAlone_135 + TestAlone_137 + TestAlone_138 + TestAlone_139 + TestAlone_140 + TestAlone_141 + TestAlone_143 + TestAlone_144 + TestAlone_145 + TestAlone_146 + TestAlone_147 + TestAlone_149 + IsEndLoop_120 + IsEndLoop_121 + IsEndLoop_122 + IsEndLoop_123 + IsEndLoop_124 + IsEndLoop_125 + IsEndLoop_126 + IsEndLoop_127 + IsEndLoop_128 + IsEndLoop_129 + IsEndLoop_130 + IsEndLoop_131 + IsEndLoop_132 + IsEndLoop_133 + IsEndLoop_134 + IsEndLoop_135 + IsEndLoop_136 + IsEndLoop_137 + IsEndLoop_138 + IsEndLoop_139 + IsEndLoop_140 + IsEndLoop_141 + IsEndLoop_142 + IsEndLoop_143 + IsEndLoop_144 + IsEndLoop_145 + IsEndLoop_146 + IsEndLoop_147 + IsEndLoop_148 + IsEndLoop_149 = 1
inv : WantSection_3 - AskForSection_5 - AskForSection_6 - AskForSection_7 - AskForSection_8 - AskForSection_9 - TestTurn_5 - TestTurn_6 - TestTurn_7 - TestTurn_8 - TestTurn_9 - BeginLoop_30 - BeginLoop_31 - BeginLoop_32 - BeginLoop_33 - BeginLoop_34 - BeginLoop_35 - BeginLoop_36 - BeginLoop_37 - BeginLoop_38 - BeginLoop_39 - BeginLoop_40 - BeginLoop_41 - BeginLoop_42 - BeginLoop_43 - BeginLoop_44 - BeginLoop_45 - BeginLoop_46 - BeginLoop_47 - BeginLoop_48 - BeginLoop_49 - BeginLoop_50 - BeginLoop_51 - BeginLoop_52 - BeginLoop_53 - BeginLoop_54 - BeginLoop_55 - BeginLoop_56 - BeginLoop_57 - BeginLoop_58 - BeginLoop_59 - EndTurn_5 - EndTurn_6 - EndTurn_7 - EndTurn_8 - EndTurn_9 - CS_1 - TestIdentity_30 - TestIdentity_31 - TestIdentity_32 - TestIdentity_33 - TestIdentity_34 - TestIdentity_35 - TestIdentity_36 - TestIdentity_37 - TestIdentity_38 - TestIdentity_39 - TestIdentity_40 - TestIdentity_41 - TestIdentity_42 - TestIdentity_43 - TestIdentity_44 - TestIdentity_45 - TestIdentity_46 - TestIdentity_47 - TestIdentity_48 - TestIdentity_49 - TestIdentity_50 - TestIdentity_51 - TestIdentity_52 - TestIdentity_53 - TestIdentity_54 - TestIdentity_55 - TestIdentity_56 - TestIdentity_57 - TestIdentity_58 - TestIdentity_59 - TestAlone_30 - TestAlone_32 - TestAlone_33 - TestAlone_34 - TestAlone_35 - TestAlone_36 - TestAlone_38 - TestAlone_39 - TestAlone_40 - TestAlone_41 - TestAlone_42 - TestAlone_44 - TestAlone_45 - TestAlone_46 - TestAlone_47 - TestAlone_48 - TestAlone_50 - TestAlone_51 - TestAlone_52 - TestAlone_53 - TestAlone_54 - TestAlone_56 - TestAlone_57 - TestAlone_58 - TestAlone_59 - IsEndLoop_30 - IsEndLoop_31 - IsEndLoop_32 - IsEndLoop_33 - IsEndLoop_34 - IsEndLoop_35 - IsEndLoop_36 - IsEndLoop_37 - IsEndLoop_38 - IsEndLoop_39 - IsEndLoop_40 - IsEndLoop_41 - IsEndLoop_42 - IsEndLoop_43 - IsEndLoop_44 - IsEndLoop_45 - IsEndLoop_46 - IsEndLoop_47 - IsEndLoop_48 - IsEndLoop_49 - IsEndLoop_50 - IsEndLoop_51 - IsEndLoop_52 - IsEndLoop_53 - IsEndLoop_54 - IsEndLoop_55 - IsEndLoop_56 - IsEndLoop_57 - IsEndLoop_58 - IsEndLoop_59 = 0
inv : Idle_5 + AskForSection_25 + AskForSection_26 + AskForSection_27 + AskForSection_28 + AskForSection_29 + TestTurn_25 + TestTurn_26 + TestTurn_27 + TestTurn_28 + TestTurn_29 + BeginLoop_150 + BeginLoop_151 + BeginLoop_152 + BeginLoop_153 + BeginLoop_154 + BeginLoop_155 + BeginLoop_156 + BeginLoop_157 + BeginLoop_158 + BeginLoop_159 + BeginLoop_160 + BeginLoop_161 + BeginLoop_162 + BeginLoop_163 + BeginLoop_164 + BeginLoop_165 + BeginLoop_166 + BeginLoop_167 + BeginLoop_168 + BeginLoop_169 + BeginLoop_170 + BeginLoop_171 + BeginLoop_172 + BeginLoop_173 + BeginLoop_174 + BeginLoop_175 + BeginLoop_176 + BeginLoop_177 + BeginLoop_178 + BeginLoop_179 + EndTurn_25 + EndTurn_26 + EndTurn_27 + EndTurn_28 + EndTurn_29 + CS_5 + TestIdentity_150 + TestIdentity_151 + TestIdentity_152 + TestIdentity_153 + TestIdentity_154 + TestIdentity_155 + TestIdentity_156 + TestIdentity_157 + TestIdentity_158 + TestIdentity_159 + TestIdentity_160 + TestIdentity_161 + TestIdentity_162 + TestIdentity_163 + TestIdentity_164 + TestIdentity_165 + TestIdentity_166 + TestIdentity_167 + TestIdentity_168 + TestIdentity_169 + TestIdentity_170 + TestIdentity_171 + TestIdentity_172 + TestIdentity_173 + TestIdentity_174 + TestIdentity_175 + TestIdentity_176 + TestIdentity_177 + TestIdentity_178 + TestIdentity_179 + TestAlone_150 + TestAlone_151 + TestAlone_152 + TestAlone_153 + TestAlone_154 + TestAlone_156 + TestAlone_157 + TestAlone_158 + TestAlone_159 + TestAlone_160 + TestAlone_162 + TestAlone_163 + TestAlone_164 + TestAlone_165 + TestAlone_166 + TestAlone_168 + TestAlone_169 + TestAlone_170 + TestAlone_171 + TestAlone_172 + TestAlone_174 + TestAlone_175 + TestAlone_176 + TestAlone_177 + TestAlone_178 + IsEndLoop_150 + IsEndLoop_151 + IsEndLoop_152 + IsEndLoop_153 + IsEndLoop_154 + IsEndLoop_155 + IsEndLoop_156 + IsEndLoop_157 + IsEndLoop_158 + IsEndLoop_159 + IsEndLoop_160 + IsEndLoop_161 + IsEndLoop_162 + IsEndLoop_163 + IsEndLoop_164 + IsEndLoop_165 + IsEndLoop_166 + IsEndLoop_167 + IsEndLoop_168 + IsEndLoop_169 + IsEndLoop_170 + IsEndLoop_171 + IsEndLoop_172 + IsEndLoop_173 + IsEndLoop_174 + IsEndLoop_175 + IsEndLoop_176 + IsEndLoop_177 + IsEndLoop_178 + IsEndLoop_179 = 1
inv : WantSection_1 - AskForSection_0 - AskForSection_1 - AskForSection_2 - AskForSection_3 - AskForSection_4 - TestTurn_0 - TestTurn_1 - TestTurn_2 - TestTurn_3 - TestTurn_4 - BeginLoop_0 - BeginLoop_1 - BeginLoop_2 - BeginLoop_3 - BeginLoop_4 - BeginLoop_5 - BeginLoop_6 - BeginLoop_7 - BeginLoop_8 - BeginLoop_9 - BeginLoop_10 - BeginLoop_11 - BeginLoop_12 - BeginLoop_13 - BeginLoop_14 - BeginLoop_15 - BeginLoop_16 - BeginLoop_17 - BeginLoop_18 - BeginLoop_19 - BeginLoop_20 - BeginLoop_21 - BeginLoop_22 - BeginLoop_23 - BeginLoop_24 - BeginLoop_25 - BeginLoop_26 - BeginLoop_27 - BeginLoop_28 - BeginLoop_29 - EndTurn_0 - EndTurn_1 - EndTurn_2 - EndTurn_3 - EndTurn_4 - CS_0 - TestIdentity_0 - TestIdentity_1 - TestIdentity_2 - TestIdentity_3 - TestIdentity_4 - TestIdentity_5 - TestIdentity_6 - TestIdentity_7 - TestIdentity_8 - TestIdentity_9 - TestIdentity_10 - TestIdentity_11 - TestIdentity_12 - TestIdentity_13 - TestIdentity_14 - TestIdentity_15 - TestIdentity_16 - TestIdentity_17 - TestIdentity_18 - TestIdentity_19 - TestIdentity_20 - TestIdentity_21 - TestIdentity_22 - TestIdentity_23 - TestIdentity_24 - TestIdentity_25 - TestIdentity_26 - TestIdentity_27 - TestIdentity_28 - TestIdentity_29 - TestAlone_1 - TestAlone_2 - TestAlone_3 - TestAlone_4 - TestAlone_5 - TestAlone_7 - TestAlone_8 - TestAlone_9 - TestAlone_10 - TestAlone_11 - TestAlone_13 - TestAlone_14 - TestAlone_15 - TestAlone_16 - TestAlone_17 - TestAlone_19 - TestAlone_20 - TestAlone_21 - TestAlone_22 - TestAlone_23 - TestAlone_25 - TestAlone_26 - TestAlone_27 - TestAlone_28 - TestAlone_29 - IsEndLoop_0 - IsEndLoop_1 - IsEndLoop_2 - IsEndLoop_3 - IsEndLoop_4 - IsEndLoop_5 - IsEndLoop_6 - IsEndLoop_7 - IsEndLoop_8 - IsEndLoop_9 - IsEndLoop_10 - IsEndLoop_11 - IsEndLoop_12 - IsEndLoop_13 - IsEndLoop_14 - IsEndLoop_15 - IsEndLoop_16 - IsEndLoop_17 - IsEndLoop_18 - IsEndLoop_19 - IsEndLoop_20 - IsEndLoop_21 - IsEndLoop_22 - IsEndLoop_23 - IsEndLoop_24 - IsEndLoop_25 - IsEndLoop_26 - IsEndLoop_27 - IsEndLoop_28 - IsEndLoop_29 = 0
inv : WantSection_5 - AskForSection_10 - AskForSection_11 - AskForSection_12 - AskForSection_13 - AskForSection_14 - TestTurn_10 - TestTurn_11 - TestTurn_12 - TestTurn_13 - TestTurn_14 - BeginLoop_60 - BeginLoop_61 - BeginLoop_62 - BeginLoop_63 - BeginLoop_64 - BeginLoop_65 - BeginLoop_66 - BeginLoop_67 - BeginLoop_68 - BeginLoop_69 - BeginLoop_70 - BeginLoop_71 - BeginLoop_72 - BeginLoop_73 - BeginLoop_74 - BeginLoop_75 - BeginLoop_76 - BeginLoop_77 - BeginLoop_78 - BeginLoop_79 - BeginLoop_80 - BeginLoop_81 - BeginLoop_82 - BeginLoop_83 - BeginLoop_84 - BeginLoop_85 - BeginLoop_86 - BeginLoop_87 - BeginLoop_88 - BeginLoop_89 - EndTurn_10 - EndTurn_11 - EndTurn_12 - EndTurn_13 - EndTurn_14 - CS_2 - TestIdentity_60 - TestIdentity_61 - TestIdentity_62 - TestIdentity_63 - TestIdentity_64 - TestIdentity_65 - TestIdentity_66 - TestIdentity_67 - TestIdentity_68 - TestIdentity_69 - TestIdentity_70 - TestIdentity_71 - TestIdentity_72 - TestIdentity_73 - TestIdentity_74 - TestIdentity_75 - TestIdentity_76 - TestIdentity_77 - TestIdentity_78 - TestIdentity_79 - TestIdentity_80 - TestIdentity_81 - TestIdentity_82 - TestIdentity_83 - TestIdentity_84 - TestIdentity_85 - TestIdentity_86 - TestIdentity_87 - TestIdentity_88 - TestIdentity_89 - TestAlone_60 - TestAlone_61 - TestAlone_63 - TestAlone_64 - TestAlone_65 - TestAlone_66 - TestAlone_67 - TestAlone_69 - TestAlone_70 - TestAlone_71 - TestAlone_72 - TestAlone_73 - TestAlone_75 - TestAlone_76 - TestAlone_77 - TestAlone_78 - TestAlone_79 - TestAlone_81 - TestAlone_82 - TestAlone_83 - TestAlone_84 - TestAlone_85 - TestAlone_87 - TestAlone_88 - TestAlone_89 - IsEndLoop_60 - IsEndLoop_61 - IsEndLoop_62 - IsEndLoop_63 - IsEndLoop_64 - IsEndLoop_65 - IsEndLoop_66 - IsEndLoop_67 - IsEndLoop_68 - IsEndLoop_69 - IsEndLoop_70 - IsEndLoop_71 - IsEndLoop_72 - IsEndLoop_73 - IsEndLoop_74 - IsEndLoop_75 - IsEndLoop_76 - IsEndLoop_77 - IsEndLoop_78 - IsEndLoop_79 - IsEndLoop_80 - IsEndLoop_81 - IsEndLoop_82 - IsEndLoop_83 - IsEndLoop_84 - IsEndLoop_85 - IsEndLoop_86 - IsEndLoop_87 - IsEndLoop_88 - IsEndLoop_89 = 0
inv : WantSection_6 + AskForSection_15 + AskForSection_16 + AskForSection_17 + AskForSection_18 + AskForSection_19 + TestTurn_15 + TestTurn_16 + TestTurn_17 + TestTurn_18 + TestTurn_19 + BeginLoop_90 + BeginLoop_91 + BeginLoop_92 + BeginLoop_93 + BeginLoop_94 + BeginLoop_95 + BeginLoop_96 + BeginLoop_97 + BeginLoop_98 + BeginLoop_99 + BeginLoop_100 + BeginLoop_101 + BeginLoop_102 + BeginLoop_103 + BeginLoop_104 + BeginLoop_105 + BeginLoop_106 + BeginLoop_107 + BeginLoop_108 + BeginLoop_109 + BeginLoop_110 + BeginLoop_111 + BeginLoop_112 + BeginLoop_113 + BeginLoop_114 + BeginLoop_115 + BeginLoop_116 + BeginLoop_117 + BeginLoop_118 + BeginLoop_119 + EndTurn_15 + EndTurn_16 + EndTurn_17 + EndTurn_18 + EndTurn_19 + CS_3 + TestIdentity_90 + TestIdentity_91 + TestIdentity_92 + TestIdentity_93 + TestIdentity_94 + TestIdentity_95 + TestIdentity_96 + TestIdentity_97 + TestIdentity_98 + TestIdentity_99 + TestIdentity_100 + TestIdentity_101 + TestIdentity_102 + TestIdentity_103 + TestIdentity_104 + TestIdentity_105 + TestIdentity_106 + TestIdentity_107 + TestIdentity_108 + TestIdentity_109 + TestIdentity_110 + TestIdentity_111 + TestIdentity_112 + TestIdentity_113 + TestIdentity_114 + TestIdentity_115 + TestIdentity_116 + TestIdentity_117 + TestIdentity_118 + TestIdentity_119 + TestAlone_90 + TestAlone_91 + TestAlone_92 + TestAlone_94 + TestAlone_95 + TestAlone_96 + TestAlone_97 + TestAlone_98 + TestAlone_100 + TestAlone_101 + TestAlone_102 + TestAlone_103 + TestAlone_104 + TestAlone_106 + TestAlone_107 + TestAlone_108 + TestAlone_109 + TestAlone_110 + TestAlone_112 + TestAlone_113 + TestAlone_114 + TestAlone_115 + TestAlone_116 + TestAlone_118 + TestAlone_119 + IsEndLoop_90 + IsEndLoop_91 + IsEndLoop_92 + IsEndLoop_93 + IsEndLoop_94 + IsEndLoop_95 + IsEndLoop_96 + IsEndLoop_97 + IsEndLoop_98 + IsEndLoop_99 + IsEndLoop_100 + IsEndLoop_101 + IsEndLoop_102 + IsEndLoop_103 + IsEndLoop_104 + IsEndLoop_105 + IsEndLoop_106 + IsEndLoop_107 + IsEndLoop_108 + IsEndLoop_109 + IsEndLoop_110 + IsEndLoop_111 + IsEndLoop_112 + IsEndLoop_113 + IsEndLoop_114 + IsEndLoop_115 + IsEndLoop_116 + IsEndLoop_117 + IsEndLoop_118 + IsEndLoop_119 = 1
inv : Idle_1 + AskForSection_5 + AskForSection_6 + AskForSection_7 + AskForSection_8 + AskForSection_9 + TestTurn_5 + TestTurn_6 + TestTurn_7 + TestTurn_8 + TestTurn_9 + BeginLoop_30 + BeginLoop_31 + BeginLoop_32 + BeginLoop_33 + BeginLoop_34 + BeginLoop_35 + BeginLoop_36 + BeginLoop_37 + BeginLoop_38 + BeginLoop_39 + BeginLoop_40 + BeginLoop_41 + BeginLoop_42 + BeginLoop_43 + BeginLoop_44 + BeginLoop_45 + BeginLoop_46 + BeginLoop_47 + BeginLoop_48 + BeginLoop_49 + BeginLoop_50 + BeginLoop_51 + BeginLoop_52 + BeginLoop_53 + BeginLoop_54 + BeginLoop_55 + BeginLoop_56 + BeginLoop_57 + BeginLoop_58 + BeginLoop_59 + EndTurn_5 + EndTurn_6 + EndTurn_7 + EndTurn_8 + EndTurn_9 + CS_1 + TestIdentity_30 + TestIdentity_31 + TestIdentity_32 + TestIdentity_33 + TestIdentity_34 + TestIdentity_35 + TestIdentity_36 + TestIdentity_37 + TestIdentity_38 + TestIdentity_39 + TestIdentity_40 + TestIdentity_41 + TestIdentity_42 + TestIdentity_43 + TestIdentity_44 + TestIdentity_45 + TestIdentity_46 + TestIdentity_47 + TestIdentity_48 + TestIdentity_49 + TestIdentity_50 + TestIdentity_51 + TestIdentity_52 + TestIdentity_53 + TestIdentity_54 + TestIdentity_55 + TestIdentity_56 + TestIdentity_57 + TestIdentity_58 + TestIdentity_59 + TestAlone_30 + TestAlone_32 + TestAlone_33 + TestAlone_34 + TestAlone_35 + TestAlone_36 + TestAlone_38 + TestAlone_39 + TestAlone_40 + TestAlone_41 + TestAlone_42 + TestAlone_44 + TestAlone_45 + TestAlone_46 + TestAlone_47 + TestAlone_48 + TestAlone_50 + TestAlone_51 + TestAlone_52 + TestAlone_53 + TestAlone_54 + TestAlone_56 + TestAlone_57 + TestAlone_58 + TestAlone_59 + IsEndLoop_30 + IsEndLoop_31 + IsEndLoop_32 + IsEndLoop_33 + IsEndLoop_34 + IsEndLoop_35 + IsEndLoop_36 + IsEndLoop_37 + IsEndLoop_38 + IsEndLoop_39 + IsEndLoop_40 + IsEndLoop_41 + IsEndLoop_42 + IsEndLoop_43 + IsEndLoop_44 + IsEndLoop_45 + IsEndLoop_46 + IsEndLoop_47 + IsEndLoop_48 + IsEndLoop_49 + IsEndLoop_50 + IsEndLoop_51 + IsEndLoop_52 + IsEndLoop_53 + IsEndLoop_54 + IsEndLoop_55 + IsEndLoop_56 + IsEndLoop_57 + IsEndLoop_58 + IsEndLoop_59 = 1
inv : Idle_3 + AskForSection_15 + AskForSection_16 + AskForSection_17 + AskForSection_18 + AskForSection_19 + TestTurn_15 + TestTurn_16 + TestTurn_17 + TestTurn_18 + TestTurn_19 + BeginLoop_90 + BeginLoop_91 + BeginLoop_92 + BeginLoop_93 + BeginLoop_94 + BeginLoop_95 + BeginLoop_96 + BeginLoop_97 + BeginLoop_98 + BeginLoop_99 + BeginLoop_100 + BeginLoop_101 + BeginLoop_102 + BeginLoop_103 + BeginLoop_104 + BeginLoop_105 + BeginLoop_106 + BeginLoop_107 + BeginLoop_108 + BeginLoop_109 + BeginLoop_110 + BeginLoop_111 + BeginLoop_112 + BeginLoop_113 + BeginLoop_114 + BeginLoop_115 + BeginLoop_116 + BeginLoop_117 + BeginLoop_118 + BeginLoop_119 + EndTurn_15 + EndTurn_16 + EndTurn_17 + EndTurn_18 + EndTurn_19 + CS_3 + TestIdentity_90 + TestIdentity_91 + TestIdentity_92 + TestIdentity_93 + TestIdentity_94 + TestIdentity_95 + TestIdentity_96 + TestIdentity_97 + TestIdentity_98 + TestIdentity_99 + TestIdentity_100 + TestIdentity_101 + TestIdentity_102 + TestIdentity_103 + TestIdentity_104 + TestIdentity_105 + TestIdentity_106 + TestIdentity_107 + TestIdentity_108 + TestIdentity_109 + TestIdentity_110 + TestIdentity_111 + TestIdentity_112 + TestIdentity_113 + TestIdentity_114 + TestIdentity_115 + TestIdentity_116 + TestIdentity_117 + TestIdentity_118 + TestIdentity_119 + TestAlone_90 + TestAlone_91 + TestAlone_92 + TestAlone_94 + TestAlone_95 + TestAlone_96 + TestAlone_97 + TestAlone_98 + TestAlone_100 + TestAlone_101 + TestAlone_102 + TestAlone_103 + TestAlone_104 + TestAlone_106 + TestAlone_107 + TestAlone_108 + TestAlone_109 + TestAlone_110 + TestAlone_112 + TestAlone_113 + TestAlone_114 + TestAlone_115 + TestAlone_116 + TestAlone_118 + TestAlone_119 + IsEndLoop_90 + IsEndLoop_91 + IsEndLoop_92 + IsEndLoop_93 + IsEndLoop_94 + IsEndLoop_95 + IsEndLoop_96 + IsEndLoop_97 + IsEndLoop_98 + IsEndLoop_99 + IsEndLoop_100 + IsEndLoop_101 + IsEndLoop_102 + IsEndLoop_103 + IsEndLoop_104 + IsEndLoop_105 + IsEndLoop_106 + IsEndLoop_107 + IsEndLoop_108 + IsEndLoop_109 + IsEndLoop_110 + IsEndLoop_111 + IsEndLoop_112 + IsEndLoop_113 + IsEndLoop_114 + IsEndLoop_115 + IsEndLoop_116 + IsEndLoop_117 + IsEndLoop_118 + IsEndLoop_119 = 1
inv : Turn_6 + Turn_7 + Turn_8 + Turn_9 + Turn_10 + Turn_11 = 1
inv : WantSection_2 + AskForSection_5 + AskForSection_6 + AskForSection_7 + AskForSection_8 + AskForSection_9 + TestTurn_5 + TestTurn_6 + TestTurn_7 + TestTurn_8 + TestTurn_9 + BeginLoop_30 + BeginLoop_31 + BeginLoop_32 + BeginLoop_33 + BeginLoop_34 + BeginLoop_35 + BeginLoop_36 + BeginLoop_37 + BeginLoop_38 + BeginLoop_39 + BeginLoop_40 + BeginLoop_41 + BeginLoop_42 + BeginLoop_43 + BeginLoop_44 + BeginLoop_45 + BeginLoop_46 + BeginLoop_47 + BeginLoop_48 + BeginLoop_49 + BeginLoop_50 + BeginLoop_51 + BeginLoop_52 + BeginLoop_53 + BeginLoop_54 + BeginLoop_55 + BeginLoop_56 + BeginLoop_57 + BeginLoop_58 + BeginLoop_59 + EndTurn_5 + EndTurn_6 + EndTurn_7 + EndTurn_8 + EndTurn_9 + CS_1 + TestIdentity_30 + TestIdentity_31 + TestIdentity_32 + TestIdentity_33 + TestIdentity_34 + TestIdentity_35 + TestIdentity_36 + TestIdentity_37 + TestIdentity_38 + TestIdentity_39 + TestIdentity_40 + TestIdentity_41 + TestIdentity_42 + TestIdentity_43 + TestIdentity_44 + TestIdentity_45 + TestIdentity_46 + TestIdentity_47 + TestIdentity_48 + TestIdentity_49 + TestIdentity_50 + TestIdentity_51 + TestIdentity_52 + TestIdentity_53 + TestIdentity_54 + TestIdentity_55 + TestIdentity_56 + TestIdentity_57 + TestIdentity_58 + TestIdentity_59 + TestAlone_30 + TestAlone_32 + TestAlone_33 + TestAlone_34 + TestAlone_35 + TestAlone_36 + TestAlone_38 + TestAlone_39 + TestAlone_40 + TestAlone_41 + TestAlone_42 + TestAlone_44 + TestAlone_45 + TestAlone_46 + TestAlone_47 + TestAlone_48 + TestAlone_50 + TestAlone_51 + TestAlone_52 + TestAlone_53 + TestAlone_54 + TestAlone_56 + TestAlone_57 + TestAlone_58 + TestAlone_59 + IsEndLoop_30 + IsEndLoop_31 + IsEndLoop_32 + IsEndLoop_33 + IsEndLoop_34 + IsEndLoop_35 + IsEndLoop_36 + IsEndLoop_37 + IsEndLoop_38 + IsEndLoop_39 + IsEndLoop_40 + IsEndLoop_41 + IsEndLoop_42 + IsEndLoop_43 + IsEndLoop_44 + IsEndLoop_45 + IsEndLoop_46 + IsEndLoop_47 + IsEndLoop_48 + IsEndLoop_49 + IsEndLoop_50 + IsEndLoop_51 + IsEndLoop_52 + IsEndLoop_53 + IsEndLoop_54 + IsEndLoop_55 + IsEndLoop_56 + IsEndLoop_57 + IsEndLoop_58 + IsEndLoop_59 = 1
inv : WantSection_9 - AskForSection_20 - AskForSection_21 - AskForSection_22 - AskForSection_23 - AskForSection_24 - TestTurn_20 - TestTurn_21 - TestTurn_22 - TestTurn_23 - TestTurn_24 - BeginLoop_120 - BeginLoop_121 - BeginLoop_122 - BeginLoop_123 - BeginLoop_124 - BeginLoop_125 - BeginLoop_126 - BeginLoop_127 - BeginLoop_128 - BeginLoop_129 - BeginLoop_130 - BeginLoop_131 - BeginLoop_132 - BeginLoop_133 - BeginLoop_134 - BeginLoop_135 - BeginLoop_136 - BeginLoop_137 - BeginLoop_138 - BeginLoop_139 - BeginLoop_140 - BeginLoop_141 - BeginLoop_142 - BeginLoop_143 - BeginLoop_144 - BeginLoop_145 - BeginLoop_146 - BeginLoop_147 - BeginLoop_148 - BeginLoop_149 - EndTurn_20 - EndTurn_21 - EndTurn_22 - EndTurn_23 - EndTurn_24 - CS_4 - TestIdentity_120 - TestIdentity_121 - TestIdentity_122 - TestIdentity_123 - TestIdentity_124 - TestIdentity_125 - TestIdentity_126 - TestIdentity_127 - TestIdentity_128 - TestIdentity_129 - TestIdentity_130 - TestIdentity_131 - TestIdentity_132 - TestIdentity_133 - TestIdentity_134 - TestIdentity_135 - TestIdentity_136 - TestIdentity_137 - TestIdentity_138 - TestIdentity_139 - TestIdentity_140 - TestIdentity_141 - TestIdentity_142 - TestIdentity_143 - TestIdentity_144 - TestIdentity_145 - TestIdentity_146 - TestIdentity_147 - TestIdentity_148 - TestIdentity_149 - TestAlone_120 - TestAlone_121 - TestAlone_122 - TestAlone_123 - TestAlone_125 - TestAlone_126 - TestAlone_127 - TestAlone_128 - TestAlone_129 - TestAlone_131 - TestAlone_132 - TestAlone_133 - TestAlone_134 - TestAlone_135 - TestAlone_137 - TestAlone_138 - TestAlone_139 - TestAlone_140 - TestAlone_141 - TestAlone_143 - TestAlone_144 - TestAlone_145 - TestAlone_146 - TestAlone_147 - TestAlone_149 - IsEndLoop_120 - IsEndLoop_121 - IsEndLoop_122 - IsEndLoop_123 - IsEndLoop_124 - IsEndLoop_125 - IsEndLoop_126 - IsEndLoop_127 - IsEndLoop_128 - IsEndLoop_129 - IsEndLoop_130 - IsEndLoop_131 - IsEndLoop_132 - IsEndLoop_133 - IsEndLoop_134 - IsEndLoop_135 - IsEndLoop_136 - IsEndLoop_137 - IsEndLoop_138 - IsEndLoop_139 - IsEndLoop_140 - IsEndLoop_141 - IsEndLoop_142 - IsEndLoop_143 - IsEndLoop_144 - IsEndLoop_145 - IsEndLoop_146 - IsEndLoop_147 - IsEndLoop_148 - IsEndLoop_149 = 0
inv : WantSection_10 + AskForSection_25 + AskForSection_26 + AskForSection_27 + AskForSection_28 + AskForSection_29 + TestTurn_25 + TestTurn_26 + TestTurn_27 + TestTurn_28 + TestTurn_29 + BeginLoop_150 + BeginLoop_151 + BeginLoop_152 + BeginLoop_153 + BeginLoop_154 + BeginLoop_155 + BeginLoop_156 + BeginLoop_157 + BeginLoop_158 + BeginLoop_159 + BeginLoop_160 + BeginLoop_161 + BeginLoop_162 + BeginLoop_163 + BeginLoop_164 + BeginLoop_165 + BeginLoop_166 + BeginLoop_167 + BeginLoop_168 + BeginLoop_169 + BeginLoop_170 + BeginLoop_171 + BeginLoop_172 + BeginLoop_173 + BeginLoop_174 + BeginLoop_175 + BeginLoop_176 + BeginLoop_177 + BeginLoop_178 + BeginLoop_179 + EndTurn_25 + EndTurn_26 + EndTurn_27 + EndTurn_28 + EndTurn_29 + CS_5 + TestIdentity_150 + TestIdentity_151 + TestIdentity_152 + TestIdentity_153 + TestIdentity_154 + TestIdentity_155 + TestIdentity_156 + TestIdentity_157 + TestIdentity_158 + TestIdentity_159 + TestIdentity_160 + TestIdentity_161 + TestIdentity_162 + TestIdentity_163 + TestIdentity_164 + TestIdentity_165 + TestIdentity_166 + TestIdentity_167 + TestIdentity_168 + TestIdentity_169 + TestIdentity_170 + TestIdentity_171 + TestIdentity_172 + TestIdentity_173 + TestIdentity_174 + TestIdentity_175 + TestIdentity_176 + TestIdentity_177 + TestIdentity_178 + TestIdentity_179 + TestAlone_150 + TestAlone_151 + TestAlone_152 + TestAlone_153 + TestAlone_154 + TestAlone_156 + TestAlone_157 + TestAlone_158 + TestAlone_159 + TestAlone_160 + TestAlone_162 + TestAlone_163 + TestAlone_164 + TestAlone_165 + TestAlone_166 + TestAlone_168 + TestAlone_169 + TestAlone_170 + TestAlone_171 + TestAlone_172 + TestAlone_174 + TestAlone_175 + TestAlone_176 + TestAlone_177 + TestAlone_178 + IsEndLoop_150 + IsEndLoop_151 + IsEndLoop_152 + IsEndLoop_153 + IsEndLoop_154 + IsEndLoop_155 + IsEndLoop_156 + IsEndLoop_157 + IsEndLoop_158 + IsEndLoop_159 + IsEndLoop_160 + IsEndLoop_161 + IsEndLoop_162 + IsEndLoop_163 + IsEndLoop_164 + IsEndLoop_165 + IsEndLoop_166 + IsEndLoop_167 + IsEndLoop_168 + IsEndLoop_169 + IsEndLoop_170 + IsEndLoop_171 + IsEndLoop_172 + IsEndLoop_173 + IsEndLoop_174 + IsEndLoop_175 + IsEndLoop_176 + IsEndLoop_177 + IsEndLoop_178 + IsEndLoop_179 = 1
inv : Turn_18 + Turn_19 + Turn_20 + Turn_21 + Turn_22 + Turn_23 = 1
inv : Idle_0 + AskForSection_0 + AskForSection_1 + AskForSection_2 + AskForSection_3 + AskForSection_4 + TestTurn_0 + TestTurn_1 + TestTurn_2 + TestTurn_3 + TestTurn_4 + BeginLoop_0 + BeginLoop_1 + BeginLoop_2 + BeginLoop_3 + BeginLoop_4 + BeginLoop_5 + BeginLoop_6 + BeginLoop_7 + BeginLoop_8 + BeginLoop_9 + BeginLoop_10 + BeginLoop_11 + BeginLoop_12 + BeginLoop_13 + BeginLoop_14 + BeginLoop_15 + BeginLoop_16 + BeginLoop_17 + BeginLoop_18 + BeginLoop_19 + BeginLoop_20 + BeginLoop_21 + BeginLoop_22 + BeginLoop_23 + BeginLoop_24 + BeginLoop_25 + BeginLoop_26 + BeginLoop_27 + BeginLoop_28 + BeginLoop_29 + EndTurn_0 + EndTurn_1 + EndTurn_2 + EndTurn_3 + EndTurn_4 + CS_0 + TestIdentity_0 + TestIdentity_1 + TestIdentity_2 + TestIdentity_3 + TestIdentity_4 + TestIdentity_5 + TestIdentity_6 + TestIdentity_7 + TestIdentity_8 + TestIdentity_9 + TestIdentity_10 + TestIdentity_11 + TestIdentity_12 + TestIdentity_13 + TestIdentity_14 + TestIdentity_15 + TestIdentity_16 + TestIdentity_17 + TestIdentity_18 + TestIdentity_19 + TestIdentity_20 + TestIdentity_21 + TestIdentity_22 + TestIdentity_23 + TestIdentity_24 + TestIdentity_25 + TestIdentity_26 + TestIdentity_27 + TestIdentity_28 + TestIdentity_29 + TestAlone_1 + TestAlone_2 + TestAlone_3 + TestAlone_4 + TestAlone_5 + TestAlone_7 + TestAlone_8 + TestAlone_9 + TestAlone_10 + TestAlone_11 + TestAlone_13 + TestAlone_14 + TestAlone_15 + TestAlone_16 + TestAlone_17 + TestAlone_19 + TestAlone_20 + TestAlone_21 + TestAlone_22 + TestAlone_23 + TestAlone_25 + TestAlone_26 + TestAlone_27 + TestAlone_28 + TestAlone_29 + IsEndLoop_0 + IsEndLoop_1 + IsEndLoop_2 + IsEndLoop_3 + IsEndLoop_4 + IsEndLoop_5 + IsEndLoop_6 + IsEndLoop_7 + IsEndLoop_8 + IsEndLoop_9 + IsEndLoop_10 + IsEndLoop_11 + IsEndLoop_12 + IsEndLoop_13 + IsEndLoop_14 + IsEndLoop_15 + IsEndLoop_16 + IsEndLoop_17 + IsEndLoop_18 + IsEndLoop_19 + IsEndLoop_20 + IsEndLoop_21 + IsEndLoop_22 + IsEndLoop_23 + IsEndLoop_24 + IsEndLoop_25 + IsEndLoop_26 + IsEndLoop_27 + IsEndLoop_28 + IsEndLoop_29 = 1
inv : WantSection_8 + AskForSection_20 + AskForSection_21 + AskForSection_22 + AskForSection_23 + AskForSection_24 + TestTurn_20 + TestTurn_21 + TestTurn_22 + TestTurn_23 + TestTurn_24 + BeginLoop_120 + BeginLoop_121 + BeginLoop_122 + BeginLoop_123 + BeginLoop_124 + BeginLoop_125 + BeginLoop_126 + BeginLoop_127 + BeginLoop_128 + BeginLoop_129 + BeginLoop_130 + BeginLoop_131 + BeginLoop_132 + BeginLoop_133 + BeginLoop_134 + BeginLoop_135 + BeginLoop_136 + BeginLoop_137 + BeginLoop_138 + BeginLoop_139 + BeginLoop_140 + BeginLoop_141 + BeginLoop_142 + BeginLoop_143 + BeginLoop_144 + BeginLoop_145 + BeginLoop_146 + BeginLoop_147 + BeginLoop_148 + BeginLoop_149 + EndTurn_20 + EndTurn_21 + EndTurn_22 + EndTurn_23 + EndTurn_24 + CS_4 + TestIdentity_120 + TestIdentity_121 + TestIdentity_122 + TestIdentity_123 + TestIdentity_124 + TestIdentity_125 + TestIdentity_126 + TestIdentity_127 + TestIdentity_128 + TestIdentity_129 + TestIdentity_130 + TestIdentity_131 + TestIdentity_132 + TestIdentity_133 + TestIdentity_134 + TestIdentity_135 + TestIdentity_136 + TestIdentity_137 + TestIdentity_138 + TestIdentity_139 + TestIdentity_140 + TestIdentity_141 + TestIdentity_142 + TestIdentity_143 + TestIdentity_144 + TestIdentity_145 + TestIdentity_146 + TestIdentity_147 + TestIdentity_148 + TestIdentity_149 + TestAlone_120 + TestAlone_121 + TestAlone_122 + TestAlone_123 + TestAlone_125 + TestAlone_126 + TestAlone_127 + TestAlone_128 + TestAlone_129 + TestAlone_131 + TestAlone_132 + TestAlone_133 + TestAlone_134 + TestAlone_135 + TestAlone_137 + TestAlone_138 + TestAlone_139 + TestAlone_140 + TestAlone_141 + TestAlone_143 + TestAlone_144 + TestAlone_145 + TestAlone_146 + TestAlone_147 + TestAlone_149 + IsEndLoop_120 + IsEndLoop_121 + IsEndLoop_122 + IsEndLoop_123 + IsEndLoop_124 + IsEndLoop_125 + IsEndLoop_126 + IsEndLoop_127 + IsEndLoop_128 + IsEndLoop_129 + IsEndLoop_130 + IsEndLoop_131 + IsEndLoop_132 + IsEndLoop_133 + IsEndLoop_134 + IsEndLoop_135 + IsEndLoop_136 + IsEndLoop_137 + IsEndLoop_138 + IsEndLoop_139 + IsEndLoop_140 + IsEndLoop_141 + IsEndLoop_142 + IsEndLoop_143 + IsEndLoop_144 + IsEndLoop_145 + IsEndLoop_146 + IsEndLoop_147 + IsEndLoop_148 + IsEndLoop_149 = 1
inv : WantSection_11 - AskForSection_25 - AskForSection_26 - AskForSection_27 - AskForSection_28 - AskForSection_29 - TestTurn_25 - TestTurn_26 - TestTurn_27 - TestTurn_28 - TestTurn_29 - BeginLoop_150 - BeginLoop_151 - BeginLoop_152 - BeginLoop_153 - BeginLoop_154 - BeginLoop_155 - BeginLoop_156 - BeginLoop_157 - BeginLoop_158 - BeginLoop_159 - BeginLoop_160 - BeginLoop_161 - BeginLoop_162 - BeginLoop_163 - BeginLoop_164 - BeginLoop_165 - BeginLoop_166 - BeginLoop_167 - BeginLoop_168 - BeginLoop_169 - BeginLoop_170 - BeginLoop_171 - BeginLoop_172 - BeginLoop_173 - BeginLoop_174 - BeginLoop_175 - BeginLoop_176 - BeginLoop_177 - BeginLoop_178 - BeginLoop_179 - EndTurn_25 - EndTurn_26 - EndTurn_27 - EndTurn_28 - EndTurn_29 - CS_5 - TestIdentity_150 - TestIdentity_151 - TestIdentity_152 - TestIdentity_153 - TestIdentity_154 - TestIdentity_155 - TestIdentity_156 - TestIdentity_157 - TestIdentity_158 - TestIdentity_159 - TestIdentity_160 - TestIdentity_161 - TestIdentity_162 - TestIdentity_163 - TestIdentity_164 - TestIdentity_165 - TestIdentity_166 - TestIdentity_167 - TestIdentity_168 - TestIdentity_169 - TestIdentity_170 - TestIdentity_171 - TestIdentity_172 - TestIdentity_173 - TestIdentity_174 - TestIdentity_175 - TestIdentity_176 - TestIdentity_177 - TestIdentity_178 - TestIdentity_179 - TestAlone_150 - TestAlone_151 - TestAlone_152 - TestAlone_153 - TestAlone_154 - TestAlone_156 - TestAlone_157 - TestAlone_158 - TestAlone_159 - TestAlone_160 - TestAlone_162 - TestAlone_163 - TestAlone_164 - TestAlone_165 - TestAlone_166 - TestAlone_168 - TestAlone_169 - TestAlone_170 - TestAlone_171 - TestAlone_172 - TestAlone_174 - TestAlone_175 - TestAlone_176 - TestAlone_177 - TestAlone_178 - IsEndLoop_150 - IsEndLoop_151 - IsEndLoop_152 - IsEndLoop_153 - IsEndLoop_154 - IsEndLoop_155 - IsEndLoop_156 - IsEndLoop_157 - IsEndLoop_158 - IsEndLoop_159 - IsEndLoop_160 - IsEndLoop_161 - IsEndLoop_162 - IsEndLoop_163 - IsEndLoop_164 - IsEndLoop_165 - IsEndLoop_166 - IsEndLoop_167 - IsEndLoop_168 - IsEndLoop_169 - IsEndLoop_170 - IsEndLoop_171 - IsEndLoop_172 - IsEndLoop_173 - IsEndLoop_174 - IsEndLoop_175 - IsEndLoop_176 - IsEndLoop_177 - IsEndLoop_178 - IsEndLoop_179 = 0
inv : Idle_2 + AskForSection_10 + AskForSection_11 + AskForSection_12 + AskForSection_13 + AskForSection_14 + TestTurn_10 + TestTurn_11 + TestTurn_12 + TestTurn_13 + TestTurn_14 + BeginLoop_60 + BeginLoop_61 + BeginLoop_62 + BeginLoop_63 + BeginLoop_64 + BeginLoop_65 + BeginLoop_66 + BeginLoop_67 + BeginLoop_68 + BeginLoop_69 + BeginLoop_70 + BeginLoop_71 + BeginLoop_72 + BeginLoop_73 + BeginLoop_74 + BeginLoop_75 + BeginLoop_76 + BeginLoop_77 + BeginLoop_78 + BeginLoop_79 + BeginLoop_80 + BeginLoop_81 + BeginLoop_82 + BeginLoop_83 + BeginLoop_84 + BeginLoop_85 + BeginLoop_86 + BeginLoop_87 + BeginLoop_88 + BeginLoop_89 + EndTurn_10 + EndTurn_11 + EndTurn_12 + EndTurn_13 + EndTurn_14 + CS_2 + TestIdentity_60 + TestIdentity_61 + TestIdentity_62 + TestIdentity_63 + TestIdentity_64 + TestIdentity_65 + TestIdentity_66 + TestIdentity_67 + TestIdentity_68 + TestIdentity_69 + TestIdentity_70 + TestIdentity_71 + TestIdentity_72 + TestIdentity_73 + TestIdentity_74 + TestIdentity_75 + TestIdentity_76 + TestIdentity_77 + TestIdentity_78 + TestIdentity_79 + TestIdentity_80 + TestIdentity_81 + TestIdentity_82 + TestIdentity_83 + TestIdentity_84 + TestIdentity_85 + TestIdentity_86 + TestIdentity_87 + TestIdentity_88 + TestIdentity_89 + TestAlone_60 + TestAlone_61 + TestAlone_63 + TestAlone_64 + TestAlone_65 + TestAlone_66 + TestAlone_67 + TestAlone_69 + TestAlone_70 + TestAlone_71 + TestAlone_72 + TestAlone_73 + TestAlone_75 + TestAlone_76 + TestAlone_77 + TestAlone_78 + TestAlone_79 + TestAlone_81 + TestAlone_82 + TestAlone_83 + TestAlone_84 + TestAlone_85 + TestAlone_87 + TestAlone_88 + TestAlone_89 + IsEndLoop_60 + IsEndLoop_61 + IsEndLoop_62 + IsEndLoop_63 + IsEndLoop_64 + IsEndLoop_65 + IsEndLoop_66 + IsEndLoop_67 + IsEndLoop_68 + IsEndLoop_69 + IsEndLoop_70 + IsEndLoop_71 + IsEndLoop_72 + IsEndLoop_73 + IsEndLoop_74 + IsEndLoop_75 + IsEndLoop_76 + IsEndLoop_77 + IsEndLoop_78 + IsEndLoop_79 + IsEndLoop_80 + IsEndLoop_81 + IsEndLoop_82 + IsEndLoop_83 + IsEndLoop_84 + IsEndLoop_85 + IsEndLoop_86 + IsEndLoop_87 + IsEndLoop_88 + IsEndLoop_89 = 1
inv : WantSection_0 + AskForSection_0 + AskForSection_1 + AskForSection_2 + AskForSection_3 + AskForSection_4 + TestTurn_0 + TestTurn_1 + TestTurn_2 + TestTurn_3 + TestTurn_4 + BeginLoop_0 + BeginLoop_1 + BeginLoop_2 + BeginLoop_3 + BeginLoop_4 + BeginLoop_5 + BeginLoop_6 + BeginLoop_7 + BeginLoop_8 + BeginLoop_9 + BeginLoop_10 + BeginLoop_11 + BeginLoop_12 + BeginLoop_13 + BeginLoop_14 + BeginLoop_15 + BeginLoop_16 + BeginLoop_17 + BeginLoop_18 + BeginLoop_19 + BeginLoop_20 + BeginLoop_21 + BeginLoop_22 + BeginLoop_23 + BeginLoop_24 + BeginLoop_25 + BeginLoop_26 + BeginLoop_27 + BeginLoop_28 + BeginLoop_29 + EndTurn_0 + EndTurn_1 + EndTurn_2 + EndTurn_3 + EndTurn_4 + CS_0 + TestIdentity_0 + TestIdentity_1 + TestIdentity_2 + TestIdentity_3 + TestIdentity_4 + TestIdentity_5 + TestIdentity_6 + TestIdentity_7 + TestIdentity_8 + TestIdentity_9 + TestIdentity_10 + TestIdentity_11 + TestIdentity_12 + TestIdentity_13 + TestIdentity_14 + TestIdentity_15 + TestIdentity_16 + TestIdentity_17 + TestIdentity_18 + TestIdentity_19 + TestIdentity_20 + TestIdentity_21 + TestIdentity_22 + TestIdentity_23 + TestIdentity_24 + TestIdentity_25 + TestIdentity_26 + TestIdentity_27 + TestIdentity_28 + TestIdentity_29 + TestAlone_1 + TestAlone_2 + TestAlone_3 + TestAlone_4 + TestAlone_5 + TestAlone_7 + TestAlone_8 + TestAlone_9 + TestAlone_10 + TestAlone_11 + TestAlone_13 + TestAlone_14 + TestAlone_15 + TestAlone_16 + TestAlone_17 + TestAlone_19 + TestAlone_20 + TestAlone_21 + TestAlone_22 + TestAlone_23 + TestAlone_25 + TestAlone_26 + TestAlone_27 + TestAlone_28 + TestAlone_29 + IsEndLoop_0 + IsEndLoop_1 + IsEndLoop_2 + IsEndLoop_3 + IsEndLoop_4 + IsEndLoop_5 + IsEndLoop_6 + IsEndLoop_7 + IsEndLoop_8 + IsEndLoop_9 + IsEndLoop_10 + IsEndLoop_11 + IsEndLoop_12 + IsEndLoop_13 + IsEndLoop_14 + IsEndLoop_15 + IsEndLoop_16 + IsEndLoop_17 + IsEndLoop_18 + IsEndLoop_19 + IsEndLoop_20 + IsEndLoop_21 + IsEndLoop_22 + IsEndLoop_23 + IsEndLoop_24 + IsEndLoop_25 + IsEndLoop_26 + IsEndLoop_27 + IsEndLoop_28 + IsEndLoop_29 = 1
inv : Turn_12 + Turn_13 + Turn_14 + Turn_15 + Turn_16 + Turn_17 = 1
inv : WantSection_7 - AskForSection_15 - AskForSection_16 - AskForSection_17 - AskForSection_18 - AskForSection_19 - TestTurn_15 - TestTurn_16 - TestTurn_17 - TestTurn_18 - TestTurn_19 - BeginLoop_90 - BeginLoop_91 - BeginLoop_92 - BeginLoop_93 - BeginLoop_94 - BeginLoop_95 - BeginLoop_96 - BeginLoop_97 - BeginLoop_98 - BeginLoop_99 - BeginLoop_100 - BeginLoop_101 - BeginLoop_102 - BeginLoop_103 - BeginLoop_104 - BeginLoop_105 - BeginLoop_106 - BeginLoop_107 - BeginLoop_108 - BeginLoop_109 - BeginLoop_110 - BeginLoop_111 - BeginLoop_112 - BeginLoop_113 - BeginLoop_114 - BeginLoop_115 - BeginLoop_116 - BeginLoop_117 - BeginLoop_118 - BeginLoop_119 - EndTurn_15 - EndTurn_16 - EndTurn_17 - EndTurn_18 - EndTurn_19 - CS_3 - TestIdentity_90 - TestIdentity_91 - TestIdentity_92 - TestIdentity_93 - TestIdentity_94 - TestIdentity_95 - TestIdentity_96 - TestIdentity_97 - TestIdentity_98 - TestIdentity_99 - TestIdentity_100 - TestIdentity_101 - TestIdentity_102 - TestIdentity_103 - TestIdentity_104 - TestIdentity_105 - TestIdentity_106 - TestIdentity_107 - TestIdentity_108 - TestIdentity_109 - TestIdentity_110 - TestIdentity_111 - TestIdentity_112 - TestIdentity_113 - TestIdentity_114 - TestIdentity_115 - TestIdentity_116 - TestIdentity_117 - TestIdentity_118 - TestIdentity_119 - TestAlone_90 - TestAlone_91 - TestAlone_92 - TestAlone_94 - TestAlone_95 - TestAlone_96 - TestAlone_97 - TestAlone_98 - TestAlone_100 - TestAlone_101 - TestAlone_102 - TestAlone_103 - TestAlone_104 - TestAlone_106 - TestAlone_107 - TestAlone_108 - TestAlone_109 - TestAlone_110 - TestAlone_112 - TestAlone_113 - TestAlone_114 - TestAlone_115 - TestAlone_116 - TestAlone_118 - TestAlone_119 - IsEndLoop_90 - IsEndLoop_91 - IsEndLoop_92 - IsEndLoop_93 - IsEndLoop_94 - IsEndLoop_95 - IsEndLoop_96 - IsEndLoop_97 - IsEndLoop_98 - IsEndLoop_99 - IsEndLoop_100 - IsEndLoop_101 - IsEndLoop_102 - IsEndLoop_103 - IsEndLoop_104 - IsEndLoop_105 - IsEndLoop_106 - IsEndLoop_107 - IsEndLoop_108 - IsEndLoop_109 - IsEndLoop_110 - IsEndLoop_111 - IsEndLoop_112 - IsEndLoop_113 - IsEndLoop_114 - IsEndLoop_115 - IsEndLoop_116 - IsEndLoop_117 - IsEndLoop_118 - IsEndLoop_119 = 0
inv : WantSection_4 + AskForSection_10 + AskForSection_11 + AskForSection_12 + AskForSection_13 + AskForSection_14 + TestTurn_10 + TestTurn_11 + TestTurn_12 + TestTurn_13 + TestTurn_14 + BeginLoop_60 + BeginLoop_61 + BeginLoop_62 + BeginLoop_63 + BeginLoop_64 + BeginLoop_65 + BeginLoop_66 + BeginLoop_67 + BeginLoop_68 + BeginLoop_69 + BeginLoop_70 + BeginLoop_71 + BeginLoop_72 + BeginLoop_73 + BeginLoop_74 + BeginLoop_75 + BeginLoop_76 + BeginLoop_77 + BeginLoop_78 + BeginLoop_79 + BeginLoop_80 + BeginLoop_81 + BeginLoop_82 + BeginLoop_83 + BeginLoop_84 + BeginLoop_85 + BeginLoop_86 + BeginLoop_87 + BeginLoop_88 + BeginLoop_89 + EndTurn_10 + EndTurn_11 + EndTurn_12 + EndTurn_13 + EndTurn_14 + CS_2 + TestIdentity_60 + TestIdentity_61 + TestIdentity_62 + TestIdentity_63 + TestIdentity_64 + TestIdentity_65 + TestIdentity_66 + TestIdentity_67 + TestIdentity_68 + TestIdentity_69 + TestIdentity_70 + TestIdentity_71 + TestIdentity_72 + TestIdentity_73 + TestIdentity_74 + TestIdentity_75 + TestIdentity_76 + TestIdentity_77 + TestIdentity_78 + TestIdentity_79 + TestIdentity_80 + TestIdentity_81 + TestIdentity_82 + TestIdentity_83 + TestIdentity_84 + TestIdentity_85 + TestIdentity_86 + TestIdentity_87 + TestIdentity_88 + TestIdentity_89 + TestAlone_60 + TestAlone_61 + TestAlone_63 + TestAlone_64 + TestAlone_65 + TestAlone_66 + TestAlone_67 + TestAlone_69 + TestAlone_70 + TestAlone_71 + TestAlone_72 + TestAlone_73 + TestAlone_75 + TestAlone_76 + TestAlone_77 + TestAlone_78 + TestAlone_79 + TestAlone_81 + TestAlone_82 + TestAlone_83 + TestAlone_84 + TestAlone_85 + TestAlone_87 + TestAlone_88 + TestAlone_89 + IsEndLoop_60 + IsEndLoop_61 + IsEndLoop_62 + IsEndLoop_63 + IsEndLoop_64 + IsEndLoop_65 + IsEndLoop_66 + IsEndLoop_67 + IsEndLoop_68 + IsEndLoop_69 + IsEndLoop_70 + IsEndLoop_71 + IsEndLoop_72 + IsEndLoop_73 + IsEndLoop_74 + IsEndLoop_75 + IsEndLoop_76 + IsEndLoop_77 + IsEndLoop_78 + IsEndLoop_79 + IsEndLoop_80 + IsEndLoop_81 + IsEndLoop_82 + IsEndLoop_83 + IsEndLoop_84 + IsEndLoop_85 + IsEndLoop_86 + IsEndLoop_87 + IsEndLoop_88 + IsEndLoop_89 = 1
inv : Turn_0 + Turn_1 + Turn_2 + Turn_3 + Turn_4 + Turn_5 = 1
Total of 23 invariants.
[2022-06-12 21:18:07] [INFO ] Computed 23 place invariants in 13 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :3 after 60
[2022-06-12 21:18:08] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityFireability-08(UNSAT) depth K=1 took 793 ms
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :60 after 2804
[2022-06-12 21:18:09] [INFO ] Proved 834 variables to be positive in 1426 ms
[2022-06-12 21:18:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-5-ReachabilityFireability-08
[2022-06-12 21:18:09] [INFO ] KInduction solution for property Peterson-COL-5-ReachabilityFireability-08(SAT) depth K=0 took 271 ms
[2022-06-12 21:18:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-5-ReachabilityFireability-08
[2022-06-12 21:18:09] [INFO ] KInduction solution for property Peterson-COL-5-ReachabilityFireability-08(SAT) depth K=1 took 477 ms
[2022-06-12 21:18:10] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityFireability-08(UNSAT) depth K=2 took 2021 ms
Compilation finished in 11399 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin13696818831017238674]
Link finished in 81 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, PetersonCOL5ReachabilityFireability08==true], workingDir=/tmp/ltsmin13696818831017238674]
[2022-06-12 21:18:28] [INFO ] BMC solution for property Peterson-COL-5-ReachabilityFireability-08(UNSAT) depth K=3 took 18592 ms
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :2804 after 5.11981e+06
[2022-06-12 21:20:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-5-ReachabilityFireability-08
[2022-06-12 21:20:12] [INFO ] KInduction solution for property Peterson-COL-5-ReachabilityFireability-08(SAT) depth K=2 took 122859 ms
Detected timeout of ITS tools.
[2022-06-12 21:39:22] [INFO ] Applying decomposition
[2022-06-12 21:39:22] [INFO ] Flatten gal took : 131 ms
[2022-06-12 21:39:22] [INFO ] Decomposing Gal with order
[2022-06-12 21:39:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:39:22] [INFO ] Removed a total of 1098 redundant transitions.
[2022-06-12 21:39:22] [INFO ] Flatten gal took : 219 ms
[2022-06-12 21:39:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-06-12 21:39:22] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13900335403600574230.gal : 24 ms
[2022-06-12 21:39:22] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability4811002954750401450.prop : 28 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/ReachabilityFireability13900335403600574230.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability4811002954750401450.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/ReachabilityFireability13900335403600574230.gal -t CGAL -reachable-file /tmp/ReachabilityFireability4811002954750401450.prop --nowitness
Loading property file /tmp/ReachabilityFireability4811002954750401450.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 169
Detected timeout of ITS tools.
[2022-06-12 22:00:38] [INFO ] Flatten gal took : 148 ms
[2022-06-12 22:00:38] [INFO ] Input system was already deterministic with 1242 transitions.
[2022-06-12 22:00:38] [INFO ] Transformed 834 places.
[2022-06-12 22:00:38] [INFO ] Transformed 1242 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-12 22:00:38] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability9553485222872865242.gal : 21 ms
[2022-06-12 22:00:38] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability12999135918867765045.prop : 29 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/ReachabilityFireability9553485222872865242.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability12999135918867765045.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --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/ReachabilityFireability9553485222872865242.gal -t CGAL -reachable-file /tmp/ReachabilityFireability12999135918867765045.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability12999135918867765045.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 15
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :15 after 16
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :16 after 48
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :48 after 52
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :52 after 122
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :122 after 156
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :156 after 228
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :228 after 529
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :529 after 4640
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :4640 after 8372

BK_TIME_CONFINEMENT_REACHED

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is Peterson-COL-5, 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 r179-tall-165277026700012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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