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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 283K Apr 30 10:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 30 10:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 190K Apr 30 09:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 861K Apr 30 09:52 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 168K May 9 08:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 481K May 9 08:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 122K May 9 08:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 417K May 9 08:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 315K Apr 30 10:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 30 10:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 702K Apr 30 10:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.1M Apr 30 10:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K May 9 08:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 59K May 9 08:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.3M 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-PT-7-ReachabilityCardinality-00
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-01
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-02
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-03
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-04
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-05
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-06
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-07
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-08
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-09
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-10
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-11
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-12
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-13
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-14
FORMULA_NAME Peterson-PT-7-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655072140089

Running Version 0
[2022-06-12 22:15:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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 22:15:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:15:41] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2022-06-12 22:15:41] [INFO ] Transformed 1992 places.
[2022-06-12 22:15:41] [INFO ] Transformed 3096 transitions.
[2022-06-12 22:15:41] [INFO ] Found NUPN structural information;
[2022-06-12 22:15:41] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_2_0_5, IsEndLoop_0_3_6, IsEndLoop_0_2_7, EndTurn_4_2, EndTurn_4_1, EndTurn_7_0, EndTurn_6_0, EndTurn_5_0, IsEndLoop_7_6_7, IsEndLoop_6_6_7, IsEndLoop_5_6_7, BeginLoop_1_4_2, BeginLoop_0_4_2, BeginLoop_3_0_4, BeginLoop_3_6_3, BeginLoop_0_6_5, BeginLoop_3_6_5, BeginLoop_4_2_7, BeginLoop_7_1_7, BeginLoop_5_1_7, BeginLoop_6_1_7, BeginLoop_4_1_7, BeginLoop_7_0_7, BeginLoop_6_0_7, BeginLoop_5_0_7, TestAlone_2_4_0, TestAlone_2_5_0, TestAlone_3_6_1, TestAlone_3_0_2, TestAlone_1_5_5, TestAlone_0_5_5, TestAlone_3_5_6, TestAlone_2_5_6, TestIdentity_4_2_1, TestIdentity_4_3_1, TestIdentity_7_2_1, TestIdentity_5_2_1, TestIdentity_6_2_1, TestIdentity_7_6_0, TestIdentity_6_6_0, TestIdentity_5_6_0, TestIdentity_0_2_3, TestIdentity_1_2_3, TestIdentity_1_1_6, TestIdentity_0_2_6, TestIdentity_2_4_4, TestIdentity_1_4_4, TestIdentity_4_5_7, TestIdentity_6_4_7, TestIdentity_5_4_7, TestIdentity_7_4_7, TestIdentity_4_4_7, TestIdentity_6_3_7, TestIdentity_5_3_7, TestIdentity_7_3_7, CS_0, CS_2, AskForSection_2_5, AskForSection_0_5]
[2022-06-12 22:15:41] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 151 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-7-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 15) seen :4
FORMULA Peterson-PT-7-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 717 ms. (steps per millisecond=13 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-06-12 22:15:44] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:15:44] [INFO ] Computed 31 place invariants in 42 ms
[2022-06-12 22:15:45] [INFO ] [Real]Absence check using 23 positive place invariants in 41 ms returned unsat
[2022-06-12 22:15:45] [INFO ] [Real]Absence check using 23 positive place invariants in 36 ms returned sat
[2022-06-12 22:15:45] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-06-12 22:15:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:46] [INFO ] [Real]Absence check using state equation in 851 ms returned sat
[2022-06-12 22:15:46] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 22:15:46] [INFO ] [Real]Added 546 Read/Feed constraints in 151 ms returned sat
[2022-06-12 22:15:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:15:47] [INFO ] [Nat]Absence check using 23 positive place invariants in 43 ms returned sat
[2022-06-12 22:15:47] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:15:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:48] [INFO ] [Nat]Absence check using state equation in 892 ms returned sat
[2022-06-12 22:15:48] [INFO ] [Nat]Added 546 Read/Feed constraints in 191 ms returned sat
[2022-06-12 22:15:49] [INFO ] Deduced a trap composed of 77 places in 1095 ms of which 6 ms to minimize.
[2022-06-12 22:15:50] [INFO ] Deduced a trap composed of 138 places in 975 ms of which 2 ms to minimize.
[2022-06-12 22:15:51] [INFO ] Deduced a trap composed of 79 places in 953 ms of which 3 ms to minimize.
[2022-06-12 22:15:52] [INFO ] Deduced a trap composed of 115 places in 953 ms of which 3 ms to minimize.
[2022-06-12 22:15: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 2
[2022-06-12 22:15:53] [INFO ] [Real]Absence check using 23 positive place invariants in 52 ms returned sat
[2022-06-12 22:15:53] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:15:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:54] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2022-06-12 22:15:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:15:57] [INFO ] [Real]Absence check using 23 positive place invariants in 45 ms returned unsat
[2022-06-12 22:15:58] [INFO ] [Real]Absence check using 23 positive place invariants in 41 ms returned sat
[2022-06-12 22:15:58] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2022-06-12 22:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:59] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2022-06-12 22:15:59] [INFO ] [Real]Added 546 Read/Feed constraints in 124 ms returned sat
[2022-06-12 22:15:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:15:59] [INFO ] [Nat]Absence check using 23 positive place invariants in 41 ms returned sat
[2022-06-12 22:15:59] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:15:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:00] [INFO ] [Nat]Absence check using state equation in 909 ms returned sat
[2022-06-12 22:16:00] [INFO ] [Nat]Added 546 Read/Feed constraints in 148 ms returned sat
[2022-06-12 22:16:01] [INFO ] Deduced a trap composed of 13 places in 781 ms of which 2 ms to minimize.
[2022-06-12 22:16:02] [INFO ] Deduced a trap composed of 104 places in 766 ms of which 1 ms to minimize.
[2022-06-12 22:16:03] [INFO ] Deduced a trap composed of 93 places in 786 ms of which 2 ms to minimize.
[2022-06-12 22:16:04] [INFO ] Deduced a trap composed of 73 places in 832 ms of which 1 ms to minimize.
[2022-06-12 22:16:05] [INFO ] Deduced a trap composed of 93 places in 762 ms of which 4 ms to minimize.
[2022-06-12 22:16:05] [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 5
[2022-06-12 22:16:05] [INFO ] [Real]Absence check using 23 positive place invariants in 42 ms returned sat
[2022-06-12 22:16:05] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:16:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:06] [INFO ] [Real]Absence check using state equation in 876 ms returned sat
[2022-06-12 22:16:06] [INFO ] [Real]Added 546 Read/Feed constraints in 120 ms returned sat
[2022-06-12 22:16:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:07] [INFO ] [Nat]Absence check using 23 positive place invariants in 49 ms returned sat
[2022-06-12 22:16:07] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:16:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:07] [INFO ] [Nat]Absence check using state equation in 871 ms returned sat
[2022-06-12 22:16:08] [INFO ] [Nat]Added 546 Read/Feed constraints in 153 ms returned sat
[2022-06-12 22:16:08] [INFO ] Deduced a trap composed of 31 places in 804 ms of which 2 ms to minimize.
[2022-06-12 22:16:09] [INFO ] Deduced a trap composed of 43 places in 805 ms of which 1 ms to minimize.
[2022-06-12 22:16:10] [INFO ] Deduced a trap composed of 31 places in 783 ms of which 1 ms to minimize.
[2022-06-12 22:16:11] [INFO ] Deduced a trap composed of 68 places in 798 ms of which 1 ms to minimize.
[2022-06-12 22:16:12] [INFO ] Deduced a trap composed of 115 places in 792 ms of which 1 ms to minimize.
[2022-06-12 22:16:12] [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 6
[2022-06-12 22:16:12] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-06-12 22:16:12] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 22:16:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:13] [INFO ] [Real]Absence check using state equation in 773 ms returned sat
[2022-06-12 22:16:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:14] [INFO ] [Real]Absence check using 23 positive place invariants in 45 ms returned sat
[2022-06-12 22:16:14] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 22:16:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:15] [INFO ] [Real]Absence check using state equation in 1564 ms returned sat
[2022-06-12 22:16:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:16] [INFO ] [Nat]Absence check using 23 positive place invariants in 46 ms returned sat
[2022-06-12 22:16:16] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-06-12 22:16:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:17] [INFO ] [Nat]Absence check using state equation in 1451 ms returned sat
[2022-06-12 22:16:17] [INFO ] [Nat]Added 546 Read/Feed constraints in 189 ms returned sat
[2022-06-12 22:16:19] [INFO ] Deduced a trap composed of 85 places in 1123 ms of which 1 ms to minimize.
[2022-06-12 22:16:20] [INFO ] Deduced a trap composed of 119 places in 1180 ms of which 1 ms to minimize.
[2022-06-12 22:16:21] [INFO ] Deduced a trap composed of 119 places in 1107 ms of which 1 ms to minimize.
[2022-06-12 22:16:21] [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 8
[2022-06-12 22:16:21] [INFO ] [Real]Absence check using 23 positive place invariants in 40 ms returned sat
[2022-06-12 22:16:21] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:22] [INFO ] [Real]Absence check using state equation in 861 ms returned sat
[2022-06-12 22:16:22] [INFO ] [Real]Added 546 Read/Feed constraints in 124 ms returned sat
[2022-06-12 22:16:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2022-06-12 22:16:23] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 22:16:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:24] [INFO ] [Nat]Absence check using state equation in 843 ms returned sat
[2022-06-12 22:16:24] [INFO ] [Nat]Added 546 Read/Feed constraints in 160 ms returned sat
[2022-06-12 22:16:25] [INFO ] Deduced a trap composed of 17 places in 755 ms of which 1 ms to minimize.
[2022-06-12 22:16:26] [INFO ] Deduced a trap composed of 21 places in 737 ms of which 1 ms to minimize.
[2022-06-12 22:16:26] [INFO ] Deduced a trap composed of 13 places in 731 ms of which 1 ms to minimize.
[2022-06-12 22:16:27] [INFO ] Deduced a trap composed of 21 places in 714 ms of which 1 ms to minimize.
[2022-06-12 22:16:28] [INFO ] Deduced a trap composed of 20 places in 715 ms of which 5 ms to minimize.
[2022-06-12 22:16:28] [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 9
[2022-06-12 22:16:28] [INFO ] [Real]Absence check using 23 positive place invariants in 40 ms returned sat
[2022-06-12 22:16:28] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-06-12 22:16:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:30] [INFO ] [Real]Absence check using state equation in 1566 ms returned sat
[2022-06-12 22:16:30] [INFO ] Solution in real domain found non-integer solution.
FORMULA Peterson-PT-7-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-7-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-7-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-7-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-PT-7-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 1 different solutions.
Support contains 1920 out of 1992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 92 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
[2022-06-12 22:16:31] [INFO ] Flatten gal took : 350 ms
[2022-06-12 22:16:31] [INFO ] Flatten gal took : 153 ms
[2022-06-12 22:16:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10926535288584222747.gal : 42 ms
[2022-06-12 22:16:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8941685186602969615.prop : 8 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10926535288584222747.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8941685186602969615.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/ReachabilityCardinality10926535288584222747.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8941685186602969615.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8941685186602969615.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 18
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :18 after 19
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :19 after 20
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :20 after 25
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :25 after 26
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :26 after 93
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :93 after 181
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :181 after 1315
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :1315 after 3093
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :3093 after 6425
Detected timeout of ITS tools.
[2022-06-12 22:16:46] [INFO ] Flatten gal took : 116 ms
[2022-06-12 22:16:46] [INFO ] Applying decomposition
[2022-06-12 22:16:46] [INFO ] Flatten gal took : 95 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/graph11724259121043402156.txt, -o, /tmp/graph11724259121043402156.bin, -w, /tmp/graph11724259121043402156.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/graph11724259121043402156.bin, -l, -1, -v, -w, /tmp/graph11724259121043402156.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:16:50] [INFO ] Decomposing Gal with order
[2022-06-12 22:16:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:16:54] [INFO ] Removed a total of 1624 redundant transitions.
[2022-06-12 22:16:54] [INFO ] Flatten gal took : 4067 ms
[2022-06-12 22:16:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1232 labels/synchronizations in 246 ms.
[2022-06-12 22:16:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3980307649369922700.gal : 31 ms
[2022-06-12 22:16:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18202603022815501104.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/ReachabilityCardinality3980307649369922700.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality18202603022815501104.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/ReachabilityCardinality3980307649369922700.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality18202603022815501104.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality18202603022815501104.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :8 after 20
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :20 after 21
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :21 after 25
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :25 after 26
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :26 after 27
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :27 after 33
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :33 after 42
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :42 after 114
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :114 after 381
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :381 after 1172
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :1172 after 4790
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15230300698916264516
[2022-06-12 22:17:10] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15230300698916264516
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/ltsmin15230300698916264516]
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/ltsmin15230300698916264516] 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/ltsmin15230300698916264516] 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)
Interrupted random walk after 909684 steps, including 2 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4195 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Interrupted Best-First random walk after 74664 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=14 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3997 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4048 ms. (steps per millisecond=247 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4546 ms. (steps per millisecond=219 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3976 ms. (steps per millisecond=251 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 1122408 steps, run timeout after 30001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 1122408 steps, saw 667367 distinct states, run finished after 30001 ms. (steps per millisecond=37 ) properties seen :{}
Running SMT prover for 6 properties.
[2022-06-12 22:18:37] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:18:37] [INFO ] Computed 31 place invariants in 25 ms
[2022-06-12 22:18:38] [INFO ] [Real]Absence check using 23 positive place invariants in 39 ms returned sat
[2022-06-12 22:18:38] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:18:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:38] [INFO ] [Real]Absence check using state equation in 783 ms returned sat
[2022-06-12 22:18:39] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 22:18:39] [INFO ] [Real]Added 546 Read/Feed constraints in 134 ms returned sat
[2022-06-12 22:18:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:18:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2022-06-12 22:18:39] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-06-12 22:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:40] [INFO ] [Nat]Absence check using state equation in 830 ms returned sat
[2022-06-12 22:18:40] [INFO ] [Nat]Added 546 Read/Feed constraints in 180 ms returned sat
[2022-06-12 22:18:41] [INFO ] Deduced a trap composed of 77 places in 963 ms of which 1 ms to minimize.
[2022-06-12 22:18:42] [INFO ] Deduced a trap composed of 138 places in 984 ms of which 1 ms to minimize.
[2022-06-12 22:18:43] [INFO ] Deduced a trap composed of 79 places in 916 ms of which 1 ms to minimize.
[2022-06-12 22:18:44] [INFO ] Deduced a trap composed of 115 places in 931 ms of which 1 ms to minimize.
[2022-06-12 22:18:45] [INFO ] Deduced a trap composed of 149 places in 936 ms of which 2 ms to minimize.
[2022-06-12 22:18:46] [INFO ] Deduced a trap composed of 149 places in 949 ms of which 1 ms to minimize.
[2022-06-12 22:18:47] [INFO ] Deduced a trap composed of 138 places in 924 ms of which 1 ms to minimize.
[2022-06-12 22:18:48] [INFO ] Deduced a trap composed of 149 places in 932 ms of which 1 ms to minimize.
[2022-06-12 22:18:49] [INFO ] Deduced a trap composed of 79 places in 961 ms of which 2 ms to minimize.
[2022-06-12 22:18:51] [INFO ] Deduced a trap composed of 13 places in 935 ms of which 2 ms to minimize.
[2022-06-12 22:18:52] [INFO ] Deduced a trap composed of 13 places in 917 ms of which 1 ms to minimize.
[2022-06-12 22:18:53] [INFO ] Deduced a trap composed of 183 places in 945 ms of which 1 ms to minimize.
[2022-06-12 22:18:54] [INFO ] Deduced a trap composed of 138 places in 914 ms of which 1 ms to minimize.
[2022-06-12 22:18:55] [INFO ] Deduced a trap composed of 145 places in 911 ms of which 1 ms to minimize.
[2022-06-12 22:18:56] [INFO ] Deduced a trap composed of 144 places in 926 ms of which 1 ms to minimize.
[2022-06-12 22:18:57] [INFO ] Deduced a trap composed of 108 places in 931 ms of which 1 ms to minimize.
[2022-06-12 22:18:58] [INFO ] Deduced a trap composed of 167 places in 917 ms of which 2 ms to minimize.
[2022-06-12 22:18:59] [INFO ] Deduced a trap composed of 13 places in 919 ms of which 1 ms to minimize.
[2022-06-12 22:19:00] [INFO ] Deduced a trap composed of 13 places in 913 ms of which 1 ms to minimize.
[2022-06-12 22:19:01] [INFO ] Deduced a trap composed of 108 places in 927 ms of which 2 ms to minimize.
[2022-06-12 22:19:02] [INFO ] Deduced a trap composed of 167 places in 952 ms of which 2 ms to minimize.
[2022-06-12 22:19:03] [INFO ] Deduced a trap composed of 108 places in 917 ms of which 1 ms to minimize.
[2022-06-12 22:19:04] [INFO ] Deduced a trap composed of 167 places in 933 ms of which 1 ms to minimize.
[2022-06-12 22:19:05] [INFO ] Deduced a trap composed of 13 places in 935 ms of which 1 ms to minimize.
[2022-06-12 22:19:06] [INFO ] Deduced a trap composed of 13 places in 928 ms of which 2 ms to minimize.
[2022-06-12 22:19:07] [INFO ] Deduced a trap composed of 13 places in 930 ms of which 2 ms to minimize.
[2022-06-12 22:19:08] [INFO ] Deduced a trap composed of 65 places in 906 ms of which 1 ms to minimize.
[2022-06-12 22:19:09] [INFO ] Deduced a trap composed of 55 places in 900 ms of which 1 ms to minimize.
[2022-06-12 22:19:10] [INFO ] Deduced a trap composed of 34 places in 866 ms of which 2 ms to minimize.
[2022-06-12 22:19:11] [INFO ] Deduced a trap composed of 119 places in 892 ms of which 1 ms to minimize.
[2022-06-12 22:19:12] [INFO ] Deduced a trap composed of 150 places in 926 ms of which 2 ms to minimize.
[2022-06-12 22:19:13] [INFO ] Deduced a trap composed of 157 places in 916 ms of which 1 ms to minimize.
[2022-06-12 22:19:14] [INFO ] Deduced a trap composed of 209 places in 914 ms of which 2 ms to minimize.
[2022-06-12 22:19:15] [INFO ] Deduced a trap composed of 157 places in 909 ms of which 1 ms to minimize.
[2022-06-12 22:19:16] [INFO ] Deduced a trap composed of 157 places in 896 ms of which 1 ms to minimize.
[2022-06-12 22:19:17] [INFO ] Deduced a trap composed of 157 places in 891 ms of which 1 ms to minimize.
[2022-06-12 22:19:18] [INFO ] Deduced a trap composed of 122 places in 890 ms of which 1 ms to minimize.
[2022-06-12 22:19:19] [INFO ] Deduced a trap composed of 38 places in 894 ms of which 1 ms to minimize.
[2022-06-12 22:19:20] [INFO ] Deduced a trap composed of 55 places in 902 ms of which 2 ms to minimize.
[2022-06-12 22:19:21] [INFO ] Deduced a trap composed of 55 places in 888 ms of which 2 ms to minimize.
[2022-06-12 22:19:22] [INFO ] Deduced a trap composed of 55 places in 892 ms of which 1 ms to minimize.
[2022-06-12 22:19:23] [INFO ] Deduced a trap composed of 58 places in 921 ms of which 1 ms to minimize.
[2022-06-12 22:19:24] [INFO ] Deduced a trap composed of 92 places in 861 ms of which 1 ms to minimize.
[2022-06-12 22:19:24] [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 22:19:25] [INFO ] [Real]Absence check using 23 positive place invariants in 50 ms returned sat
[2022-06-12 22:19:25] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-06-12 22:19:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:26] [INFO ] [Real]Absence check using state equation in 840 ms returned sat
[2022-06-12 22:19:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:19:29] [INFO ] [Real]Absence check using 23 positive place invariants in 40 ms returned sat
[2022-06-12 22:19:29] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:19:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:30] [INFO ] [Real]Absence check using state equation in 889 ms returned sat
[2022-06-12 22:19:30] [INFO ] [Real]Added 546 Read/Feed constraints in 122 ms returned sat
[2022-06-12 22:19:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:19:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2022-06-12 22:19:31] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:19:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:32] [INFO ] [Nat]Absence check using state equation in 887 ms returned sat
[2022-06-12 22:19:32] [INFO ] [Nat]Added 546 Read/Feed constraints in 151 ms returned sat
[2022-06-12 22:19:33] [INFO ] Deduced a trap composed of 13 places in 756 ms of which 2 ms to minimize.
[2022-06-12 22:19:34] [INFO ] Deduced a trap composed of 104 places in 759 ms of which 2 ms to minimize.
[2022-06-12 22:19:34] [INFO ] Deduced a trap composed of 93 places in 751 ms of which 2 ms to minimize.
[2022-06-12 22:19:35] [INFO ] Deduced a trap composed of 73 places in 754 ms of which 1 ms to minimize.
[2022-06-12 22:19:36] [INFO ] Deduced a trap composed of 93 places in 753 ms of which 2 ms to minimize.
[2022-06-12 22:19:37] [INFO ] Deduced a trap composed of 136 places in 719 ms of which 1 ms to minimize.
[2022-06-12 22:19:38] [INFO ] Deduced a trap composed of 93 places in 718 ms of which 1 ms to minimize.
[2022-06-12 22:19:39] [INFO ] Deduced a trap composed of 73 places in 733 ms of which 2 ms to minimize.
[2022-06-12 22:19:39] [INFO ] Deduced a trap composed of 105 places in 720 ms of which 1 ms to minimize.
[2022-06-12 22:19:40] [INFO ] Deduced a trap composed of 89 places in 741 ms of which 1 ms to minimize.
[2022-06-12 22:19:41] [INFO ] Deduced a trap composed of 93 places in 726 ms of which 2 ms to minimize.
[2022-06-12 22:19:42] [INFO ] Deduced a trap composed of 142 places in 745 ms of which 1 ms to minimize.
[2022-06-12 22:19:43] [INFO ] Deduced a trap composed of 142 places in 724 ms of which 1 ms to minimize.
[2022-06-12 22:19:44] [INFO ] Deduced a trap composed of 142 places in 734 ms of which 1 ms to minimize.
[2022-06-12 22:19:44] [INFO ] Deduced a trap composed of 210 places in 733 ms of which 1 ms to minimize.
[2022-06-12 22:19:45] [INFO ] Deduced a trap composed of 19 places in 771 ms of which 1 ms to minimize.
[2022-06-12 22:19:46] [INFO ] Deduced a trap composed of 63 places in 746 ms of which 2 ms to minimize.
[2022-06-12 22:19:47] [INFO ] Deduced a trap composed of 66 places in 752 ms of which 1 ms to minimize.
[2022-06-12 22:19:48] [INFO ] Deduced a trap composed of 66 places in 762 ms of which 1 ms to minimize.
[2022-06-12 22:19:49] [INFO ] Deduced a trap composed of 66 places in 759 ms of which 1 ms to minimize.
[2022-06-12 22:19:50] [INFO ] Deduced a trap composed of 62 places in 784 ms of which 2 ms to minimize.
[2022-06-12 22:19:51] [INFO ] Deduced a trap composed of 63 places in 746 ms of which 1 ms to minimize.
[2022-06-12 22:19:51] [INFO ] Deduced a trap composed of 63 places in 748 ms of which 1 ms to minimize.
[2022-06-12 22:19:52] [INFO ] Deduced a trap composed of 24 places in 754 ms of which 1 ms to minimize.
[2022-06-12 22:19:53] [INFO ] Deduced a trap composed of 17 places in 767 ms of which 1 ms to minimize.
[2022-06-12 22:19:54] [INFO ] Deduced a trap composed of 25 places in 762 ms of which 1 ms to minimize.
[2022-06-12 22:19:55] [INFO ] Deduced a trap composed of 21 places in 754 ms of which 2 ms to minimize.
[2022-06-12 22:19:56] [INFO ] Deduced a trap composed of 25 places in 790 ms of which 2 ms to minimize.
[2022-06-12 22:19:57] [INFO ] Deduced a trap composed of 20 places in 772 ms of which 1 ms to minimize.
[2022-06-12 22:19:57] [INFO ] Deduced a trap composed of 100 places in 662 ms of which 1 ms to minimize.
[2022-06-12 22:19:59] [INFO ] Deduced a trap composed of 13 places in 1025 ms of which 1 ms to minimize.
[2022-06-12 22:20:00] [INFO ] Deduced a trap composed of 45 places in 906 ms of which 2 ms to minimize.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 45 places in 905 ms of which 1 ms to minimize.
[2022-06-12 22:20:02] [INFO ] Deduced a trap composed of 45 places in 900 ms of which 1 ms to minimize.
[2022-06-12 22:20:03] [INFO ] Deduced a trap composed of 45 places in 888 ms of which 1 ms to minimize.
[2022-06-12 22:20:04] [INFO ] Deduced a trap composed of 45 places in 907 ms of which 1 ms to minimize.
[2022-06-12 22:20:05] [INFO ] Deduced a trap composed of 165 places in 934 ms of which 2 ms to minimize.
[2022-06-12 22:20:06] [INFO ] Deduced a trap composed of 139 places in 931 ms of which 1 ms to minimize.
[2022-06-12 22:20:07] [INFO ] Deduced a trap composed of 119 places in 919 ms of which 2 ms to minimize.
[2022-06-12 22:20:08] [INFO ] Deduced a trap composed of 119 places in 939 ms of which 1 ms to minimize.
[2022-06-12 22:20:09] [INFO ] Deduced a trap composed of 119 places in 952 ms of which 1 ms to minimize.
[2022-06-12 22:20:10] [INFO ] Deduced a trap composed of 159 places in 954 ms of which 2 ms to minimize.
[2022-06-12 22:20:11] [INFO ] Deduced a trap composed of 97 places in 923 ms of which 1 ms to minimize.
[2022-06-12 22:20:12] [INFO ] Deduced a trap composed of 143 places in 930 ms of which 2 ms to minimize.
[2022-06-12 22:20:13] [INFO ] Deduced a trap composed of 112 places in 925 ms of which 2 ms to minimize.
[2022-06-12 22:20:14] [INFO ] Deduced a trap composed of 81 places in 927 ms of which 1 ms to minimize.
[2022-06-12 22:20:15] [INFO ] Deduced a trap composed of 219 places in 942 ms of which 1 ms to minimize.
[2022-06-12 22:20:16] [INFO ] Deduced a trap composed of 266 places in 943 ms of which 1 ms to minimize.
[2022-06-12 22:20:16] [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 22:20:17] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2022-06-12 22:20:17] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:20:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:17] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2022-06-12 22:20:18] [INFO ] [Real]Added 546 Read/Feed constraints in 111 ms returned sat
[2022-06-12 22:20:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:20:18] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2022-06-12 22:20:18] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:20:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:20:19] [INFO ] [Nat]Absence check using state equation in 825 ms returned sat
[2022-06-12 22:20:19] [INFO ] [Nat]Added 546 Read/Feed constraints in 145 ms returned sat
[2022-06-12 22:20:20] [INFO ] Deduced a trap composed of 31 places in 750 ms of which 1 ms to minimize.
[2022-06-12 22:20:21] [INFO ] Deduced a trap composed of 43 places in 754 ms of which 1 ms to minimize.
[2022-06-12 22:20:22] [INFO ] Deduced a trap composed of 31 places in 787 ms of which 2 ms to minimize.
[2022-06-12 22:20:22] [INFO ] Deduced a trap composed of 68 places in 772 ms of which 1 ms to minimize.
[2022-06-12 22:20:23] [INFO ] Deduced a trap composed of 115 places in 744 ms of which 1 ms to minimize.
[2022-06-12 22:20:24] [INFO ] Deduced a trap composed of 75 places in 763 ms of which 1 ms to minimize.
[2022-06-12 22:20:25] [INFO ] Deduced a trap composed of 75 places in 787 ms of which 1 ms to minimize.
[2022-06-12 22:20:26] [INFO ] Deduced a trap composed of 75 places in 774 ms of which 1 ms to minimize.
[2022-06-12 22:20:27] [INFO ] Deduced a trap composed of 115 places in 760 ms of which 1 ms to minimize.
[2022-06-12 22:20:28] [INFO ] Deduced a trap composed of 149 places in 784 ms of which 1 ms to minimize.
[2022-06-12 22:20:29] [INFO ] Deduced a trap composed of 149 places in 779 ms of which 1 ms to minimize.
[2022-06-12 22:20:29] [INFO ] Deduced a trap composed of 149 places in 777 ms of which 1 ms to minimize.
[2022-06-12 22:20:30] [INFO ] Deduced a trap composed of 149 places in 779 ms of which 2 ms to minimize.
[2022-06-12 22:20:31] [INFO ] Deduced a trap composed of 17 places in 915 ms of which 1 ms to minimize.
[2022-06-12 22:20:32] [INFO ] Deduced a trap composed of 69 places in 923 ms of which 2 ms to minimize.
[2022-06-12 22:20:33] [INFO ] Deduced a trap composed of 126 places in 932 ms of which 2 ms to minimize.
[2022-06-12 22:20:34] [INFO ] Deduced a trap composed of 128 places in 851 ms of which 2 ms to minimize.
[2022-06-12 22:20:35] [INFO ] Deduced a trap composed of 36 places in 844 ms of which 1 ms to minimize.
[2022-06-12 22:20:36] [INFO ] Deduced a trap composed of 17 places in 857 ms of which 2 ms to minimize.
[2022-06-12 22:20:37] [INFO ] Deduced a trap composed of 164 places in 858 ms of which 1 ms to minimize.
[2022-06-12 22:20:38] [INFO ] Deduced a trap composed of 164 places in 859 ms of which 1 ms to minimize.
[2022-06-12 22:20:39] [INFO ] Deduced a trap composed of 165 places in 837 ms of which 1 ms to minimize.
[2022-06-12 22:20:40] [INFO ] Deduced a trap composed of 164 places in 879 ms of which 1 ms to minimize.
[2022-06-12 22:20:41] [INFO ] Deduced a trap composed of 51 places in 890 ms of which 1 ms to minimize.
[2022-06-12 22:20:42] [INFO ] Deduced a trap composed of 61 places in 900 ms of which 1 ms to minimize.
[2022-06-12 22:20:43] [INFO ] Deduced a trap composed of 63 places in 845 ms of which 2 ms to minimize.
[2022-06-12 22:20:44] [INFO ] Deduced a trap composed of 57 places in 877 ms of which 1 ms to minimize.
[2022-06-12 22:20:45] [INFO ] Deduced a trap composed of 62 places in 855 ms of which 2 ms to minimize.
[2022-06-12 22:20:46] [INFO ] Deduced a trap composed of 62 places in 875 ms of which 2 ms to minimize.
[2022-06-12 22:20:48] [INFO ] Deduced a trap composed of 13 places in 1082 ms of which 1 ms to minimize.
[2022-06-12 22:20:49] [INFO ] Deduced a trap composed of 17 places in 1072 ms of which 2 ms to minimize.
[2022-06-12 22:20:50] [INFO ] Deduced a trap composed of 97 places in 1090 ms of which 2 ms to minimize.
[2022-06-12 22:20:51] [INFO ] Deduced a trap composed of 96 places in 1074 ms of which 2 ms to minimize.
[2022-06-12 22:20:52] [INFO ] Deduced a trap composed of 97 places in 1116 ms of which 1 ms to minimize.
[2022-06-12 22:20:54] [INFO ] Deduced a trap composed of 97 places in 1092 ms of which 1 ms to minimize.
[2022-06-12 22:20:55] [INFO ] Deduced a trap composed of 70 places in 1098 ms of which 2 ms to minimize.
[2022-06-12 22:20:56] [INFO ] Deduced a trap composed of 55 places in 1107 ms of which 1 ms to minimize.
[2022-06-12 22:20:57] [INFO ] Deduced a trap composed of 65 places in 1073 ms of which 1 ms to minimize.
[2022-06-12 22:20:58] [INFO ] Deduced a trap composed of 13 places in 1068 ms of which 1 ms to minimize.
[2022-06-12 22:21:00] [INFO ] Deduced a trap composed of 13 places in 1098 ms of which 1 ms to minimize.
[2022-06-12 22:21:01] [INFO ] Deduced a trap composed of 67 places in 958 ms of which 1 ms to minimize.
[2022-06-12 22:21:02] [INFO ] Deduced a trap composed of 158 places in 933 ms of which 1 ms to minimize.
[2022-06-12 22:21:03] [INFO ] Deduced a trap composed of 115 places in 911 ms of which 2 ms to minimize.
[2022-06-12 22:21:04] [INFO ] Deduced a trap composed of 2 places in 1227 ms of which 2 ms to minimize.
[2022-06-12 22:21:04] [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
[2022-06-12 22:21:04] [INFO ] [Real]Absence check using 23 positive place invariants in 42 ms returned sat
[2022-06-12 22:21:04] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 22:21:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:06] [INFO ] [Real]Absence check using state equation in 1540 ms returned sat
[2022-06-12 22:21:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 45 ms returned sat
[2022-06-12 22:21:06] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 22:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:08] [INFO ] [Nat]Absence check using state equation in 1503 ms returned sat
[2022-06-12 22:21:08] [INFO ] [Nat]Added 546 Read/Feed constraints in 188 ms returned sat
[2022-06-12 22:21:09] [INFO ] Deduced a trap composed of 85 places in 1081 ms of which 1 ms to minimize.
[2022-06-12 22:21:10] [INFO ] Deduced a trap composed of 119 places in 1098 ms of which 2 ms to minimize.
[2022-06-12 22:21:11] [INFO ] Deduced a trap composed of 119 places in 1108 ms of which 1 ms to minimize.
[2022-06-12 22:21:13] [INFO ] Deduced a trap composed of 60 places in 1053 ms of which 1 ms to minimize.
[2022-06-12 22:21:14] [INFO ] Deduced a trap composed of 119 places in 1064 ms of which 2 ms to minimize.
[2022-06-12 22:21:15] [INFO ] Deduced a trap composed of 119 places in 1140 ms of which 1 ms to minimize.
[2022-06-12 22:21:16] [INFO ] Deduced a trap composed of 101 places in 1093 ms of which 1 ms to minimize.
[2022-06-12 22:21:17] [INFO ] Deduced a trap composed of 45 places in 1070 ms of which 2 ms to minimize.
[2022-06-12 22:21:19] [INFO ] Deduced a trap composed of 85 places in 1123 ms of which 1 ms to minimize.
[2022-06-12 22:21:20] [INFO ] Deduced a trap composed of 85 places in 1033 ms of which 2 ms to minimize.
[2022-06-12 22:21:21] [INFO ] Deduced a trap composed of 109 places in 1024 ms of which 2 ms to minimize.
[2022-06-12 22:21:22] [INFO ] Deduced a trap composed of 20 places in 1029 ms of which 1 ms to minimize.
[2022-06-12 22:21:23] [INFO ] Deduced a trap composed of 51 places in 1003 ms of which 2 ms to minimize.
[2022-06-12 22:21:24] [INFO ] Deduced a trap composed of 47 places in 1001 ms of which 1 ms to minimize.
[2022-06-12 22:21:25] [INFO ] Deduced a trap composed of 42 places in 988 ms of which 1 ms to minimize.
[2022-06-12 22:21:26] [INFO ] Deduced a trap composed of 115 places in 999 ms of which 1 ms to minimize.
[2022-06-12 22:21:28] [INFO ] Deduced a trap composed of 55 places in 988 ms of which 2 ms to minimize.
[2022-06-12 22:21:29] [INFO ] Deduced a trap composed of 52 places in 1007 ms of which 1 ms to minimize.
[2022-06-12 22:21:30] [INFO ] Deduced a trap composed of 52 places in 973 ms of which 1 ms to minimize.
[2022-06-12 22:21:31] [INFO ] Deduced a trap composed of 52 places in 994 ms of which 2 ms to minimize.
[2022-06-12 22:21:32] [INFO ] Deduced a trap composed of 93 places in 1033 ms of which 1 ms to minimize.
[2022-06-12 22:21:33] [INFO ] Deduced a trap composed of 93 places in 1032 ms of which 1 ms to minimize.
[2022-06-12 22:21:34] [INFO ] Deduced a trap composed of 85 places in 1030 ms of which 2 ms to minimize.
[2022-06-12 22:21:36] [INFO ] Deduced a trap composed of 13 places in 1088 ms of which 1 ms to minimize.
[2022-06-12 22:21:37] [INFO ] Deduced a trap composed of 13 places in 1090 ms of which 2 ms to minimize.
[2022-06-12 22:21:38] [INFO ] Deduced a trap composed of 33 places in 1021 ms of which 1 ms to minimize.
[2022-06-12 22:21:39] [INFO ] Deduced a trap composed of 96 places in 831 ms of which 2 ms to minimize.
[2022-06-12 22:21:40] [INFO ] Deduced a trap composed of 60 places in 916 ms of which 2 ms to minimize.
[2022-06-12 22:21:41] [INFO ] Deduced a trap composed of 161 places in 773 ms of which 2 ms to minimize.
[2022-06-12 22:21:42] [INFO ] Deduced a trap composed of 161 places in 780 ms of which 1 ms to minimize.
[2022-06-12 22:21:43] [INFO ] Deduced a trap composed of 160 places in 761 ms of which 1 ms to minimize.
[2022-06-12 22:21:44] [INFO ] Deduced a trap composed of 161 places in 750 ms of which 1 ms to minimize.
[2022-06-12 22:21:45] [INFO ] Deduced a trap composed of 160 places in 760 ms of which 1 ms to minimize.
[2022-06-12 22:21:45] [INFO ] Deduced a trap composed of 195 places in 749 ms of which 2 ms to minimize.
[2022-06-12 22:21:46] [INFO ] Deduced a trap composed of 130 places in 797 ms of which 1 ms to minimize.
[2022-06-12 22:21:47] [INFO ] Deduced a trap composed of 246 places in 716 ms of which 2 ms to minimize.
[2022-06-12 22:21:48] [INFO ] Deduced a trap composed of 127 places in 745 ms of which 1 ms to minimize.
[2022-06-12 22:21:50] [INFO ] Deduced a trap composed of 57 places in 1095 ms of which 2 ms to minimize.
[2022-06-12 22:21:51] [INFO ] Deduced a trap composed of 21 places in 1129 ms of which 2 ms to minimize.
[2022-06-12 22:21:51] [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 4
[2022-06-12 22:21:51] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2022-06-12 22:21:51] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:21:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:52] [INFO ] [Real]Absence check using state equation in 803 ms returned sat
[2022-06-12 22:21:52] [INFO ] [Real]Added 546 Read/Feed constraints in 115 ms returned sat
[2022-06-12 22:21:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:53] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2022-06-12 22:21:53] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:21:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:54] [INFO ] [Nat]Absence check using state equation in 848 ms returned sat
[2022-06-12 22:21:54] [INFO ] [Nat]Added 546 Read/Feed constraints in 171 ms returned sat
[2022-06-12 22:21:55] [INFO ] Deduced a trap composed of 17 places in 754 ms of which 1 ms to minimize.
[2022-06-12 22:21:55] [INFO ] Deduced a trap composed of 21 places in 766 ms of which 1 ms to minimize.
[2022-06-12 22:21:56] [INFO ] Deduced a trap composed of 13 places in 751 ms of which 1 ms to minimize.
[2022-06-12 22:21:57] [INFO ] Deduced a trap composed of 21 places in 739 ms of which 1 ms to minimize.
[2022-06-12 22:21:58] [INFO ] Deduced a trap composed of 20 places in 733 ms of which 1 ms to minimize.
[2022-06-12 22:21:59] [INFO ] Deduced a trap composed of 13 places in 732 ms of which 2 ms to minimize.
[2022-06-12 22:22:00] [INFO ] Deduced a trap composed of 13 places in 753 ms of which 3 ms to minimize.
[2022-06-12 22:22:00] [INFO ] Deduced a trap composed of 81 places in 694 ms of which 1 ms to minimize.
[2022-06-12 22:22:01] [INFO ] Deduced a trap composed of 81 places in 677 ms of which 1 ms to minimize.
[2022-06-12 22:22:02] [INFO ] Deduced a trap composed of 81 places in 688 ms of which 1 ms to minimize.
[2022-06-12 22:22:03] [INFO ] Deduced a trap composed of 81 places in 685 ms of which 1 ms to minimize.
[2022-06-12 22:22:04] [INFO ] Deduced a trap composed of 42 places in 721 ms of which 2 ms to minimize.
[2022-06-12 22:22:04] [INFO ] Deduced a trap composed of 81 places in 689 ms of which 1 ms to minimize.
[2022-06-12 22:22:05] [INFO ] Deduced a trap composed of 81 places in 704 ms of which 1 ms to minimize.
[2022-06-12 22:22:06] [INFO ] Deduced a trap composed of 81 places in 711 ms of which 1 ms to minimize.
[2022-06-12 22:22:07] [INFO ] Deduced a trap composed of 51 places in 867 ms of which 1 ms to minimize.
[2022-06-12 22:22:08] [INFO ] Deduced a trap composed of 45 places in 878 ms of which 1 ms to minimize.
[2022-06-12 22:22:09] [INFO ] Deduced a trap composed of 51 places in 867 ms of which 1 ms to minimize.
[2022-06-12 22:22:10] [INFO ] Deduced a trap composed of 51 places in 884 ms of which 1 ms to minimize.
[2022-06-12 22:22:11] [INFO ] Deduced a trap composed of 51 places in 854 ms of which 2 ms to minimize.
[2022-06-12 22:22:12] [INFO ] Deduced a trap composed of 34 places in 901 ms of which 1 ms to minimize.
[2022-06-12 22:22:13] [INFO ] Deduced a trap composed of 160 places in 752 ms of which 1 ms to minimize.
[2022-06-12 22:22:13] [INFO ] Deduced a trap composed of 90 places in 563 ms of which 1 ms to minimize.
[2022-06-12 22:22:14] [INFO ] Deduced a trap composed of 72 places in 602 ms of which 1 ms to minimize.
[2022-06-12 22:22:15] [INFO ] Deduced a trap composed of 222 places in 751 ms of which 2 ms to minimize.
[2022-06-12 22:22:16] [INFO ] Deduced a trap composed of 123 places in 588 ms of which 1 ms to minimize.
[2022-06-12 22:22:16] [INFO ] Deduced a trap composed of 88 places in 580 ms of which 1 ms to minimize.
[2022-06-12 22:22:17] [INFO ] Deduced a trap composed of 88 places in 583 ms of which 2 ms to minimize.
[2022-06-12 22:22:18] [INFO ] Deduced a trap composed of 88 places in 560 ms of which 1 ms to minimize.
[2022-06-12 22:22:19] [INFO ] Deduced a trap composed of 123 places in 577 ms of which 1 ms to minimize.
[2022-06-12 22:22:19] [INFO ] Deduced a trap composed of 88 places in 580 ms of which 1 ms to minimize.
[2022-06-12 22:22:20] [INFO ] Deduced a trap composed of 51 places in 629 ms of which 1 ms to minimize.
[2022-06-12 22:22:21] [INFO ] Deduced a trap composed of 91 places in 603 ms of which 1 ms to minimize.
[2022-06-12 22:22:21] [INFO ] Deduced a trap composed of 16 places in 667 ms of which 2 ms to minimize.
[2022-06-12 22:22:22] [INFO ] Deduced a trap composed of 153 places in 443 ms of which 1 ms to minimize.
[2022-06-12 22:22:23] [INFO ] Deduced a trap composed of 202 places in 443 ms of which 1 ms to minimize.
[2022-06-12 22:22:23] [INFO ] Deduced a trap composed of 114 places in 460 ms of which 1 ms to minimize.
[2022-06-12 22:22:24] [INFO ] Deduced a trap composed of 153 places in 461 ms of which 1 ms to minimize.
[2022-06-12 22:22:24] [INFO ] Deduced a trap composed of 153 places in 450 ms of which 1 ms to minimize.
[2022-06-12 22:22:25] [INFO ] Deduced a trap composed of 153 places in 455 ms of which 1 ms to minimize.
[2022-06-12 22:22:25] [INFO ] Deduced a trap composed of 153 places in 463 ms of which 1 ms to minimize.
[2022-06-12 22:22:26] [INFO ] Deduced a trap composed of 153 places in 459 ms of which 1 ms to minimize.
[2022-06-12 22:22:27] [INFO ] Deduced a trap composed of 118 places in 610 ms of which 1 ms to minimize.
[2022-06-12 22:22:27] [INFO ] Deduced a trap composed of 33 places in 633 ms of which 1 ms to minimize.
[2022-06-12 22:22:28] [INFO ] Deduced a trap composed of 92 places in 619 ms of which 1 ms to minimize.
[2022-06-12 22:22:29] [INFO ] Deduced a trap composed of 187 places in 325 ms of which 1 ms to minimize.
[2022-06-12 22:22:29] [INFO ] Deduced a trap composed of 137 places in 332 ms of which 1 ms to minimize.
[2022-06-12 22:22:29] [INFO ] Deduced a trap composed of 187 places in 365 ms of which 1 ms to minimize.
[2022-06-12 22:22:30] [INFO ] Deduced a trap composed of 187 places in 329 ms of which 1 ms to minimize.
[2022-06-12 22:22:30] [INFO ] Deduced a trap composed of 187 places in 334 ms of which 2 ms to minimize.
[2022-06-12 22:22:31] [INFO ] Deduced a trap composed of 187 places in 338 ms of which 1 ms to minimize.
[2022-06-12 22:22:31] [INFO ] Deduced a trap composed of 187 places in 333 ms of which 1 ms to minimize.
[2022-06-12 22:22:33] [INFO ] Deduced a trap composed of 95 places in 872 ms of which 1 ms to minimize.
[2022-06-12 22:22:34] [INFO ] Deduced a trap composed of 79 places in 752 ms of which 1 ms to minimize.
[2022-06-12 22:22:35] [INFO ] Deduced a trap composed of 161 places in 725 ms of which 1 ms to minimize.
[2022-06-12 22:22:35] [INFO ] Deduced a trap composed of 274 places in 717 ms of which 2 ms to minimize.
[2022-06-12 22:22:36] [INFO ] Deduced a trap composed of 160 places in 731 ms of which 1 ms to minimize.
[2022-06-12 22:22:37] [INFO ] Deduced a trap composed of 242 places in 716 ms of which 1 ms to minimize.
[2022-06-12 22:22:38] [INFO ] Deduced a trap composed of 202 places in 752 ms of which 8 ms to minimize.
[2022-06-12 22:22:38] [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 5
Fused 6 Parikh solutions to 1 different solutions.
Support contains 1920 out of 1992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 52 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Applied a total of 0 rules in 39 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-06-12 22:22:38] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:22:38] [INFO ] Computed 31 place invariants in 19 ms
[2022-06-12 22:22:39] [INFO ] Implicit Places using invariants in 516 ms returned []
[2022-06-12 22:22:39] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:22:39] [INFO ] Computed 31 place invariants in 10 ms
[2022-06-12 22:22:40] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 22:22:43] [INFO ] Implicit Places using invariants and state equation in 3965 ms returned []
Implicit Place search using SMT with State Equation took 4483 ms to find 0 implicit places.
[2022-06-12 22:22:43] [INFO ] Redundant transitions in 162 ms returned []
[2022-06-12 22:22:43] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:22:43] [INFO ] Computed 31 place invariants in 15 ms
[2022-06-12 22:22:44] [INFO ] Dead Transitions using invariants and state equation in 1650 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1992/1992 places, 3096/3096 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 3276 ms. (steps per millisecond=30 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-06-12 22:22:48] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:22:48] [INFO ] Computed 31 place invariants in 14 ms
[2022-06-12 22:22:48] [INFO ] [Real]Absence check using 23 positive place invariants in 41 ms returned sat
[2022-06-12 22:22:48] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 1 ms returned sat
[2022-06-12 22:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:49] [INFO ] [Real]Absence check using state equation in 798 ms returned sat
[2022-06-12 22:22:49] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 22:22:49] [INFO ] [Real]Added 546 Read/Feed constraints in 135 ms returned sat
[2022-06-12 22:22:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:22:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2022-06-12 22:22:49] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:22:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:22:50] [INFO ] [Nat]Absence check using state equation in 827 ms returned sat
[2022-06-12 22:22:50] [INFO ] [Nat]Added 546 Read/Feed constraints in 186 ms returned sat
[2022-06-12 22:22:51] [INFO ] Deduced a trap composed of 77 places in 958 ms of which 8 ms to minimize.
[2022-06-12 22:22:52] [INFO ] Deduced a trap composed of 138 places in 948 ms of which 2 ms to minimize.
[2022-06-12 22:22:53] [INFO ] Deduced a trap composed of 79 places in 937 ms of which 2 ms to minimize.
[2022-06-12 22:22:55] [INFO ] Deduced a trap composed of 115 places in 945 ms of which 2 ms to minimize.
[2022-06-12 22:22:56] [INFO ] Deduced a trap composed of 149 places in 939 ms of which 1 ms to minimize.
[2022-06-12 22:22:57] [INFO ] Deduced a trap composed of 149 places in 919 ms of which 2 ms to minimize.
[2022-06-12 22:22:58] [INFO ] Deduced a trap composed of 138 places in 935 ms of which 1 ms to minimize.
[2022-06-12 22:22:59] [INFO ] Deduced a trap composed of 149 places in 925 ms of which 1 ms to minimize.
[2022-06-12 22:23:00] [INFO ] Deduced a trap composed of 79 places in 938 ms of which 1 ms to minimize.
[2022-06-12 22:23:01] [INFO ] Deduced a trap composed of 13 places in 924 ms of which 1 ms to minimize.
[2022-06-12 22:23:02] [INFO ] Deduced a trap composed of 13 places in 926 ms of which 2 ms to minimize.
[2022-06-12 22:23:03] [INFO ] Deduced a trap composed of 183 places in 930 ms of which 1 ms to minimize.
[2022-06-12 22:23:04] [INFO ] Deduced a trap composed of 138 places in 928 ms of which 1 ms to minimize.
[2022-06-12 22:23:05] [INFO ] Deduced a trap composed of 145 places in 911 ms of which 1 ms to minimize.
[2022-06-12 22:23:06] [INFO ] Deduced a trap composed of 144 places in 933 ms of which 2 ms to minimize.
[2022-06-12 22:23:07] [INFO ] Deduced a trap composed of 108 places in 921 ms of which 1 ms to minimize.
[2022-06-12 22:23:08] [INFO ] Deduced a trap composed of 167 places in 929 ms of which 1 ms to minimize.
[2022-06-12 22:23:09] [INFO ] Deduced a trap composed of 13 places in 936 ms of which 1 ms to minimize.
[2022-06-12 22:23:10] [INFO ] Deduced a trap composed of 2 places in 1205 ms of which 1 ms to minimize.
[2022-06-12 22:23:10] [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 22:23:11] [INFO ] [Real]Absence check using 23 positive place invariants in 50 ms returned sat
[2022-06-12 22:23:11] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:23:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:11] [INFO ] [Real]Absence check using state equation in 866 ms returned sat
[2022-06-12 22:23:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:23:15] [INFO ] [Real]Absence check using 23 positive place invariants in 41 ms returned sat
[2022-06-12 22:23:15] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:23:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:16] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2022-06-12 22:23:16] [INFO ] [Real]Added 546 Read/Feed constraints in 122 ms returned sat
[2022-06-12 22:23:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:23:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2022-06-12 22:23:17] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2022-06-12 22:23:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:18] [INFO ] [Nat]Absence check using state equation in 888 ms returned sat
[2022-06-12 22:23:18] [INFO ] [Nat]Added 546 Read/Feed constraints in 156 ms returned sat
[2022-06-12 22:23:19] [INFO ] Deduced a trap composed of 13 places in 739 ms of which 1 ms to minimize.
[2022-06-12 22:23:19] [INFO ] Deduced a trap composed of 104 places in 740 ms of which 1 ms to minimize.
[2022-06-12 22:23:20] [INFO ] Deduced a trap composed of 93 places in 704 ms of which 1 ms to minimize.
[2022-06-12 22:23:21] [INFO ] Deduced a trap composed of 73 places in 717 ms of which 1 ms to minimize.
[2022-06-12 22:23:22] [INFO ] Deduced a trap composed of 93 places in 721 ms of which 1 ms to minimize.
[2022-06-12 22:23:23] [INFO ] Deduced a trap composed of 136 places in 736 ms of which 1 ms to minimize.
[2022-06-12 22:23:23] [INFO ] Deduced a trap composed of 93 places in 739 ms of which 1 ms to minimize.
[2022-06-12 22:23:24] [INFO ] Deduced a trap composed of 73 places in 745 ms of which 2 ms to minimize.
[2022-06-12 22:23:25] [INFO ] Deduced a trap composed of 105 places in 724 ms of which 2 ms to minimize.
[2022-06-12 22:23:26] [INFO ] Deduced a trap composed of 89 places in 730 ms of which 1 ms to minimize.
[2022-06-12 22:23:27] [INFO ] Deduced a trap composed of 93 places in 725 ms of which 1 ms to minimize.
[2022-06-12 22:23:28] [INFO ] Deduced a trap composed of 142 places in 728 ms of which 1 ms to minimize.
[2022-06-12 22:23:28] [INFO ] Deduced a trap composed of 142 places in 720 ms of which 1 ms to minimize.
[2022-06-12 22:23:29] [INFO ] Deduced a trap composed of 142 places in 743 ms of which 1 ms to minimize.
[2022-06-12 22:23:30] [INFO ] Deduced a trap composed of 210 places in 732 ms of which 1 ms to minimize.
[2022-06-12 22:23:31] [INFO ] Deduced a trap composed of 19 places in 757 ms of which 1 ms to minimize.
[2022-06-12 22:23:32] [INFO ] Deduced a trap composed of 63 places in 746 ms of which 1 ms to minimize.
[2022-06-12 22:23:33] [INFO ] Deduced a trap composed of 66 places in 750 ms of which 1 ms to minimize.
[2022-06-12 22:23:34] [INFO ] Deduced a trap composed of 66 places in 753 ms of which 1 ms to minimize.
[2022-06-12 22:23:34] [INFO ] Deduced a trap composed of 66 places in 770 ms of which 1 ms to minimize.
[2022-06-12 22:23:35] [INFO ] Deduced a trap composed of 62 places in 749 ms of which 1 ms to minimize.
[2022-06-12 22:23:36] [INFO ] Deduced a trap composed of 63 places in 760 ms of which 2 ms to minimize.
[2022-06-12 22:23:37] [INFO ] Deduced a trap composed of 63 places in 750 ms of which 1 ms to minimize.
[2022-06-12 22:23:37] [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 22:23:37] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2022-06-12 22:23:37] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-06-12 22:23:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:38] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2022-06-12 22:23:38] [INFO ] [Real]Added 546 Read/Feed constraints in 115 ms returned sat
[2022-06-12 22:23:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:23:39] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2022-06-12 22:23:39] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 2 ms returned sat
[2022-06-12 22:23:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:40] [INFO ] [Nat]Absence check using state equation in 847 ms returned sat
[2022-06-12 22:23:40] [INFO ] [Nat]Added 546 Read/Feed constraints in 159 ms returned sat
[2022-06-12 22:23:41] [INFO ] Deduced a trap composed of 31 places in 768 ms of which 1 ms to minimize.
[2022-06-12 22:23:41] [INFO ] Deduced a trap composed of 43 places in 769 ms of which 1 ms to minimize.
[2022-06-12 22:23:42] [INFO ] Deduced a trap composed of 31 places in 776 ms of which 1 ms to minimize.
[2022-06-12 22:23:43] [INFO ] Deduced a trap composed of 68 places in 758 ms of which 1 ms to minimize.
[2022-06-12 22:23:44] [INFO ] Deduced a trap composed of 115 places in 756 ms of which 1 ms to minimize.
[2022-06-12 22:23:45] [INFO ] Deduced a trap composed of 75 places in 773 ms of which 1 ms to minimize.
[2022-06-12 22:23:46] [INFO ] Deduced a trap composed of 75 places in 771 ms of which 2 ms to minimize.
[2022-06-12 22:23:47] [INFO ] Deduced a trap composed of 75 places in 762 ms of which 1 ms to minimize.
[2022-06-12 22:23:48] [INFO ] Deduced a trap composed of 115 places in 769 ms of which 2 ms to minimize.
[2022-06-12 22:23:48] [INFO ] Deduced a trap composed of 149 places in 764 ms of which 2 ms to minimize.
[2022-06-12 22:23:49] [INFO ] Deduced a trap composed of 149 places in 763 ms of which 1 ms to minimize.
[2022-06-12 22:23:50] [INFO ] Deduced a trap composed of 149 places in 770 ms of which 1 ms to minimize.
[2022-06-12 22:23:51] [INFO ] Deduced a trap composed of 149 places in 758 ms of which 1 ms to minimize.
[2022-06-12 22:23:52] [INFO ] Deduced a trap composed of 17 places in 940 ms of which 1 ms to minimize.
[2022-06-12 22:23:53] [INFO ] Deduced a trap composed of 69 places in 926 ms of which 1 ms to minimize.
[2022-06-12 22:23:54] [INFO ] Deduced a trap composed of 126 places in 943 ms of which 1 ms to minimize.
[2022-06-12 22:23:55] [INFO ] Deduced a trap composed of 128 places in 847 ms of which 2 ms to minimize.
[2022-06-12 22:23:56] [INFO ] Deduced a trap composed of 36 places in 870 ms of which 1 ms to minimize.
[2022-06-12 22:23:57] [INFO ] Deduced a trap composed of 17 places in 878 ms of which 1 ms to minimize.
[2022-06-12 22:23:58] [INFO ] Deduced a trap composed of 164 places in 877 ms of which 1 ms to minimize.
[2022-06-12 22:23:59] [INFO ] Deduced a trap composed of 164 places in 828 ms of which 2 ms to minimize.
[2022-06-12 22:23:59] [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
[2022-06-12 22:23:59] [INFO ] [Real]Absence check using 23 positive place invariants in 42 ms returned sat
[2022-06-12 22:23:59] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-06-12 22:23:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:24:01] [INFO ] [Real]Absence check using state equation in 1502 ms returned sat
[2022-06-12 22:24:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:24:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 42 ms returned sat
[2022-06-12 22:24:01] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-06-12 22:24:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:24:03] [INFO ] [Nat]Absence check using state equation in 1406 ms returned sat
[2022-06-12 22:24:03] [INFO ] [Nat]Added 546 Read/Feed constraints in 176 ms returned sat
[2022-06-12 22:24:04] [INFO ] Deduced a trap composed of 85 places in 1111 ms of which 2 ms to minimize.
[2022-06-12 22:24:05] [INFO ] Deduced a trap composed of 119 places in 1091 ms of which 2 ms to minimize.
[2022-06-12 22:24:06] [INFO ] Deduced a trap composed of 119 places in 1104 ms of which 1 ms to minimize.
[2022-06-12 22:24:08] [INFO ] Deduced a trap composed of 60 places in 1099 ms of which 2 ms to minimize.
[2022-06-12 22:24:09] [INFO ] Deduced a trap composed of 119 places in 1104 ms of which 1 ms to minimize.
[2022-06-12 22:24:10] [INFO ] Deduced a trap composed of 119 places in 1112 ms of which 2 ms to minimize.
[2022-06-12 22:24:11] [INFO ] Deduced a trap composed of 101 places in 1118 ms of which 2 ms to minimize.
[2022-06-12 22:24:13] [INFO ] Deduced a trap composed of 45 places in 1095 ms of which 2 ms to minimize.
[2022-06-12 22:24:14] [INFO ] Deduced a trap composed of 85 places in 1104 ms of which 2 ms to minimize.
[2022-06-12 22:24:15] [INFO ] Deduced a trap composed of 85 places in 1098 ms of which 1 ms to minimize.
[2022-06-12 22:24:16] [INFO ] Deduced a trap composed of 109 places in 1127 ms of which 2 ms to minimize.
[2022-06-12 22:24:17] [INFO ] Deduced a trap composed of 20 places in 1064 ms of which 1 ms to minimize.
[2022-06-12 22:24:18] [INFO ] Deduced a trap composed of 51 places in 904 ms of which 2 ms to minimize.
[2022-06-12 22:24:20] [INFO ] Deduced a trap composed of 47 places in 1003 ms of which 2 ms to minimize.
[2022-06-12 22:24:21] [INFO ] Deduced a trap composed of 42 places in 990 ms of which 1 ms to minimize.
[2022-06-12 22:24:22] [INFO ] Deduced a trap composed of 115 places in 1025 ms of which 2 ms to minimize.
[2022-06-12 22:24:22] [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 4
[2022-06-12 22:24:22] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2022-06-12 22:24:22] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 22:24:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:24:23] [INFO ] [Real]Absence check using state equation in 841 ms returned sat
[2022-06-12 22:24:23] [INFO ] [Real]Added 546 Read/Feed constraints in 118 ms returned sat
[2022-06-12 22:24:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:24:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2022-06-12 22:24:23] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 22:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:24:24] [INFO ] [Nat]Absence check using state equation in 795 ms returned sat
[2022-06-12 22:24:24] [INFO ] [Nat]Added 546 Read/Feed constraints in 152 ms returned sat
[2022-06-12 22:24:25] [INFO ] Deduced a trap composed of 17 places in 740 ms of which 1 ms to minimize.
[2022-06-12 22:24:26] [INFO ] Deduced a trap composed of 21 places in 743 ms of which 1 ms to minimize.
[2022-06-12 22:24:27] [INFO ] Deduced a trap composed of 13 places in 749 ms of which 2 ms to minimize.
[2022-06-12 22:24:28] [INFO ] Deduced a trap composed of 21 places in 731 ms of which 2 ms to minimize.
[2022-06-12 22:24:29] [INFO ] Deduced a trap composed of 20 places in 733 ms of which 1 ms to minimize.
[2022-06-12 22:24:29] [INFO ] Deduced a trap composed of 13 places in 733 ms of which 1 ms to minimize.
[2022-06-12 22:24:30] [INFO ] Deduced a trap composed of 13 places in 729 ms of which 1 ms to minimize.
[2022-06-12 22:24:31] [INFO ] Deduced a trap composed of 81 places in 640 ms of which 1 ms to minimize.
[2022-06-12 22:24:32] [INFO ] Deduced a trap composed of 81 places in 695 ms of which 1 ms to minimize.
[2022-06-12 22:24:33] [INFO ] Deduced a trap composed of 81 places in 693 ms of which 2 ms to minimize.
[2022-06-12 22:24:33] [INFO ] Deduced a trap composed of 81 places in 696 ms of which 1 ms to minimize.
[2022-06-12 22:24:34] [INFO ] Deduced a trap composed of 42 places in 696 ms of which 1 ms to minimize.
[2022-06-12 22:24:35] [INFO ] Deduced a trap composed of 81 places in 696 ms of which 1 ms to minimize.
[2022-06-12 22:24:36] [INFO ] Deduced a trap composed of 81 places in 703 ms of which 1 ms to minimize.
[2022-06-12 22:24:37] [INFO ] Deduced a trap composed of 81 places in 694 ms of which 1 ms to minimize.
[2022-06-12 22:24:38] [INFO ] Deduced a trap composed of 51 places in 876 ms of which 1 ms to minimize.
[2022-06-12 22:24:39] [INFO ] Deduced a trap composed of 45 places in 854 ms of which 1 ms to minimize.
[2022-06-12 22:24:40] [INFO ] Deduced a trap composed of 51 places in 860 ms of which 1 ms to minimize.
[2022-06-12 22:24:40] [INFO ] Deduced a trap composed of 51 places in 861 ms of which 1 ms to minimize.
[2022-06-12 22:24:41] [INFO ] Deduced a trap composed of 51 places in 878 ms of which 1 ms to minimize.
[2022-06-12 22:24:42] [INFO ] Deduced a trap composed of 34 places in 913 ms of which 1 ms to minimize.
[2022-06-12 22:24:43] [INFO ] Deduced a trap composed of 160 places in 774 ms of which 1 ms to minimize.
[2022-06-12 22:24:43] [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 5
[2022-06-12 22:24:43] [INFO ] Flatten gal took : 93 ms
[2022-06-12 22:24:44] [INFO ] Flatten gal took : 85 ms
[2022-06-12 22:24:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16639635957495159922.gal : 8 ms
[2022-06-12 22:24:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7801011578572535723.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/ReachabilityCardinality16639635957495159922.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7801011578572535723.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/ReachabilityCardinality16639635957495159922.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7801011578572535723.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality7801011578572535723.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :13 after 18
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :18 after 19
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :19 after 20
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :20 after 25
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :25 after 26
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :26 after 93
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :93 after 181
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :181 after 1315
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :1315 after 3093
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :3093 after 6425
Detected timeout of ITS tools.
[2022-06-12 22:24:59] [INFO ] Flatten gal took : 81 ms
[2022-06-12 22:24:59] [INFO ] Applying decomposition
[2022-06-12 22:24:59] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5885830878529732439.txt, -o, /tmp/graph5885830878529732439.bin, -w, /tmp/graph5885830878529732439.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/graph5885830878529732439.bin, -l, -1, -v, -w, /tmp/graph5885830878529732439.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:25:02] [INFO ] Decomposing Gal with order
[2022-06-12 22:25:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:25:05] [INFO ] Removed a total of 1624 redundant transitions.
[2022-06-12 22:25:05] [INFO ] Flatten gal took : 3316 ms
[2022-06-12 22:25:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 1232 labels/synchronizations in 160 ms.
[2022-06-12 22:25:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11587563157719855363.gal : 15 ms
[2022-06-12 22:25:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality363871922008820627.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/ReachabilityCardinality11587563157719855363.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality363871922008820627.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/ReachabilityCardinality11587563157719855363.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality363871922008820627.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality363871922008820627.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :8 after 20
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :20 after 21
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :21 after 25
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :25 after 26
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :26 after 27
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :27 after 33
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :33 after 42
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :42 after 114
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :114 after 381
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :381 after 1172
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :1172 after 4790
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3088065629835260923
[2022-06-12 22:25:21] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3088065629835260923
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/ltsmin3088065629835260923]
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/ltsmin3088065629835260923] 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/ltsmin3088065629835260923] 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 8 places
Ensure Unique test removed 336 transitions
Reduce isomorphic transitions removed 336 transitions.
Iterating post reduction 0 with 344 rules applied. Total rules applied 344 place count 1984 transition count 2760
Applied a total of 344 rules in 56 ms. Remains 1984 /1992 variables (removed 8) and now considering 2760/3096 (removed 336) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 2760 rows 1984 cols
[2022-06-12 22:25:22] [INFO ] Computed 23 place invariants in 8 ms
[2022-06-12 22:25:23] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2022-06-12 22:25:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:25:23] [INFO ] [Real]Absence check using state equation in 785 ms returned sat
[2022-06-12 22:25:24] [INFO ] Computed and/alt/rep : 2640/5105/2640 causal constraints (skipped 112 transitions) in 133 ms.
[2022-06-12 22:25:44] [INFO ] Added : 755 causal constraints over 151 iterations in 20199 ms.(timeout) Result :sat
[2022-06-12 22:25:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:25:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 38 ms returned sat
[2022-06-12 22:25:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:25:45] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2022-06-12 22:25:45] [INFO ] Computed and/alt/rep : 2640/5105/2640 causal constraints (skipped 112 transitions) in 122 ms.
[2022-06-12 22:26:05] [INFO ] Added : 840 causal constraints over 168 iterations in 20091 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-06-12 22:26:05] [INFO ] [Real]Absence check using 23 positive place invariants in 51 ms returned sat
[2022-06-12 22:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:06] [INFO ] [Real]Absence check using state equation in 977 ms returned sat
[2022-06-12 22:26:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:26:10] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2022-06-12 22:26:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:11] [INFO ] [Real]Absence check using state equation in 911 ms returned sat
[2022-06-12 22:26:11] [INFO ] Computed and/alt/rep : 2640/5105/2640 causal constraints (skipped 112 transitions) in 120 ms.
[2022-06-12 22:26:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:26:21] [INFO ] [Nat]Absence check using 23 positive place invariants in 44 ms returned sat
[2022-06-12 22:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:22] [INFO ] [Nat]Absence check using state equation in 884 ms returned sat
[2022-06-12 22:26:22] [INFO ] Computed and/alt/rep : 2640/5105/2640 causal constraints (skipped 112 transitions) in 133 ms.
[2022-06-12 22:26:42] [INFO ] Added : 875 causal constraints over 175 iterations in 20101 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 22:26:42] [INFO ] [Real]Absence check using 23 positive place invariants in 38 ms returned sat
[2022-06-12 22:26:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:43] [INFO ] [Real]Absence check using state equation in 849 ms returned sat
[2022-06-12 22:26:43] [INFO ] Computed and/alt/rep : 2640/5105/2640 causal constraints (skipped 112 transitions) in 122 ms.
[2022-06-12 22:26:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:26:51] [INFO ] [Nat]Absence check using 23 positive place invariants in 39 ms returned sat
[2022-06-12 22:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:26:52] [INFO ] [Nat]Absence check using state equation in 847 ms returned sat
[2022-06-12 22:26:52] [INFO ] Computed and/alt/rep : 2640/5105/2640 causal constraints (skipped 112 transitions) in 119 ms.
[2022-06-12 22:27:12] [INFO ] Added : 835 causal constraints over 167 iterations in 20051 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 22:27:13] [INFO ] [Real]Absence check using 23 positive place invariants in 42 ms returned sat
[2022-06-12 22:27:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:27:14] [INFO ] [Real]Absence check using state equation in 1416 ms returned sat
[2022-06-12 22:27:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:27:15] [INFO ] [Nat]Absence check using 23 positive place invariants in 42 ms returned sat
[2022-06-12 22:27:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:27:16] [INFO ] [Nat]Absence check using state equation in 1287 ms returned sat
[2022-06-12 22:27:16] [INFO ] Computed and/alt/rep : 2640/5105/2640 causal constraints (skipped 112 transitions) in 116 ms.
[2022-06-12 22:27:36] [INFO ] Added : 825 causal constraints over 165 iterations in 20026 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-12 22:27:36] [INFO ] [Real]Absence check using 23 positive place invariants in 40 ms returned sat
[2022-06-12 22:27:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:27:37] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2022-06-12 22:27:37] [INFO ] Computed and/alt/rep : 2640/5105/2640 causal constraints (skipped 112 transitions) in 118 ms.
[2022-06-12 22:27:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:27:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 43 ms returned sat
[2022-06-12 22:27:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:27:45] [INFO ] [Nat]Absence check using state equation in 850 ms returned sat
[2022-06-12 22:27:46] [INFO ] Computed and/alt/rep : 2640/5105/2640 causal constraints (skipped 112 transitions) in 117 ms.
[2022-06-12 22:28:06] [INFO ] Added : 850 causal constraints over 170 iterations in 20161 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2022-06-12 22:28:06] [INFO ] Flatten gal took : 75 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15312746223535222392
[2022-06-12 22:28:06] [INFO ] Too many transitions (3096) to apply POR reductions. Disabling POR matrices.
[2022-06-12 22:28:06] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15312746223535222392
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/ltsmin15312746223535222392]
[2022-06-12 22:28:06] [INFO ] Flatten gal took : 98 ms
[2022-06-12 22:28:06] [INFO ] Applying decomposition
[2022-06-12 22:28:06] [INFO ] Input system was already deterministic with 3096 transitions.
[2022-06-12 22:28:06] [INFO ] Flatten gal took : 94 ms
[2022-06-12 22:28:07] [INFO ] Ran tautology test, simplified 0 / 6 in 1113 ms.
[2022-06-12 22:28:07] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-04(UNSAT) depth K=0 took 20 ms
[2022-06-12 22:28:07] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-06(UNSAT) depth K=0 took 34 ms
[2022-06-12 22:28:07] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-08(UNSAT) depth K=0 took 5 ms
[2022-06-12 22:28:07] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-09(UNSAT) depth K=0 took 4 ms
[2022-06-12 22:28:07] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-12(UNSAT) depth K=0 took 5 ms
[2022-06-12 22:28:07] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-14(UNSAT) depth K=0 took 4 ms
[2022-06-12 22:28:07] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-04(UNSAT) depth K=1 took 9 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 2760 out of 3096 initially.
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:28:08] [INFO ] Computed 31 place invariants in 8 ms
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_5_0 + IsEndLoop_3_6_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_5_1 + IsEndLoop_3_6_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_2_2 + IsEndLoop_3_5_2 + IsEndLoop_3_4_2 + IsEndLoop_3_0_3 + IsEndLoop_3_6_2 + IsEndLoop_3_2_3 + IsEndLoop_3_1_3 + IsEndLoop_3_4_3 + IsEndLoop_3_3_3 + IsEndLoop_3_6_3 + IsEndLoop_3_5_3 + IsEndLoop_3_1_4 + IsEndLoop_3_0_4 + IsEndLoop_3_3_4 + IsEndLoop_3_2_4 + IsEndLoop_3_6_4 + IsEndLoop_3_0_5 + IsEndLoop_3_4_4 + IsEndLoop_3_5_4 + IsEndLoop_3_3_5 + IsEndLoop_3_4_5 + IsEndLoop_3_1_5 + IsEndLoop_3_2_5 + IsEndLoop_3_0_6 + IsEndLoop_3_1_6 + IsEndLoop_3_5_5 + IsEndLoop_3_6_5 + IsEndLoop_3_4_6 + IsEndLoop_3_5_6 + IsEndLoop_3_2_6 + IsEndLoop_3_3_6 + IsEndLoop_3_2_7 + IsEndLoop_3_1_7 + IsEndLoop_3_0_7 + IsEndLoop_3_6_6 + IsEndLoop_3_6_7 + IsEndLoop_3_5_7 + IsEndLoop_3_4_7 + IsEndLoop_3_3_7 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + EndTurn_3_0 + BeginLoop_3_0_0 + EndTurn_3_6 + EndTurn_3_5 + EndTurn_3_4 + BeginLoop_3_5_0 + BeginLoop_3_6_0 + BeginLoop_3_0_1 + BeginLoop_3_1_1 + BeginLoop_3_1_0 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + BeginLoop_3_4_0 + BeginLoop_3_6_1 + BeginLoop_3_0_2 + BeginLoop_3_1_2 + BeginLoop_3_2_2 + BeginLoop_3_2_1 + BeginLoop_3_3_1 + BeginLoop_3_4_1 + BeginLoop_3_5_1 + BeginLoop_3_1_3 + BeginLoop_3_0_3 + BeginLoop_3_3_3 + BeginLoop_3_2_3 + BeginLoop_3_4_2 + BeginLoop_3_3_2 + BeginLoop_3_6_2 + BeginLoop_3_5_2 + BeginLoop_3_2_4 + BeginLoop_3_1_4 + BeginLoop_3_4_4 + BeginLoop_3_3_4 + BeginLoop_3_5_3 + BeginLoop_3_4_3 + BeginLoop_3_0_4 + BeginLoop_3_6_3 + BeginLoop_3_4_5 + BeginLoop_3_5_5 + BeginLoop_3_2_5 + BeginLoop_3_3_5 + BeginLoop_3_0_5 + BeginLoop_3_1_5 + BeginLoop_3_5_4 + BeginLoop_3_6_4 + BeginLoop_3_5_6 + BeginLoop_3_6_6 + BeginLoop_3_3_6 + BeginLoop_3_4_6 + BeginLoop_3_1_6 + BeginLoop_3_2_6 + BeginLoop_3_6_5 + BeginLoop_3_0_6 + BeginLoop_3_6_7 + BeginLoop_3_5_7 + BeginLoop_3_4_7 + BeginLoop_3_3_7 + BeginLoop_3_2_7 + BeginLoop_3_1_7 + BeginLoop_3_0_7 + TestAlone_3_0_1 + TestAlone_3_5_0 + TestAlone_3_6_0 + TestAlone_3_4_0 + TestAlone_3_3_0 + TestAlone_3_2_0 + TestAlone_3_1_0 + TestAlone_3_0_0 + TestAlone_3_4_2 + TestAlone_3_3_2 + TestAlone_3_6_2 + TestAlone_3_5_2 + TestAlone_3_2_1 + TestAlone_3_1_1 + TestAlone_3_4_1 + TestAlone_3_3_1 + TestAlone_3_6_1 + TestAlone_3_0_2 + TestAlone_3_5_1 + TestAlone_3_2_2 + TestAlone_3_1_2 + TestAlone_3_0_5 + TestAlone_3_1_5 + TestAlone_3_2_5 + TestAlone_3_4_5 + TestAlone_3_3_5 + TestAlone_3_5_5 + TestAlone_3_6_5 + TestAlone_3_0_6 + TestAlone_3_1_6 + TestAlone_3_0_4 + TestAlone_3_1_4 + TestAlone_3_2_4 + TestAlone_3_3_4 + TestAlone_3_4_4 + TestAlone_3_5_4 + TestAlone_3_6_4 + TestTurn_3_1 + TestTurn_3_0 + TestAlone_3_6_7 + TestAlone_3_5_7 + TestAlone_3_4_7 + TestTurn_3_5 + TestTurn_3_4 + TestTurn_3_3 + TestTurn_3_2 + TestAlone_3_6_6 + TestAlone_3_4_6 + TestAlone_3_5_6 + TestAlone_3_3_6 + TestAlone_3_2_6 + TestAlone_3_3_7 + TestAlone_3_2_7 + TestAlone_3_1_7 + TestAlone_3_0_7 + TestIdentity_3_2_1 + TestIdentity_3_3_1 + TestIdentity_3_0_1 + TestIdentity_3_1_1 + TestIdentity_3_6_1 + TestIdentity_3_0_2 + TestIdentity_3_4_1 + TestIdentity_3_5_1 + TestIdentity_3_1_0 + TestIdentity_3_2_0 + TestTurn_3_6 + TestIdentity_3_0_0 + TestIdentity_3_5_0 + TestIdentity_3_6_0 + TestIdentity_3_3_0 + TestIdentity_3_4_0 + TestIdentity_3_0_4 + TestIdentity_3_6_3 + TestIdentity_3_2_4 + TestIdentity_3_1_4 + TestIdentity_3_3_3 + TestIdentity_3_2_3 + TestIdentity_3_5_3 + TestIdentity_3_4_3 + TestIdentity_3_6_2 + TestIdentity_3_5_2 + TestIdentity_3_1_3 + TestIdentity_3_0_3 + TestIdentity_3_2_2 + TestIdentity_3_1_2 + TestIdentity_3_4_2 + TestIdentity_3_3_2 + TestIdentity_3_1_6 + TestIdentity_3_2_6 + TestIdentity_3_3_6 + TestIdentity_3_4_6 + TestIdentity_3_4_5 + TestIdentity_3_5_5 + TestIdentity_3_6_5 + TestIdentity_3_0_6 + TestIdentity_3_0_5 + TestIdentity_3_1_5 + TestIdentity_3_2_5 + TestIdentity_3_3_5 + TestIdentity_3_3_4 + TestIdentity_3_4_4 + TestIdentity_3_5_4 + TestIdentity_3_6_4 + TestIdentity_3_6_7 + TestIdentity_3_5_7 + TestIdentity_3_4_7 + TestIdentity_3_3_7 + TestIdentity_3_2_7 + TestIdentity_3_1_7 + TestIdentity_3_0_7 + TestIdentity_3_6_6 + TestIdentity_3_5_6 + CS_3 + AskForSection_3_5 + AskForSection_3_6 + AskForSection_3_3 + AskForSection_3_4 + AskForSection_3_1 + AskForSection_3_2 + Idle_3 + AskForSection_3_0 = 1
inv : WantSection_4_F - Idle_4 = 0
inv : WantSection_1_T + Idle_1 = 1
inv : WantSection_7_F - Idle_7 = 0
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_5_0 + IsEndLoop_4_6_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_5_1 + IsEndLoop_4_6_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_3_2 + IsEndLoop_4_2_2 + IsEndLoop_4_5_2 + IsEndLoop_4_4_2 + IsEndLoop_4_0_3 + IsEndLoop_4_6_2 + IsEndLoop_4_2_3 + IsEndLoop_4_1_3 + IsEndLoop_4_4_3 + IsEndLoop_4_3_3 + IsEndLoop_4_6_3 + IsEndLoop_4_5_3 + IsEndLoop_4_1_4 + IsEndLoop_4_0_4 + IsEndLoop_4_3_4 + IsEndLoop_4_2_4 + IsEndLoop_4_6_4 + IsEndLoop_4_0_5 + IsEndLoop_4_4_4 + IsEndLoop_4_5_4 + IsEndLoop_4_3_5 + IsEndLoop_4_4_5 + IsEndLoop_4_1_5 + IsEndLoop_4_2_5 + IsEndLoop_4_0_6 + IsEndLoop_4_1_6 + IsEndLoop_4_5_5 + IsEndLoop_4_6_5 + IsEndLoop_4_4_6 + IsEndLoop_4_5_6 + IsEndLoop_4_2_6 + IsEndLoop_4_3_6 + IsEndLoop_4_2_7 + IsEndLoop_4_1_7 + IsEndLoop_4_0_7 + IsEndLoop_4_6_6 + IsEndLoop_4_6_7 + IsEndLoop_4_5_7 + IsEndLoop_4_4_7 + IsEndLoop_4_3_7 + EndTurn_4_3 + EndTurn_4_2 + EndTurn_4_1 + EndTurn_4_0 + BeginLoop_4_0_0 + EndTurn_4_6 + EndTurn_4_5 + EndTurn_4_4 + BeginLoop_4_5_0 + BeginLoop_4_6_0 + BeginLoop_4_0_1 + BeginLoop_4_1_1 + BeginLoop_4_1_0 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + BeginLoop_4_4_0 + BeginLoop_4_6_1 + BeginLoop_4_0_2 + BeginLoop_4_1_2 + BeginLoop_4_2_2 + BeginLoop_4_2_1 + BeginLoop_4_3_1 + BeginLoop_4_4_1 + BeginLoop_4_5_1 + BeginLoop_4_1_3 + BeginLoop_4_0_3 + BeginLoop_4_3_3 + BeginLoop_4_2_3 + BeginLoop_4_4_2 + BeginLoop_4_3_2 + BeginLoop_4_6_2 + BeginLoop_4_5_2 + BeginLoop_4_2_4 + BeginLoop_4_1_4 + BeginLoop_4_4_4 + BeginLoop_4_3_4 + BeginLoop_4_5_3 + BeginLoop_4_4_3 + BeginLoop_4_0_4 + BeginLoop_4_6_3 + BeginLoop_4_4_5 + BeginLoop_4_5_5 + BeginLoop_4_2_5 + BeginLoop_4_3_5 + BeginLoop_4_0_5 + BeginLoop_4_1_5 + BeginLoop_4_5_4 + BeginLoop_4_6_4 + BeginLoop_4_5_6 + BeginLoop_4_6_6 + BeginLoop_4_3_6 + BeginLoop_4_4_6 + BeginLoop_4_1_6 + BeginLoop_4_2_6 + BeginLoop_4_6_5 + BeginLoop_4_0_6 + BeginLoop_4_6_7 + BeginLoop_4_5_7 + BeginLoop_4_4_7 + BeginLoop_4_3_7 + BeginLoop_4_2_7 + BeginLoop_4_1_7 + BeginLoop_4_0_7 + TestAlone_4_6_0 + TestAlone_4_0_1 + TestAlone_4_5_0 + TestAlone_4_4_0 + TestAlone_4_3_0 + TestAlone_4_2_0 + TestAlone_4_1_0 + TestAlone_4_0_0 + TestAlone_4_4_2 + TestAlone_4_3_2 + TestAlone_4_6_2 + TestAlone_4_5_2 + TestAlone_4_2_3 + TestAlone_4_1_3 + TestAlone_4_0_3 + TestAlone_4_4_3 + TestAlone_4_3_3 + TestAlone_4_2_1 + TestAlone_4_1_1 + TestAlone_4_4_1 + TestAlone_4_3_1 + TestAlone_4_6_1 + TestAlone_4_5_1 + TestAlone_4_2_2 + TestAlone_4_0_2 + TestAlone_4_1_2 + TestAlone_4_0_5 + TestAlone_4_1_5 + TestAlone_4_2_5 + TestAlone_4_3_5 + TestAlone_4_5_5 + TestAlone_4_4_5 + TestAlone_4_6_5 + TestAlone_4_0_6 + TestAlone_4_1_6 + TestAlone_4_5_3 + TestAlone_4_6_3 + TestTurn_4_1 + TestTurn_4_0 + TestAlone_4_6_7 + TestAlone_4_5_7 + TestAlone_4_4_7 + TestTurn_4_5 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestAlone_4_5_6 + TestAlone_4_6_6 + TestAlone_4_4_6 + TestAlone_4_3_6 + TestAlone_4_2_6 + TestAlone_4_3_7 + TestAlone_4_2_7 + TestAlone_4_1_7 + TestAlone_4_0_7 + TestIdentity_4_2_1 + TestIdentity_4_3_1 + TestIdentity_4_0_1 + TestIdentity_4_1_1 + TestIdentity_4_6_1 + TestIdentity_4_0_2 + TestIdentity_4_4_1 + TestIdentity_4_5_1 + TestIdentity_4_1_0 + TestIdentity_4_2_0 + TestTurn_4_6 + TestIdentity_4_0_0 + TestIdentity_4_5_0 + TestIdentity_4_6_0 + TestIdentity_4_3_0 + TestIdentity_4_4_0 + TestIdentity_4_0_4 + TestIdentity_4_6_3 + TestIdentity_4_2_4 + TestIdentity_4_1_4 + TestIdentity_4_3_3 + TestIdentity_4_2_3 + TestIdentity_4_5_3 + TestIdentity_4_4_3 + TestIdentity_4_6_2 + TestIdentity_4_5_2 + TestIdentity_4_1_3 + TestIdentity_4_0_3 + TestIdentity_4_2_2 + TestIdentity_4_1_2 + TestIdentity_4_4_2 + TestIdentity_4_3_2 + TestIdentity_4_1_6 + TestIdentity_4_2_6 + TestIdentity_4_3_6 + TestIdentity_4_4_6 + TestIdentity_4_4_5 + TestIdentity_4_5_5 + TestIdentity_4_6_5 + TestIdentity_4_0_6 + TestIdentity_4_0_5 + TestIdentity_4_1_5 + TestIdentity_4_2_5 + TestIdentity_4_3_5 + TestIdentity_4_3_4 + TestIdentity_4_4_4 + TestIdentity_4_5_4 + TestIdentity_4_6_4 + TestIdentity_4_6_7 + TestIdentity_4_5_7 + TestIdentity_4_4_7 + TestIdentity_4_3_7 + TestIdentity_4_2_7 + TestIdentity_4_1_7 + TestIdentity_4_0_7 + TestIdentity_4_6_6 + TestIdentity_4_5_6 + CS_4 + AskForSection_4_5 + AskForSection_4_6 + AskForSection_4_3 + AskForSection_4_4 + AskForSection_4_1 + AskForSection_4_2 + Idle_4 + AskForSection_4_0 = 1
inv : Turn_0_7 + Turn_0_6 + Turn_0_5 + Turn_0_3 + Turn_0_4 + Turn_0_2 + Turn_0_1 + Turn_0_0 = 1
inv : WantSection_1_F - Idle_1 = 0
inv : WantSection_0_F - Idle_0 = 0
inv : WantSection_5_T + Idle_5 = 1
inv : Turn_1_7 + Turn_1_6 + Turn_1_4 + Turn_1_5 + Turn_1_3 + Turn_1_2 + Turn_1_1 + Turn_1_0 = 1
inv : WantSection_2_T + Idle_2 = 1
inv : WantSection_6_T + Idle_6 = 1
inv : Turn_6_6 + Turn_6_5 + Turn_6_4 + Turn_6_3 + Turn_6_1 + Turn_6_2 + Turn_6_0 + Turn_6_7 = 1
inv : IsEndLoop_7_0_0 + IsEndLoop_7_1_0 + IsEndLoop_7_2_0 + IsEndLoop_7_3_0 + IsEndLoop_7_4_0 + IsEndLoop_7_5_0 + IsEndLoop_7_6_0 + IsEndLoop_7_0_1 + IsEndLoop_7_1_1 + IsEndLoop_7_2_1 + IsEndLoop_7_3_1 + IsEndLoop_7_4_1 + IsEndLoop_7_5_1 + IsEndLoop_7_6_1 + IsEndLoop_7_0_2 + IsEndLoop_7_2_2 + IsEndLoop_7_1_2 + IsEndLoop_7_4_2 + IsEndLoop_7_3_2 + IsEndLoop_7_6_2 + IsEndLoop_7_5_2 + IsEndLoop_7_1_3 + IsEndLoop_7_0_3 + IsEndLoop_7_3_3 + IsEndLoop_7_2_3 + IsEndLoop_7_5_3 + IsEndLoop_7_4_3 + IsEndLoop_7_0_4 + IsEndLoop_7_6_3 + IsEndLoop_7_2_4 + IsEndLoop_7_1_4 + IsEndLoop_7_5_4 + IsEndLoop_7_6_4 + IsEndLoop_7_3_4 + IsEndLoop_7_4_4 + IsEndLoop_7_2_5 + IsEndLoop_7_3_5 + IsEndLoop_7_0_5 + IsEndLoop_7_1_5 + IsEndLoop_7_6_5 + IsEndLoop_7_0_6 + IsEndLoop_7_4_5 + IsEndLoop_7_5_5 + IsEndLoop_7_3_6 + IsEndLoop_7_4_6 + IsEndLoop_7_1_6 + IsEndLoop_7_2_6 + IsEndLoop_7_1_7 + IsEndLoop_7_0_7 + IsEndLoop_7_6_6 + IsEndLoop_7_5_6 + IsEndLoop_7_5_7 + IsEndLoop_7_4_7 + IsEndLoop_7_3_7 + IsEndLoop_7_2_7 + EndTurn_7_2 + EndTurn_7_1 + EndTurn_7_0 + IsEndLoop_7_6_7 + EndTurn_7_6 + EndTurn_7_5 + EndTurn_7_4 + EndTurn_7_3 + BeginLoop_7_4_0 + BeginLoop_7_5_0 + BeginLoop_7_6_0 + BeginLoop_7_0_1 + BeginLoop_7_0_0 + BeginLoop_7_1_0 + BeginLoop_7_2_0 + BeginLoop_7_3_0 + BeginLoop_7_5_1 + BeginLoop_7_6_1 + BeginLoop_7_0_2 + BeginLoop_7_1_2 + BeginLoop_7_1_1 + BeginLoop_7_2_1 + BeginLoop_7_3_1 + BeginLoop_7_4_1 + BeginLoop_7_0_3 + BeginLoop_7_6_2 + BeginLoop_7_2_3 + BeginLoop_7_1_3 + BeginLoop_7_3_2 + BeginLoop_7_2_2 + BeginLoop_7_5_2 + BeginLoop_7_4_2 + BeginLoop_7_1_4 + BeginLoop_7_0_4 + BeginLoop_7_3_4 + BeginLoop_7_2_4 + BeginLoop_7_4_3 + BeginLoop_7_3_3 + BeginLoop_7_6_3 + BeginLoop_7_5_3 + BeginLoop_7_3_5 + BeginLoop_7_4_5 + BeginLoop_7_1_5 + BeginLoop_7_2_5 + BeginLoop_7_6_4 + BeginLoop_7_0_5 + BeginLoop_7_4_4 + BeginLoop_7_5_4 + BeginLoop_7_4_6 + BeginLoop_7_5_6 + BeginLoop_7_2_6 + BeginLoop_7_3_6 + BeginLoop_7_0_6 + BeginLoop_7_1_6 + BeginLoop_7_5_5 + BeginLoop_7_6_5 + BeginLoop_7_6_7 + BeginLoop_7_5_7 + BeginLoop_7_4_7 + BeginLoop_7_3_7 + BeginLoop_7_2_7 + BeginLoop_7_1_7 + BeginLoop_7_0_7 + BeginLoop_7_6_6 + TestAlone_7_6_0 + TestAlone_7_5_0 + TestAlone_7_4_0 + TestAlone_7_3_0 + TestAlone_7_1_0 + TestAlone_7_2_0 + TestAlone_7_0_0 + TestAlone_7_4_2 + TestAlone_7_3_2 + TestAlone_7_2_2 + TestAlone_7_6_2 + TestAlone_7_5_2 + TestAlone_7_1_3 + TestAlone_7_0_3 + TestAlone_7_3_3 + TestAlone_7_2_3 + TestAlone_7_1_1 + TestAlone_7_0_1 + TestAlone_7_4_1 + TestAlone_7_2_1 + TestAlone_7_3_1 + TestAlone_7_6_1 + TestAlone_7_5_1 + TestAlone_7_1_2 + TestAlone_7_0_2 + TestAlone_7_0_5 + TestAlone_7_1_5 + TestAlone_7_2_5 + TestAlone_7_3_5 + TestAlone_7_4_5 + TestAlone_7_5_5 + TestAlone_7_0_6 + TestAlone_7_6_5 + TestAlone_7_1_6 + TestAlone_7_4_3 + TestAlone_7_5_3 + TestAlone_7_6_3 + TestAlone_7_0_4 + TestAlone_7_1_4 + TestAlone_7_2_4 + TestAlone_7_3_4 + TestAlone_7_4_4 + TestAlone_7_5_4 + TestAlone_7_6_4 + TestTurn_7_0 + TestTurn_7_4 + TestTurn_7_3 + TestTurn_7_2 + TestTurn_7_1 + TestAlone_7_5_6 + TestAlone_7_4_6 + TestAlone_7_3_6 + TestAlone_7_2_6 + TestAlone_7_6_6 + TestIdentity_7_1_1 + TestIdentity_7_2_1 + TestIdentity_7_6_0 + TestIdentity_7_0_1 + TestIdentity_7_5_1 + TestIdentity_7_6_1 + TestIdentity_7_3_1 + TestIdentity_7_4_1 + TestIdentity_7_0_0 + TestIdentity_7_1_0 + TestTurn_7_5 + TestTurn_7_6 + TestIdentity_7_4_0 + TestIdentity_7_5_0 + TestIdentity_7_2_0 + TestIdentity_7_3_0 + TestIdentity_7_6_3 + TestIdentity_7_5_3 + TestIdentity_7_1_4 + TestIdentity_7_0_4 + TestIdentity_7_2_3 + TestIdentity_7_1_3 + TestIdentity_7_4_3 + TestIdentity_7_3_3 + TestIdentity_7_5_2 + TestIdentity_7_4_2 + TestIdentity_7_0_3 + TestIdentity_7_6_2 + TestIdentity_7_1_2 + TestIdentity_7_0_2 + TestIdentity_7_3_2 + TestIdentity_7_2_2 + TestIdentity_7_0_6 + TestIdentity_7_1_6 + TestIdentity_7_2_6 + TestIdentity_7_3_6 + TestIdentity_7_3_5 + TestIdentity_7_4_5 + TestIdentity_7_5_5 + TestIdentity_7_6_5 + TestIdentity_7_6_4 + TestIdentity_7_0_5 + TestIdentity_7_1_5 + TestIdentity_7_2_5 + TestIdentity_7_2_4 + TestIdentity_7_3_4 + TestIdentity_7_4_4 + TestIdentity_7_5_4 + TestIdentity_7_6_7 + TestIdentity_7_5_7 + TestIdentity_7_4_7 + TestIdentity_7_3_7 + TestIdentity_7_2_7 + TestIdentity_7_1_7 + TestIdentity_7_0_7 + TestIdentity_7_6_6 + TestIdentity_7_5_6 + TestIdentity_7_4_6 + AskForSection_7_6 + CS_7 + AskForSection_7_4 + AskForSection_7_5 + AskForSection_7_2 + AskForSection_7_3 + AskForSection_7_0 + AskForSection_7_1 + Idle_7 = 1
inv : Turn_3_6 + Turn_3_7 + Turn_3_5 + Turn_3_4 + Turn_3_3 + Turn_3_2 + Turn_3_1 + Turn_3_0 = 1
inv : WantSection_5_F - Idle_5 = 0
inv : WantSection_0_T + Idle_0 = 1
inv : IsEndLoop_6_0_0 + IsEndLoop_6_1_0 + IsEndLoop_6_2_0 + IsEndLoop_6_3_0 + IsEndLoop_6_4_0 + IsEndLoop_6_5_0 + IsEndLoop_6_6_0 + IsEndLoop_6_0_1 + IsEndLoop_6_1_1 + IsEndLoop_6_2_1 + IsEndLoop_6_3_1 + IsEndLoop_6_4_1 + IsEndLoop_6_5_1 + IsEndLoop_6_6_1 + IsEndLoop_6_0_2 + IsEndLoop_6_2_2 + IsEndLoop_6_1_2 + IsEndLoop_6_4_2 + IsEndLoop_6_3_2 + IsEndLoop_6_6_2 + IsEndLoop_6_5_2 + IsEndLoop_6_1_3 + IsEndLoop_6_0_3 + IsEndLoop_6_3_3 + IsEndLoop_6_2_3 + IsEndLoop_6_5_3 + IsEndLoop_6_4_3 + IsEndLoop_6_0_4 + IsEndLoop_6_6_3 + IsEndLoop_6_2_4 + IsEndLoop_6_1_4 + IsEndLoop_6_5_4 + IsEndLoop_6_6_4 + IsEndLoop_6_3_4 + IsEndLoop_6_4_4 + IsEndLoop_6_2_5 + IsEndLoop_6_3_5 + IsEndLoop_6_0_5 + IsEndLoop_6_1_5 + IsEndLoop_6_6_5 + IsEndLoop_6_0_6 + IsEndLoop_6_4_5 + IsEndLoop_6_5_5 + IsEndLoop_6_3_6 + IsEndLoop_6_4_6 + IsEndLoop_6_1_6 + IsEndLoop_6_2_6 + IsEndLoop_6_1_7 + IsEndLoop_6_0_7 + IsEndLoop_6_6_6 + IsEndLoop_6_5_6 + IsEndLoop_6_5_7 + IsEndLoop_6_4_7 + IsEndLoop_6_3_7 + IsEndLoop_6_2_7 + EndTurn_6_2 + EndTurn_6_1 + EndTurn_6_0 + IsEndLoop_6_6_7 + EndTurn_6_6 + EndTurn_6_5 + EndTurn_6_4 + EndTurn_6_3 + BeginLoop_6_4_0 + BeginLoop_6_5_0 + BeginLoop_6_6_0 + BeginLoop_6_0_1 + BeginLoop_6_0_0 + BeginLoop_6_1_0 + BeginLoop_6_2_0 + BeginLoop_6_3_0 + BeginLoop_6_5_1 + BeginLoop_6_6_1 + BeginLoop_6_0_2 + BeginLoop_6_1_2 + BeginLoop_6_1_1 + BeginLoop_6_2_1 + BeginLoop_6_3_1 + BeginLoop_6_4_1 + BeginLoop_6_0_3 + BeginLoop_6_6_2 + BeginLoop_6_2_3 + BeginLoop_6_1_3 + BeginLoop_6_3_2 + BeginLoop_6_2_2 + BeginLoop_6_5_2 + BeginLoop_6_4_2 + BeginLoop_6_1_4 + BeginLoop_6_0_4 + BeginLoop_6_3_4 + BeginLoop_6_2_4 + BeginLoop_6_4_3 + BeginLoop_6_3_3 + BeginLoop_6_6_3 + BeginLoop_6_5_3 + BeginLoop_6_3_5 + BeginLoop_6_4_5 + BeginLoop_6_1_5 + BeginLoop_6_2_5 + BeginLoop_6_6_4 + BeginLoop_6_0_5 + BeginLoop_6_4_4 + BeginLoop_6_5_4 + BeginLoop_6_4_6 + BeginLoop_6_5_6 + BeginLoop_6_2_6 + BeginLoop_6_3_6 + BeginLoop_6_0_6 + BeginLoop_6_1_6 + BeginLoop_6_5_5 + BeginLoop_6_6_5 + BeginLoop_6_6_7 + BeginLoop_6_5_7 + BeginLoop_6_4_7 + BeginLoop_6_3_7 + BeginLoop_6_2_7 + BeginLoop_6_1_7 + BeginLoop_6_0_7 + BeginLoop_6_6_6 + TestAlone_6_6_0 + TestAlone_6_5_0 + TestAlone_6_4_0 + TestAlone_6_3_0 + TestAlone_6_2_0 + TestAlone_6_0_0 + TestAlone_6_1_0 + TestAlone_6_4_2 + TestAlone_6_3_2 + TestAlone_6_2_2 + TestAlone_6_6_2 + TestAlone_6_5_2 + TestAlone_6_1_3 + TestAlone_6_0_3 + TestAlone_6_4_3 + TestAlone_6_3_3 + TestAlone_6_2_3 + TestAlone_6_1_1 + TestAlone_6_2_1 + TestAlone_6_0_1 + TestAlone_6_4_1 + TestAlone_6_3_1 + TestAlone_6_6_1 + TestAlone_6_5_1 + TestAlone_6_1_2 + TestAlone_6_0_2 + TestAlone_6_0_5 + TestAlone_6_1_5 + TestAlone_6_2_5 + TestAlone_6_3_5 + TestAlone_6_4_5 + TestAlone_6_6_5 + TestAlone_6_5_5 + TestAlone_6_5_3 + TestAlone_6_6_3 + TestAlone_6_0_4 + TestAlone_6_1_4 + TestAlone_6_2_4 + TestAlone_6_3_4 + TestAlone_6_4_4 + TestAlone_6_5_4 + TestAlone_6_6_4 + TestTurn_6_0 + TestAlone_6_6_7 + TestAlone_6_5_7 + TestAlone_6_4_7 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestAlone_6_3_7 + TestAlone_6_2_7 + TestAlone_6_0_7 + TestAlone_6_1_7 + TestIdentity_6_1_1 + TestIdentity_6_2_1 + TestIdentity_6_6_0 + TestIdentity_6_0_1 + TestIdentity_6_5_1 + TestIdentity_6_6_1 + TestIdentity_6_3_1 + TestIdentity_6_4_1 + TestIdentity_6_0_0 + TestIdentity_6_1_0 + TestTurn_6_5 + TestTurn_6_6 + TestIdentity_6_4_0 + TestIdentity_6_5_0 + TestIdentity_6_2_0 + TestIdentity_6_3_0 + TestIdentity_6_6_3 + TestIdentity_6_5_3 + TestIdentity_6_1_4 + TestIdentity_6_0_4 + TestIdentity_6_2_3 + TestIdentity_6_1_3 + TestIdentity_6_4_3 + TestIdentity_6_3_3 + TestIdentity_6_5_2 + TestIdentity_6_4_2 + TestIdentity_6_0_3 + TestIdentity_6_6_2 + TestIdentity_6_1_2 + TestIdentity_6_0_2 + TestIdentity_6_3_2 + TestIdentity_6_2_2 + TestIdentity_6_0_6 + TestIdentity_6_1_6 + TestIdentity_6_2_6 + TestIdentity_6_3_6 + TestIdentity_6_3_5 + TestIdentity_6_4_5 + TestIdentity_6_5_5 + TestIdentity_6_6_5 + TestIdentity_6_6_4 + TestIdentity_6_0_5 + TestIdentity_6_1_5 + TestIdentity_6_2_5 + TestIdentity_6_2_4 + TestIdentity_6_3_4 + TestIdentity_6_4_4 + TestIdentity_6_5_4 + TestIdentity_6_6_7 + TestIdentity_6_5_7 + TestIdentity_6_4_7 + TestIdentity_6_3_7 + TestIdentity_6_2_7 + TestIdentity_6_1_7 + TestIdentity_6_0_7 + TestIdentity_6_6_6 + TestIdentity_6_5_6 + TestIdentity_6_4_6 + AskForSection_6_6 + CS_6 + AskForSection_6_4 + AskForSection_6_5 + AskForSection_6_2 + AskForSection_6_3 + AskForSection_6_0 + AskForSection_6_1 + Idle_6 = 1
inv : Turn_5_6 + Turn_5_5 + Turn_5_4 + Turn_5_3 + Turn_5_2 + Turn_5_0 + Turn_5_1 + Turn_5_7 = 1
inv : WantSection_3_T + Idle_3 = 1
inv : WantSection_2_F - Idle_2 = 0
inv : WantSection_6_F - Idle_6 = 0
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_5_0 + IsEndLoop_1_6_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_1 + IsEndLoop_1_2_1 + IsEndLoop_1_3_1 + IsEndLoop_1_4_1 + IsEndLoop_1_5_1 + IsEndLoop_1_6_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_2 + IsEndLoop_1_3_2 + IsEndLoop_1_2_2 + IsEndLoop_1_5_2 + IsEndLoop_1_4_2 + IsEndLoop_1_0_3 + IsEndLoop_1_6_2 + IsEndLoop_1_2_3 + IsEndLoop_1_1_3 + IsEndLoop_1_4_3 + IsEndLoop_1_3_3 + IsEndLoop_1_6_3 + IsEndLoop_1_5_3 + IsEndLoop_1_1_4 + IsEndLoop_1_0_4 + IsEndLoop_1_3_4 + IsEndLoop_1_2_4 + IsEndLoop_1_6_4 + IsEndLoop_1_0_5 + IsEndLoop_1_4_4 + IsEndLoop_1_5_4 + IsEndLoop_1_3_5 + IsEndLoop_1_4_5 + IsEndLoop_1_1_5 + IsEndLoop_1_2_5 + IsEndLoop_1_0_6 + IsEndLoop_1_1_6 + IsEndLoop_1_5_5 + IsEndLoop_1_6_5 + IsEndLoop_1_4_6 + IsEndLoop_1_5_6 + IsEndLoop_1_2_6 + IsEndLoop_1_3_6 + IsEndLoop_1_2_7 + IsEndLoop_1_1_7 + IsEndLoop_1_0_7 + IsEndLoop_1_6_6 + IsEndLoop_1_6_7 + IsEndLoop_1_5_7 + IsEndLoop_1_4_7 + IsEndLoop_1_3_7 + EndTurn_1_3 + EndTurn_1_2 + EndTurn_1_1 + EndTurn_1_0 + BeginLoop_1_0_0 + EndTurn_1_6 + EndTurn_1_5 + EndTurn_1_4 + BeginLoop_1_5_0 + BeginLoop_1_6_0 + BeginLoop_1_0_1 + BeginLoop_1_1_1 + BeginLoop_1_1_0 + BeginLoop_1_2_0 + BeginLoop_1_3_0 + BeginLoop_1_4_0 + BeginLoop_1_6_1 + BeginLoop_1_0_2 + BeginLoop_1_1_2 + BeginLoop_1_2_2 + BeginLoop_1_2_1 + BeginLoop_1_3_1 + BeginLoop_1_4_1 + BeginLoop_1_5_1 + BeginLoop_1_1_3 + BeginLoop_1_0_3 + BeginLoop_1_3_3 + BeginLoop_1_2_3 + BeginLoop_1_4_2 + BeginLoop_1_3_2 + BeginLoop_1_6_2 + BeginLoop_1_5_2 + BeginLoop_1_2_4 + BeginLoop_1_1_4 + BeginLoop_1_4_4 + BeginLoop_1_3_4 + BeginLoop_1_5_3 + BeginLoop_1_4_3 + BeginLoop_1_0_4 + BeginLoop_1_6_3 + BeginLoop_1_4_5 + BeginLoop_1_5_5 + BeginLoop_1_2_5 + BeginLoop_1_3_5 + BeginLoop_1_0_5 + BeginLoop_1_1_5 + BeginLoop_1_5_4 + BeginLoop_1_6_4 + BeginLoop_1_5_6 + BeginLoop_1_6_6 + BeginLoop_1_3_6 + BeginLoop_1_4_6 + BeginLoop_1_1_6 + BeginLoop_1_2_6 + BeginLoop_1_6_5 + BeginLoop_1_0_6 + BeginLoop_1_6_7 + BeginLoop_1_5_7 + BeginLoop_1_4_7 + BeginLoop_1_3_7 + BeginLoop_1_2_7 + BeginLoop_1_1_7 + BeginLoop_1_0_7 + TestAlone_1_6_0 + TestAlone_1_5_0 + TestAlone_1_3_0 + TestAlone_1_4_0 + TestAlone_1_2_0 + TestAlone_1_1_0 + TestAlone_1_0_0 + TestAlone_1_4_2 + TestAlone_1_3_2 + TestAlone_1_0_3 + TestAlone_1_6_2 + TestAlone_1_5_2 + TestAlone_1_2_3 + TestAlone_1_1_3 + TestAlone_1_4_3 + TestAlone_1_3_3 + TestAlone_1_0_2 + TestAlone_1_2_2 + TestAlone_1_1_2 + TestAlone_1_0_5 + TestAlone_1_2_5 + TestAlone_1_1_5 + TestAlone_1_3_5 + TestAlone_1_4_5 + TestAlone_1_5_5 + TestAlone_1_6_5 + TestAlone_1_0_6 + TestAlone_1_1_6 + TestAlone_1_5_3 + TestAlone_1_6_3 + TestAlone_1_0_4 + TestAlone_1_1_4 + TestAlone_1_2_4 + TestAlone_1_3_4 + TestAlone_1_4_4 + TestAlone_1_5_4 + TestAlone_1_6_4 + TestTurn_1_1 + TestTurn_1_0 + TestAlone_1_6_7 + TestAlone_1_5_7 + TestTurn_1_5 + TestTurn_1_4 + TestTurn_1_3 + TestTurn_1_2 + TestAlone_1_6_6 + TestAlone_1_5_6 + TestAlone_1_4_6 + TestAlone_1_2_6 + TestAlone_1_3_6 + TestAlone_1_3_7 + TestAlone_1_4_7 + TestAlone_1_2_7 + TestAlone_1_1_7 + TestAlone_1_0_7 + TestIdentity_1_2_1 + TestIdentity_1_3_1 + TestIdentity_1_0_1 + TestIdentity_1_1_1 + TestIdentity_1_6_1 + TestIdentity_1_0_2 + TestIdentity_1_4_1 + TestIdentity_1_5_1 + TestIdentity_1_1_0 + TestIdentity_1_2_0 + TestTurn_1_6 + TestIdentity_1_0_0 + TestIdentity_1_5_0 + TestIdentity_1_6_0 + TestIdentity_1_3_0 + TestIdentity_1_4_0 + TestIdentity_1_0_4 + TestIdentity_1_6_3 + TestIdentity_1_2_4 + TestIdentity_1_1_4 + TestIdentity_1_3_3 + TestIdentity_1_2_3 + TestIdentity_1_5_3 + TestIdentity_1_4_3 + TestIdentity_1_6_2 + TestIdentity_1_5_2 + TestIdentity_1_1_3 + TestIdentity_1_0_3 + TestIdentity_1_2_2 + TestIdentity_1_1_2 + TestIdentity_1_4_2 + TestIdentity_1_3_2 + TestIdentity_1_1_6 + TestIdentity_1_2_6 + TestIdentity_1_3_6 + TestIdentity_1_4_6 + TestIdentity_1_4_5 + TestIdentity_1_5_5 + TestIdentity_1_6_5 + TestIdentity_1_0_6 + TestIdentity_1_0_5 + TestIdentity_1_1_5 + TestIdentity_1_2_5 + TestIdentity_1_3_5 + TestIdentity_1_3_4 + TestIdentity_1_4_4 + TestIdentity_1_5_4 + TestIdentity_1_6_4 + TestIdentity_1_6_7 + TestIdentity_1_5_7 + TestIdentity_1_4_7 + TestIdentity_1_3_7 + TestIdentity_1_2_7 + TestIdentity_1_1_7 + TestIdentity_1_0_7 + TestIdentity_1_6_6 + TestIdentity_1_5_6 + CS_1 + AskForSection_1_5 + AskForSection_1_6 + AskForSection_1_3 + AskForSection_1_4 + AskForSection_1_1 + AskForSection_1_2 + Idle_1 + AskForSection_1_0 = 1
inv : IsEndLoop_0_0_0 + IsEndLoop_0_1_0 + IsEndLoop_0_2_0 + IsEndLoop_0_3_0 + IsEndLoop_0_4_0 + IsEndLoop_0_5_0 + IsEndLoop_0_6_0 + IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_5_1 + IsEndLoop_0_6_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_3_2 + IsEndLoop_0_2_2 + IsEndLoop_0_5_2 + IsEndLoop_0_4_2 + IsEndLoop_0_0_3 + IsEndLoop_0_6_2 + IsEndLoop_0_2_3 + IsEndLoop_0_1_3 + IsEndLoop_0_4_3 + IsEndLoop_0_3_3 + IsEndLoop_0_6_3 + IsEndLoop_0_5_3 + IsEndLoop_0_1_4 + IsEndLoop_0_0_4 + IsEndLoop_0_3_4 + IsEndLoop_0_2_4 + IsEndLoop_0_6_4 + IsEndLoop_0_0_5 + IsEndLoop_0_4_4 + IsEndLoop_0_5_4 + IsEndLoop_0_3_5 + IsEndLoop_0_4_5 + IsEndLoop_0_1_5 + IsEndLoop_0_2_5 + IsEndLoop_0_0_6 + IsEndLoop_0_1_6 + IsEndLoop_0_5_5 + IsEndLoop_0_6_5 + IsEndLoop_0_4_6 + IsEndLoop_0_5_6 + IsEndLoop_0_2_6 + IsEndLoop_0_3_6 + IsEndLoop_0_2_7 + IsEndLoop_0_1_7 + IsEndLoop_0_0_7 + IsEndLoop_0_6_6 + IsEndLoop_0_6_7 + IsEndLoop_0_5_7 + IsEndLoop_0_4_7 + IsEndLoop_0_3_7 + EndTurn_0_3 + EndTurn_0_2 + EndTurn_0_1 + EndTurn_0_0 + BeginLoop_0_0_0 + EndTurn_0_6 + EndTurn_0_5 + EndTurn_0_4 + BeginLoop_0_5_0 + BeginLoop_0_6_0 + BeginLoop_0_0_1 + BeginLoop_0_1_1 + BeginLoop_0_1_0 + BeginLoop_0_2_0 + BeginLoop_0_3_0 + BeginLoop_0_4_0 + BeginLoop_0_6_1 + BeginLoop_0_0_2 + BeginLoop_0_1_2 + BeginLoop_0_2_2 + BeginLoop_0_2_1 + BeginLoop_0_3_1 + BeginLoop_0_4_1 + BeginLoop_0_5_1 + BeginLoop_0_1_3 + BeginLoop_0_0_3 + BeginLoop_0_3_3 + BeginLoop_0_2_3 + BeginLoop_0_4_2 + BeginLoop_0_3_2 + BeginLoop_0_6_2 + BeginLoop_0_5_2 + BeginLoop_0_2_4 + BeginLoop_0_1_4 + BeginLoop_0_4_4 + BeginLoop_0_3_4 + BeginLoop_0_5_3 + BeginLoop_0_4_3 + BeginLoop_0_0_4 + BeginLoop_0_6_3 + BeginLoop_0_4_5 + BeginLoop_0_5_5 + BeginLoop_0_2_5 + BeginLoop_0_3_5 + BeginLoop_0_0_5 + BeginLoop_0_1_5 + BeginLoop_0_5_4 + BeginLoop_0_6_4 + BeginLoop_0_5_6 + BeginLoop_0_6_6 + BeginLoop_0_3_6 + BeginLoop_0_4_6 + BeginLoop_0_1_6 + BeginLoop_0_2_6 + BeginLoop_0_6_5 + BeginLoop_0_0_6 + BeginLoop_0_6_7 + BeginLoop_0_5_7 + BeginLoop_0_4_7 + BeginLoop_0_3_7 + BeginLoop_0_2_7 + BeginLoop_0_1_7 + BeginLoop_0_0_7 + TestAlone_0_0_1 + TestAlone_0_4_2 + TestAlone_0_3_2 + TestAlone_0_0_3 + TestAlone_0_6_2 + TestAlone_0_5_2 + TestAlone_0_2_3 + TestAlone_0_1_3 + TestAlone_0_4_3 + TestAlone_0_3_3 + TestAlone_0_2_1 + TestAlone_0_1_1 + TestAlone_0_4_1 + TestAlone_0_5_1 + TestAlone_0_3_1 + TestAlone_0_0_2 + TestAlone_0_6_1 + TestAlone_0_2_2 + TestAlone_0_1_2 + TestAlone_0_1_5 + TestAlone_0_0_5 + TestAlone_0_2_5 + TestAlone_0_3_5 + TestAlone_0_4_5 + TestAlone_0_5_5 + TestAlone_0_6_5 + TestAlone_0_0_6 + TestAlone_0_2_6 + TestAlone_0_1_6 + TestAlone_0_5_3 + TestAlone_0_6_3 + TestAlone_0_0_4 + TestAlone_0_1_4 + TestAlone_0_2_4 + TestAlone_0_3_4 + TestAlone_0_4_4 + TestAlone_0_5_4 + TestAlone_0_6_4 + TestTurn_0_1 + TestTurn_0_0 + TestAlone_0_6_7 + TestAlone_0_5_7 + TestTurn_0_5 + TestTurn_0_4 + TestTurn_0_3 + TestTurn_0_2 + TestAlone_0_6_6 + TestAlone_0_5_6 + TestAlone_0_4_6 + TestAlone_0_3_6 + TestAlone_0_4_7 + TestAlone_0_2_7 + TestAlone_0_3_7 + TestAlone_0_1_7 + TestAlone_0_0_7 + TestIdentity_0_2_1 + TestIdentity_0_3_1 + TestIdentity_0_0_1 + TestIdentity_0_1_1 + TestIdentity_0_6_1 + TestIdentity_0_0_2 + TestIdentity_0_4_1 + TestIdentity_0_5_1 + TestIdentity_0_1_0 + TestIdentity_0_2_0 + TestTurn_0_6 + TestIdentity_0_0_0 + TestIdentity_0_5_0 + TestIdentity_0_6_0 + TestIdentity_0_3_0 + TestIdentity_0_4_0 + TestIdentity_0_0_4 + TestIdentity_0_6_3 + TestIdentity_0_2_4 + TestIdentity_0_1_4 + TestIdentity_0_3_3 + TestIdentity_0_2_3 + TestIdentity_0_5_3 + TestIdentity_0_4_3 + TestIdentity_0_6_2 + TestIdentity_0_5_2 + TestIdentity_0_1_3 + TestIdentity_0_0_3 + TestIdentity_0_2_2 + TestIdentity_0_1_2 + TestIdentity_0_4_2 + TestIdentity_0_3_2 + TestIdentity_0_1_6 + TestIdentity_0_2_6 + TestIdentity_0_3_6 + TestIdentity_0_4_6 + TestIdentity_0_4_5 + TestIdentity_0_5_5 + TestIdentity_0_6_5 + TestIdentity_0_0_6 + TestIdentity_0_0_5 + TestIdentity_0_1_5 + TestIdentity_0_2_5 + TestIdentity_0_3_5 + TestIdentity_0_3_4 + TestIdentity_0_4_4 + TestIdentity_0_5_4 + TestIdentity_0_6_4 + TestIdentity_0_6_7 + TestIdentity_0_5_7 + TestIdentity_0_4_7 + TestIdentity_0_3_7 + TestIdentity_0_2_7 + TestIdentity_0_1_7 + TestIdentity_0_0_7 + TestIdentity_0_6_6 + TestIdentity_0_5_6 + CS_0 + AskForSection_0_5 + AskForSection_0_6 + AskForSection_0_3 + AskForSection_0_4 + AskForSection_0_1 + AskForSection_0_2 + Idle_0 + AskForSection_0_0 = 1
inv : Turn_2_7 + Turn_2_5 + Turn_2_6 + Turn_2_4 + Turn_2_3 + Turn_2_2 + Turn_2_1 + Turn_2_0 = 1
inv : WantSection_3_F - Idle_3 = 0
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_5_0 + IsEndLoop_2_6_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_5_1 + IsEndLoop_2_6_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_2 + IsEndLoop_2_3_2 + IsEndLoop_2_2_2 + IsEndLoop_2_5_2 + IsEndLoop_2_4_2 + IsEndLoop_2_0_3 + IsEndLoop_2_6_2 + IsEndLoop_2_2_3 + IsEndLoop_2_1_3 + IsEndLoop_2_4_3 + IsEndLoop_2_3_3 + IsEndLoop_2_6_3 + IsEndLoop_2_5_3 + IsEndLoop_2_1_4 + IsEndLoop_2_0_4 + IsEndLoop_2_3_4 + IsEndLoop_2_2_4 + IsEndLoop_2_6_4 + IsEndLoop_2_0_5 + IsEndLoop_2_4_4 + IsEndLoop_2_5_4 + IsEndLoop_2_3_5 + IsEndLoop_2_4_5 + IsEndLoop_2_1_5 + IsEndLoop_2_2_5 + IsEndLoop_2_0_6 + IsEndLoop_2_1_6 + IsEndLoop_2_5_5 + IsEndLoop_2_6_5 + IsEndLoop_2_4_6 + IsEndLoop_2_5_6 + IsEndLoop_2_2_6 + IsEndLoop_2_3_6 + IsEndLoop_2_2_7 + IsEndLoop_2_1_7 + IsEndLoop_2_0_7 + IsEndLoop_2_6_6 + IsEndLoop_2_6_7 + IsEndLoop_2_5_7 + IsEndLoop_2_4_7 + IsEndLoop_2_3_7 + EndTurn_2_3 + EndTurn_2_2 + EndTurn_2_1 + EndTurn_2_0 + BeginLoop_2_0_0 + EndTurn_2_6 + EndTurn_2_5 + EndTurn_2_4 + BeginLoop_2_5_0 + BeginLoop_2_6_0 + BeginLoop_2_0_1 + BeginLoop_2_1_1 + BeginLoop_2_1_0 + BeginLoop_2_2_0 + BeginLoop_2_3_0 + BeginLoop_2_4_0 + BeginLoop_2_6_1 + BeginLoop_2_0_2 + BeginLoop_2_1_2 + BeginLoop_2_2_2 + BeginLoop_2_2_1 + BeginLoop_2_3_1 + BeginLoop_2_4_1 + BeginLoop_2_5_1 + BeginLoop_2_1_3 + BeginLoop_2_0_3 + BeginLoop_2_3_3 + BeginLoop_2_2_3 + BeginLoop_2_4_2 + BeginLoop_2_3_2 + BeginLoop_2_6_2 + BeginLoop_2_5_2 + BeginLoop_2_2_4 + BeginLoop_2_1_4 + BeginLoop_2_4_4 + BeginLoop_2_3_4 + BeginLoop_2_5_3 + BeginLoop_2_4_3 + BeginLoop_2_0_4 + BeginLoop_2_6_3 + BeginLoop_2_4_5 + BeginLoop_2_5_5 + BeginLoop_2_2_5 + BeginLoop_2_3_5 + BeginLoop_2_0_5 + BeginLoop_2_1_5 + BeginLoop_2_5_4 + BeginLoop_2_6_4 + BeginLoop_2_5_6 + BeginLoop_2_6_6 + BeginLoop_2_3_6 + BeginLoop_2_4_6 + BeginLoop_2_1_6 + BeginLoop_2_2_6 + BeginLoop_2_6_5 + BeginLoop_2_0_6 + BeginLoop_2_6_7 + BeginLoop_2_5_7 + BeginLoop_2_4_7 + BeginLoop_2_3_7 + BeginLoop_2_2_7 + BeginLoop_2_1_7 + BeginLoop_2_0_7 + TestAlone_2_0_1 + TestAlone_2_6_0 + TestAlone_2_4_0 + TestAlone_2_5_0 + TestAlone_2_3_0 + TestAlone_2_2_0 + TestAlone_2_1_0 + TestAlone_2_0_0 + TestAlone_2_2_3 + TestAlone_2_1_3 + TestAlone_2_0_3 + TestAlone_2_4_3 + TestAlone_2_3_3 + TestAlone_2_2_1 + TestAlone_2_1_1 + TestAlone_2_4_1 + TestAlone_2_3_1 + TestAlone_2_5_1 + TestAlone_2_6_1 + TestAlone_2_0_5 + TestAlone_2_1_5 + TestAlone_2_3_5 + TestAlone_2_2_5 + TestAlone_2_4_5 + TestAlone_2_5_5 + TestAlone_2_6_5 + TestAlone_2_0_6 + TestAlone_2_1_6 + TestAlone_2_5_3 + TestAlone_2_6_3 + TestAlone_2_0_4 + TestAlone_2_1_4 + TestAlone_2_2_4 + TestAlone_2_3_4 + TestAlone_2_4_4 + TestAlone_2_5_4 + TestAlone_2_6_4 + TestTurn_2_1 + TestTurn_2_0 + TestAlone_2_6_7 + TestAlone_2_5_7 + TestAlone_2_4_7 + TestTurn_2_5 + TestTurn_2_4 + TestTurn_2_3 + TestTurn_2_2 + TestAlone_2_6_6 + TestAlone_2_5_6 + TestAlone_2_3_6 + TestAlone_2_4_6 + TestAlone_2_2_6 + TestAlone_2_3_7 + TestAlone_2_2_7 + TestAlone_2_1_7 + TestAlone_2_0_7 + TestIdentity_2_2_1 + TestIdentity_2_3_1 + TestIdentity_2_0_1 + TestIdentity_2_1_1 + TestIdentity_2_6_1 + TestIdentity_2_0_2 + TestIdentity_2_4_1 + TestIdentity_2_5_1 + TestIdentity_2_1_0 + TestIdentity_2_2_0 + TestTurn_2_6 + TestIdentity_2_0_0 + TestIdentity_2_5_0 + TestIdentity_2_6_0 + TestIdentity_2_3_0 + TestIdentity_2_4_0 + TestIdentity_2_0_4 + TestIdentity_2_6_3 + TestIdentity_2_2_4 + TestIdentity_2_1_4 + TestIdentity_2_3_3 + TestIdentity_2_2_3 + TestIdentity_2_5_3 + TestIdentity_2_4_3 + TestIdentity_2_6_2 + TestIdentity_2_5_2 + TestIdentity_2_1_3 + TestIdentity_2_0_3 + TestIdentity_2_2_2 + TestIdentity_2_1_2 + TestIdentity_2_4_2 + TestIdentity_2_3_2 + TestIdentity_2_1_6 + TestIdentity_2_2_6 + TestIdentity_2_3_6 + TestIdentity_2_4_6 + TestIdentity_2_4_5 + TestIdentity_2_5_5 + TestIdentity_2_6_5 + TestIdentity_2_0_6 + TestIdentity_2_0_5 + TestIdentity_2_1_5 + TestIdentity_2_2_5 + TestIdentity_2_3_5 + TestIdentity_2_3_4 + TestIdentity_2_4_4 + TestIdentity_2_5_4 + TestIdentity_2_6_4 + TestIdentity_2_6_7 + TestIdentity_2_5_7 + TestIdentity_2_4_7 + TestIdentity_2_3_7 + TestIdentity_2_2_7 + TestIdentity_2_1_7 + TestIdentity_2_0_7 + TestIdentity_2_6_6 + TestIdentity_2_5_6 + CS_2 + AskForSection_2_5 + AskForSection_2_6 + AskForSection_2_3 + AskForSection_2_4 + AskForSection_2_1 + AskForSection_2_2 + Idle_2 + AskForSection_2_0 = 1
inv : WantSection_4_T + Idle_4 = 1
inv : WantSection_7_T + Idle_7 = 1
inv : Turn_4_6 + Turn_4_5 + Turn_4_4 + Turn_4_3 + Turn_4_2 + Turn_4_1 + Turn_4_0 + Turn_4_7 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_5_0 + IsEndLoop_5_6_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_2_1 + IsEndLoop_5_3_1 + IsEndLoop_5_4_1 + IsEndLoop_5_5_1 + IsEndLoop_5_6_1 + IsEndLoop_5_0_2 + IsEndLoop_5_2_2 + IsEndLoop_5_1_2 + IsEndLoop_5_4_2 + IsEndLoop_5_3_2 + IsEndLoop_5_6_2 + IsEndLoop_5_5_2 + IsEndLoop_5_1_3 + IsEndLoop_5_0_3 + IsEndLoop_5_3_3 + IsEndLoop_5_2_3 + IsEndLoop_5_5_3 + IsEndLoop_5_4_3 + IsEndLoop_5_0_4 + IsEndLoop_5_6_3 + IsEndLoop_5_2_4 + IsEndLoop_5_1_4 + IsEndLoop_5_5_4 + IsEndLoop_5_6_4 + IsEndLoop_5_3_4 + IsEndLoop_5_4_4 + IsEndLoop_5_2_5 + IsEndLoop_5_3_5 + IsEndLoop_5_0_5 + IsEndLoop_5_1_5 + IsEndLoop_5_6_5 + IsEndLoop_5_0_6 + IsEndLoop_5_4_5 + IsEndLoop_5_5_5 + IsEndLoop_5_3_6 + IsEndLoop_5_4_6 + IsEndLoop_5_1_6 + IsEndLoop_5_2_6 + IsEndLoop_5_1_7 + IsEndLoop_5_0_7 + IsEndLoop_5_6_6 + IsEndLoop_5_5_6 + IsEndLoop_5_5_7 + IsEndLoop_5_4_7 + IsEndLoop_5_3_7 + IsEndLoop_5_2_7 + EndTurn_5_2 + EndTurn_5_1 + EndTurn_5_0 + IsEndLoop_5_6_7 + EndTurn_5_6 + EndTurn_5_5 + EndTurn_5_4 + EndTurn_5_3 + BeginLoop_5_4_0 + BeginLoop_5_5_0 + BeginLoop_5_6_0 + BeginLoop_5_0_1 + BeginLoop_5_0_0 + BeginLoop_5_1_0 + BeginLoop_5_2_0 + BeginLoop_5_3_0 + BeginLoop_5_5_1 + BeginLoop_5_6_1 + BeginLoop_5_0_2 + BeginLoop_5_1_2 + BeginLoop_5_1_1 + BeginLoop_5_2_1 + BeginLoop_5_3_1 + BeginLoop_5_4_1 + BeginLoop_5_0_3 + BeginLoop_5_6_2 + BeginLoop_5_2_3 + BeginLoop_5_1_3 + BeginLoop_5_3_2 + BeginLoop_5_2_2 + BeginLoop_5_5_2 + BeginLoop_5_4_2 + BeginLoop_5_1_4 + BeginLoop_5_0_4 + BeginLoop_5_3_4 + BeginLoop_5_2_4 + BeginLoop_5_4_3 + BeginLoop_5_3_3 + BeginLoop_5_6_3 + BeginLoop_5_5_3 + BeginLoop_5_3_5 + BeginLoop_5_4_5 + BeginLoop_5_1_5 + BeginLoop_5_2_5 + BeginLoop_5_6_4 + BeginLoop_5_0_5 + BeginLoop_5_4_4 + BeginLoop_5_5_4 + BeginLoop_5_4_6 + BeginLoop_5_5_6 + BeginLoop_5_2_6 + BeginLoop_5_3_6 + BeginLoop_5_0_6 + BeginLoop_5_1_6 + BeginLoop_5_5_5 + BeginLoop_5_6_5 + BeginLoop_5_6_7 + BeginLoop_5_5_7 + BeginLoop_5_4_7 + BeginLoop_5_3_7 + BeginLoop_5_2_7 + BeginLoop_5_1_7 + BeginLoop_5_0_7 + BeginLoop_5_6_6 + TestAlone_5_6_0 + TestAlone_5_5_0 + TestAlone_5_4_0 + TestAlone_5_3_0 + TestAlone_5_2_0 + TestAlone_5_1_0 + TestAlone_5_0_0 + TestAlone_5_4_2 + TestAlone_5_3_2 + TestAlone_5_6_2 + TestAlone_5_5_2 + TestAlone_5_1_3 + TestAlone_5_0_3 + TestAlone_5_4_3 + TestAlone_5_3_3 + TestAlone_5_2_3 + TestAlone_5_2_1 + TestAlone_5_0_1 + TestAlone_5_1_1 + TestAlone_5_4_1 + TestAlone_5_3_1 + TestAlone_5_6_1 + TestAlone_5_5_1 + TestAlone_5_1_2 + TestAlone_5_2_2 + TestAlone_5_0_2 + TestAlone_5_0_6 + TestAlone_5_1_6 + TestAlone_5_5_3 + TestAlone_5_6_3 + TestAlone_5_0_4 + TestAlone_5_1_4 + TestAlone_5_2_4 + TestAlone_5_3_4 + TestAlone_5_4_4 + TestAlone_5_5_4 + TestAlone_5_6_4 + TestTurn_5_0 + TestAlone_5_6_7 + TestAlone_5_5_7 + TestAlone_5_4_7 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestAlone_5_5_6 + TestAlone_5_4_6 + TestAlone_5_3_6 + TestAlone_5_2_6 + TestAlone_5_3_7 + TestAlone_5_2_7 + TestAlone_5_1_7 + TestAlone_5_6_6 + TestAlone_5_0_7 + TestIdentity_5_1_1 + TestIdentity_5_2_1 + TestIdentity_5_6_0 + TestIdentity_5_0_1 + TestIdentity_5_5_1 + TestIdentity_5_6_1 + TestIdentity_5_3_1 + TestIdentity_5_4_1 + TestIdentity_5_0_0 + TestIdentity_5_1_0 + TestTurn_5_5 + TestTurn_5_6 + TestIdentity_5_4_0 + TestIdentity_5_5_0 + TestIdentity_5_2_0 + TestIdentity_5_3_0 + TestIdentity_5_6_3 + TestIdentity_5_5_3 + TestIdentity_5_1_4 + TestIdentity_5_0_4 + TestIdentity_5_2_3 + TestIdentity_5_1_3 + TestIdentity_5_4_3 + TestIdentity_5_3_3 + TestIdentity_5_5_2 + TestIdentity_5_4_2 + TestIdentity_5_0_3 + TestIdentity_5_6_2 + TestIdentity_5_1_2 + TestIdentity_5_0_2 + TestIdentity_5_3_2 + TestIdentity_5_2_2 + TestIdentity_5_0_6 + TestIdentity_5_1_6 + TestIdentity_5_2_6 + TestIdentity_5_3_6 + TestIdentity_5_3_5 + TestIdentity_5_4_5 + TestIdentity_5_5_5 + TestIdentity_5_6_5 + TestIdentity_5_6_4 + TestIdentity_5_0_5 + TestIdentity_5_1_5 + TestIdentity_5_2_5 + TestIdentity_5_2_4 + TestIdentity_5_3_4 + TestIdentity_5_4_4 + TestIdentity_5_5_4 + TestIdentity_5_6_7 + TestIdentity_5_5_7 + TestIdentity_5_4_7 + TestIdentity_5_3_7 + TestIdentity_5_2_7 + TestIdentity_5_1_7 + TestIdentity_5_0_7 + TestIdentity_5_6_6 + TestIdentity_5_5_6 + TestIdentity_5_4_6 + AskForSection_5_6 + CS_5 + AskForSection_5_4 + AskForSection_5_5 + AskForSection_5_2 + AskForSection_5_3 + AskForSection_5_0 + AskForSection_5_1 + Idle_5 = 1
Total of 31 invariants.
[2022-06-12 22:28:08] [INFO ] Computed 31 place invariants in 10 ms
[2022-06-12 22:28:08] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-06(UNSAT) depth K=1 took 769 ms
[2022-06-12 22:28:08] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-08(UNSAT) depth K=1 took 9 ms
[2022-06-12 22:28:08] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-09(UNSAT) depth K=1 took 3 ms
[2022-06-12 22:28:08] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-12(UNSAT) depth K=1 took 3 ms
[2022-06-12 22:28:08] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-14(UNSAT) depth K=1 took 14 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/graph862452358468886669.txt, -o, /tmp/graph862452358468886669.bin, -w, /tmp/graph862452358468886669.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/graph862452358468886669.bin, -l, -1, -v, -w, /tmp/graph862452358468886669.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:28:09] [INFO ] Decomposing Gal with order
[2022-06-12 22:28:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:28:13] [INFO ] Removed a total of 1528 redundant transitions.
[2022-06-12 22:28:13] [INFO ] Flatten gal took : 3571 ms
[2022-06-12 22:28:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 1160 labels/synchronizations in 121 ms.
[2022-06-12 22:28:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2808845858944086274.gal : 15 ms
[2022-06-12 22:28:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16202354646451589851.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/ReachabilityCardinality2808845858944086274.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality16202354646451589851.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/ReachabilityCardinality2808845858944086274.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality16202354646451589851.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality16202354646451589851.prop.
[2022-06-12 22:28:14] [INFO ] Proved 1992 variables to be positive in 6131 ms
[2022-06-12 22:28:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-04
[2022-06-12 22:28:15] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-04(SAT) depth K=0 took 485 ms
[2022-06-12 22:28:15] [INFO ] Induction result is UNSAT, proved UNreachability of reachability predicate Peterson-PT-7-ReachabilityCardinality-06
[2022-06-12 22:28:15] [INFO ] Induction result is UNSAT, successfully proved induction at step 0 for Peterson-PT-7-ReachabilityCardinality-06
FORMULA Peterson-PT-7-ReachabilityCardinality-06 FALSE TECHNIQUES SAT_SMT K_INDUCTION(0)
[2022-06-12 22:28:15] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-06(FALSE) depth K=0 took 70 ms
[2022-06-12 22:28:15] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-04(UNSAT) depth K=2 took 6838 ms
[2022-06-12 22:28:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-08
[2022-06-12 22:28:16] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-08(SAT) depth K=0 took 1700 ms
[2022-06-12 22:28:18] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-08(UNSAT) depth K=2 took 2558 ms
[2022-06-12 22:28:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-09
[2022-06-12 22:28:18] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-09(SAT) depth K=0 took 1428 ms
[2022-06-12 22:28:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-12
[2022-06-12 22:28:20] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-12(SAT) depth K=0 took 1734 ms
[2022-06-12 22:28:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-14
[2022-06-12 22:28:20] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-14(SAT) depth K=0 took 964 ms
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 4
[2022-06-12 22:28:21] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-09(UNSAT) depth K=2 took 3176 ms
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :4 after 11
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :12 after 15
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :15 after 16
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :16 after 19
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :19 after 23
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :23 after 25
[2022-06-12 22:28:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-04
[2022-06-12 22:28:23] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-04(SAT) depth K=1 took 2551 ms
[2022-06-12 22:28:23] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-12(UNSAT) depth K=2 took 2458 ms
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :25 after 58
SDD proceeding with computation,6 properties remain. new max is 2048
SDD size :58 after 119
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :119 after 896
[2022-06-12 22:28:26] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-14(UNSAT) depth K=2 took 2437 ms
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :896 after 2145
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :2145 after 9167
[2022-06-12 22:28:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-08
[2022-06-12 22:28:33] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-08(SAT) depth K=1 took 9979 ms
SDD proceeding with computation,6 properties remain. new max is 32768
SDD size :9167 after 24008
[2022-06-12 22:28:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-09
[2022-06-12 22:28:44] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-09(SAT) depth K=1 took 11221 ms
SDD proceeding with computation,6 properties remain. new max is 65536
SDD size :24008 after 79593
[2022-06-12 22:28:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-12
[2022-06-12 22:28:48] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-12(SAT) depth K=1 took 4075 ms
Compilation finished in 42731 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15312746223535222392]
Link finished in 66 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT7ReachabilityCardinality04==true], workingDir=/tmp/ltsmin15312746223535222392]
[2022-06-12 22:29:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityCardinality-14
[2022-06-12 22:29:09] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityCardinality-14(SAT) depth K=1 took 20795 ms
SDD proceeding with computation,6 properties remain. new max is 131072
SDD size :79593 after 208240
SDD proceeding with computation,6 properties remain. new max is 262144
SDD size :208240 after 470734
[2022-06-12 22:34:40] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-04(UNSAT) depth K=3 took 374716 ms
[2022-06-12 22:38:17] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-08(UNSAT) depth K=3 took 216737 ms
WARNING : LTSmin timed out (>600 s) on command 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, PetersonPT7ReachabilityCardinality04==true], workingDir=/tmp/ltsmin15312746223535222392]
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, PetersonPT7ReachabilityCardinality08==true], workingDir=/tmp/ltsmin15312746223535222392]
[2022-06-12 22:41:50] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-09(UNSAT) depth K=3 took 212857 ms
SDD proceeding with computation,6 properties remain. new max is 524288
SDD size :470734 after 738675
[2022-06-12 22:43:48] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-12(UNSAT) depth K=3 took 117930 ms
WARNING : LTSmin timed out (>600 s) on command 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, PetersonPT7ReachabilityCardinality08==true], workingDir=/tmp/ltsmin15312746223535222392]
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, PetersonPT7ReachabilityCardinality09==true], workingDir=/tmp/ltsmin15312746223535222392]
[2022-06-12 22:52:19] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityCardinality-14(UNSAT) depth K=3 took 511592 ms
Detected timeout of ITS tools.
[2022-06-12 22:52:22] [INFO ] Applying decomposition
[2022-06-12 22:52:22] [INFO ] Flatten gal took : 229 ms
[2022-06-12 22:52:22] [INFO ] Decomposing Gal with order
[2022-06-12 22:52:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:52:32] [INFO ] Removed a total of 1624 redundant transitions.
[2022-06-12 22:52:32] [INFO ] Flatten gal took : 9493 ms
[2022-06-12 22:52:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 1232 labels/synchronizations in 330 ms.
[2022-06-12 22:52:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3586662773877263059.gal : 129 ms
[2022-06-12 22:52:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4671337126167068807.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/ReachabilityCardinality3586662773877263059.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4671337126167068807.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/ReachabilityCardinality3586662773877263059.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4671337126167068807.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4671337126167068807.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :4 after 8
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :8 after 20
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :20 after 21
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :21 after 25
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :25 after 26
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :26 after 27
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :27 after 33
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :33 after 42
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :42 after 114
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :114 after 381
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :381 after 1172
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :1172 after 4790
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :4790 after 8013
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :8013 after 42443
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :42443 after 137046
WARNING : LTSmin timed out (>600 s) on command 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, PetersonPT7ReachabilityCardinality09==true], workingDir=/tmp/ltsmin15312746223535222392]
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, PetersonPT7ReachabilityCardinality12==true], workingDir=/tmp/ltsmin15312746223535222392]
SDD proceeding with computation,5 properties remain. new max is 262144
SDD size :137046 after 354911
SDD proceeding with computation,5 properties remain. new max is 524288
SDD size :354911 after 610571
WARNING : LTSmin timed out (>600 s) on command 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, PetersonPT7ReachabilityCardinality12==true], workingDir=/tmp/ltsmin15312746223535222392]
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, PetersonPT7ReachabilityCardinality14==true], workingDir=/tmp/ltsmin15312746223535222392]

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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-PT-7"
export BK_EXAMINATION="ReachabilityCardinality"
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-PT-7, examination is ReachabilityCardinality"
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-165277026700035"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;