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-165277026700015.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-6, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-165277026700015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 8.1K Apr 30 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 30 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 09:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 09:39 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.8K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 30 10:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Apr 30 10:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 30 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 30 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 46K 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-6-ReachabilityFireability-00
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-01
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-02
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-03
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-04
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-05
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-06
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-07
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-08
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-09
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-10
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-11
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-12
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-13
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-14
FORMULA_NAME Peterson-COL-6-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655068463038

Running Version 0
[2022-06-12 21:14:24] [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:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:14:24] [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:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-06-12 21:14:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 589 ms
[2022-06-12 21:14:25] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 1372 PT places and 2247.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-6-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-06-12 21:14:25] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions in 3 ms.
[2022-06-12 21:14:25] [INFO ] Skeletonized HLPN properties in 0 ms.
Successfully produced net in file /tmp/petri1000_11533124187713882367.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:25] [INFO ] Flatten gal took : 26 ms
[2022-06-12 21:14:25] [INFO ] Flatten gal took : 2 ms
[2022-06-12 21:14:25] [INFO ] Unfolded HLPN to a Petri net with 1372 places and 2114 transitions in 35 ms.
[2022-06-12 21:14:25] [INFO ] Unfolded HLPN properties in 3 ms.
Successfully produced net in file /tmp/petri1001_12610167084036457036.dot
[2022-06-12 21:14:25] [INFO ] Initial state test concluded for 1 properties.
Deduced a syphon composed of 42 places in 18 ms
Reduce places removed 42 places and 84 transitions.
FORMULA Peterson-COL-6-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 14) seen :10
FORMULA Peterson-COL-6-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-12 21:14:26] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2022-06-12 21:14:26] [INFO ] Computed 27 place invariants in 29 ms
[2022-06-12 21:14:27] [INFO ] [Real]Absence check using 20 positive place invariants in 33 ms returned sat
[2022-06-12 21:14:27] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 11 ms returned sat
[2022-06-12 21:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:28] [INFO ] [Real]Absence check using state equation in 978 ms returned sat
[2022-06-12 21:14:28] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 21:14:28] [INFO ] [Real]Added 366 Read/Feed constraints in 76 ms returned sat
[2022-06-12 21:14:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:28] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2022-06-12 21:14:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:29] [INFO ] [Nat]Absence check using state equation in 916 ms returned sat
[2022-06-12 21:14:29] [INFO ] [Nat]Added 366 Read/Feed constraints in 105 ms returned sat
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 225 places in 505 ms of which 4 ms to minimize.
[2022-06-12 21:14:30] [INFO ] Deduced a trap composed of 198 places in 509 ms of which 2 ms to minimize.
[2022-06-12 21:14:31] [INFO ] Deduced a trap composed of 127 places in 462 ms of which 1 ms to minimize.
[2022-06-12 21:14:32] [INFO ] Deduced a trap composed of 321 places in 430 ms of which 3 ms to minimize.
[2022-06-12 21:14:32] [INFO ] Deduced a trap composed of 108 places in 481 ms of which 1 ms to minimize.
[2022-06-12 21:14:33] [INFO ] Deduced a trap composed of 54 places in 455 ms of which 1 ms to minimize.
[2022-06-12 21:14:33] [INFO ] Deduced a trap composed of 173 places in 404 ms of which 1 ms to minimize.
[2022-06-12 21:14:33] [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:33] [INFO ] [Real]Absence check using 20 positive place invariants in 51 ms returned sat
[2022-06-12 21:14:33] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 21 ms returned sat
[2022-06-12 21:14:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:38] [INFO ] [Real]Absence check using state equation in 4632 ms returned sat
[2022-06-12 21:14:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-12 21:14:38] [INFO ] [Real]Added 366 Read/Feed constraints in 102 ms returned unknown
[2022-06-12 21:14:38] [INFO ] [Real]Absence check using 20 positive place invariants in 29 ms returned sat
[2022-06-12 21:14:38] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 11 ms returned sat
[2022-06-12 21:14:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:39] [INFO ] [Real]Absence check using state equation in 821 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 20 positive place invariants in 27 ms returned sat
[2022-06-12 21:14:39] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2022-06-12 21:14:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:40] [INFO ] [Nat]Absence check using state equation in 863 ms returned sat
[2022-06-12 21:14:40] [INFO ] [Nat]Added 366 Read/Feed constraints in 100 ms returned sat
[2022-06-12 21:14:41] [INFO ] Deduced a trap composed of 95 places in 405 ms of which 1 ms to minimize.
[2022-06-12 21:14:41] [INFO ] Deduced a trap composed of 101 places in 417 ms of which 1 ms to minimize.
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 22 places in 452 ms of which 1 ms to minimize.
[2022-06-12 21:14:42] [INFO ] Deduced a trap composed of 20 places in 445 ms of which 1 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 106 places in 471 ms of which 1 ms to minimize.
[2022-06-12 21:14:43] [INFO ] Deduced a trap composed of 120 places in 457 ms of which 1 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 138 places in 445 ms of which 1 ms to minimize.
[2022-06-12 21:14:44] [INFO ] Deduced a trap composed of 38 places in 447 ms of which 1 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
[2022-06-12 21:14:45] [INFO ] [Real]Absence check using 20 positive place invariants in 36 ms returned sat
[2022-06-12 21:14:45] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 14 ms returned sat
[2022-06-12 21:14:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:46] [INFO ] [Real]Absence check using state equation in 1817 ms returned sat
[2022-06-12 21:14:47] [INFO ] [Real]Added 366 Read/Feed constraints in 87 ms returned sat
[2022-06-12 21:14:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:14:47] [INFO ] [Nat]Absence check using 20 positive place invariants in 35 ms returned sat
[2022-06-12 21:14:47] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 12 ms returned sat
[2022-06-12 21:14:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:14:49] [INFO ] [Nat]Absence check using state equation in 1860 ms returned sat
[2022-06-12 21:14:49] [INFO ] [Nat]Added 366 Read/Feed constraints in 89 ms returned sat
[2022-06-12 21:14:49] [INFO ] Deduced a trap composed of 195 places in 409 ms of which 1 ms to minimize.
[2022-06-12 21:14:50] [INFO ] Deduced a trap composed of 173 places in 425 ms of which 1 ms to minimize.
[2022-06-12 21:14:50] [INFO ] Deduced a trap composed of 206 places in 470 ms of which 1 ms to minimize.
[2022-06-12 21:14:51] [INFO ] Deduced a trap composed of 235 places in 362 ms of which 0 ms to minimize.
[2022-06-12 21:14:51] [INFO ] Deduced a trap composed of 215 places in 361 ms of which 1 ms to minimize.
[2022-06-12 21:14:52] [INFO ] Deduced a trap composed of 287 places in 352 ms of which 1 ms to minimize.
[2022-06-12 21:14:52] [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 3
Fused 4 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 51300 steps, including 998 resets, run finished after 429 ms. (steps per millisecond=119 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA Peterson-COL-6-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-COL-6-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 406 out of 1330 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 330 transitions
Trivial Post-agglo rules discarded 330 transitions
Performed 330 trivial Post agglomeration. Transition count delta: 330
Iterating post reduction 0 with 330 rules applied. Total rules applied 330 place count 1330 transition count 1700
Reduce places removed 330 places and 0 transitions.
Iterating post reduction 1 with 330 rules applied. Total rules applied 660 place count 1000 transition count 1700
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 660 place count 1000 transition count 1442
Deduced a syphon composed of 258 places in 3 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 1176 place count 742 transition count 1442
Applied a total of 1176 rules in 223 ms. Remains 742 /1330 variables (removed 588) and now considering 1442/2030 (removed 588) transitions.
Finished structural reductions, in 1 iterations. Remains : 742/1330 places, 1442/2030 transitions.
[2022-06-12 21:14:53] [INFO ] Flatten gal took : 113 ms
[2022-06-12 21:14:53] [INFO ] Flatten gal took : 89 ms
[2022-06-12 21:14:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5298079139838007361.gal : 21 ms
[2022-06-12 21:14:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11130097781032723126.prop : 4 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/ReachabilityCardinality5298079139838007361.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11130097781032723126.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/ReachabilityCardinality5298079139838007361.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11130097781032723126.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11130097781032723126.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :10 after 17
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :17 after 21
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :21 after 40
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :40 after 141
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :141 after 174
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :174 after 338
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :338 after 937
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :937 after 3226
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :3226 after 10678
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :10678 after 31592
Detected timeout of ITS tools.
[2022-06-12 21:15:08] [INFO ] Flatten gal took : 64 ms
[2022-06-12 21:15:08] [INFO ] Applying decomposition
[2022-06-12 21:15:08] [INFO ] Flatten gal took : 65 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/graph7200614648417344583.txt, -o, /tmp/graph7200614648417344583.bin, -w, /tmp/graph7200614648417344583.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/graph7200614648417344583.bin, -l, -1, -v, -w, /tmp/graph7200614648417344583.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:15:08] [INFO ] Decomposing Gal with order
[2022-06-12 21:15:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:15:09] [INFO ] Removed a total of 1786 redundant transitions.
[2022-06-12 21:15:09] [INFO ] Flatten gal took : 186 ms
[2022-06-12 21:15:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 14 ms.
[2022-06-12 21:15:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3392923112301251995.gal : 18 ms
[2022-06-12 21:15:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6688415024977089422.prop : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3392923112301251995.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality6688415024977089422.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/ReachabilityCardinality3392923112301251995.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality6688415024977089422.prop --nowitness
Loading property file /tmp/ReachabilityCardinality6688415024977089422.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 5
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9066249936497757616
[2022-06-12 21:15:24] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9066249936497757616
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/ltsmin9066249936497757616]
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/ltsmin9066249936497757616] 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/ltsmin9066249936497757616] 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 6377 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2692 ms. (steps per millisecond=371 ) properties (out of 2) seen :0
Interrupted Best-First random walk after 118160 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=23 ) properties seen :{}
Interrupted probabilistic random walk after 6505664 steps, run timeout after 30001 ms. (steps per millisecond=216 ) properties seen :{0=1}
Probabilistic random walk after 6505664 steps, saw 921209 distinct states, run finished after 30001 ms. (steps per millisecond=216 ) properties seen :{0=1}
FORMULA Peterson-COL-6-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2022-06-12 21:16:09] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-06-12 21:16:09] [INFO ] Computed 27 place invariants in 8 ms
[2022-06-12 21:16:09] [INFO ] [Real]Absence check using 20 positive place invariants in 26 ms returned sat
[2022-06-12 21:16:09] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 11 ms returned sat
[2022-06-12 21:16:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:10] [INFO ] [Real]Absence check using state equation in 1202 ms returned sat
[2022-06-12 21:16:10] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 21:16:11] [INFO ] [Real]Added 366 Read/Feed constraints in 41 ms returned sat
[2022-06-12 21:16:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:16:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2022-06-12 21:16:11] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2022-06-12 21:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:16:12] [INFO ] [Nat]Absence check using state equation in 1180 ms returned sat
[2022-06-12 21:16:12] [INFO ] [Nat]Added 366 Read/Feed constraints in 60 ms returned sat
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2022-06-12 21:16:12] [INFO ] Deduced a trap composed of 52 places in 161 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 45 places in 179 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 24 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 29 places in 163 ms of which 0 ms to minimize.
[2022-06-12 21:16:13] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 0 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 29 places in 178 ms of which 1 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 44 places in 163 ms of which 0 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 1 ms to minimize.
[2022-06-12 21:16:14] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 0 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 53 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 83 places in 169 ms of which 0 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 1 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 1 ms to minimize.
[2022-06-12 21:16:15] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 1 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 29 places in 176 ms of which 0 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 0 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 81 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:16:16] [INFO ] Deduced a trap composed of 125 places in 165 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 63 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 104 places in 157 ms of which 0 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 1 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:16:17] [INFO ] Deduced a trap composed of 69 places in 113 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 0 ms to minimize.
[2022-06-12 21:16:18] [INFO ] Deduced a trap composed of 17 places in 124 ms of which 1 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 48 places in 152 ms of which 0 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 0 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 23 places in 119 ms of which 0 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:16:19] [INFO ] Deduced a trap composed of 88 places in 116 ms of which 1 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 62 places in 140 ms of which 1 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 106 places in 125 ms of which 0 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 0 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 104 places in 122 ms of which 0 ms to minimize.
[2022-06-12 21:16:20] [INFO ] Deduced a trap composed of 104 places in 121 ms of which 1 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 0 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 5 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 110 places in 181 ms of which 0 ms to minimize.
[2022-06-12 21:16:21] [INFO ] Deduced a trap composed of 35 places in 203 ms of which 0 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 172 places in 233 ms of which 14 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 12 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 0 ms to minimize.
[2022-06-12 21:16:22] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 1 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 97 places in 139 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Deduced a trap composed of 97 places in 138 ms of which 0 ms to minimize.
[2022-06-12 21:16:23] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 10955 ms
[2022-06-12 21:16:23] [INFO ] Computed and/alt/rep : 1141/2954/1141 causal constraints (skipped 84 transitions) in 76 ms.
[2022-06-12 21:16:43] [INFO ] Added : 970 causal constraints over 194 iterations in 20052 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 39 ms.
Incomplete Parikh walk after 555500 steps, including 1000 resets, run finished after 2079 ms. (steps per millisecond=267 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 406 out of 742 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 59 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 742/742 places, 1442/1442 transitions.
[2022-06-12 21:16:45] [INFO ] Flatten gal took : 52 ms
[2022-06-12 21:16:45] [INFO ] Flatten gal took : 50 ms
[2022-06-12 21:16:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2961555815600543095.gal : 6 ms
[2022-06-12 21:16:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10251456824865368531.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality2961555815600543095.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality10251456824865368531.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/ReachabilityCardinality2961555815600543095.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality10251456824865368531.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality10251456824865368531.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 21
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :21 after 40
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :40 after 141
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :141 after 174
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :174 after 338
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :338 after 937
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :937 after 3226
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3226 after 10678
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :10678 after 31592
Detected timeout of ITS tools.
[2022-06-12 21:17:00] [INFO ] Flatten gal took : 43 ms
[2022-06-12 21:17:00] [INFO ] Applying decomposition
[2022-06-12 21:17:00] [INFO ] Flatten gal took : 42 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/graph9601462674329122207.txt, -o, /tmp/graph9601462674329122207.bin, -w, /tmp/graph9601462674329122207.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/graph9601462674329122207.bin, -l, -1, -v, -w, /tmp/graph9601462674329122207.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:17:01] [INFO ] Decomposing Gal with order
[2022-06-12 21:17:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:17:01] [INFO ] Removed a total of 1786 redundant transitions.
[2022-06-12 21:17:01] [INFO ] Flatten gal took : 89 ms
[2022-06-12 21:17:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 10 ms.
[2022-06-12 21:17:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13302124880443245253.gal : 12 ms
[2022-06-12 21:17:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11153113393980538929.prop : 57 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/ReachabilityCardinality13302124880443245253.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11153113393980538929.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/ReachabilityCardinality13302124880443245253.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11153113393980538929.prop --nowitness
Loading property file /tmp/ReachabilityCardinality11153113393980538929.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 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 4384
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6140894387049186722
[2022-06-12 21:17:16] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6140894387049186722
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/ltsmin6140894387049186722]
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/ltsmin6140894387049186722] 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/ltsmin6140894387049186722] 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 5360 ms. (steps per millisecond=186 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 120784 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=24 ) properties seen :{}
Interrupted probabilistic random walk after 6465664 steps, run timeout after 30001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 6465664 steps, saw 921201 distinct states, run finished after 30001 ms. (steps per millisecond=215 ) properties seen :{}
Running SMT prover for 1 properties.
[2022-06-12 21:17:57] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-06-12 21:17:57] [INFO ] Computed 27 place invariants in 19 ms
[2022-06-12 21:17:57] [INFO ] [Real]Absence check using 20 positive place invariants in 25 ms returned sat
[2022-06-12 21:17:57] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 11 ms returned sat
[2022-06-12 21:17:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:17:59] [INFO ] [Real]Absence check using state equation in 1188 ms returned sat
[2022-06-12 21:17:59] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 21:17:59] [INFO ] [Real]Added 366 Read/Feed constraints in 46 ms returned sat
[2022-06-12 21:17:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:17:59] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned sat
[2022-06-12 21:17:59] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2022-06-12 21:17:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:00] [INFO ] [Nat]Absence check using state equation in 1180 ms returned sat
[2022-06-12 21:18:00] [INFO ] [Nat]Added 366 Read/Feed constraints in 59 ms returned sat
[2022-06-12 21:18:00] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 1 ms to minimize.
[2022-06-12 21:18:01] [INFO ] Deduced a trap composed of 52 places in 158 ms of which 0 ms to minimize.
[2022-06-12 21:18:01] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 0 ms to minimize.
[2022-06-12 21:18:01] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 1 ms to minimize.
[2022-06-12 21:18:01] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 1 ms to minimize.
[2022-06-12 21:18:01] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 1 ms to minimize.
[2022-06-12 21:18:02] [INFO ] Deduced a trap composed of 27 places in 160 ms of which 1 ms to minimize.
[2022-06-12 21:18:02] [INFO ] Deduced a trap composed of 29 places in 155 ms of which 0 ms to minimize.
[2022-06-12 21:18:02] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 0 ms to minimize.
[2022-06-12 21:18:02] [INFO ] Deduced a trap composed of 24 places in 157 ms of which 1 ms to minimize.
[2022-06-12 21:18:03] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 1 ms to minimize.
[2022-06-12 21:18:03] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 1 ms to minimize.
[2022-06-12 21:18:03] [INFO ] Deduced a trap composed of 83 places in 154 ms of which 1 ms to minimize.
[2022-06-12 21:18:03] [INFO ] Deduced a trap composed of 19 places in 154 ms of which 0 ms to minimize.
[2022-06-12 21:18:03] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 1 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 0 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 29 places in 147 ms of which 1 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 0 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 81 places in 145 ms of which 0 ms to minimize.
[2022-06-12 21:18:04] [INFO ] Deduced a trap composed of 125 places in 150 ms of which 0 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 0 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 104 places in 148 ms of which 1 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 1 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 0 ms to minimize.
[2022-06-12 21:18:05] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 0 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 27 places in 136 ms of which 0 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 1 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 88 places in 100 ms of which 0 ms to minimize.
[2022-06-12 21:18:06] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 1 ms to minimize.
[2022-06-12 21:18:07] [INFO ] Deduced a trap composed of 48 places in 158 ms of which 1 ms to minimize.
[2022-06-12 21:18:07] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 0 ms to minimize.
[2022-06-12 21:18:07] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 0 ms to minimize.
[2022-06-12 21:18:07] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 0 ms to minimize.
[2022-06-12 21:18:07] [INFO ] Deduced a trap composed of 59 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:18:08] [INFO ] Deduced a trap composed of 88 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:18:08] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 1 ms to minimize.
[2022-06-12 21:18:08] [INFO ] Deduced a trap composed of 106 places in 130 ms of which 0 ms to minimize.
[2022-06-12 21:18:08] [INFO ] Deduced a trap composed of 106 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:18:08] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 0 ms to minimize.
[2022-06-12 21:18:08] [INFO ] Deduced a trap composed of 104 places in 116 ms of which 1 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 79 places in 181 ms of which 1 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 110 places in 173 ms of which 1 ms to minimize.
[2022-06-12 21:18:09] [INFO ] Deduced a trap composed of 35 places in 184 ms of which 1 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 172 places in 182 ms of which 1 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 1 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 32 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 17 places in 164 ms of which 0 ms to minimize.
[2022-06-12 21:18:10] [INFO ] Deduced a trap composed of 97 places in 132 ms of which 1 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Deduced a trap composed of 97 places in 130 ms of which 1 ms to minimize.
[2022-06-12 21:18:11] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 10484 ms
[2022-06-12 21:18:11] [INFO ] Computed and/alt/rep : 1141/2954/1141 causal constraints (skipped 84 transitions) in 62 ms.
[2022-06-12 21:18:31] [INFO ] Added : 1010 causal constraints over 202 iterations in 20098 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 50 ms.
Incomplete Parikh walk after 555500 steps, including 1000 resets, run finished after 1964 ms. (steps per millisecond=282 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 406 out of 742 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 26 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 742/742 places, 1442/1442 transitions.
Starting structural reductions, iteration 0 : 742/742 places, 1442/1442 transitions.
Applied a total of 0 rules in 22 ms. Remains 742 /742 variables (removed 0) and now considering 1442/1442 (removed 0) transitions.
[2022-06-12 21:18:33] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-06-12 21:18:33] [INFO ] Computed 27 place invariants in 4 ms
[2022-06-12 21:18:33] [INFO ] Implicit Places using invariants in 172 ms returned []
[2022-06-12 21:18:33] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-06-12 21:18:33] [INFO ] Computed 27 place invariants in 7 ms
[2022-06-12 21:18:33] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 21:18:34] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2022-06-12 21:18:34] [INFO ] Redundant transitions in 82 ms returned []
[2022-06-12 21:18:34] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-06-12 21:18:34] [INFO ] Computed 27 place invariants in 4 ms
[2022-06-12 21:18:34] [INFO ] Dead Transitions using invariants and state equation in 458 ms returned []
Finished structural reductions, in 1 iterations. Remains : 742/742 places, 1442/1442 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 619 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-06-12 21:18:35] [INFO ] Flow matrix only has 1232 transitions (discarded 210 similar events)
// Phase 1: matrix 1232 rows 742 cols
[2022-06-12 21:18:35] [INFO ] Computed 27 place invariants in 4 ms
[2022-06-12 21:18:35] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2022-06-12 21:18:35] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2022-06-12 21:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:36] [INFO ] [Real]Absence check using state equation in 1139 ms returned sat
[2022-06-12 21:18:36] [INFO ] State equation strengthened by 366 read => feed constraints.
[2022-06-12 21:18:36] [INFO ] [Real]Added 366 Read/Feed constraints in 44 ms returned sat
[2022-06-12 21:18:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:18:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 24 ms returned sat
[2022-06-12 21:18:36] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2022-06-12 21:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:18:38] [INFO ] [Nat]Absence check using state equation in 1176 ms returned sat
[2022-06-12 21:18:38] [INFO ] [Nat]Added 366 Read/Feed constraints in 55 ms returned sat
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 1 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 0 ms to minimize.
[2022-06-12 21:18:38] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 0 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 40 places in 177 ms of which 0 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 24 places in 170 ms of which 0 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 29 places in 151 ms of which 0 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 0 ms to minimize.
[2022-06-12 21:18:39] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 1 ms to minimize.
[2022-06-12 21:18:40] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 0 ms to minimize.
[2022-06-12 21:18:40] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 0 ms to minimize.
[2022-06-12 21:18:40] [INFO ] Deduced a trap composed of 33 places in 154 ms of which 1 ms to minimize.
[2022-06-12 21:18:40] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 1 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 0 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 19 places in 160 ms of which 1 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 13 places in 155 ms of which 1 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 1 ms to minimize.
[2022-06-12 21:18:41] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 1 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 79 places in 149 ms of which 0 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 1 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 125 places in 147 ms of which 0 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 63 places in 147 ms of which 0 ms to minimize.
[2022-06-12 21:18:42] [INFO ] Deduced a trap composed of 104 places in 144 ms of which 1 ms to minimize.
[2022-06-12 21:18:43] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 1 ms to minimize.
[2022-06-12 21:18:43] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2022-06-12 21:18:43] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 0 ms to minimize.
[2022-06-12 21:18:43] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 0 ms to minimize.
[2022-06-12 21:18:43] [INFO ] Deduced a trap composed of 27 places in 142 ms of which 1 ms to minimize.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 64 places in 135 ms of which 0 ms to minimize.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 88 places in 102 ms of which 0 ms to minimize.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 0 ms to minimize.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 0 ms to minimize.
[2022-06-12 21:18:44] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 1 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 1 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 88 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 0 ms to minimize.
[2022-06-12 21:18:45] [INFO ] Deduced a trap composed of 106 places in 121 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 106 places in 117 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 104 places in 114 ms of which 1 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:18:46] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 110 places in 184 ms of which 0 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 35 places in 188 ms of which 1 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 172 places in 173 ms of which 0 ms to minimize.
[2022-06-12 21:18:47] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 0 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 32 places in 175 ms of which 1 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 17 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 97 places in 135 ms of which 0 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 1 ms to minimize.
[2022-06-12 21:18:48] [INFO ] Trap strengthening (SAT) tested/added 52/51 trap constraints in 10533 ms
[2022-06-12 21:18:48] [INFO ] Computed and/alt/rep : 1141/2954/1141 causal constraints (skipped 84 transitions) in 70 ms.
[2022-06-12 21:18:57] [INFO ] Deduced a trap composed of 2 places in 251 ms of which 1 ms to minimize.
[2022-06-12 21:18:57] [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:18:57] [INFO ] Flatten gal took : 42 ms
[2022-06-12 21:18:57] [INFO ] Flatten gal took : 41 ms
[2022-06-12 21:18:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5724823137131434568.gal : 4 ms
[2022-06-12 21:18:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11265807793848268251.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/ReachabilityCardinality5724823137131434568.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11265807793848268251.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/ReachabilityCardinality5724823137131434568.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11265807793848268251.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11265807793848268251.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 4
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :10 after 17
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :17 after 21
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :21 after 40
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :40 after 141
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :141 after 174
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :174 after 338
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :338 after 937
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :937 after 3226
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3226 after 10678
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :10678 after 31592
Detected timeout of ITS tools.
[2022-06-12 21:19:12] [INFO ] Flatten gal took : 37 ms
[2022-06-12 21:19:12] [INFO ] Applying decomposition
[2022-06-12 21:19:12] [INFO ] Flatten gal took : 36 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/graph6299687286197509297.txt, -o, /tmp/graph6299687286197509297.bin, -w, /tmp/graph6299687286197509297.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/graph6299687286197509297.bin, -l, -1, -v, -w, /tmp/graph6299687286197509297.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:19:12] [INFO ] Decomposing Gal with order
[2022-06-12 21:19:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:19:12] [INFO ] Removed a total of 1786 redundant transitions.
[2022-06-12 21:19:12] [INFO ] Flatten gal took : 96 ms
[2022-06-12 21:19:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2022-06-12 21:19:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1945782030588373177.gal : 10 ms
[2022-06-12 21:19:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13198329406085353843.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/ReachabilityCardinality1945782030588373177.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13198329406085353843.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/ReachabilityCardinality1945782030588373177.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13198329406085353843.prop --nowitness
Loading property file /tmp/ReachabilityCardinality13198329406085353843.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 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 368
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11338325209150738594
[2022-06-12 21:19:27] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11338325209150738594
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/ltsmin11338325209150738594]
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/ltsmin11338325209150738594] 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/ltsmin11338325209150738594] 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 210 transitions
Reduce isomorphic transitions removed 210 transitions.
Iterating post reduction 0 with 210 rules applied. Total rules applied 210 place count 742 transition count 1232
Applied a total of 210 rules in 20 ms. Remains 742 /742 variables (removed 0) and now considering 1232/1442 (removed 210) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1232 rows 742 cols
[2022-06-12 21:19:28] [INFO ] Computed 27 place invariants in 3 ms
[2022-06-12 21:19:28] [INFO ] [Real]Absence check using 20 positive place invariants in 23 ms returned sat
[2022-06-12 21:19:28] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 10 ms returned sat
[2022-06-12 21:19:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:30] [INFO ] [Real]Absence check using state equation in 1245 ms returned sat
[2022-06-12 21:19:30] [INFO ] Computed and/alt/rep : 1141/2486/1141 causal constraints (skipped 84 transitions) in 87 ms.
[2022-06-12 21:19:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:19:30] [INFO ] [Nat]Absence check using 20 positive place invariants in 25 ms returned sat
[2022-06-12 21:19:30] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 25 ms returned sat
[2022-06-12 21:19:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:19:31] [INFO ] [Nat]Absence check using state equation in 1178 ms returned sat
[2022-06-12 21:19:32] [INFO ] Computed and/alt/rep : 1141/2486/1141 causal constraints (skipped 84 transitions) in 52 ms.
[2022-06-12 21:19:43] [INFO ] Added : 711 causal constraints over 143 iterations in 11485 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-06-12 21:19:43] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6479315323776066716
[2022-06-12 21:19:43] [INFO ] Applying decomposition
[2022-06-12 21:19:43] [INFO ] Flatten gal took : 53 ms
[2022-06-12 21:19:43] [INFO ] Computing symmetric may disable matrix : 1442 transitions.
[2022-06-12 21:19:43] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:19:43] [INFO ] Computing symmetric may enable matrix : 1442 transitions.
[2022-06-12 21:19:43] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:19:43] [INFO ] Flatten gal took : 78 ms
[2022-06-12 21:19:43] [INFO ] Input system was already deterministic with 1442 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph16240938549625046162.txt, -o, /tmp/graph16240938549625046162.bin, -w, /tmp/graph16240938549625046162.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/graph16240938549625046162.bin, -l, -1, -v, -w, /tmp/graph16240938549625046162.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:19:43] [INFO ] Decomposing Gal with order
[2022-06-12 21:19:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:19:43] [INFO ] Removed a total of 1786 redundant transitions.
[2022-06-12 21:19:44] [INFO ] Flatten gal took : 83 ms
[2022-06-12 21:19:44] [INFO ] Ran tautology test, simplified 0 / 1 in 558 ms.
[2022-06-12 21:19:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-06-12 21:19:44] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6540239321964412461.gal : 10 ms
[2022-06-12 21:19:44] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability14226203332567406987.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/ReachabilityFireability6540239321964412461.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability14226203332567406987.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/ReachabilityFireability6540239321964412461.gal -t CGAL -reachable-file /tmp/ReachabilityFireability14226203332567406987.prop --nowitness
[2022-06-12 21:19:44] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-09(UNSAT) depth K=0 took 59 ms
[2022-06-12 21:19:44] [INFO ] Computing Do-Not-Accords matrix : 1442 transitions.
[2022-06-12 21:19:44] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-09(UNSAT) depth K=1 took 131 ms
[2022-06-12 21:19:44] [INFO ] Computation of Completed DNA matrix. took 76 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-12 21:19:44] [INFO ] Built C files in 850ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6479315323776066716
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/ltsmin6479315323776066716]
Loading property file /tmp/ReachabilityFireability14226203332567406987.prop.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 1232 out of 1442 initially.
// Phase 1: matrix 1232 rows 742 cols
[2022-06-12 21:19:44] [INFO ] Computed 27 place invariants in 3 ms
inv : WantSection_0 + AskForSection_0 + AskForSection_1 + AskForSection_2 + AskForSection_3 + AskForSection_4 + AskForSection_5 + TestTurn_0 + TestTurn_1 + TestTurn_2 + TestTurn_3 + TestTurn_4 + TestTurn_5 + BeginLoop_0 + BeginLoop_7 + BeginLoop_14 + BeginLoop_21 + BeginLoop_28 + BeginLoop_35 + EndTurn_0 + EndTurn_1 + EndTurn_2 + EndTurn_3 + EndTurn_4 + EndTurn_5 + CS_0 + TestAlone_1 + TestAlone_2 + TestAlone_3 + TestAlone_4 + TestAlone_5 + TestAlone_6 + TestAlone_8 + TestAlone_9 + TestAlone_10 + TestAlone_11 + TestAlone_12 + TestAlone_13 + TestAlone_15 + TestAlone_16 + TestAlone_17 + TestAlone_18 + TestAlone_19 + TestAlone_20 + TestAlone_22 + TestAlone_23 + TestAlone_24 + TestAlone_25 + TestAlone_26 + TestAlone_27 + TestAlone_29 + TestAlone_30 + TestAlone_31 + TestAlone_32 + TestAlone_33 + TestAlone_34 + TestAlone_36 + TestAlone_37 + TestAlone_38 + TestAlone_39 + TestAlone_40 + TestAlone_41 + IsEndLoop_1 + IsEndLoop_2 + IsEndLoop_3 + IsEndLoop_4 + IsEndLoop_5 + IsEndLoop_6 + IsEndLoop_8 + IsEndLoop_9 + IsEndLoop_10 + IsEndLoop_11 + IsEndLoop_12 + IsEndLoop_13 + IsEndLoop_15 + IsEndLoop_16 + IsEndLoop_17 + IsEndLoop_18 + IsEndLoop_19 + IsEndLoop_20 + IsEndLoop_22 + IsEndLoop_23 + IsEndLoop_24 + IsEndLoop_25 + IsEndLoop_26 + IsEndLoop_27 + IsEndLoop_29 + IsEndLoop_30 + IsEndLoop_31 + IsEndLoop_32 + IsEndLoop_33 + IsEndLoop_34 + IsEndLoop_36 + IsEndLoop_37 + IsEndLoop_38 + IsEndLoop_39 + IsEndLoop_40 + IsEndLoop_41 = 1
inv : WantSection_3 - AskForSection_6 - AskForSection_7 - AskForSection_8 - AskForSection_9 - AskForSection_10 - AskForSection_11 - TestTurn_6 - TestTurn_7 - TestTurn_8 - TestTurn_9 - TestTurn_10 - TestTurn_11 - BeginLoop_42 - BeginLoop_49 - BeginLoop_56 - BeginLoop_63 - BeginLoop_70 - BeginLoop_77 - EndTurn_6 - EndTurn_7 - EndTurn_8 - EndTurn_9 - EndTurn_10 - EndTurn_11 - CS_1 - TestAlone_42 - TestAlone_44 - TestAlone_45 - TestAlone_46 - TestAlone_47 - TestAlone_48 - TestAlone_49 - TestAlone_51 - TestAlone_52 - TestAlone_53 - TestAlone_54 - TestAlone_55 - TestAlone_56 - TestAlone_58 - TestAlone_59 - TestAlone_60 - TestAlone_61 - TestAlone_62 - TestAlone_63 - TestAlone_65 - TestAlone_66 - TestAlone_67 - TestAlone_68 - TestAlone_69 - TestAlone_70 - TestAlone_72 - TestAlone_73 - TestAlone_74 - TestAlone_75 - TestAlone_76 - TestAlone_77 - TestAlone_79 - TestAlone_80 - TestAlone_81 - TestAlone_82 - TestAlone_83 - IsEndLoop_42 - IsEndLoop_44 - IsEndLoop_45 - IsEndLoop_46 - IsEndLoop_47 - IsEndLoop_48 - IsEndLoop_49 - IsEndLoop_51 - IsEndLoop_52 - IsEndLoop_53 - IsEndLoop_54 - IsEndLoop_55 - IsEndLoop_56 - IsEndLoop_58 - IsEndLoop_59 - IsEndLoop_60 - IsEndLoop_61 - IsEndLoop_62 - IsEndLoop_63 - IsEndLoop_65 - IsEndLoop_66 - IsEndLoop_67 - IsEndLoop_68 - IsEndLoop_69 - IsEndLoop_70 - IsEndLoop_72 - IsEndLoop_73 - IsEndLoop_74 - IsEndLoop_75 - IsEndLoop_76 - IsEndLoop_77 - IsEndLoop_79 - IsEndLoop_80 - IsEndLoop_81 - IsEndLoop_82 - IsEndLoop_83 = 0
inv : WantSection_9 - AskForSection_24 - AskForSection_25 - AskForSection_26 - AskForSection_27 - AskForSection_28 - AskForSection_29 - TestTurn_24 - TestTurn_25 - TestTurn_26 - TestTurn_27 - TestTurn_28 - TestTurn_29 - BeginLoop_168 - BeginLoop_175 - BeginLoop_182 - BeginLoop_189 - BeginLoop_196 - BeginLoop_203 - EndTurn_24 - EndTurn_25 - EndTurn_26 - EndTurn_27 - EndTurn_28 - EndTurn_29 - CS_4 - TestAlone_168 - TestAlone_169 - TestAlone_170 - TestAlone_171 - TestAlone_173 - TestAlone_174 - TestAlone_175 - TestAlone_176 - TestAlone_177 - TestAlone_178 - TestAlone_180 - TestAlone_181 - TestAlone_182 - TestAlone_183 - TestAlone_184 - TestAlone_185 - TestAlone_187 - TestAlone_188 - TestAlone_189 - TestAlone_190 - TestAlone_191 - TestAlone_192 - TestAlone_194 - TestAlone_195 - TestAlone_196 - TestAlone_197 - TestAlone_198 - TestAlone_199 - TestAlone_201 - TestAlone_202 - TestAlone_203 - TestAlone_204 - TestAlone_205 - TestAlone_206 - TestAlone_208 - TestAlone_209 - IsEndLoop_168 - IsEndLoop_169 - IsEndLoop_170 - IsEndLoop_171 - IsEndLoop_173 - IsEndLoop_174 - IsEndLoop_175 - IsEndLoop_176 - IsEndLoop_177 - IsEndLoop_178 - IsEndLoop_180 - IsEndLoop_181 - IsEndLoop_182 - IsEndLoop_183 - IsEndLoop_184 - IsEndLoop_185 - IsEndLoop_187 - IsEndLoop_188 - IsEndLoop_189 - IsEndLoop_190 - IsEndLoop_191 - IsEndLoop_192 - IsEndLoop_194 - IsEndLoop_195 - IsEndLoop_196 - IsEndLoop_197 - IsEndLoop_198 - IsEndLoop_199 - IsEndLoop_201 - IsEndLoop_202 - IsEndLoop_203 - IsEndLoop_204 - IsEndLoop_205 - IsEndLoop_206 - IsEndLoop_208 - IsEndLoop_209 = 0
inv : WantSection_12 + AskForSection_36 + AskForSection_37 + AskForSection_38 + AskForSection_39 + AskForSection_40 + AskForSection_41 + TestTurn_36 + TestTurn_37 + TestTurn_38 + TestTurn_39 + TestTurn_40 + TestTurn_41 + BeginLoop_252 + BeginLoop_259 + BeginLoop_266 + BeginLoop_273 + BeginLoop_280 + BeginLoop_287 + EndTurn_36 + EndTurn_37 + EndTurn_38 + EndTurn_39 + EndTurn_40 + EndTurn_41 + CS_6 + TestAlone_252 + TestAlone_253 + TestAlone_254 + TestAlone_255 + TestAlone_256 + TestAlone_257 + TestAlone_259 + TestAlone_260 + TestAlone_261 + TestAlone_262 + TestAlone_263 + TestAlone_264 + TestAlone_266 + TestAlone_267 + TestAlone_268 + TestAlone_269 + TestAlone_270 + TestAlone_271 + TestAlone_273 + TestAlone_274 + TestAlone_275 + TestAlone_276 + TestAlone_277 + TestAlone_278 + TestAlone_280 + TestAlone_281 + TestAlone_282 + TestAlone_283 + TestAlone_284 + TestAlone_285 + TestAlone_287 + TestAlone_288 + TestAlone_289 + TestAlone_290 + TestAlone_291 + TestAlone_292 + IsEndLoop_252 + IsEndLoop_253 + IsEndLoop_254 + IsEndLoop_255 + IsEndLoop_256 + IsEndLoop_257 + IsEndLoop_259 + IsEndLoop_260 + IsEndLoop_261 + IsEndLoop_262 + IsEndLoop_263 + IsEndLoop_264 + IsEndLoop_266 + IsEndLoop_267 + IsEndLoop_268 + IsEndLoop_269 + IsEndLoop_270 + IsEndLoop_271 + IsEndLoop_273 + IsEndLoop_274 + IsEndLoop_275 + IsEndLoop_276 + IsEndLoop_277 + IsEndLoop_278 + IsEndLoop_280 + IsEndLoop_281 + IsEndLoop_282 + IsEndLoop_283 + IsEndLoop_284 + IsEndLoop_285 + IsEndLoop_287 + IsEndLoop_288 + IsEndLoop_289 + IsEndLoop_290 + IsEndLoop_291 + IsEndLoop_292 = 1
inv : Idle_6 + AskForSection_36 + AskForSection_37 + AskForSection_38 + AskForSection_39 + AskForSection_40 + AskForSection_41 + TestTurn_36 + TestTurn_37 + TestTurn_38 + TestTurn_39 + TestTurn_40 + TestTurn_41 + BeginLoop_252 + BeginLoop_259 + BeginLoop_266 + BeginLoop_273 + BeginLoop_280 + BeginLoop_287 + EndTurn_36 + EndTurn_37 + EndTurn_38 + EndTurn_39 + EndTurn_40 + EndTurn_41 + CS_6 + TestAlone_252 + TestAlone_253 + TestAlone_254 + TestAlone_255 + TestAlone_256 + TestAlone_257 + TestAlone_259 + TestAlone_260 + TestAlone_261 + TestAlone_262 + TestAlone_263 + TestAlone_264 + TestAlone_266 + TestAlone_267 + TestAlone_268 + TestAlone_269 + TestAlone_270 + TestAlone_271 + TestAlone_273 + TestAlone_274 + TestAlone_275 + TestAlone_276 + TestAlone_277 + TestAlone_278 + TestAlone_280 + TestAlone_281 + TestAlone_282 + TestAlone_283 + TestAlone_284 + TestAlone_285 + TestAlone_287 + TestAlone_288 + TestAlone_289 + TestAlone_290 + TestAlone_291 + TestAlone_292 + IsEndLoop_252 + IsEndLoop_253 + IsEndLoop_254 + IsEndLoop_255 + IsEndLoop_256 + IsEndLoop_257 + IsEndLoop_259 + IsEndLoop_260 + IsEndLoop_261 + IsEndLoop_262 + IsEndLoop_263 + IsEndLoop_264 + IsEndLoop_266 + IsEndLoop_267 + IsEndLoop_268 + IsEndLoop_269 + IsEndLoop_270 + IsEndLoop_271 + IsEndLoop_273 + IsEndLoop_274 + IsEndLoop_275 + IsEndLoop_276 + IsEndLoop_277 + IsEndLoop_278 + IsEndLoop_280 + IsEndLoop_281 + IsEndLoop_282 + IsEndLoop_283 + IsEndLoop_284 + IsEndLoop_285 + IsEndLoop_287 + IsEndLoop_288 + IsEndLoop_289 + IsEndLoop_290 + IsEndLoop_291 + IsEndLoop_292 = 1
inv : Turn_14 + Turn_15 + Turn_16 + Turn_17 + Turn_18 + Turn_19 + Turn_20 = 1
inv : WantSection_6 + AskForSection_18 + AskForSection_19 + AskForSection_20 + AskForSection_21 + AskForSection_22 + AskForSection_23 + TestTurn_18 + TestTurn_19 + TestTurn_20 + TestTurn_21 + TestTurn_22 + TestTurn_23 + BeginLoop_126 + BeginLoop_133 + BeginLoop_140 + BeginLoop_147 + BeginLoop_154 + BeginLoop_161 + EndTurn_18 + EndTurn_19 + EndTurn_20 + EndTurn_21 + EndTurn_22 + EndTurn_23 + CS_3 + TestAlone_126 + TestAlone_127 + TestAlone_128 + TestAlone_130 + TestAlone_131 + TestAlone_132 + TestAlone_133 + TestAlone_134 + TestAlone_135 + TestAlone_137 + TestAlone_138 + TestAlone_139 + TestAlone_140 + TestAlone_141 + TestAlone_142 + TestAlone_144 + TestAlone_145 + TestAlone_146 + TestAlone_147 + TestAlone_148 + TestAlone_149 + TestAlone_151 + TestAlone_152 + TestAlone_153 + TestAlone_154 + TestAlone_155 + TestAlone_156 + TestAlone_158 + TestAlone_159 + TestAlone_160 + TestAlone_161 + TestAlone_162 + TestAlone_163 + TestAlone_165 + TestAlone_166 + TestAlone_167 + IsEndLoop_126 + IsEndLoop_127 + IsEndLoop_128 + IsEndLoop_130 + IsEndLoop_131 + IsEndLoop_132 + IsEndLoop_133 + IsEndLoop_134 + IsEndLoop_135 + IsEndLoop_137 + IsEndLoop_138 + IsEndLoop_139 + IsEndLoop_140 + IsEndLoop_141 + IsEndLoop_142 + IsEndLoop_144 + IsEndLoop_145 + IsEndLoop_146 + IsEndLoop_147 + IsEndLoop_148 + IsEndLoop_149 + IsEndLoop_151 + IsEndLoop_152 + IsEndLoop_153 + IsEndLoop_154 + IsEndLoop_155 + IsEndLoop_156 + IsEndLoop_158 + IsEndLoop_159 + IsEndLoop_160 + IsEndLoop_161 + IsEndLoop_162 + IsEndLoop_163 + IsEndLoop_165 + IsEndLoop_166 + IsEndLoop_167 = 1
inv : Idle_5 + AskForSection_30 + AskForSection_31 + AskForSection_32 + AskForSection_33 + AskForSection_34 + AskForSection_35 + TestTurn_30 + TestTurn_31 + TestTurn_32 + TestTurn_33 + TestTurn_34 + TestTurn_35 + BeginLoop_210 + BeginLoop_217 + BeginLoop_224 + BeginLoop_231 + BeginLoop_238 + BeginLoop_245 + EndTurn_30 + EndTurn_31 + EndTurn_32 + EndTurn_33 + EndTurn_34 + EndTurn_35 + CS_5 + TestAlone_210 + TestAlone_211 + TestAlone_212 + TestAlone_213 + TestAlone_214 + TestAlone_216 + TestAlone_217 + TestAlone_218 + TestAlone_219 + TestAlone_220 + TestAlone_221 + TestAlone_223 + TestAlone_224 + TestAlone_225 + TestAlone_226 + TestAlone_227 + TestAlone_228 + TestAlone_230 + TestAlone_231 + TestAlone_232 + TestAlone_233 + TestAlone_234 + TestAlone_235 + TestAlone_237 + TestAlone_238 + TestAlone_239 + TestAlone_240 + TestAlone_241 + TestAlone_242 + TestAlone_244 + TestAlone_245 + TestAlone_246 + TestAlone_247 + TestAlone_248 + TestAlone_249 + TestAlone_251 + IsEndLoop_210 + IsEndLoop_211 + IsEndLoop_212 + IsEndLoop_213 + IsEndLoop_214 + IsEndLoop_216 + IsEndLoop_217 + IsEndLoop_218 + IsEndLoop_219 + IsEndLoop_220 + IsEndLoop_221 + IsEndLoop_223 + IsEndLoop_224 + IsEndLoop_225 + IsEndLoop_226 + IsEndLoop_227 + IsEndLoop_228 + IsEndLoop_230 + IsEndLoop_231 + IsEndLoop_232 + IsEndLoop_233 + IsEndLoop_234 + IsEndLoop_235 + IsEndLoop_237 + IsEndLoop_238 + IsEndLoop_239 + IsEndLoop_240 + IsEndLoop_241 + IsEndLoop_242 + IsEndLoop_244 + IsEndLoop_245 + IsEndLoop_246 + IsEndLoop_247 + IsEndLoop_248 + IsEndLoop_249 + IsEndLoop_251 = 1
inv : Turn_7 + Turn_8 + Turn_9 + Turn_10 + Turn_11 + Turn_12 + Turn_13 = 1
inv : Idle_3 + AskForSection_18 + AskForSection_19 + AskForSection_20 + AskForSection_21 + AskForSection_22 + AskForSection_23 + TestTurn_18 + TestTurn_19 + TestTurn_20 + TestTurn_21 + TestTurn_22 + TestTurn_23 + BeginLoop_126 + BeginLoop_133 + BeginLoop_140 + BeginLoop_147 + BeginLoop_154 + BeginLoop_161 + EndTurn_18 + EndTurn_19 + EndTurn_20 + EndTurn_21 + EndTurn_22 + EndTurn_23 + CS_3 + TestAlone_126 + TestAlone_127 + TestAlone_128 + TestAlone_130 + TestAlone_131 + TestAlone_132 + TestAlone_133 + TestAlone_134 + TestAlone_135 + TestAlone_137 + TestAlone_138 + TestAlone_139 + TestAlone_140 + TestAlone_141 + TestAlone_142 + TestAlone_144 + TestAlone_145 + TestAlone_146 + TestAlone_147 + TestAlone_148 + TestAlone_149 + TestAlone_151 + TestAlone_152 + TestAlone_153 + TestAlone_154 + TestAlone_155 + TestAlone_156 + TestAlone_158 + TestAlone_159 + TestAlone_160 + TestAlone_161 + TestAlone_162 + TestAlone_163 + TestAlone_165 + TestAlone_166 + TestAlone_167 + IsEndLoop_126 + IsEndLoop_127 + IsEndLoop_128 + IsEndLoop_130 + IsEndLoop_131 + IsEndLoop_132 + IsEndLoop_133 + IsEndLoop_134 + IsEndLoop_135 + IsEndLoop_137 + IsEndLoop_138 + IsEndLoop_139 + IsEndLoop_140 + IsEndLoop_141 + IsEndLoop_142 + IsEndLoop_144 + IsEndLoop_145 + IsEndLoop_146 + IsEndLoop_147 + IsEndLoop_148 + IsEndLoop_149 + IsEndLoop_151 + IsEndLoop_152 + IsEndLoop_153 + IsEndLoop_154 + IsEndLoop_155 + IsEndLoop_156 + IsEndLoop_158 + IsEndLoop_159 + IsEndLoop_160 + IsEndLoop_161 + IsEndLoop_162 + IsEndLoop_163 + IsEndLoop_165 + IsEndLoop_166 + IsEndLoop_167 = 1
inv : WantSection_2 + AskForSection_6 + AskForSection_7 + AskForSection_8 + AskForSection_9 + AskForSection_10 + AskForSection_11 + TestTurn_6 + TestTurn_7 + TestTurn_8 + TestTurn_9 + TestTurn_10 + TestTurn_11 + BeginLoop_42 + BeginLoop_49 + BeginLoop_56 + BeginLoop_63 + BeginLoop_70 + BeginLoop_77 + EndTurn_6 + EndTurn_7 + EndTurn_8 + EndTurn_9 + EndTurn_10 + EndTurn_11 + CS_1 + TestAlone_42 + TestAlone_44 + TestAlone_45 + TestAlone_46 + TestAlone_47 + TestAlone_48 + TestAlone_49 + TestAlone_51 + TestAlone_52 + TestAlone_53 + TestAlone_54 + TestAlone_55 + TestAlone_56 + TestAlone_58 + TestAlone_59 + TestAlone_60 + TestAlone_61 + TestAlone_62 + TestAlone_63 + TestAlone_65 + TestAlone_66 + TestAlone_67 + TestAlone_68 + TestAlone_69 + TestAlone_70 + TestAlone_72 + TestAlone_73 + TestAlone_74 + TestAlone_75 + TestAlone_76 + TestAlone_77 + TestAlone_79 + TestAlone_80 + TestAlone_81 + TestAlone_82 + TestAlone_83 + IsEndLoop_42 + IsEndLoop_44 + IsEndLoop_45 + IsEndLoop_46 + IsEndLoop_47 + IsEndLoop_48 + IsEndLoop_49 + IsEndLoop_51 + IsEndLoop_52 + IsEndLoop_53 + IsEndLoop_54 + IsEndLoop_55 + IsEndLoop_56 + IsEndLoop_58 + IsEndLoop_59 + IsEndLoop_60 + IsEndLoop_61 + IsEndLoop_62 + IsEndLoop_63 + IsEndLoop_65 + IsEndLoop_66 + IsEndLoop_67 + IsEndLoop_68 + IsEndLoop_69 + IsEndLoop_70 + IsEndLoop_72 + IsEndLoop_73 + IsEndLoop_74 + IsEndLoop_75 + IsEndLoop_76 + IsEndLoop_77 + IsEndLoop_79 + IsEndLoop_80 + IsEndLoop_81 + IsEndLoop_82 + IsEndLoop_83 = 1
inv : Idle_1 + AskForSection_6 + AskForSection_7 + AskForSection_8 + AskForSection_9 + AskForSection_10 + AskForSection_11 + TestTurn_6 + TestTurn_7 + TestTurn_8 + TestTurn_9 + TestTurn_10 + TestTurn_11 + BeginLoop_42 + BeginLoop_49 + BeginLoop_56 + BeginLoop_63 + BeginLoop_70 + BeginLoop_77 + EndTurn_6 + EndTurn_7 + EndTurn_8 + EndTurn_9 + EndTurn_10 + EndTurn_11 + CS_1 + TestAlone_42 + TestAlone_44 + TestAlone_45 + TestAlone_46 + TestAlone_47 + TestAlone_48 + TestAlone_49 + TestAlone_51 + TestAlone_52 + TestAlone_53 + TestAlone_54 + TestAlone_55 + TestAlone_56 + TestAlone_58 + TestAlone_59 + TestAlone_60 + TestAlone_61 + TestAlone_62 + TestAlone_63 + TestAlone_65 + TestAlone_66 + TestAlone_67 + TestAlone_68 + TestAlone_69 + TestAlone_70 + TestAlone_72 + TestAlone_73 + TestAlone_74 + TestAlone_75 + TestAlone_76 + TestAlone_77 + TestAlone_79 + TestAlone_80 + TestAlone_81 + TestAlone_82 + TestAlone_83 + IsEndLoop_42 + IsEndLoop_44 + IsEndLoop_45 + IsEndLoop_46 + IsEndLoop_47 + IsEndLoop_48 + IsEndLoop_49 + IsEndLoop_51 + IsEndLoop_52 + IsEndLoop_53 + IsEndLoop_54 + IsEndLoop_55 + IsEndLoop_56 + IsEndLoop_58 + IsEndLoop_59 + IsEndLoop_60 + IsEndLoop_61 + IsEndLoop_62 + IsEndLoop_63 + IsEndLoop_65 + IsEndLoop_66 + IsEndLoop_67 + IsEndLoop_68 + IsEndLoop_69 + IsEndLoop_70 + IsEndLoop_72 + IsEndLoop_73 + IsEndLoop_74 + IsEndLoop_75 + IsEndLoop_76 + IsEndLoop_77 + IsEndLoop_79 + IsEndLoop_80 + IsEndLoop_81 + IsEndLoop_82 + IsEndLoop_83 = 1
inv : Turn_28 + Turn_29 + Turn_30 + Turn_31 + Turn_32 + Turn_33 + Turn_34 = 1
inv : WantSection_10 + AskForSection_30 + AskForSection_31 + AskForSection_32 + AskForSection_33 + AskForSection_34 + AskForSection_35 + TestTurn_30 + TestTurn_31 + TestTurn_32 + TestTurn_33 + TestTurn_34 + TestTurn_35 + BeginLoop_210 + BeginLoop_217 + BeginLoop_224 + BeginLoop_231 + BeginLoop_238 + BeginLoop_245 + EndTurn_30 + EndTurn_31 + EndTurn_32 + EndTurn_33 + EndTurn_34 + EndTurn_35 + CS_5 + TestAlone_210 + TestAlone_211 + TestAlone_212 + TestAlone_213 + TestAlone_214 + TestAlone_216 + TestAlone_217 + TestAlone_218 + TestAlone_219 + TestAlone_220 + TestAlone_221 + TestAlone_223 + TestAlone_224 + TestAlone_225 + TestAlone_226 + TestAlone_227 + TestAlone_228 + TestAlone_230 + TestAlone_231 + TestAlone_232 + TestAlone_233 + TestAlone_234 + TestAlone_235 + TestAlone_237 + TestAlone_238 + TestAlone_239 + TestAlone_240 + TestAlone_241 + TestAlone_242 + TestAlone_244 + TestAlone_245 + TestAlone_246 + TestAlone_247 + TestAlone_248 + TestAlone_249 + TestAlone_251 + IsEndLoop_210 + IsEndLoop_211 + IsEndLoop_212 + IsEndLoop_213 + IsEndLoop_214 + IsEndLoop_216 + IsEndLoop_217 + IsEndLoop_218 + IsEndLoop_219 + IsEndLoop_220 + IsEndLoop_221 + IsEndLoop_223 + IsEndLoop_224 + IsEndLoop_225 + IsEndLoop_226 + IsEndLoop_227 + IsEndLoop_228 + IsEndLoop_230 + IsEndLoop_231 + IsEndLoop_232 + IsEndLoop_233 + IsEndLoop_234 + IsEndLoop_235 + IsEndLoop_237 + IsEndLoop_238 + IsEndLoop_239 + IsEndLoop_240 + IsEndLoop_241 + IsEndLoop_242 + IsEndLoop_244 + IsEndLoop_245 + IsEndLoop_246 + IsEndLoop_247 + IsEndLoop_248 + IsEndLoop_249 + IsEndLoop_251 = 1
inv : Turn_0 + Turn_1 + Turn_2 + Turn_3 + Turn_4 + Turn_5 + Turn_6 = 1
inv : WantSection_4 + AskForSection_12 + AskForSection_13 + AskForSection_14 + AskForSection_15 + AskForSection_16 + AskForSection_17 + TestTurn_12 + TestTurn_13 + TestTurn_14 + TestTurn_15 + TestTurn_16 + TestTurn_17 + BeginLoop_84 + BeginLoop_91 + BeginLoop_98 + BeginLoop_105 + BeginLoop_112 + BeginLoop_119 + EndTurn_12 + EndTurn_13 + EndTurn_14 + EndTurn_15 + EndTurn_16 + EndTurn_17 + CS_2 + TestAlone_84 + TestAlone_85 + TestAlone_87 + TestAlone_88 + TestAlone_89 + TestAlone_90 + TestAlone_91 + TestAlone_92 + TestAlone_94 + TestAlone_95 + TestAlone_96 + TestAlone_97 + TestAlone_98 + TestAlone_99 + TestAlone_101 + TestAlone_102 + TestAlone_103 + TestAlone_104 + TestAlone_105 + TestAlone_106 + TestAlone_108 + TestAlone_109 + TestAlone_110 + TestAlone_111 + TestAlone_112 + TestAlone_113 + TestAlone_115 + TestAlone_116 + TestAlone_117 + TestAlone_118 + TestAlone_119 + TestAlone_120 + TestAlone_122 + TestAlone_123 + TestAlone_124 + TestAlone_125 + IsEndLoop_84 + IsEndLoop_85 + IsEndLoop_87 + IsEndLoop_88 + IsEndLoop_89 + IsEndLoop_90 + IsEndLoop_91 + IsEndLoop_92 + IsEndLoop_94 + IsEndLoop_95 + IsEndLoop_96 + IsEndLoop_97 + IsEndLoop_98 + IsEndLoop_99 + IsEndLoop_101 + IsEndLoop_102 + IsEndLoop_103 + IsEndLoop_104 + IsEndLoop_105 + IsEndLoop_106 + IsEndLoop_108 + IsEndLoop_109 + IsEndLoop_110 + IsEndLoop_111 + IsEndLoop_112 + IsEndLoop_113 + IsEndLoop_115 + IsEndLoop_116 + IsEndLoop_117 + IsEndLoop_118 + IsEndLoop_119 + IsEndLoop_120 + IsEndLoop_122 + IsEndLoop_123 + IsEndLoop_124 + IsEndLoop_125 = 1
inv : WantSection_13 - AskForSection_36 - AskForSection_37 - AskForSection_38 - AskForSection_39 - AskForSection_40 - AskForSection_41 - TestTurn_36 - TestTurn_37 - TestTurn_38 - TestTurn_39 - TestTurn_40 - TestTurn_41 - BeginLoop_252 - BeginLoop_259 - BeginLoop_266 - BeginLoop_273 - BeginLoop_280 - BeginLoop_287 - EndTurn_36 - EndTurn_37 - EndTurn_38 - EndTurn_39 - EndTurn_40 - EndTurn_41 - CS_6 - TestAlone_252 - TestAlone_253 - TestAlone_254 - TestAlone_255 - TestAlone_256 - TestAlone_257 - TestAlone_259 - TestAlone_260 - TestAlone_261 - TestAlone_262 - TestAlone_263 - TestAlone_264 - TestAlone_266 - TestAlone_267 - TestAlone_268 - TestAlone_269 - TestAlone_270 - TestAlone_271 - TestAlone_273 - TestAlone_274 - TestAlone_275 - TestAlone_276 - TestAlone_277 - TestAlone_278 - TestAlone_280 - TestAlone_281 - TestAlone_282 - TestAlone_283 - TestAlone_284 - TestAlone_285 - TestAlone_287 - TestAlone_288 - TestAlone_289 - TestAlone_290 - TestAlone_291 - TestAlone_292 - IsEndLoop_252 - IsEndLoop_253 - IsEndLoop_254 - IsEndLoop_255 - IsEndLoop_256 - IsEndLoop_257 - IsEndLoop_259 - IsEndLoop_260 - IsEndLoop_261 - IsEndLoop_262 - IsEndLoop_263 - IsEndLoop_264 - IsEndLoop_266 - IsEndLoop_267 - IsEndLoop_268 - IsEndLoop_269 - IsEndLoop_270 - IsEndLoop_271 - IsEndLoop_273 - IsEndLoop_274 - IsEndLoop_275 - IsEndLoop_276 - IsEndLoop_277 - IsEndLoop_278 - IsEndLoop_280 - IsEndLoop_281 - IsEndLoop_282 - IsEndLoop_283 - IsEndLoop_284 - IsEndLoop_285 - IsEndLoop_287 - IsEndLoop_288 - IsEndLoop_289 - IsEndLoop_290 - IsEndLoop_291 - IsEndLoop_292 = 0
inv : Idle_4 + AskForSection_24 + AskForSection_25 + AskForSection_26 + AskForSection_27 + AskForSection_28 + AskForSection_29 + TestTurn_24 + TestTurn_25 + TestTurn_26 + TestTurn_27 + TestTurn_28 + TestTurn_29 + BeginLoop_168 + BeginLoop_175 + BeginLoop_182 + BeginLoop_189 + BeginLoop_196 + BeginLoop_203 + EndTurn_24 + EndTurn_25 + EndTurn_26 + EndTurn_27 + EndTurn_28 + EndTurn_29 + CS_4 + TestAlone_168 + TestAlone_169 + TestAlone_170 + TestAlone_171 + TestAlone_173 + TestAlone_174 + TestAlone_175 + TestAlone_176 + TestAlone_177 + TestAlone_178 + TestAlone_180 + TestAlone_181 + TestAlone_182 + TestAlone_183 + TestAlone_184 + TestAlone_185 + TestAlone_187 + TestAlone_188 + TestAlone_189 + TestAlone_190 + TestAlone_191 + TestAlone_192 + TestAlone_194 + TestAlone_195 + TestAlone_196 + TestAlone_197 + TestAlone_198 + TestAlone_199 + TestAlone_201 + TestAlone_202 + TestAlone_203 + TestAlone_204 + TestAlone_205 + TestAlone_206 + TestAlone_208 + TestAlone_209 + IsEndLoop_168 + IsEndLoop_169 + IsEndLoop_170 + IsEndLoop_171 + IsEndLoop_173 + IsEndLoop_174 + IsEndLoop_175 + IsEndLoop_176 + IsEndLoop_177 + IsEndLoop_178 + IsEndLoop_180 + IsEndLoop_181 + IsEndLoop_182 + IsEndLoop_183 + IsEndLoop_184 + IsEndLoop_185 + IsEndLoop_187 + IsEndLoop_188 + IsEndLoop_189 + IsEndLoop_190 + IsEndLoop_191 + IsEndLoop_192 + IsEndLoop_194 + IsEndLoop_195 + IsEndLoop_196 + IsEndLoop_197 + IsEndLoop_198 + IsEndLoop_199 + IsEndLoop_201 + IsEndLoop_202 + IsEndLoop_203 + IsEndLoop_204 + IsEndLoop_205 + IsEndLoop_206 + IsEndLoop_208 + IsEndLoop_209 = 1
inv : WantSection_8 + AskForSection_24 + AskForSection_25 + AskForSection_26 + AskForSection_27 + AskForSection_28 + AskForSection_29 + TestTurn_24 + TestTurn_25 + TestTurn_26 + TestTurn_27 + TestTurn_28 + TestTurn_29 + BeginLoop_168 + BeginLoop_175 + BeginLoop_182 + BeginLoop_189 + BeginLoop_196 + BeginLoop_203 + EndTurn_24 + EndTurn_25 + EndTurn_26 + EndTurn_27 + EndTurn_28 + EndTurn_29 + CS_4 + TestAlone_168 + TestAlone_169 + TestAlone_170 + TestAlone_171 + TestAlone_173 + TestAlone_174 + TestAlone_175 + TestAlone_176 + TestAlone_177 + TestAlone_178 + TestAlone_180 + TestAlone_181 + TestAlone_182 + TestAlone_183 + TestAlone_184 + TestAlone_185 + TestAlone_187 + TestAlone_188 + TestAlone_189 + TestAlone_190 + TestAlone_191 + TestAlone_192 + TestAlone_194 + TestAlone_195 + TestAlone_196 + TestAlone_197 + TestAlone_198 + TestAlone_199 + TestAlone_201 + TestAlone_202 + TestAlone_203 + TestAlone_204 + TestAlone_205 + TestAlone_206 + TestAlone_208 + TestAlone_209 + IsEndLoop_168 + IsEndLoop_169 + IsEndLoop_170 + IsEndLoop_171 + IsEndLoop_173 + IsEndLoop_174 + IsEndLoop_175 + IsEndLoop_176 + IsEndLoop_177 + IsEndLoop_178 + IsEndLoop_180 + IsEndLoop_181 + IsEndLoop_182 + IsEndLoop_183 + IsEndLoop_184 + IsEndLoop_185 + IsEndLoop_187 + IsEndLoop_188 + IsEndLoop_189 + IsEndLoop_190 + IsEndLoop_191 + IsEndLoop_192 + IsEndLoop_194 + IsEndLoop_195 + IsEndLoop_196 + IsEndLoop_197 + IsEndLoop_198 + IsEndLoop_199 + IsEndLoop_201 + IsEndLoop_202 + IsEndLoop_203 + IsEndLoop_204 + IsEndLoop_205 + IsEndLoop_206 + IsEndLoop_208 + IsEndLoop_209 = 1
inv : Turn_21 + Turn_22 + Turn_23 + Turn_24 + Turn_25 + Turn_26 + Turn_27 = 1
inv : WantSection_1 - AskForSection_0 - AskForSection_1 - AskForSection_2 - AskForSection_3 - AskForSection_4 - AskForSection_5 - TestTurn_0 - TestTurn_1 - TestTurn_2 - TestTurn_3 - TestTurn_4 - TestTurn_5 - BeginLoop_0 - BeginLoop_7 - BeginLoop_14 - BeginLoop_21 - BeginLoop_28 - BeginLoop_35 - EndTurn_0 - EndTurn_1 - EndTurn_2 - EndTurn_3 - EndTurn_4 - EndTurn_5 - CS_0 - TestAlone_1 - TestAlone_2 - TestAlone_3 - TestAlone_4 - TestAlone_5 - TestAlone_6 - TestAlone_8 - TestAlone_9 - TestAlone_10 - TestAlone_11 - TestAlone_12 - TestAlone_13 - TestAlone_15 - TestAlone_16 - TestAlone_17 - TestAlone_18 - TestAlone_19 - TestAlone_20 - TestAlone_22 - TestAlone_23 - TestAlone_24 - TestAlone_25 - TestAlone_26 - TestAlone_27 - TestAlone_29 - TestAlone_30 - TestAlone_31 - TestAlone_32 - TestAlone_33 - TestAlone_34 - TestAlone_36 - TestAlone_37 - TestAlone_38 - TestAlone_39 - TestAlone_40 - TestAlone_41 - IsEndLoop_1 - IsEndLoop_2 - IsEndLoop_3 - IsEndLoop_4 - IsEndLoop_5 - IsEndLoop_6 - IsEndLoop_8 - IsEndLoop_9 - IsEndLoop_10 - IsEndLoop_11 - IsEndLoop_12 - IsEndLoop_13 - IsEndLoop_15 - IsEndLoop_16 - IsEndLoop_17 - IsEndLoop_18 - IsEndLoop_19 - IsEndLoop_20 - IsEndLoop_22 - IsEndLoop_23 - IsEndLoop_24 - IsEndLoop_25 - IsEndLoop_26 - IsEndLoop_27 - IsEndLoop_29 - IsEndLoop_30 - IsEndLoop_31 - IsEndLoop_32 - IsEndLoop_33 - IsEndLoop_34 - IsEndLoop_36 - IsEndLoop_37 - IsEndLoop_38 - IsEndLoop_39 - IsEndLoop_40 - IsEndLoop_41 = 0
inv : WantSection_11 - AskForSection_30 - AskForSection_31 - AskForSection_32 - AskForSection_33 - AskForSection_34 - AskForSection_35 - TestTurn_30 - TestTurn_31 - TestTurn_32 - TestTurn_33 - TestTurn_34 - TestTurn_35 - BeginLoop_210 - BeginLoop_217 - BeginLoop_224 - BeginLoop_231 - BeginLoop_238 - BeginLoop_245 - EndTurn_30 - EndTurn_31 - EndTurn_32 - EndTurn_33 - EndTurn_34 - EndTurn_35 - CS_5 - TestAlone_210 - TestAlone_211 - TestAlone_212 - TestAlone_213 - TestAlone_214 - TestAlone_216 - TestAlone_217 - TestAlone_218 - TestAlone_219 - TestAlone_220 - TestAlone_221 - TestAlone_223 - TestAlone_224 - TestAlone_225 - TestAlone_226 - TestAlone_227 - TestAlone_228 - TestAlone_230 - TestAlone_231 - TestAlone_232 - TestAlone_233 - TestAlone_234 - TestAlone_235 - TestAlone_237 - TestAlone_238 - TestAlone_239 - TestAlone_240 - TestAlone_241 - TestAlone_242 - TestAlone_244 - TestAlone_245 - TestAlone_246 - TestAlone_247 - TestAlone_248 - TestAlone_249 - TestAlone_251 - IsEndLoop_210 - IsEndLoop_211 - IsEndLoop_212 - IsEndLoop_213 - IsEndLoop_214 - IsEndLoop_216 - IsEndLoop_217 - IsEndLoop_218 - IsEndLoop_219 - IsEndLoop_220 - IsEndLoop_221 - IsEndLoop_223 - IsEndLoop_224 - IsEndLoop_225 - IsEndLoop_226 - IsEndLoop_227 - IsEndLoop_228 - IsEndLoop_230 - IsEndLoop_231 - IsEndLoop_232 - IsEndLoop_233 - IsEndLoop_234 - IsEndLoop_235 - IsEndLoop_237 - IsEndLoop_238 - IsEndLoop_239 - IsEndLoop_240 - IsEndLoop_241 - IsEndLoop_242 - IsEndLoop_244 - IsEndLoop_245 - IsEndLoop_246 - IsEndLoop_247 - IsEndLoop_248 - IsEndLoop_249 - IsEndLoop_251 = 0
inv : Idle_2 + AskForSection_12 + AskForSection_13 + AskForSection_14 + AskForSection_15 + AskForSection_16 + AskForSection_17 + TestTurn_12 + TestTurn_13 + TestTurn_14 + TestTurn_15 + TestTurn_16 + TestTurn_17 + BeginLoop_84 + BeginLoop_91 + BeginLoop_98 + BeginLoop_105 + BeginLoop_112 + BeginLoop_119 + EndTurn_12 + EndTurn_13 + EndTurn_14 + EndTurn_15 + EndTurn_16 + EndTurn_17 + CS_2 + TestAlone_84 + TestAlone_85 + TestAlone_87 + TestAlone_88 + TestAlone_89 + TestAlone_90 + TestAlone_91 + TestAlone_92 + TestAlone_94 + TestAlone_95 + TestAlone_96 + TestAlone_97 + TestAlone_98 + TestAlone_99 + TestAlone_101 + TestAlone_102 + TestAlone_103 + TestAlone_104 + TestAlone_105 + TestAlone_106 + TestAlone_108 + TestAlone_109 + TestAlone_110 + TestAlone_111 + TestAlone_112 + TestAlone_113 + TestAlone_115 + TestAlone_116 + TestAlone_117 + TestAlone_118 + TestAlone_119 + TestAlone_120 + TestAlone_122 + TestAlone_123 + TestAlone_124 + TestAlone_125 + IsEndLoop_84 + IsEndLoop_85 + IsEndLoop_87 + IsEndLoop_88 + IsEndLoop_89 + IsEndLoop_90 + IsEndLoop_91 + IsEndLoop_92 + IsEndLoop_94 + IsEndLoop_95 + IsEndLoop_96 + IsEndLoop_97 + IsEndLoop_98 + IsEndLoop_99 + IsEndLoop_101 + IsEndLoop_102 + IsEndLoop_103 + IsEndLoop_104 + IsEndLoop_105 + IsEndLoop_106 + IsEndLoop_108 + IsEndLoop_109 + IsEndLoop_110 + IsEndLoop_111 + IsEndLoop_112 + IsEndLoop_113 + IsEndLoop_115 + IsEndLoop_116 + IsEndLoop_117 + IsEndLoop_118 + IsEndLoop_119 + IsEndLoop_120 + IsEndLoop_122 + IsEndLoop_123 + IsEndLoop_124 + IsEndLoop_125 = 1
inv : WantSection_7 - AskForSection_18 - AskForSection_19 - AskForSection_20 - AskForSection_21 - AskForSection_22 - AskForSection_23 - TestTurn_18 - TestTurn_19 - TestTurn_20 - TestTurn_21 - TestTurn_22 - TestTurn_23 - BeginLoop_126 - BeginLoop_133 - BeginLoop_140 - BeginLoop_147 - BeginLoop_154 - BeginLoop_161 - EndTurn_18 - EndTurn_19 - EndTurn_20 - EndTurn_21 - EndTurn_22 - EndTurn_23 - CS_3 - TestAlone_126 - TestAlone_127 - TestAlone_128 - TestAlone_130 - TestAlone_131 - TestAlone_132 - TestAlone_133 - TestAlone_134 - TestAlone_135 - TestAlone_137 - TestAlone_138 - TestAlone_139 - TestAlone_140 - TestAlone_141 - TestAlone_142 - TestAlone_144 - TestAlone_145 - TestAlone_146 - TestAlone_147 - TestAlone_148 - TestAlone_149 - TestAlone_151 - TestAlone_152 - TestAlone_153 - TestAlone_154 - TestAlone_155 - TestAlone_156 - TestAlone_158 - TestAlone_159 - TestAlone_160 - TestAlone_161 - TestAlone_162 - TestAlone_163 - TestAlone_165 - TestAlone_166 - TestAlone_167 - IsEndLoop_126 - IsEndLoop_127 - IsEndLoop_128 - IsEndLoop_130 - IsEndLoop_131 - IsEndLoop_132 - IsEndLoop_133 - IsEndLoop_134 - IsEndLoop_135 - IsEndLoop_137 - IsEndLoop_138 - IsEndLoop_139 - IsEndLoop_140 - IsEndLoop_141 - IsEndLoop_142 - IsEndLoop_144 - IsEndLoop_145 - IsEndLoop_146 - IsEndLoop_147 - IsEndLoop_148 - IsEndLoop_149 - IsEndLoop_151 - IsEndLoop_152 - IsEndLoop_153 - IsEndLoop_154 - IsEndLoop_155 - IsEndLoop_156 - IsEndLoop_158 - IsEndLoop_159 - IsEndLoop_160 - IsEndLoop_161 - IsEndLoop_162 - IsEndLoop_163 - IsEndLoop_165 - IsEndLoop_166 - IsEndLoop_167 = 0
inv : Idle_0 + AskForSection_0 + AskForSection_1 + AskForSection_2 + AskForSection_3 + AskForSection_4 + AskForSection_5 + TestTurn_0 + TestTurn_1 + TestTurn_2 + TestTurn_3 + TestTurn_4 + TestTurn_5 + BeginLoop_0 + BeginLoop_7 + BeginLoop_14 + BeginLoop_21 + BeginLoop_28 + BeginLoop_35 + EndTurn_0 + EndTurn_1 + EndTurn_2 + EndTurn_3 + EndTurn_4 + EndTurn_5 + CS_0 + TestAlone_1 + TestAlone_2 + TestAlone_3 + TestAlone_4 + TestAlone_5 + TestAlone_6 + TestAlone_8 + TestAlone_9 + TestAlone_10 + TestAlone_11 + TestAlone_12 + TestAlone_13 + TestAlone_15 + TestAlone_16 + TestAlone_17 + TestAlone_18 + TestAlone_19 + TestAlone_20 + TestAlone_22 + TestAlone_23 + TestAlone_24 + TestAlone_25 + TestAlone_26 + TestAlone_27 + TestAlone_29 + TestAlone_30 + TestAlone_31 + TestAlone_32 + TestAlone_33 + TestAlone_34 + TestAlone_36 + TestAlone_37 + TestAlone_38 + TestAlone_39 + TestAlone_40 + TestAlone_41 + IsEndLoop_1 + IsEndLoop_2 + IsEndLoop_3 + IsEndLoop_4 + IsEndLoop_5 + IsEndLoop_6 + IsEndLoop_8 + IsEndLoop_9 + IsEndLoop_10 + IsEndLoop_11 + IsEndLoop_12 + IsEndLoop_13 + IsEndLoop_15 + IsEndLoop_16 + IsEndLoop_17 + IsEndLoop_18 + IsEndLoop_19 + IsEndLoop_20 + IsEndLoop_22 + IsEndLoop_23 + IsEndLoop_24 + IsEndLoop_25 + IsEndLoop_26 + IsEndLoop_27 + IsEndLoop_29 + IsEndLoop_30 + IsEndLoop_31 + IsEndLoop_32 + IsEndLoop_33 + IsEndLoop_34 + IsEndLoop_36 + IsEndLoop_37 + IsEndLoop_38 + IsEndLoop_39 + IsEndLoop_40 + IsEndLoop_41 = 1
inv : WantSection_5 - AskForSection_12 - AskForSection_13 - AskForSection_14 - AskForSection_15 - AskForSection_16 - AskForSection_17 - TestTurn_12 - TestTurn_13 - TestTurn_14 - TestTurn_15 - TestTurn_16 - TestTurn_17 - BeginLoop_84 - BeginLoop_91 - BeginLoop_98 - BeginLoop_105 - BeginLoop_112 - BeginLoop_119 - EndTurn_12 - EndTurn_13 - EndTurn_14 - EndTurn_15 - EndTurn_16 - EndTurn_17 - CS_2 - TestAlone_84 - TestAlone_85 - TestAlone_87 - TestAlone_88 - TestAlone_89 - TestAlone_90 - TestAlone_91 - TestAlone_92 - TestAlone_94 - TestAlone_95 - TestAlone_96 - TestAlone_97 - TestAlone_98 - TestAlone_99 - TestAlone_101 - TestAlone_102 - TestAlone_103 - TestAlone_104 - TestAlone_105 - TestAlone_106 - TestAlone_108 - TestAlone_109 - TestAlone_110 - TestAlone_111 - TestAlone_112 - TestAlone_113 - TestAlone_115 - TestAlone_116 - TestAlone_117 - TestAlone_118 - TestAlone_119 - TestAlone_120 - TestAlone_122 - TestAlone_123 - TestAlone_124 - TestAlone_125 - IsEndLoop_84 - IsEndLoop_85 - IsEndLoop_87 - IsEndLoop_88 - IsEndLoop_89 - IsEndLoop_90 - IsEndLoop_91 - IsEndLoop_92 - IsEndLoop_94 - IsEndLoop_95 - IsEndLoop_96 - IsEndLoop_97 - IsEndLoop_98 - IsEndLoop_99 - IsEndLoop_101 - IsEndLoop_102 - IsEndLoop_103 - IsEndLoop_104 - IsEndLoop_105 - IsEndLoop_106 - IsEndLoop_108 - IsEndLoop_109 - IsEndLoop_110 - IsEndLoop_111 - IsEndLoop_112 - IsEndLoop_113 - IsEndLoop_115 - IsEndLoop_116 - IsEndLoop_117 - IsEndLoop_118 - IsEndLoop_119 - IsEndLoop_120 - IsEndLoop_122 - IsEndLoop_123 - IsEndLoop_124 - IsEndLoop_125 = 0
inv : Turn_35 + Turn_36 + Turn_37 + Turn_38 + Turn_39 + Turn_40 + Turn_41 = 1
Total of 27 invariants.
[2022-06-12 21:19:44] [INFO ] Computed 27 place invariants in 6 ms
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
[2022-06-12 21:19:46] [INFO ] Proved 742 variables to be positive in 1255 ms
[2022-06-12 21:19:46] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityFireability-09
[2022-06-12 21:19:46] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityFireability-09(SAT) depth K=0 took 226 ms
[2022-06-12 21:19:46] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-09(UNSAT) depth K=2 took 2302 ms
[2022-06-12 21:19:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityFireability-09
[2022-06-12 21:19:48] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityFireability-09(SAT) depth K=1 took 2032 ms
[2022-06-12 21:19:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityFireability-09
[2022-06-12 21:19:53] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityFireability-09(SAT) depth K=2 took 5480 ms
Compilation finished in 12251 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6479315323776066716]
Link finished in 113 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, PetersonCOL6ReachabilityFireability09==true], workingDir=/tmp/ltsmin6479315323776066716]
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 269269
[2022-06-12 21:20:53] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-09(UNSAT) depth K=3 took 66872 ms
[2022-06-12 21:29:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-COL-6-ReachabilityFireability-09
[2022-06-12 21:29:16] [INFO ] KInduction solution for property Peterson-COL-6-ReachabilityFireability-09(SAT) depth K=3 took 562400 ms
[2022-06-12 21:39:28] [INFO ] BMC solution for property Peterson-COL-6-ReachabilityFireability-09(UNSAT) depth K=4 took 1115238 ms
Detected timeout of ITS tools.
[2022-06-12 21:41:31] [INFO ] Applying decomposition
[2022-06-12 21:41:32] [INFO ] Flatten gal took : 254 ms
[2022-06-12 21:41:32] [INFO ] Decomposing Gal with order
[2022-06-12 21:41:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:41:33] [INFO ] Removed a total of 1876 redundant transitions.
[2022-06-12 21:41:33] [INFO ] Flatten gal took : 471 ms
[2022-06-12 21:41:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 34 ms.
[2022-06-12 21:41:33] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4506452772769734572.gal : 92 ms
[2022-06-12 21:41:33] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability9102283495890507940.prop : 26 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/ReachabilityFireability4506452772769734572.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability9102283495890507940.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/ReachabilityFireability4506452772769734572.gal -t CGAL -reachable-file /tmp/ReachabilityFireability9102283495890507940.prop --nowitness
Loading property file /tmp/ReachabilityFireability9102283495890507940.prop.
Detected timeout of ITS tools.
[2022-06-12 22:03:21] [INFO ] Flatten gal took : 387 ms
[2022-06-12 22:03:23] [INFO ] Input system was already deterministic with 1442 transitions.
[2022-06-12 22:03:24] [INFO ] Transformed 742 places.
[2022-06-12 22:03:24] [INFO ] Transformed 1442 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:03:24] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability12878962793898867561.gal : 31 ms
[2022-06-12 22:03:24] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1708451457782981502.prop : 16 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/ReachabilityFireability12878962793898867561.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability1708451457782981502.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/ReachabilityFireability12878962793898867561.gal -t CGAL -reachable-file /tmp/ReachabilityFireability1708451457782981502.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/ReachabilityFireability1708451457782981502.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 13
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :13 after 16
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :16 after 28
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :28 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 34
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :34 after 41
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :41 after 46
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :46 after 63
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :63 after 191
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :191 after 247
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :247 after 568
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :568 after 1083
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :1083 after 3732
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :3732 after 10220
SDD proceeding with computation,1 properties remain. new max is 131072
SDD size :10220 after 22085

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-6"
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-6, 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-165277026700015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-6.tgz
mv Peterson-COL-6 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 ;