fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r179-tall-165277026700036
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for Peterson-PT-7

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16242.487 3600000.00 12804864.00 3692.50 TTFT?TTTT??T?TTF normal

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

--------------------
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-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655072141980

Running Version 0
[2022-06-12 22:15:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 22:15:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:15:43] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2022-06-12 22:15:43] [INFO ] Transformed 1992 places.
[2022-06-12 22:15:43] [INFO ] Transformed 3096 transitions.
[2022-06-12 22:15:43] [INFO ] Found NUPN structural information;
[2022-06-12 22:15:43] [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:43] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 200 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 86 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-PT-7-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 15) seen :9
FORMULA Peterson-PT-7-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2241 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 6) seen :1
FORMULA Peterson-PT-7-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2022-06-12 22:15:46] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:15:46] [INFO ] Computed 31 place invariants in 41 ms
[2022-06-12 22:15:48] [INFO ] [Real]Absence check using 23 positive place invariants in 770 ms returned sat
[2022-06-12 22:15:48] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 134 ms returned sat
[2022-06-12 22:15:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:51] [INFO ] [Real]Absence check using state equation in 3618 ms returned unknown
[2022-06-12 22:15:52] [INFO ] [Real]Absence check using 23 positive place invariants in 43 ms returned sat
[2022-06-12 22:15:52] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 10 ms returned sat
[2022-06-12 22:15:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:54] [INFO ] [Real]Absence check using state equation in 2209 ms returned sat
[2022-06-12 22:15:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:15:54] [INFO ] [Nat]Absence check using 23 positive place invariants in 52 ms returned sat
[2022-06-12 22:15:54] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2022-06-12 22:15:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:15:56] [INFO ] [Nat]Absence check using state equation in 1396 ms returned sat
[2022-06-12 22:15:56] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 22:15:56] [INFO ] [Nat]Added 546 Read/Feed constraints in 177 ms returned sat
[2022-06-12 22:15:57] [INFO ] Deduced a trap composed of 54 places in 1043 ms of which 4 ms to minimize.
[2022-06-12 22:15:58] [INFO ] Deduced a trap composed of 142 places in 957 ms of which 3 ms to minimize.
[2022-06-12 22:15:59] [INFO ] Deduced a trap composed of 92 places in 881 ms of which 2 ms to minimize.
[2022-06-12 22:15: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 1
[2022-06-12 22:16:00] [INFO ] [Real]Absence check using 23 positive place invariants in 62 ms returned sat
[2022-06-12 22:16:00] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2022-06-12 22:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:01] [INFO ] [Real]Absence check using state equation in 1664 ms returned sat
[2022-06-12 22:16:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:02] [INFO ] [Nat]Absence check using 23 positive place invariants in 47 ms returned sat
[2022-06-12 22:16:02] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 9 ms returned sat
[2022-06-12 22:16:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:04] [INFO ] [Nat]Absence check using state equation in 1726 ms returned sat
[2022-06-12 22:16:04] [INFO ] [Nat]Added 546 Read/Feed constraints in 183 ms returned sat
[2022-06-12 22:16:05] [INFO ] Deduced a trap composed of 21 places in 1104 ms of which 2 ms to minimize.
[2022-06-12 22:16:06] [INFO ] Deduced a trap composed of 13 places in 1075 ms of which 2 ms to minimize.
[2022-06-12 22:16:07] [INFO ] Deduced a trap composed of 13 places in 1081 ms of which 1 ms to minimize.
[2022-06-12 22:16:07] [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:16:08] [INFO ] [Real]Absence check using 23 positive place invariants in 48 ms returned sat
[2022-06-12 22:16:08] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2022-06-12 22:16:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:10] [INFO ] [Real]Absence check using state equation in 2544 ms returned sat
[2022-06-12 22:16:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:16:11] [INFO ] [Nat]Absence check using 23 positive place invariants in 60 ms returned sat
[2022-06-12 22:16:11] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 22:16:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:16:13] [INFO ] [Nat]Absence check using state equation in 2518 ms returned sat
[2022-06-12 22:16:13] [INFO ] [Nat]Added 546 Read/Feed constraints in 185 ms returned sat
[2022-06-12 22:16:14] [INFO ] Deduced a trap composed of 13 places in 1037 ms of which 1 ms to minimize.
[2022-06-12 22:16:16] [INFO ] Deduced a trap composed of 24 places in 1059 ms of which 1 ms to minimize.
[2022-06-12 22:16: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 3
[2022-06-12 22:16:16] [INFO ] [Real]Absence check using 23 positive place invariants in 34 ms returned unsat
FORMULA Peterson-PT-7-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 5 Parikh solutions to 1 different solutions.
Support contains 1944 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 107 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:16] [INFO ] Flatten gal took : 218 ms
[2022-06-12 22:16:17] [INFO ] Flatten gal took : 155 ms
[2022-06-12 22:16:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2477935119154642666.gal : 40 ms
[2022-06-12 22:16:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13161052231926006437.prop : 14 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/ReachabilityCardinality2477935119154642666.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13161052231926006437.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/ReachabilityCardinality2477935119154642666.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13161052231926006437.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13161052231926006437.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :13 after 18
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :18 after 19
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :19 after 20
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :20 after 25
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :25 after 26
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :26 after 93
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :93 after 181
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :181 after 1315
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1315 after 3093
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :3093 after 6425
Detected timeout of ITS tools.
[2022-06-12 22:16:32] [INFO ] Flatten gal took : 125 ms
[2022-06-12 22:16:32] [INFO ] Applying decomposition
[2022-06-12 22:16:32] [INFO ] Flatten gal took : 94 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/graph17650044920503868767.txt, -o, /tmp/graph17650044920503868767.bin, -w, /tmp/graph17650044920503868767.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/graph17650044920503868767.bin, -l, -1, -v, -w, /tmp/graph17650044920503868767.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:16:32] [INFO ] Decomposing Gal with order
[2022-06-12 22:16:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:16:33] [INFO ] Removed a total of 2835 redundant transitions.
[2022-06-12 22:16:33] [INFO ] Flatten gal took : 254 ms
[2022-06-12 22:16:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2022-06-12 22:16:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6253010175827250115.gal : 24 ms
[2022-06-12 22:16:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8452025935291950002.prop : 9 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/ReachabilityCardinality6253010175827250115.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8452025935291950002.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality6253010175827250115.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8452025935291950002.prop --nowitness
Loading property file /tmp/ReachabilityCardinality8452025935291950002.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 240
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2906339517178318739
[2022-06-12 22:16:49] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2906339517178318739
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/ltsmin2906339517178318739]
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/ltsmin2906339517178318739] 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/ltsmin2906339517178318739] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4533 ms. (steps per millisecond=220 ) properties (out of 4) seen :0
Interrupted Best-First random walk after 21195 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=4 ) properties seen :{}
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1487 ms. (steps per millisecond=672 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1657 ms. (steps per millisecond=603 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2171 ms. (steps per millisecond=460 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 2729169 steps, run timeout after 30001 ms. (steps per millisecond=90 ) properties seen :{}
Probabilistic random walk after 2729169 steps, saw 1573885 distinct states, run finished after 30001 ms. (steps per millisecond=90 ) properties seen :{}
Running SMT prover for 4 properties.
[2022-06-12 22:17:35] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:17:35] [INFO ] Computed 31 place invariants in 19 ms
[2022-06-12 22:17:36] [INFO ] [Real]Absence check using 23 positive place invariants in 713 ms returned sat
[2022-06-12 22:17:36] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 124 ms returned sat
[2022-06-12 22:17:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:20] [INFO ] [Real]Absence check using state equation in 43718 ms returned unknown
[2022-06-12 22:18:20] [INFO ] [Real]Absence check using 23 positive place invariants in 42 ms returned sat
[2022-06-12 22:18:20] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2022-06-12 22:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:22] [INFO ] [Real]Absence check using state equation in 2076 ms returned sat
[2022-06-12 22:18:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:18:23] [INFO ] [Nat]Absence check using 23 positive place invariants in 42 ms returned sat
[2022-06-12 22:18:23] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 22:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:18:24] [INFO ] [Nat]Absence check using state equation in 1342 ms returned sat
[2022-06-12 22:18:24] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 22:18:24] [INFO ] [Nat]Added 546 Read/Feed constraints in 171 ms returned sat
[2022-06-12 22:18:25] [INFO ] Deduced a trap composed of 54 places in 880 ms of which 1 ms to minimize.
[2022-06-12 22:18:26] [INFO ] Deduced a trap composed of 142 places in 948 ms of which 2 ms to minimize.
[2022-06-12 22:18:27] [INFO ] Deduced a trap composed of 92 places in 864 ms of which 2 ms to minimize.
[2022-06-12 22:18:28] [INFO ] Deduced a trap composed of 93 places in 843 ms of which 1 ms to minimize.
[2022-06-12 22:18:29] [INFO ] Deduced a trap composed of 93 places in 865 ms of which 1 ms to minimize.
[2022-06-12 22:18:30] [INFO ] Deduced a trap composed of 92 places in 876 ms of which 2 ms to minimize.
[2022-06-12 22:18:31] [INFO ] Deduced a trap composed of 93 places in 854 ms of which 2 ms to minimize.
[2022-06-12 22:18:32] [INFO ] Deduced a trap composed of 66 places in 747 ms of which 1 ms to minimize.
[2022-06-12 22:18:33] [INFO ] Deduced a trap composed of 55 places in 784 ms of which 2 ms to minimize.
[2022-06-12 22:18:33] [INFO ] Deduced a trap composed of 237 places in 449 ms of which 1 ms to minimize.
[2022-06-12 22:18:34] [INFO ] Deduced a trap composed of 236 places in 475 ms of which 1 ms to minimize.
[2022-06-12 22:18:34] [INFO ] Deduced a trap composed of 202 places in 505 ms of which 1 ms to minimize.
[2022-06-12 22:18:35] [INFO ] Deduced a trap composed of 202 places in 441 ms of which 1 ms to minimize.
[2022-06-12 22:18:36] [INFO ] Deduced a trap composed of 203 places in 459 ms of which 1 ms to minimize.
[2022-06-12 22:18:36] [INFO ] Deduced a trap composed of 202 places in 442 ms of which 1 ms to minimize.
[2022-06-12 22:18:37] [INFO ] Deduced a trap composed of 236 places in 441 ms of which 1 ms to minimize.
[2022-06-12 22:18:37] [INFO ] Deduced a trap composed of 236 places in 439 ms of which 1 ms to minimize.
[2022-06-12 22:18:38] [INFO ] Deduced a trap composed of 236 places in 454 ms of which 1 ms to minimize.
[2022-06-12 22:18:38] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 13798 ms
[2022-06-12 22:18:38] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 142 ms.
[2022-06-12 22:18:58] [INFO ] Added : 665 causal constraints over 133 iterations in 20228 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
[2022-06-12 22:18:59] [INFO ] [Real]Absence check using 23 positive place invariants in 42 ms returned sat
[2022-06-12 22:18:59] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 22:18:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:00] [INFO ] [Real]Absence check using state equation in 1655 ms returned sat
[2022-06-12 22:19:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:19:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 45 ms returned sat
[2022-06-12 22:19:01] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-06-12 22:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:02] [INFO ] [Nat]Absence check using state equation in 1615 ms returned sat
[2022-06-12 22:19:02] [INFO ] [Nat]Added 546 Read/Feed constraints in 163 ms returned sat
[2022-06-12 22:19:04] [INFO ] Deduced a trap composed of 21 places in 1066 ms of which 1 ms to minimize.
[2022-06-12 22:19:05] [INFO ] Deduced a trap composed of 13 places in 1013 ms of which 2 ms to minimize.
[2022-06-12 22:19:06] [INFO ] Deduced a trap composed of 13 places in 1031 ms of which 1 ms to minimize.
[2022-06-12 22:19:07] [INFO ] Deduced a trap composed of 34 places in 1045 ms of which 2 ms to minimize.
[2022-06-12 22:19:08] [INFO ] Deduced a trap composed of 13 places in 1020 ms of which 2 ms to minimize.
[2022-06-12 22:19:09] [INFO ] Deduced a trap composed of 13 places in 1072 ms of which 1 ms to minimize.
[2022-06-12 22:19:10] [INFO ] Deduced a trap composed of 13 places in 1047 ms of which 6 ms to minimize.
[2022-06-12 22:19:12] [INFO ] Deduced a trap composed of 16 places in 1053 ms of which 1 ms to minimize.
[2022-06-12 22:19:13] [INFO ] Deduced a trap composed of 13 places in 1027 ms of which 2 ms to minimize.
[2022-06-12 22:19:14] [INFO ] Deduced a trap composed of 30 places in 996 ms of which 2 ms to minimize.
[2022-06-12 22:19:15] [INFO ] Deduced a trap composed of 50 places in 976 ms of which 1 ms to minimize.
[2022-06-12 22:19:16] [INFO ] Deduced a trap composed of 66 places in 972 ms of which 1 ms to minimize.
[2022-06-12 22:19:17] [INFO ] Deduced a trap composed of 30 places in 985 ms of which 1 ms to minimize.
[2022-06-12 22:19:18] [INFO ] Deduced a trap composed of 30 places in 992 ms of which 2 ms to minimize.
[2022-06-12 22:19:19] [INFO ] Deduced a trap composed of 30 places in 987 ms of which 1 ms to minimize.
[2022-06-12 22:19:20] [INFO ] Deduced a trap composed of 51 places in 971 ms of which 1 ms to minimize.
[2022-06-12 22:19:22] [INFO ] Deduced a trap composed of 50 places in 977 ms of which 1 ms to minimize.
[2022-06-12 22:19:23] [INFO ] Deduced a trap composed of 50 places in 985 ms of which 1 ms to minimize.
[2022-06-12 22:19:24] [INFO ] Deduced a trap composed of 81 places in 894 ms of which 2 ms to minimize.
[2022-06-12 22:19:25] [INFO ] Deduced a trap composed of 45 places in 896 ms of which 5 ms to minimize.
[2022-06-12 22:19:26] [INFO ] Deduced a trap composed of 45 places in 889 ms of which 2 ms to minimize.
[2022-06-12 22:19:27] [INFO ] Deduced a trap composed of 81 places in 904 ms of which 2 ms to minimize.
[2022-06-12 22:19:28] [INFO ] Deduced a trap composed of 115 places in 889 ms of which 1 ms to minimize.
[2022-06-12 22:19:29] [INFO ] Deduced a trap composed of 115 places in 887 ms of which 3 ms to minimize.
[2022-06-12 22:19:30] [INFO ] Deduced a trap composed of 156 places in 884 ms of which 2 ms to minimize.
[2022-06-12 22:19:31] [INFO ] Deduced a trap composed of 101 places in 906 ms of which 1 ms to minimize.
[2022-06-12 22:19:32] [INFO ] Deduced a trap composed of 101 places in 881 ms of which 2 ms to minimize.
[2022-06-12 22:19:33] [INFO ] Deduced a trap composed of 138 places in 887 ms of which 1 ms to minimize.
[2022-06-12 22:19:34] [INFO ] Deduced a trap composed of 156 places in 895 ms of which 6 ms to minimize.
[2022-06-12 22:19:35] [INFO ] Deduced a trap composed of 45 places in 898 ms of which 1 ms to minimize.
[2022-06-12 22:19:36] [INFO ] Deduced a trap composed of 45 places in 907 ms of which 2 ms to minimize.
[2022-06-12 22:19:37] [INFO ] Deduced a trap composed of 45 places in 887 ms of which 1 ms to minimize.
[2022-06-12 22:19:38] [INFO ] Deduced a trap composed of 48 places in 885 ms of which 1 ms to minimize.
[2022-06-12 22:19:39] [INFO ] Deduced a trap composed of 51 places in 864 ms of which 2 ms to minimize.
[2022-06-12 22:19:40] [INFO ] Deduced a trap composed of 109 places in 682 ms of which 1 ms to minimize.
[2022-06-12 22:19:41] [INFO ] Deduced a trap composed of 47 places in 985 ms of which 2 ms to minimize.
[2022-06-12 22:19:42] [INFO ] Deduced a trap composed of 104 places in 1007 ms of which 1 ms to minimize.
[2022-06-12 22:19:43] [INFO ] Deduced a trap composed of 101 places in 918 ms of which 2 ms to minimize.
[2022-06-12 22:19:44] [INFO ] Deduced a trap composed of 110 places in 965 ms of which 1 ms to minimize.
[2022-06-12 22:19:45] [INFO ] Deduced a trap composed of 122 places in 950 ms of which 3 ms to minimize.
[2022-06-12 22:19:46] [INFO ] Deduced a trap composed of 122 places in 937 ms of which 2 ms to minimize.
[2022-06-12 22:19:46] [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:19:46] [INFO ] [Real]Absence check using 23 positive place invariants in 43 ms returned sat
[2022-06-12 22:19:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-06-12 22:19:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:49] [INFO ] [Real]Absence check using state equation in 2551 ms returned sat
[2022-06-12 22:19:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:19:49] [INFO ] [Nat]Absence check using 23 positive place invariants in 45 ms returned sat
[2022-06-12 22:19:49] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2022-06-12 22:19:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:19:52] [INFO ] [Nat]Absence check using state equation in 2531 ms returned sat
[2022-06-12 22:19:52] [INFO ] [Nat]Added 546 Read/Feed constraints in 172 ms returned sat
[2022-06-12 22:19:53] [INFO ] Deduced a trap composed of 13 places in 1038 ms of which 2 ms to minimize.
[2022-06-12 22:19:54] [INFO ] Deduced a trap composed of 24 places in 1020 ms of which 2 ms to minimize.
[2022-06-12 22:19:56] [INFO ] Deduced a trap composed of 13 places in 1017 ms of which 2 ms to minimize.
[2022-06-12 22:19:57] [INFO ] Deduced a trap composed of 25 places in 1039 ms of which 1 ms to minimize.
[2022-06-12 22:19:58] [INFO ] Deduced a trap composed of 13 places in 1030 ms of which 2 ms to minimize.
[2022-06-12 22:19:59] [INFO ] Deduced a trap composed of 36 places in 1015 ms of which 1 ms to minimize.
[2022-06-12 22:20:00] [INFO ] Deduced a trap composed of 25 places in 1022 ms of which 2 ms to minimize.
[2022-06-12 22:20:01] [INFO ] Deduced a trap composed of 34 places in 1008 ms of which 2 ms to minimize.
[2022-06-12 22:20:03] [INFO ] Deduced a trap composed of 17 places in 1009 ms of which 2 ms to minimize.
[2022-06-12 22:20:04] [INFO ] Deduced a trap composed of 126 places in 779 ms of which 1 ms to minimize.
[2022-06-12 22:20:05] [INFO ] Deduced a trap composed of 70 places in 945 ms of which 2 ms to minimize.
[2022-06-12 22:20:06] [INFO ] Deduced a trap composed of 25 places in 918 ms of which 2 ms to minimize.
[2022-06-12 22:20:07] [INFO ] Deduced a trap composed of 138 places in 755 ms of which 1 ms to minimize.
[2022-06-12 22:20:08] [INFO ] Deduced a trap composed of 105 places in 763 ms of which 2 ms to minimize.
[2022-06-12 22:20:09] [INFO ] Deduced a trap composed of 104 places in 692 ms of which 1 ms to minimize.
[2022-06-12 22:20:10] [INFO ] Deduced a trap composed of 138 places in 768 ms of which 1 ms to minimize.
[2022-06-12 22:20:11] [INFO ] Deduced a trap composed of 172 places in 763 ms of which 1 ms to minimize.
[2022-06-12 22:20:12] [INFO ] Deduced a trap composed of 173 places in 786 ms of which 1 ms to minimize.
[2022-06-12 22:20:13] [INFO ] Deduced a trap composed of 240 places in 763 ms of which 1 ms to minimize.
[2022-06-12 22:20:13] [INFO ] Deduced a trap composed of 206 places in 744 ms of which 1 ms to minimize.
[2022-06-12 22:20:14] [INFO ] Deduced a trap composed of 206 places in 767 ms of which 1 ms to minimize.
[2022-06-12 22:20:15] [INFO ] Deduced a trap composed of 207 places in 744 ms of which 1 ms to minimize.
[2022-06-12 22:20:16] [INFO ] Deduced a trap composed of 240 places in 753 ms of which 1 ms to minimize.
[2022-06-12 22:20:17] [INFO ] Deduced a trap composed of 172 places in 764 ms of which 1 ms to minimize.
[2022-06-12 22:20:18] [INFO ] Deduced a trap composed of 194 places in 764 ms of which 1 ms to minimize.
[2022-06-12 22:20:19] [INFO ] Deduced a trap composed of 241 places in 768 ms of which 2 ms to minimize.
[2022-06-12 22:20:20] [INFO ] Deduced a trap composed of 373 places in 792 ms of which 1 ms to minimize.
[2022-06-12 22:20:21] [INFO ] Deduced a trap composed of 367 places in 793 ms of which 2 ms to minimize.
[2022-06-12 22:20:21] [INFO ] Deduced a trap composed of 358 places in 776 ms of which 1 ms to minimize.
[2022-06-12 22:20:22] [INFO ] Deduced a trap composed of 375 places in 775 ms of which 1 ms to minimize.
[2022-06-12 22:20:23] [INFO ] Deduced a trap composed of 381 places in 781 ms of which 1 ms to minimize.
[2022-06-12 22:20:24] [INFO ] Deduced a trap composed of 366 places in 783 ms of which 2 ms to minimize.
[2022-06-12 22:20:25] [INFO ] Deduced a trap composed of 152 places in 772 ms of which 2 ms to minimize.
[2022-06-12 22:20:26] [INFO ] Deduced a trap composed of 213 places in 783 ms of which 1 ms to minimize.
[2022-06-12 22:20:27] [INFO ] Deduced a trap composed of 407 places in 769 ms of which 1 ms to minimize.
[2022-06-12 22:20:28] [INFO ] Deduced a trap composed of 377 places in 782 ms of which 2 ms to minimize.
[2022-06-12 22:20:29] [INFO ] Deduced a trap composed of 42 places in 993 ms of which 2 ms to minimize.
[2022-06-12 22:20:30] [INFO ] Deduced a trap composed of 21 places in 859 ms of which 1 ms to minimize.
[2022-06-12 22:20:31] [INFO ] Deduced a trap composed of 60 places in 915 ms of which 1 ms to minimize.
[2022-06-12 22:20:32] [INFO ] Deduced a trap composed of 45 places in 939 ms of which 1 ms to minimize.
[2022-06-12 22:20:33] [INFO ] Deduced a trap composed of 45 places in 926 ms of which 2 ms to minimize.
[2022-06-12 22:20:34] [INFO ] Deduced a trap composed of 127 places in 945 ms of which 1 ms to minimize.
[2022-06-12 22:20:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
Fused 4 Parikh solutions to 2 different solutions.
Incomplete Parikh walk after 1395500 steps, including 1000 resets, run finished after 4677 ms. (steps per millisecond=298 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 1944 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 49 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 38 ms. Remains 1992 /1992 variables (removed 0) and now considering 3096/3096 (removed 0) transitions.
[2022-06-12 22:20:39] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:20:39] [INFO ] Computed 31 place invariants in 20 ms
[2022-06-12 22:20:39] [INFO ] Implicit Places using invariants in 334 ms returned []
[2022-06-12 22:20:39] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:20:39] [INFO ] Computed 31 place invariants in 10 ms
[2022-06-12 22:20:40] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 22:20:41] [INFO ] Implicit Places using invariants and state equation in 1139 ms returned []
Implicit Place search using SMT with State Equation took 1475 ms to find 0 implicit places.
[2022-06-12 22:20:41] [INFO ] Redundant transitions in 164 ms returned []
[2022-06-12 22:20:41] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:20:41] [INFO ] Computed 31 place invariants in 9 ms
[2022-06-12 22:20:43] [INFO ] Dead Transitions using invariants and state equation in 1909 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 502 ms. (steps per millisecond=199 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2022-06-12 22:20:43] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:20:43] [INFO ] Computed 31 place invariants in 12 ms
[2022-06-12 22:20:44] [INFO ] [Real]Absence check using 23 positive place invariants in 800 ms returned sat
[2022-06-12 22:20:44] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 122 ms returned sat
[2022-06-12 22:20:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:03] [INFO ] [Real]Absence check using state equation in 18703 ms returned unknown
[2022-06-12 22:21:03] [INFO ] [Real]Absence check using 23 positive place invariants in 41 ms returned sat
[2022-06-12 22:21:03] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 22:21:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:05] [INFO ] [Real]Absence check using state equation in 1978 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 41 ms returned sat
[2022-06-12 22:21:06] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2022-06-12 22:21:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:07] [INFO ] [Nat]Absence check using state equation in 1277 ms returned sat
[2022-06-12 22:21:07] [INFO ] State equation strengthened by 546 read => feed constraints.
[2022-06-12 22:21:07] [INFO ] [Nat]Added 546 Read/Feed constraints in 170 ms returned sat
[2022-06-12 22:21:08] [INFO ] Deduced a trap composed of 54 places in 952 ms of which 1 ms to minimize.
[2022-06-12 22:21:09] [INFO ] Deduced a trap composed of 142 places in 884 ms of which 1 ms to minimize.
[2022-06-12 22:21:10] [INFO ] Deduced a trap composed of 92 places in 905 ms of which 2 ms to minimize.
[2022-06-12 22:21:11] [INFO ] Deduced a trap composed of 93 places in 893 ms of which 1 ms to minimize.
[2022-06-12 22:21:12] [INFO ] Deduced a trap composed of 93 places in 899 ms of which 2 ms to minimize.
[2022-06-12 22:21:13] [INFO ] Deduced a trap composed of 92 places in 831 ms of which 2 ms to minimize.
[2022-06-12 22:21:14] [INFO ] Deduced a trap composed of 93 places in 860 ms of which 2 ms to minimize.
[2022-06-12 22:21:15] [INFO ] Deduced a trap composed of 66 places in 779 ms of which 1 ms to minimize.
[2022-06-12 22:21:16] [INFO ] Deduced a trap composed of 55 places in 811 ms of which 1 ms to minimize.
[2022-06-12 22:21:17] [INFO ] Deduced a trap composed of 237 places in 480 ms of which 1 ms to minimize.
[2022-06-12 22:21:17] [INFO ] Deduced a trap composed of 236 places in 482 ms of which 1 ms to minimize.
[2022-06-12 22:21:18] [INFO ] Deduced a trap composed of 202 places in 478 ms of which 0 ms to minimize.
[2022-06-12 22:21:18] [INFO ] Deduced a trap composed of 202 places in 492 ms of which 1 ms to minimize.
[2022-06-12 22:21:19] [INFO ] Deduced a trap composed of 203 places in 445 ms of which 1 ms to minimize.
[2022-06-12 22:21:20] [INFO ] Deduced a trap composed of 202 places in 463 ms of which 1 ms to minimize.
[2022-06-12 22:21:20] [INFO ] Deduced a trap composed of 236 places in 455 ms of which 0 ms to minimize.
[2022-06-12 22:21:21] [INFO ] Deduced a trap composed of 236 places in 478 ms of which 1 ms to minimize.
[2022-06-12 22:21:21] [INFO ] Deduced a trap composed of 236 places in 450 ms of which 1 ms to minimize.
[2022-06-12 22:21:21] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 14134 ms
[2022-06-12 22:21:22] [INFO ] Computed and/alt/rep : 2640/5840/2640 causal constraints (skipped 112 transitions) in 124 ms.
[2022-06-12 22:21:27] [INFO ] Deduced a trap composed of 2 places in 1215 ms of which 2 ms to minimize.
[2022-06-12 22:21:27] [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 1
[2022-06-12 22:21:27] [INFO ] [Real]Absence check using 23 positive place invariants in 46 ms returned sat
[2022-06-12 22:21:27] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 11 ms returned sat
[2022-06-12 22:21:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:29] [INFO ] [Real]Absence check using state equation in 1718 ms returned sat
[2022-06-12 22:21:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:29] [INFO ] [Nat]Absence check using 23 positive place invariants in 45 ms returned sat
[2022-06-12 22:21:29] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-06-12 22:21:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:31] [INFO ] [Nat]Absence check using state equation in 1620 ms returned sat
[2022-06-12 22:21:31] [INFO ] [Nat]Added 546 Read/Feed constraints in 167 ms returned sat
[2022-06-12 22:21:32] [INFO ] Deduced a trap composed of 21 places in 1050 ms of which 2 ms to minimize.
[2022-06-12 22:21:33] [INFO ] Deduced a trap composed of 13 places in 1018 ms of which 1 ms to minimize.
[2022-06-12 22:21:34] [INFO ] Deduced a trap composed of 13 places in 1029 ms of which 2 ms to minimize.
[2022-06-12 22:21:36] [INFO ] Deduced a trap composed of 34 places in 1086 ms of which 2 ms to minimize.
[2022-06-12 22:21:37] [INFO ] Deduced a trap composed of 13 places in 1048 ms of which 1 ms to minimize.
[2022-06-12 22:21:38] [INFO ] Deduced a trap composed of 13 places in 1044 ms of which 2 ms to minimize.
[2022-06-12 22:21:39] [INFO ] Deduced a trap composed of 13 places in 1028 ms of which 2 ms to minimize.
[2022-06-12 22:21:40] [INFO ] Deduced a trap composed of 16 places in 1046 ms of which 1 ms to minimize.
[2022-06-12 22:21:41] [INFO ] Deduced a trap composed of 13 places in 1047 ms of which 1 ms to minimize.
[2022-06-12 22:21:43] [INFO ] Deduced a trap composed of 30 places in 975 ms of which 2 ms to minimize.
[2022-06-12 22:21:44] [INFO ] Deduced a trap composed of 50 places in 979 ms of which 1 ms to minimize.
[2022-06-12 22:21:45] [INFO ] Deduced a trap composed of 66 places in 986 ms of which 2 ms to minimize.
[2022-06-12 22:21:46] [INFO ] Deduced a trap composed of 30 places in 1038 ms of which 2 ms to minimize.
[2022-06-12 22:21:47] [INFO ] Deduced a trap composed of 30 places in 993 ms of which 1 ms to minimize.
[2022-06-12 22:21:48] [INFO ] Deduced a trap composed of 30 places in 984 ms of which 2 ms to minimize.
[2022-06-12 22:21:49] [INFO ] Deduced a trap composed of 51 places in 979 ms of which 1 ms to minimize.
[2022-06-12 22:21:49] [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:21:49] [INFO ] [Real]Absence check using 23 positive place invariants in 43 ms returned sat
[2022-06-12 22:21:49] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 13 ms returned sat
[2022-06-12 22:21:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:52] [INFO ] [Real]Absence check using state equation in 2556 ms returned sat
[2022-06-12 22:21:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:52] [INFO ] [Nat]Absence check using 23 positive place invariants in 45 ms returned sat
[2022-06-12 22:21:52] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 22:21:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:55] [INFO ] [Nat]Absence check using state equation in 2515 ms returned sat
[2022-06-12 22:21:55] [INFO ] [Nat]Added 546 Read/Feed constraints in 170 ms returned sat
[2022-06-12 22:21:56] [INFO ] Deduced a trap composed of 13 places in 1043 ms of which 1 ms to minimize.
[2022-06-12 22:21:57] [INFO ] Deduced a trap composed of 24 places in 1043 ms of which 1 ms to minimize.
[2022-06-12 22:21:58] [INFO ] Deduced a trap composed of 13 places in 1032 ms of which 1 ms to minimize.
[2022-06-12 22:22:00] [INFO ] Deduced a trap composed of 25 places in 1049 ms of which 2 ms to minimize.
[2022-06-12 22:22:01] [INFO ] Deduced a trap composed of 13 places in 1032 ms of which 2 ms to minimize.
[2022-06-12 22:22:02] [INFO ] Deduced a trap composed of 36 places in 1026 ms of which 2 ms to minimize.
[2022-06-12 22:22:03] [INFO ] Deduced a trap composed of 25 places in 1016 ms of which 1 ms to minimize.
[2022-06-12 22:22:04] [INFO ] Deduced a trap composed of 34 places in 1000 ms of which 1 ms to minimize.
[2022-06-12 22:22:06] [INFO ] Deduced a trap composed of 17 places in 1046 ms of which 1 ms to minimize.
[2022-06-12 22:22:07] [INFO ] Deduced a trap composed of 126 places in 756 ms of which 2 ms to minimize.
[2022-06-12 22:22:08] [INFO ] Deduced a trap composed of 70 places in 973 ms of which 2 ms to minimize.
[2022-06-12 22:22:09] [INFO ] Deduced a trap composed of 25 places in 950 ms of which 1 ms to minimize.
[2022-06-12 22:22:10] [INFO ] Deduced a trap composed of 138 places in 748 ms of which 1 ms to minimize.
[2022-06-12 22:22:11] [INFO ] Deduced a trap composed of 105 places in 751 ms of which 2 ms to minimize.
[2022-06-12 22:22:12] [INFO ] Deduced a trap composed of 104 places in 751 ms of which 1 ms to minimize.
[2022-06-12 22:22:13] [INFO ] Deduced a trap composed of 138 places in 756 ms of which 1 ms to minimize.
[2022-06-12 22:22:13] [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:22:13] [INFO ] Flatten gal took : 87 ms
[2022-06-12 22:22:13] [INFO ] Flatten gal took : 87 ms
[2022-06-12 22:22:13] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3835523728559930440.gal : 8 ms
[2022-06-12 22:22:13] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11253189920832133361.prop : 5 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3835523728559930440.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality11253189920832133361.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/ReachabilityCardinality3835523728559930440.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality11253189920832133361.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality11253189920832133361.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :4 after 13
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :13 after 18
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :18 after 19
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :19 after 20
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :20 after 25
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :25 after 26
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :26 after 93
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :93 after 181
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :181 after 1315
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :1315 after 3093
Detected timeout of ITS tools.
[2022-06-12 22:22:28] [INFO ] Flatten gal took : 80 ms
[2022-06-12 22:22:28] [INFO ] Applying decomposition
[2022-06-12 22:22:28] [INFO ] Flatten gal took : 80 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/graph14285288262684834214.txt, -o, /tmp/graph14285288262684834214.bin, -w, /tmp/graph14285288262684834214.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/graph14285288262684834214.bin, -l, -1, -v, -w, /tmp/graph14285288262684834214.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:22:29] [INFO ] Decomposing Gal with order
[2022-06-12 22:22:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:22:29] [INFO ] Removed a total of 2834 redundant transitions.
[2022-06-12 22:22:29] [INFO ] Flatten gal took : 155 ms
[2022-06-12 22:22:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 13 ms.
[2022-06-12 22:22:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12546306545260447248.gal : 16 ms
[2022-06-12 22:22:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2463790545208263670.prop : 10 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/ReachabilityCardinality12546306545260447248.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2463790545208263670.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality12546306545260447248.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2463790545208263670.prop --nowitness
Loading property file /tmp/ReachabilityCardinality2463790545208263670.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 8096
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7727928739863135852
[2022-06-12 22:22:45] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7727928739863135852
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/ltsmin7727928739863135852]
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/ltsmin7727928739863135852] 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/ltsmin7727928739863135852] 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 336 transitions
Reduce isomorphic transitions removed 336 transitions.
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 1992 transition count 2760
Applied a total of 336 rules in 35 ms. Remains 1992 /1992 variables (removed 0) and now considering 2760/3096 (removed 336) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2760 rows 1992 cols
[2022-06-12 22:22:46] [INFO ] Computed 31 place invariants in 8 ms
[2022-06-12 22:22:47] [INFO ] [Real]Absence check using 23 positive place invariants in 708 ms returned sat
[2022-06-12 22:22:47] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 130 ms returned sat
[2022-06-12 22:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:31] [INFO ] [Real]Absence check using state equation in 43877 ms returned unknown
[2022-06-12 22:23:31] [INFO ] [Real]Absence check using 23 positive place invariants in 43 ms returned sat
[2022-06-12 22:23:31] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2022-06-12 22:23:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:33] [INFO ] [Real]Absence check using state equation in 2036 ms returned sat
[2022-06-12 22:23:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:23:33] [INFO ] [Nat]Absence check using 23 positive place invariants in 42 ms returned sat
[2022-06-12 22:23:33] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-06-12 22:23:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:35] [INFO ] [Nat]Absence check using state equation in 1308 ms returned sat
[2022-06-12 22:23:35] [INFO ] Computed and/alt/rep : 2640/5105/2640 causal constraints (skipped 112 transitions) in 128 ms.
[2022-06-12 22:23:55] [INFO ] Added : 830 causal constraints over 166 iterations in 20092 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-12 22:23:55] [INFO ] [Real]Absence check using 23 positive place invariants in 43 ms returned sat
[2022-06-12 22:23:55] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2022-06-12 22:23:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:57] [INFO ] [Real]Absence check using state equation in 1589 ms returned sat
[2022-06-12 22:23:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:23:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 47 ms returned sat
[2022-06-12 22:23:57] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2022-06-12 22:23:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:23:59] [INFO ] [Nat]Absence check using state equation in 1581 ms returned sat
[2022-06-12 22:23:59] [INFO ] Computed and/alt/rep : 2640/5105/2640 causal constraints (skipped 112 transitions) in 115 ms.
[2022-06-12 22:24:19] [INFO ] Added : 820 causal constraints over 164 iterations in 20064 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-06-12 22:24:19] [INFO ] [Real]Absence check using 23 positive place invariants in 44 ms returned sat
[2022-06-12 22:24:19] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-06-12 22:24:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:24:22] [INFO ] [Real]Absence check using state equation in 2660 ms returned sat
[2022-06-12 22:24:22] [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 48 ms returned sat
[2022-06-12 22:24:23] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2022-06-12 22:24:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:24:25] [INFO ] [Nat]Absence check using state equation in 2491 ms returned sat
[2022-06-12 22:24:25] [INFO ] Computed and/alt/rep : 2640/5105/2640 causal constraints (skipped 112 transitions) in 110 ms.
[2022-06-12 22:24:45] [INFO ] Added : 785 causal constraints over 157 iterations in 20048 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 42 ms.
[2022-06-12 22:24:45] [INFO ] Flatten gal took : 88 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4501553600986220812
[2022-06-12 22:24:46] [INFO ] Too many transitions (3096) to apply POR reductions. Disabling POR matrices.
[2022-06-12 22:24:46] [INFO ] Flatten gal took : 134 ms
[2022-06-12 22:24:46] [INFO ] Applying decomposition
[2022-06-12 22:24:46] [INFO ] Built C files in 78ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4501553600986220812
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/ltsmin4501553600986220812]
[2022-06-12 22:24:46] [INFO ] Flatten gal took : 140 ms
[2022-06-12 22:24:46] [INFO ] Input system was already deterministic with 3096 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph13257223794064591453.txt, -o, /tmp/graph13257223794064591453.bin, -w, /tmp/graph13257223794064591453.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/graph13257223794064591453.bin, -l, -1, -v, -w, /tmp/graph13257223794064591453.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:24:46] [INFO ] Decomposing Gal with order
[2022-06-12 22:24:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:24:46] [INFO ] Removed a total of 2835 redundant transitions.
[2022-06-12 22:24:46] [INFO ] Flatten gal took : 146 ms
[2022-06-12 22:24:47] [INFO ] Ran tautology test, simplified 0 / 4 in 1283 ms.
[2022-06-12 22:24:47] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-04(UNSAT) depth K=0 took 125 ms
[2022-06-12 22:24:47] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=0 took 3 ms
[2022-06-12 22:24:47] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-10(UNSAT) depth K=0 took 3 ms
[2022-06-12 22:24:47] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-12(UNSAT) depth K=0 took 14 ms
[2022-06-12 22:24:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 19 ms.
[2022-06-12 22:24:48] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17529683713216375260.gal : 25 ms
[2022-06-12 22:24:48] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability3484291286280488778.prop : 10 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/ReachabilityFireability17529683713216375260.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability3484291286280488778.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability17529683713216375260.gal -t CGAL -reachable-file /tmp/ReachabilityFireability3484291286280488778.prop --nowitness
[2022-06-12 22:24:48] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-04(UNSAT) depth K=1 took 580 ms
[2022-06-12 22:24:48] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=1 took 4 ms
[2022-06-12 22:24:48] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-10(UNSAT) depth K=1 took 3 ms
[2022-06-12 22:24:48] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-12(UNSAT) depth K=1 took 4 ms
Loading property file /tmp/ReachabilityFireability3484291286280488778.prop.
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:24:48] [INFO ] Computed 31 place invariants in 15 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:24:48] [INFO ] Computed 31 place invariants in 18 ms
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :1 after 6736
[2022-06-12 22:24:53] [INFO ] Proved 1992 variables to be positive in 5343 ms
[2022-06-12 22:24:55] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-04
[2022-06-12 22:24:55] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-04(SAT) depth K=0 took 1276 ms
[2022-06-12 22:24:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-09
[2022-06-12 22:24:56] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-09(SAT) depth K=0 took 1890 ms
[2022-06-12 22:24:57] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-04(UNSAT) depth K=2 took 8733 ms
[2022-06-12 22:24:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-10
[2022-06-12 22:24:58] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-10(SAT) depth K=0 took 1448 ms
[2022-06-12 22:24:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-12
[2022-06-12 22:24:59] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-12(SAT) depth K=0 took 1189 ms
[2022-06-12 22:25:00] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=2 took 3674 ms
[2022-06-12 22:25:03] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-10(UNSAT) depth K=2 took 2283 ms
[2022-06-12 22:25:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-04
[2022-06-12 22:25:06] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-04(SAT) depth K=1 took 6689 ms
[2022-06-12 22:25:07] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-12(UNSAT) depth K=2 took 4688 ms
[2022-06-12 22:25:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-09
[2022-06-12 22:25:12] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-09(SAT) depth K=1 took 6439 ms
[2022-06-12 22:25:17] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-10
[2022-06-12 22:25:17] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-10(SAT) depth K=1 took 4977 ms
[2022-06-12 22:25:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-12
[2022-06-12 22:25:25] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-12(SAT) depth K=1 took 8005 ms
Compilation finished in 52050 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin4501553600986220812]
Link finished in 77 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, PetersonPT7ReachabilityFireability04==true], workingDir=/tmp/ltsmin4501553600986220812]
[2022-06-12 22:36:03] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-04(UNSAT) depth K=3 took 655474 ms
WARNING : LTSmin timed out (>900 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, PetersonPT7ReachabilityFireability04==true], workingDir=/tmp/ltsmin4501553600986220812]
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, PetersonPT7ReachabilityFireability09==true], workingDir=/tmp/ltsmin4501553600986220812]
Detected timeout of ITS tools.
[2022-06-12 22:47:49] [INFO ] Applying decomposition
[2022-06-12 22:47:50] [INFO ] Flatten gal took : 379 ms
[2022-06-12 22:47:50] [INFO ] Decomposing Gal with order
[2022-06-12 22:47:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:47:52] [INFO ] Removed a total of 2834 redundant transitions.
[2022-06-12 22:47:52] [INFO ] Flatten gal took : 756 ms
[2022-06-12 22:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2022-06-12 22:47:55] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability17674373049802918807.gal : 26 ms
[2022-06-12 22:47:55] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1239328041328932540.prop : 18 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/ReachabilityFireability17674373049802918807.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability1239328041328932540.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability17674373049802918807.gal -t CGAL -reachable-file /tmp/ReachabilityFireability1239328041328932540.prop --nowitness
Loading property file /tmp/ReachabilityFireability1239328041328932540.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 8096
[2022-06-12 22:54:58] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=3 took 1135101 ms
WARNING : LTSmin timed out (>900 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, PetersonPT7ReachabilityFireability09==true], workingDir=/tmp/ltsmin4501553600986220812]
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, PetersonPT7ReachabilityFireability10==true], workingDir=/tmp/ltsmin4501553600986220812]
[2022-06-12 22:56:19] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-10(UNSAT) depth K=3 took 81341 ms
[2022-06-12 22:59:18] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-12(UNSAT) depth K=3 took 178598 ms
WARNING : LTSmin timed out (>900 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, PetersonPT7ReachabilityFireability10==true], workingDir=/tmp/ltsmin4501553600986220812]
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, PetersonPT7ReachabilityFireability12==true], workingDir=/tmp/ltsmin4501553600986220812]
Detected timeout of ITS tools.
[2022-06-12 23:10:57] [INFO ] Flatten gal took : 302 ms
[2022-06-12 23:10:58] [INFO ] Input system was already deterministic with 3096 transitions.
[2022-06-12 23:10:58] [INFO ] Transformed 1992 places.
[2022-06-12 23:10:58] [INFO ] Transformed 3096 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-06-12 23:11:00] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability1799529889077577051.gal : 22 ms
[2022-06-12 23:11:00] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability11239027096297592744.prop : 20 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/ReachabilityFireability1799529889077577051.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityFireability11239027096297592744.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityFireability1799529889077577051.gal -t CGAL -reachable-file /tmp/ReachabilityFireability11239027096297592744.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/ReachabilityFireability11239027096297592744.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 18
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :18 after 20
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :20 after 23
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :23 after 24
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :24 after 28
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :28 after 51
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :51 after 84
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :84 after 188
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :188 after 340
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :340 after 476
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :476 after 3469
SDD proceeding with computation,4 properties remain. new max is 32768
SDD size :3469 after 4892

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2021"
echo " Input is Peterson-PT-7, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-165277026700036"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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