Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258100721.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 itstools
Input is Peterson-PT-4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258100721
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 144K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 33K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 25K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 32K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 91K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 42K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 138K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 511K Apr 27 15:14 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-4-00
FORMULA_NAME Peterson-PT-4-01
FORMULA_NAME Peterson-PT-4-02
FORMULA_NAME Peterson-PT-4-03
FORMULA_NAME Peterson-PT-4-04
FORMULA_NAME Peterson-PT-4-05
FORMULA_NAME Peterson-PT-4-06
FORMULA_NAME Peterson-PT-4-07
FORMULA_NAME Peterson-PT-4-08
FORMULA_NAME Peterson-PT-4-09
FORMULA_NAME Peterson-PT-4-10
FORMULA_NAME Peterson-PT-4-11
FORMULA_NAME Peterson-PT-4-12
FORMULA_NAME Peterson-PT-4-13
FORMULA_NAME Peterson-PT-4-14
FORMULA_NAME Peterson-PT-4-15

=== Now, execution of the tool begins

BK_START 1590023255664

[2020-05-21 01:07:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-21 01:07:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 01:07:37] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2020-05-21 01:07:37] [INFO ] Transformed 480 places.
[2020-05-21 01:07:37] [INFO ] Transformed 690 transitions.
[2020-05-21 01:07:37] [INFO ] Parsed PT model containing 480 places and 690 transitions in 169 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 804 ms. (steps per millisecond=124 ) properties seen :[1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1]
[2020-05-21 01:07:38] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2020-05-21 01:07:38] [INFO ] Computed 19 place invariants in 30 ms
[2020-05-21 01:07:39] [INFO ] [Real]Absence check using 14 positive place invariants in 40 ms returned sat
[2020-05-21 01:07:39] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2020-05-21 01:07:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:39] [INFO ] [Real]Absence check using state equation in 788 ms returned sat
[2020-05-21 01:07:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 49 ms returned sat
[2020-05-21 01:07:40] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:07:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:40] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2020-05-21 01:07:40] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-05-21 01:07:40] [INFO ] [Nat]Added 132 Read/Feed constraints in 53 ms returned sat
[2020-05-21 01:07:41] [INFO ] Deduced a trap composed of 10 places in 456 ms
[2020-05-21 01:07:41] [INFO ] Deduced a trap composed of 10 places in 322 ms
[2020-05-21 01:07:42] [INFO ] Deduced a trap composed of 10 places in 301 ms
[2020-05-21 01:07:42] [INFO ] Deduced a trap composed of 14 places in 322 ms
[2020-05-21 01:07:42] [INFO ] Deduced a trap composed of 10 places in 328 ms
[2020-05-21 01:07:43] [INFO ] Deduced a trap composed of 43 places in 291 ms
[2020-05-21 01:07:43] [INFO ] Deduced a trap composed of 21 places in 349 ms
[2020-05-21 01:07:43] [INFO ] Deduced a trap composed of 27 places in 296 ms
[2020-05-21 01:07:44] [INFO ] Deduced a trap composed of 42 places in 303 ms
[2020-05-21 01:07:44] [INFO ] Deduced a trap composed of 13 places in 316 ms
[2020-05-21 01:07:44] [INFO ] Deduced a trap composed of 43 places in 205 ms
[2020-05-21 01:07:44] [INFO ] Deduced a trap composed of 36 places in 185 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 52 places in 214 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 65 places in 162 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 58 places in 160 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 58 places in 139 ms
[2020-05-21 01:07:45] [INFO ] Deduced a trap composed of 58 places in 136 ms
[2020-05-21 01:07:45] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 5132 ms
[2020-05-21 01:07:46] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 40 ms.
[2020-05-21 01:07:51] [INFO ] Added : 558 causal constraints over 112 iterations in 5963 ms. Result :sat
[2020-05-21 01:07:52] [INFO ] Deduced a trap composed of 65 places in 148 ms
[2020-05-21 01:07:52] [INFO ] Deduced a trap composed of 65 places in 138 ms
[2020-05-21 01:07:52] [INFO ] Deduced a trap composed of 66 places in 172 ms
[2020-05-21 01:07:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 721 ms
[2020-05-21 01:07:52] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned unsat
[2020-05-21 01:07:52] [INFO ] [Real]Absence check using 14 positive place invariants in 16 ms returned sat
[2020-05-21 01:07:52] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:07:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:53] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2020-05-21 01:07:53] [INFO ] [Real]Added 132 Read/Feed constraints in 39 ms returned sat
[2020-05-21 01:07:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:07:53] [INFO ] [Nat]Absence check using 14 positive place invariants in 28 ms returned sat
[2020-05-21 01:07:53] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:07:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:07:54] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2020-05-21 01:07:54] [INFO ] [Nat]Added 132 Read/Feed constraints in 52 ms returned sat
[2020-05-21 01:07:54] [INFO ] Deduced a trap composed of 14 places in 256 ms
[2020-05-21 01:07:54] [INFO ] Deduced a trap composed of 10 places in 211 ms
[2020-05-21 01:07:55] [INFO ] Deduced a trap composed of 43 places in 221 ms
[2020-05-21 01:07:55] [INFO ] Deduced a trap composed of 14 places in 209 ms
[2020-05-21 01:07:55] [INFO ] Deduced a trap composed of 10 places in 222 ms
[2020-05-21 01:07:55] [INFO ] Deduced a trap composed of 36 places in 182 ms
[2020-05-21 01:07:55] [INFO ] Deduced a trap composed of 50 places in 219 ms
[2020-05-21 01:07:56] [INFO ] Deduced a trap composed of 50 places in 224 ms
[2020-05-21 01:07:56] [INFO ] Deduced a trap composed of 50 places in 199 ms
[2020-05-21 01:07:56] [INFO ] Deduced a trap composed of 36 places in 248 ms
[2020-05-21 01:07:57] [INFO ] Deduced a trap composed of 39 places in 279 ms
[2020-05-21 01:07:57] [INFO ] Deduced a trap composed of 32 places in 185 ms
[2020-05-21 01:07:57] [INFO ] Deduced a trap composed of 42 places in 193 ms
[2020-05-21 01:07:57] [INFO ] Deduced a trap composed of 70 places in 169 ms
[2020-05-21 01:07:57] [INFO ] Deduced a trap composed of 65 places in 131 ms
[2020-05-21 01:07:58] [INFO ] Deduced a trap composed of 57 places in 142 ms
[2020-05-21 01:07:58] [INFO ] Deduced a trap composed of 57 places in 176 ms
[2020-05-21 01:07:58] [INFO ] Deduced a trap composed of 42 places in 156 ms
[2020-05-21 01:07:58] [INFO ] Deduced a trap composed of 35 places in 217 ms
[2020-05-21 01:07:58] [INFO ] Deduced a trap composed of 21 places in 178 ms
[2020-05-21 01:07:59] [INFO ] Deduced a trap composed of 103 places in 260 ms
[2020-05-21 01:07:59] [INFO ] Deduced a trap composed of 21 places in 221 ms
[2020-05-21 01:07:59] [INFO ] Deduced a trap composed of 65 places in 198 ms
[2020-05-21 01:08:00] [INFO ] Deduced a trap composed of 66 places in 196 ms
[2020-05-21 01:08:00] [INFO ] Deduced a trap composed of 10 places in 230 ms
[2020-05-21 01:08:00] [INFO ] Deduced a trap composed of 40 places in 227 ms
[2020-05-21 01:08:00] [INFO ] Deduced a trap composed of 40 places in 218 ms
[2020-05-21 01:08:01] [INFO ] Deduced a trap composed of 39 places in 206 ms
[2020-05-21 01:08:01] [INFO ] Deduced a trap composed of 65 places in 232 ms
[2020-05-21 01:08:01] [INFO ] Deduced a trap composed of 67 places in 219 ms
[2020-05-21 01:08:01] [INFO ] Deduced a trap composed of 58 places in 163 ms
[2020-05-21 01:08:02] [INFO ] Deduced a trap composed of 10 places in 196 ms
[2020-05-21 01:08:02] [INFO ] Deduced a trap composed of 62 places in 181 ms
[2020-05-21 01:08:02] [INFO ] Deduced a trap composed of 32 places in 238 ms
[2020-05-21 01:08:03] [INFO ] Deduced a trap composed of 13 places in 223 ms
[2020-05-21 01:08:03] [INFO ] Deduced a trap composed of 57 places in 228 ms
[2020-05-21 01:08:03] [INFO ] Deduced a trap composed of 17 places in 195 ms
[2020-05-21 01:08:04] [INFO ] Deduced a trap composed of 47 places in 175 ms
[2020-05-21 01:08:04] [INFO ] Deduced a trap composed of 42 places in 213 ms
[2020-05-21 01:08:04] [INFO ] Deduced a trap composed of 58 places in 229 ms
[2020-05-21 01:08:04] [INFO ] Deduced a trap composed of 58 places in 172 ms
[2020-05-21 01:08:05] [INFO ] Deduced a trap composed of 61 places in 185 ms
[2020-05-21 01:08:05] [INFO ] Deduced a trap composed of 50 places in 197 ms
[2020-05-21 01:08:05] [INFO ] Deduced a trap composed of 50 places in 168 ms
[2020-05-21 01:08:05] [INFO ] Deduced a trap composed of 84 places in 172 ms
[2020-05-21 01:08:06] [INFO ] Deduced a trap composed of 61 places in 209 ms
[2020-05-21 01:08:08] [INFO ] Deduced a trap composed of 69 places in 209 ms
[2020-05-21 01:08:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 47 trap constraints in 16221 ms
[2020-05-21 01:08:10] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:08:10] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2020-05-21 01:08:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:11] [INFO ] [Real]Absence check using state equation in 615 ms returned sat
[2020-05-21 01:08:11] [INFO ] [Real]Added 132 Read/Feed constraints in 62 ms returned sat
[2020-05-21 01:08:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:08:11] [INFO ] [Nat]Absence check using 14 positive place invariants in 29 ms returned sat
[2020-05-21 01:08:11] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:08:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:12] [INFO ] [Nat]Absence check using state equation in 623 ms returned sat
[2020-05-21 01:08:12] [INFO ] [Nat]Added 132 Read/Feed constraints in 36 ms returned sat
[2020-05-21 01:08:12] [INFO ] Deduced a trap composed of 12 places in 234 ms
[2020-05-21 01:08:12] [INFO ] Deduced a trap composed of 10 places in 235 ms
[2020-05-21 01:08:12] [INFO ] Deduced a trap composed of 12 places in 243 ms
[2020-05-21 01:08:13] [INFO ] Deduced a trap composed of 10 places in 218 ms
[2020-05-21 01:08:13] [INFO ] Deduced a trap composed of 27 places in 204 ms
[2020-05-21 01:08:13] [INFO ] Deduced a trap composed of 27 places in 236 ms
[2020-05-21 01:08:13] [INFO ] Deduced a trap composed of 27 places in 227 ms
[2020-05-21 01:08:14] [INFO ] Deduced a trap composed of 27 places in 194 ms
[2020-05-21 01:08:14] [INFO ] Deduced a trap composed of 58 places in 174 ms
[2020-05-21 01:08:14] [INFO ] Deduced a trap composed of 77 places in 176 ms
[2020-05-21 01:08:14] [INFO ] Deduced a trap composed of 58 places in 187 ms
[2020-05-21 01:08:14] [INFO ] Deduced a trap composed of 58 places in 151 ms
[2020-05-21 01:08:15] [INFO ] Deduced a trap composed of 54 places in 204 ms
[2020-05-21 01:08:15] [INFO ] Deduced a trap composed of 36 places in 231 ms
[2020-05-21 01:08:15] [INFO ] Deduced a trap composed of 36 places in 222 ms
[2020-05-21 01:08:15] [INFO ] Deduced a trap composed of 58 places in 185 ms
[2020-05-21 01:08:16] [INFO ] Deduced a trap composed of 36 places in 208 ms
[2020-05-21 01:08:16] [INFO ] Deduced a trap composed of 80 places in 172 ms
[2020-05-21 01:08:16] [INFO ] Deduced a trap composed of 80 places in 147 ms
[2020-05-21 01:08:16] [INFO ] Deduced a trap composed of 92 places in 191 ms
[2020-05-21 01:08:16] [INFO ] Deduced a trap composed of 80 places in 152 ms
[2020-05-21 01:08:17] [INFO ] Deduced a trap composed of 35 places in 219 ms
[2020-05-21 01:08:17] [INFO ] Deduced a trap composed of 113 places in 176 ms
[2020-05-21 01:08:17] [INFO ] Deduced a trap composed of 10 places in 256 ms
[2020-05-21 01:08:18] [INFO ] Deduced a trap composed of 50 places in 212 ms
[2020-05-21 01:08:18] [INFO ] Deduced a trap composed of 79 places in 277 ms
[2020-05-21 01:08:18] [INFO ] Deduced a trap composed of 61 places in 165 ms
[2020-05-21 01:08:18] [INFO ] Deduced a trap composed of 13 places in 79 ms
[2020-05-21 01:08:18] [INFO ] Deduced a trap composed of 45 places in 138 ms
[2020-05-21 01:08:19] [INFO ] Deduced a trap composed of 57 places in 131 ms
[2020-05-21 01:08:19] [INFO ] Deduced a trap composed of 10 places in 212 ms
[2020-05-21 01:08:19] [INFO ] Deduced a trap composed of 57 places in 138 ms
[2020-05-21 01:08:19] [INFO ] Deduced a trap composed of 83 places in 172 ms
[2020-05-21 01:08:19] [INFO ] Deduced a trap composed of 87 places in 130 ms
[2020-05-21 01:08:20] [INFO ] Deduced a trap composed of 17 places in 254 ms
[2020-05-21 01:08:20] [INFO ] Deduced a trap composed of 87 places in 251 ms
[2020-05-21 01:08:21] [INFO ] Deduced a trap composed of 39 places in 237 ms
[2020-05-21 01:08:21] [INFO ] Deduced a trap composed of 32 places in 211 ms
[2020-05-21 01:08:21] [INFO ] Deduced a trap composed of 66 places in 258 ms
[2020-05-21 01:08:21] [INFO ] Deduced a trap composed of 43 places in 174 ms
[2020-05-21 01:08:22] [INFO ] Deduced a trap composed of 88 places in 144 ms
[2020-05-21 01:08:22] [INFO ] Deduced a trap composed of 84 places in 124 ms
[2020-05-21 01:08:22] [INFO ] Deduced a trap composed of 88 places in 110 ms
[2020-05-21 01:08:22] [INFO ] Deduced a trap composed of 91 places in 153 ms
[2020-05-21 01:08:23] [INFO ] Deduced a trap composed of 40 places in 210 ms
[2020-05-21 01:08:23] [INFO ] Deduced a trap composed of 14 places in 198 ms
[2020-05-21 01:08:23] [INFO ] Deduced a trap composed of 22 places in 169 ms
[2020-05-21 01:08:24] [INFO ] Deduced a trap composed of 43 places in 117 ms
[2020-05-21 01:08:24] [INFO ] Deduced a trap composed of 39 places in 107 ms
[2020-05-21 01:08:24] [INFO ] Deduced a trap composed of 40 places in 163 ms
[2020-05-21 01:08:24] [INFO ] Deduced a trap composed of 61 places in 199 ms
[2020-05-21 01:08:24] [INFO ] Deduced a trap composed of 83 places in 209 ms
[2020-05-21 01:08:25] [INFO ] Deduced a trap composed of 84 places in 149 ms
[2020-05-21 01:08:25] [INFO ] Deduced a trap composed of 21 places in 161 ms
[2020-05-21 01:08:25] [INFO ] Deduced a trap composed of 14 places in 159 ms
[2020-05-21 01:08:25] [INFO ] Deduced a trap composed of 18 places in 203 ms
[2020-05-21 01:08:26] [INFO ] Deduced a trap composed of 17 places in 254 ms
[2020-05-21 01:08:26] [INFO ] Deduced a trap composed of 62 places in 191 ms
[2020-05-21 01:08:26] [INFO ] Deduced a trap composed of 69 places in 152 ms
[2020-05-21 01:08:26] [INFO ] Deduced a trap composed of 62 places in 193 ms
[2020-05-21 01:08:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 01:08:31] [INFO ] Deduced a trap composed of 2 places in 355 ms
[2020-05-21 01:08:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s231 s236) 0)") while checking expression at index 3
[2020-05-21 01:08:31] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned unsat
[2020-05-21 01:08:31] [INFO ] [Real]Absence check using 14 positive place invariants in 15 ms returned unsat
[2020-05-21 01:08:31] [INFO ] [Real]Absence check using 14 positive place invariants in 14 ms returned unsat
[2020-05-21 01:08:31] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned unsat
[2020-05-21 01:08:32] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned unsat
[2020-05-21 01:08:32] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned unsat
[2020-05-21 01:08:32] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned unsat
[2020-05-21 01:08:32] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned unsat
[2020-05-21 01:08:32] [INFO ] [Real]Absence check using 14 positive place invariants in 8 ms returned unsat
[2020-05-21 01:08:32] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-05-21 01:08:32] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:32] [INFO ] [Real]Absence check using state equation in 560 ms returned sat
[2020-05-21 01:08:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:08:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2020-05-21 01:08:33] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:33] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2020-05-21 01:08:33] [INFO ] [Nat]Added 132 Read/Feed constraints in 60 ms returned sat
[2020-05-21 01:08:33] [INFO ] Deduced a trap composed of 27 places in 169 ms
[2020-05-21 01:08:34] [INFO ] Deduced a trap composed of 10 places in 202 ms
[2020-05-21 01:08:34] [INFO ] Deduced a trap composed of 10 places in 189 ms
[2020-05-21 01:08:34] [INFO ] Deduced a trap composed of 10 places in 190 ms
[2020-05-21 01:08:34] [INFO ] Deduced a trap composed of 10 places in 201 ms
[2020-05-21 01:08:35] [INFO ] Deduced a trap composed of 66 places in 196 ms
[2020-05-21 01:08:35] [INFO ] Deduced a trap composed of 54 places in 203 ms
[2020-05-21 01:08:35] [INFO ] Deduced a trap composed of 32 places in 176 ms
[2020-05-21 01:08:35] [INFO ] Deduced a trap composed of 32 places in 201 ms
[2020-05-21 01:08:35] [INFO ] Deduced a trap composed of 32 places in 199 ms
[2020-05-21 01:08:36] [INFO ] Deduced a trap composed of 62 places in 214 ms
[2020-05-21 01:08:36] [INFO ] Deduced a trap composed of 51 places in 168 ms
[2020-05-21 01:08:36] [INFO ] Deduced a trap composed of 102 places in 186 ms
[2020-05-21 01:08:36] [INFO ] Deduced a trap composed of 102 places in 125 ms
[2020-05-21 01:08:36] [INFO ] Deduced a trap composed of 36 places in 165 ms
[2020-05-21 01:08:37] [INFO ] Deduced a trap composed of 39 places in 157 ms
[2020-05-21 01:08:37] [INFO ] Deduced a trap composed of 40 places in 133 ms
[2020-05-21 01:08:37] [INFO ] Deduced a trap composed of 13 places in 124 ms
[2020-05-21 01:08:37] [INFO ] Deduced a trap composed of 14 places in 174 ms
[2020-05-21 01:08:37] [INFO ] Deduced a trap composed of 14 places in 110 ms
[2020-05-21 01:08:37] [INFO ] Deduced a trap composed of 53 places in 159 ms
[2020-05-21 01:08:38] [INFO ] Deduced a trap composed of 59 places in 116 ms
[2020-05-21 01:08:38] [INFO ] Deduced a trap composed of 18 places in 204 ms
[2020-05-21 01:08:38] [INFO ] Deduced a trap composed of 23 places in 211 ms
[2020-05-21 01:08:38] [INFO ] Deduced a trap composed of 39 places in 196 ms
[2020-05-21 01:08:39] [INFO ] Deduced a trap composed of 21 places in 196 ms
[2020-05-21 01:08:39] [INFO ] Deduced a trap composed of 19 places in 189 ms
[2020-05-21 01:08:39] [INFO ] Deduced a trap composed of 18 places in 157 ms
[2020-05-21 01:08:39] [INFO ] Deduced a trap composed of 65 places in 217 ms
[2020-05-21 01:08:40] [INFO ] Deduced a trap composed of 31 places in 268 ms
[2020-05-21 01:08:40] [INFO ] Deduced a trap composed of 57 places in 226 ms
[2020-05-21 01:08:40] [INFO ] Deduced a trap composed of 61 places in 195 ms
[2020-05-21 01:08:40] [INFO ] Deduced a trap composed of 84 places in 182 ms
[2020-05-21 01:08:40] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 7130 ms
[2020-05-21 01:08:40] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 53 ms.
[2020-05-21 01:08:47] [INFO ] Added : 575 causal constraints over 115 iterations in 7154 ms. Result :sat
[2020-05-21 01:08:48] [INFO ] Deduced a trap composed of 36 places in 236 ms
[2020-05-21 01:08:48] [INFO ] Deduced a trap composed of 58 places in 169 ms
[2020-05-21 01:08:48] [INFO ] Deduced a trap composed of 54 places in 186 ms
[2020-05-21 01:08:49] [INFO ] Deduced a trap composed of 43 places in 186 ms
[2020-05-21 01:08:49] [INFO ] Deduced a trap composed of 69 places in 125 ms
[2020-05-21 01:08:49] [INFO ] Deduced a trap composed of 54 places in 116 ms
[2020-05-21 01:08:49] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1683 ms
[2020-05-21 01:08:49] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2020-05-21 01:08:49] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:08:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:50] [INFO ] [Real]Absence check using state equation in 624 ms returned sat
[2020-05-21 01:08:50] [INFO ] [Real]Added 132 Read/Feed constraints in 18 ms returned sat
[2020-05-21 01:08:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:08:50] [INFO ] [Nat]Absence check using 14 positive place invariants in 24 ms returned sat
[2020-05-21 01:08:50] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:08:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:08:51] [INFO ] [Nat]Absence check using state equation in 632 ms returned sat
[2020-05-21 01:08:51] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:08:51] [INFO ] Deduced a trap composed of 25 places in 230 ms
[2020-05-21 01:08:51] [INFO ] Deduced a trap composed of 54 places in 211 ms
[2020-05-21 01:08:51] [INFO ] Deduced a trap composed of 25 places in 192 ms
[2020-05-21 01:08:52] [INFO ] Deduced a trap composed of 36 places in 223 ms
[2020-05-21 01:08:52] [INFO ] Deduced a trap composed of 25 places in 231 ms
[2020-05-21 01:08:52] [INFO ] Deduced a trap composed of 14 places in 208 ms
[2020-05-21 01:08:52] [INFO ] Deduced a trap composed of 10 places in 179 ms
[2020-05-21 01:08:53] [INFO ] Deduced a trap composed of 30 places in 214 ms
[2020-05-21 01:08:53] [INFO ] Deduced a trap composed of 45 places in 222 ms
[2020-05-21 01:08:53] [INFO ] Deduced a trap composed of 10 places in 181 ms
[2020-05-21 01:08:53] [INFO ] Deduced a trap composed of 21 places in 226 ms
[2020-05-21 01:08:54] [INFO ] Deduced a trap composed of 30 places in 220 ms
[2020-05-21 01:08:54] [INFO ] Deduced a trap composed of 10 places in 220 ms
[2020-05-21 01:08:54] [INFO ] Deduced a trap composed of 58 places in 208 ms
[2020-05-21 01:08:54] [INFO ] Deduced a trap composed of 39 places in 162 ms
[2020-05-21 01:08:54] [INFO ] Deduced a trap composed of 40 places in 163 ms
[2020-05-21 01:08:55] [INFO ] Deduced a trap composed of 36 places in 232 ms
[2020-05-21 01:08:55] [INFO ] Deduced a trap composed of 42 places in 233 ms
[2020-05-21 01:08:55] [INFO ] Deduced a trap composed of 42 places in 228 ms
[2020-05-21 01:08:56] [INFO ] Deduced a trap composed of 42 places in 232 ms
[2020-05-21 01:08:56] [INFO ] Deduced a trap composed of 80 places in 205 ms
[2020-05-21 01:08:56] [INFO ] Deduced a trap composed of 27 places in 238 ms
[2020-05-21 01:08:56] [INFO ] Deduced a trap composed of 57 places in 164 ms
[2020-05-21 01:08:56] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 5596 ms
[2020-05-21 01:08:56] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 52 ms.
[2020-05-21 01:09:03] [INFO ] Added : 553 causal constraints over 111 iterations in 6546 ms. Result :sat
[2020-05-21 01:09:03] [INFO ] Deduced a trap composed of 30 places in 273 ms
[2020-05-21 01:09:04] [INFO ] Deduced a trap composed of 58 places in 221 ms
[2020-05-21 01:09:04] [INFO ] Deduced a trap composed of 58 places in 228 ms
[2020-05-21 01:09:04] [INFO ] Deduced a trap composed of 65 places in 217 ms
[2020-05-21 01:09:04] [INFO ] Deduced a trap composed of 58 places in 223 ms
[2020-05-21 01:09:05] [INFO ] Deduced a trap composed of 69 places in 249 ms
[2020-05-21 01:09:05] [INFO ] Deduced a trap composed of 80 places in 229 ms
[2020-05-21 01:09:06] [INFO ] Deduced a trap composed of 58 places in 281 ms
[2020-05-21 01:09:06] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2790 ms
[2020-05-21 01:09:06] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2020-05-21 01:09:06] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:06] [INFO ] [Real]Absence check using state equation in 665 ms returned sat
[2020-05-21 01:09:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:09:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 24 ms returned sat
[2020-05-21 01:09:06] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:09:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:07] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2020-05-21 01:09:07] [INFO ] [Nat]Added 132 Read/Feed constraints in 47 ms returned sat
[2020-05-21 01:09:07] [INFO ] Deduced a trap composed of 27 places in 201 ms
[2020-05-21 01:09:08] [INFO ] Deduced a trap composed of 42 places in 186 ms
[2020-05-21 01:09:08] [INFO ] Deduced a trap composed of 10 places in 283 ms
[2020-05-21 01:09:08] [INFO ] Deduced a trap composed of 36 places in 231 ms
[2020-05-21 01:09:08] [INFO ] Deduced a trap composed of 27 places in 234 ms
[2020-05-21 01:09:09] [INFO ] Deduced a trap composed of 36 places in 259 ms
[2020-05-21 01:09:09] [INFO ] Deduced a trap composed of 10 places in 196 ms
[2020-05-21 01:09:09] [INFO ] Deduced a trap composed of 10 places in 216 ms
[2020-05-21 01:09:09] [INFO ] Deduced a trap composed of 10 places in 160 ms
[2020-05-21 01:09:10] [INFO ] Deduced a trap composed of 69 places in 231 ms
[2020-05-21 01:09:10] [INFO ] Deduced a trap composed of 54 places in 228 ms
[2020-05-21 01:09:10] [INFO ] Deduced a trap composed of 54 places in 197 ms
[2020-05-21 01:09:10] [INFO ] Deduced a trap composed of 54 places in 226 ms
[2020-05-21 01:09:11] [INFO ] Deduced a trap composed of 54 places in 228 ms
[2020-05-21 01:09:11] [INFO ] Deduced a trap composed of 39 places in 237 ms
[2020-05-21 01:09:11] [INFO ] Deduced a trap composed of 40 places in 269 ms
[2020-05-21 01:09:12] [INFO ] Deduced a trap composed of 32 places in 247 ms
[2020-05-21 01:09:12] [INFO ] Deduced a trap composed of 32 places in 228 ms
[2020-05-21 01:09:12] [INFO ] Deduced a trap composed of 76 places in 170 ms
[2020-05-21 01:09:12] [INFO ] Deduced a trap composed of 76 places in 138 ms
[2020-05-21 01:09:12] [INFO ] Deduced a trap composed of 76 places in 159 ms
[2020-05-21 01:09:13] [INFO ] Deduced a trap composed of 76 places in 171 ms
[2020-05-21 01:09:13] [INFO ] Deduced a trap composed of 32 places in 150 ms
[2020-05-21 01:09:13] [INFO ] Deduced a trap composed of 47 places in 169 ms
[2020-05-21 01:09:13] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 5923 ms
[2020-05-21 01:09:13] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 40 ms.
[2020-05-21 01:09:21] [INFO ] Added : 608 causal constraints over 122 iterations in 7395 ms. Result :sat
[2020-05-21 01:09:21] [INFO ] Deduced a trap composed of 43 places in 255 ms
[2020-05-21 01:09:21] [INFO ] Deduced a trap composed of 47 places in 217 ms
[2020-05-21 01:09:21] [INFO ] Deduced a trap composed of 21 places in 249 ms
[2020-05-21 01:09:22] [INFO ] Deduced a trap composed of 17 places in 252 ms
[2020-05-21 01:09:22] [INFO ] Deduced a trap composed of 69 places in 198 ms
[2020-05-21 01:09:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1608 ms
[2020-05-21 01:09:22] [INFO ] [Real]Absence check using 14 positive place invariants in 23 ms returned sat
[2020-05-21 01:09:22] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 4 ms returned sat
[2020-05-21 01:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:23] [INFO ] [Real]Absence check using state equation in 659 ms returned sat
[2020-05-21 01:09:23] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:09:23] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-05-21 01:09:23] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:09:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:24] [INFO ] [Nat]Absence check using state equation in 668 ms returned sat
[2020-05-21 01:09:24] [INFO ] [Nat]Added 132 Read/Feed constraints in 55 ms returned sat
[2020-05-21 01:09:24] [INFO ] Deduced a trap composed of 17 places in 171 ms
[2020-05-21 01:09:24] [INFO ] Deduced a trap composed of 58 places in 211 ms
[2020-05-21 01:09:24] [INFO ] Deduced a trap composed of 32 places in 221 ms
[2020-05-21 01:09:25] [INFO ] Deduced a trap composed of 36 places in 179 ms
[2020-05-21 01:09:25] [INFO ] Deduced a trap composed of 10 places in 163 ms
[2020-05-21 01:09:25] [INFO ] Deduced a trap composed of 10 places in 228 ms
[2020-05-21 01:09:25] [INFO ] Deduced a trap composed of 61 places in 191 ms
[2020-05-21 01:09:26] [INFO ] Deduced a trap composed of 24 places in 168 ms
[2020-05-21 01:09:26] [INFO ] Deduced a trap composed of 32 places in 192 ms
[2020-05-21 01:09:26] [INFO ] Deduced a trap composed of 39 places in 200 ms
[2020-05-21 01:09:26] [INFO ] Deduced a trap composed of 58 places in 99 ms
[2020-05-21 01:09:26] [INFO ] Deduced a trap composed of 58 places in 83 ms
[2020-05-21 01:09:26] [INFO ] Deduced a trap composed of 83 places in 142 ms
[2020-05-21 01:09:26] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2696 ms
[2020-05-21 01:09:26] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 45 ms.
[2020-05-21 01:09:34] [INFO ] Added : 595 causal constraints over 120 iterations in 7203 ms. Result :sat
[2020-05-21 01:09:34] [INFO ] Deduced a trap composed of 38 places in 282 ms
[2020-05-21 01:09:34] [INFO ] Deduced a trap composed of 39 places in 281 ms
[2020-05-21 01:09:35] [INFO ] Deduced a trap composed of 83 places in 235 ms
[2020-05-21 01:09:35] [INFO ] Deduced a trap composed of 62 places in 222 ms
[2020-05-21 01:09:35] [INFO ] Deduced a trap composed of 61 places in 230 ms
[2020-05-21 01:09:36] [INFO ] Deduced a trap composed of 62 places in 219 ms
[2020-05-21 01:09:36] [INFO ] Deduced a trap composed of 14 places in 245 ms
[2020-05-21 01:09:36] [INFO ] Deduced a trap composed of 62 places in 199 ms
[2020-05-21 01:09:37] [INFO ] Deduced a trap composed of 85 places in 193 ms
[2020-05-21 01:09:37] [INFO ] Deduced a trap composed of 96 places in 170 ms
[2020-05-21 01:09:37] [INFO ] Deduced a trap composed of 43 places in 220 ms
[2020-05-21 01:09:37] [INFO ] Deduced a trap composed of 39 places in 219 ms
[2020-05-21 01:09:38] [INFO ] Deduced a trap composed of 25 places in 185 ms
[2020-05-21 01:09:38] [INFO ] Deduced a trap composed of 70 places in 137 ms
[2020-05-21 01:09:38] [INFO ] Deduced a trap composed of 13 places in 190 ms
[2020-05-21 01:09:38] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 4648 ms
[2020-05-21 01:09:38] [INFO ] [Real]Absence check using 14 positive place invariants in 24 ms returned sat
[2020-05-21 01:09:38] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:39] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2020-05-21 01:09:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 01:09:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2020-05-21 01:09:39] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 3 ms returned sat
[2020-05-21 01:09:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 01:09:40] [INFO ] [Nat]Absence check using state equation in 616 ms returned sat
[2020-05-21 01:09:40] [INFO ] [Nat]Added 132 Read/Feed constraints in 33 ms returned sat
[2020-05-21 01:09:40] [INFO ] Deduced a trap composed of 10 places in 283 ms
[2020-05-21 01:09:40] [INFO ] Deduced a trap composed of 25 places in 285 ms
[2020-05-21 01:09:41] [INFO ] Deduced a trap composed of 35 places in 257 ms
[2020-05-21 01:09:41] [INFO ] Deduced a trap composed of 50 places in 253 ms
[2020-05-21 01:09:41] [INFO ] Deduced a trap composed of 50 places in 288 ms
[2020-05-21 01:09:42] [INFO ] Deduced a trap composed of 25 places in 247 ms
[2020-05-21 01:09:42] [INFO ] Deduced a trap composed of 37 places in 309 ms
[2020-05-21 01:09:42] [INFO ] Deduced a trap composed of 10 places in 288 ms
[2020-05-21 01:09:43] [INFO ] Deduced a trap composed of 10 places in 283 ms
[2020-05-21 01:09:43] [INFO ] Deduced a trap composed of 58 places in 271 ms
[2020-05-21 01:09:43] [INFO ] Deduced a trap composed of 58 places in 266 ms
[2020-05-21 01:09:43] [INFO ] Deduced a trap composed of 40 places in 268 ms
[2020-05-21 01:09:44] [INFO ] Deduced a trap composed of 32 places in 249 ms
[2020-05-21 01:09:44] [INFO ] Deduced a trap composed of 32 places in 208 ms
[2020-05-21 01:09:44] [INFO ] Deduced a trap composed of 21 places in 252 ms
[2020-05-21 01:09:45] [INFO ] Deduced a trap composed of 54 places in 225 ms
[2020-05-21 01:09:45] [INFO ] Deduced a trap composed of 54 places in 202 ms
[2020-05-21 01:09:45] [INFO ] Deduced a trap composed of 44 places in 241 ms
[2020-05-21 01:09:45] [INFO ] Deduced a trap composed of 81 places in 155 ms
[2020-05-21 01:09:45] [INFO ] Deduced a trap composed of 76 places in 166 ms
[2020-05-21 01:09:46] [INFO ] Deduced a trap composed of 76 places in 153 ms
[2020-05-21 01:09:46] [INFO ] Deduced a trap composed of 76 places in 171 ms
[2020-05-21 01:09:46] [INFO ] Deduced a trap composed of 43 places in 187 ms
[2020-05-21 01:09:46] [INFO ] Deduced a trap composed of 40 places in 178 ms
[2020-05-21 01:09:47] [INFO ] Deduced a trap composed of 143 places in 158 ms
[2020-05-21 01:09:47] [INFO ] Deduced a trap composed of 43 places in 112 ms
[2020-05-21 01:09:47] [INFO ] Deduced a trap composed of 82 places in 130 ms
[2020-05-21 01:09:47] [INFO ] Deduced a trap composed of 85 places in 98 ms
[2020-05-21 01:09:47] [INFO ] Deduced a trap composed of 62 places in 95 ms
[2020-05-21 01:09:47] [INFO ] Deduced a trap composed of 61 places in 152 ms
[2020-05-21 01:09:47] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 7684 ms
[2020-05-21 01:09:47] [INFO ] Computed and/alt/rep : 685/2230/625 causal constraints in 37 ms.
[2020-05-21 01:09:56] [INFO ] Added : 549 causal constraints over 110 iterations in 8340 ms. Result :sat
[2020-05-21 01:09:56] [INFO ] Deduced a trap composed of 10 places in 288 ms
[2020-05-21 01:09:56] [INFO ] Deduced a trap composed of 32 places in 286 ms
[2020-05-21 01:09:57] [INFO ] Deduced a trap composed of 15 places in 298 ms
[2020-05-21 01:09:57] [INFO ] Deduced a trap composed of 14 places in 230 ms
[2020-05-21 01:09:58] [INFO ] Deduced a trap composed of 14 places in 261 ms
[2020-05-21 01:09:58] [INFO ] Deduced a trap composed of 61 places in 148 ms
[2020-05-21 01:09:58] [INFO ] Deduced a trap composed of 43 places in 336 ms
[2020-05-21 01:09:58] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2574 ms
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
[2020-05-21 01:09:59] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2020-05-21 01:09:59] [INFO ] Flatten gal took : 98 ms
FORMULA Peterson-PT-4-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-4-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 01:09:59] [INFO ] Flatten gal took : 41 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 01:09:59] [INFO ] Applying decomposition
[2020-05-21 01:09:59] [INFO ] Input system was already deterministic with 690 transitions.
[2020-05-21 01:09:59] [INFO ] Flatten gal took : 91 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 630 out of 690 initially.
// Phase 1: matrix 630 rows 480 cols
[2020-05-21 01:09:59] [INFO ] Computed 19 place invariants in 8 ms
inv : Turn_2_2 + Turn_2_3 + Turn_2_0 + Turn_2_1 + Turn_2_4 = 1
inv : WantSection_1_F - Idle_1 = 0
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_2_2 + IsEndLoop_3_3_2 + IsEndLoop_3_1_3 + IsEndLoop_3_0_3 + IsEndLoop_3_2_3 + IsEndLoop_3_0_4 + IsEndLoop_3_3_3 + IsEndLoop_3_1_4 + IsEndLoop_3_3_4 + IsEndLoop_3_2_4 + EndTurn_3_1 + EndTurn_3_0 + EndTurn_3_2 + BeginLoop_3_0_0 + EndTurn_3_3 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + BeginLoop_3_1_0 + BeginLoop_3_2_1 + BeginLoop_3_0_1 + BeginLoop_3_1_1 + BeginLoop_3_1_2 + BeginLoop_3_3_1 + BeginLoop_3_0_2 + BeginLoop_3_0_3 + BeginLoop_3_1_3 + BeginLoop_3_2_2 + BeginLoop_3_3_2 + BeginLoop_3_0_4 + BeginLoop_3_3_3 + BeginLoop_3_2_3 + BeginLoop_3_3_4 + BeginLoop_3_2_4 + BeginLoop_3_1_4 + TestAlone_3_1_0 + TestAlone_3_0_0 + TestAlone_3_1_1 + TestAlone_3_0_1 + TestAlone_3_3_0 + TestAlone_3_2_0 + TestAlone_3_2_2 + TestAlone_3_3_2 + TestAlone_3_2_1 + TestAlone_3_3_1 + TestAlone_3_0_2 + TestAlone_3_1_2 + TestAlone_3_1_4 + TestAlone_3_2_4 + TestAlone_3_3_4 + TestTurn_3_0 + TestAlone_3_0_4 + TestIdentity_3_1_0 + TestIdentity_3_0_0 + TestIdentity_3_3_0 + TestIdentity_3_2_0 + TestTurn_3_2 + TestTurn_3_1 + TestTurn_3_3 + TestIdentity_3_3_1 + TestIdentity_3_1_2 + TestIdentity_3_0_2 + TestIdentity_3_0_1 + TestIdentity_3_2_1 + TestIdentity_3_1_1 + TestIdentity_3_3_3 + TestIdentity_3_1_3 + TestIdentity_3_2_3 + TestIdentity_3_0_3 + TestIdentity_3_2_2 + TestIdentity_3_3_2 + TestIdentity_3_2_4 + TestIdentity_3_3_4 + TestIdentity_3_0_4 + TestIdentity_3_1_4 + AskForSection_3_3 + AskForSection_3_2 + AskForSection_3_1 + AskForSection_3_0 + Idle_3 + CS_3 = 1
inv : WantSection_4_T + Idle_4 = 1
inv : WantSection_0_T + Idle_0 = 1
inv : WantSection_2_F - Idle_2 = 0
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_0_2 + IsEndLoop_2_1_2 + IsEndLoop_2_2_2 + IsEndLoop_2_3_2 + IsEndLoop_2_1_3 + IsEndLoop_2_0_3 + IsEndLoop_2_2_3 + IsEndLoop_2_0_4 + IsEndLoop_2_3_3 + IsEndLoop_2_2_4 + IsEndLoop_2_1_4 + IsEndLoop_2_3_4 + EndTurn_2_1 + EndTurn_2_0 + EndTurn_2_2 + BeginLoop_2_0_0 + EndTurn_2_3 + BeginLoop_2_3_0 + BeginLoop_2_1_0 + BeginLoop_2_2_0 + BeginLoop_2_2_1 + BeginLoop_2_0_1 + BeginLoop_2_1_1 + BeginLoop_2_1_2 + BeginLoop_2_2_2 + BeginLoop_2_3_1 + BeginLoop_2_0_2 + BeginLoop_2_0_3 + BeginLoop_2_1_3 + BeginLoop_2_3_2 + BeginLoop_2_0_4 + BeginLoop_2_3_3 + BeginLoop_2_2_3 + BeginLoop_2_3_4 + BeginLoop_2_2_4 + BeginLoop_2_1_4 + TestAlone_2_1_0 + TestAlone_2_0_0 + TestAlone_2_1_1 + TestAlone_2_0_1 + TestAlone_2_3_0 + TestAlone_2_2_0 + TestAlone_2_0_3 + TestAlone_2_1_3 + TestAlone_2_2_1 + TestAlone_2_3_1 + TestAlone_2_2_4 + TestAlone_2_3_4 + TestTurn_2_0 + TestAlone_2_2_3 + TestAlone_2_3_3 + TestAlone_2_0_4 + TestAlone_2_1_4 + TestIdentity_2_1_0 + TestIdentity_2_3_0 + TestIdentity_2_2_0 + TestTurn_2_2 + TestTurn_2_1 + TestIdentity_2_0_0 + TestTurn_2_3 + TestIdentity_2_0_2 + TestIdentity_2_3_1 + TestIdentity_2_1_2 + TestIdentity_2_0_1 + TestIdentity_2_2_1 + TestIdentity_2_1_1 + TestIdentity_2_3_3 + TestIdentity_2_0_4 + TestIdentity_2_1_3 + TestIdentity_2_2_3 + TestIdentity_2_0_3 + TestIdentity_2_2_2 + TestIdentity_2_3_2 + TestIdentity_2_2_4 + TestIdentity_2_3_4 + TestIdentity_2_1_4 + AskForSection_2_3 + AskForSection_2_2 + AskForSection_2_1 + AskForSection_2_0 + Idle_2 + CS_2 = 1
inv : WantSection_3_F - Idle_3 = 0
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_2_2 + IsEndLoop_4_3_2 + IsEndLoop_4_0_3 + IsEndLoop_4_2_3 + IsEndLoop_4_1_3 + IsEndLoop_4_0_4 + IsEndLoop_4_3_3 + IsEndLoop_4_1_4 + IsEndLoop_4_3_4 + IsEndLoop_4_2_4 + EndTurn_4_0 + EndTurn_4_2 + EndTurn_4_1 + BeginLoop_4_0_0 + EndTurn_4_3 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + BeginLoop_4_1_0 + BeginLoop_4_1_1 + BeginLoop_4_2_1 + BeginLoop_4_0_1 + BeginLoop_4_1_2 + BeginLoop_4_3_1 + BeginLoop_4_0_2 + BeginLoop_4_0_3 + BeginLoop_4_2_2 + BeginLoop_4_3_2 + BeginLoop_4_0_4 + BeginLoop_4_3_3 + BeginLoop_4_2_3 + BeginLoop_4_1_3 + BeginLoop_4_3_4 + BeginLoop_4_2_4 + BeginLoop_4_1_4 + TestAlone_4_0_0 + TestAlone_4_0_1 + TestAlone_4_3_0 + TestAlone_4_2_0 + TestAlone_4_1_0 + TestAlone_4_1_2 + TestAlone_4_2_2 + TestAlone_4_3_2 + TestAlone_4_0_3 + TestAlone_4_1_1 + TestAlone_4_2_1 + TestAlone_4_3_1 + TestAlone_4_0_2 + TestTurn_4_0 + TestAlone_4_1_3 + TestAlone_4_2_3 + TestAlone_4_3_3 + TestIdentity_4_1_0 + TestIdentity_4_0_0 + TestIdentity_4_2_0 + TestTurn_4_2 + TestTurn_4_1 + TestTurn_4_3 + TestIdentity_4_3_1 + TestIdentity_4_1_2 + TestIdentity_4_0_2 + TestIdentity_4_0_1 + TestIdentity_4_3_0 + TestIdentity_4_2_1 + TestIdentity_4_1_1 + TestIdentity_4_3_3 + TestIdentity_4_1_3 + TestIdentity_4_2_3 + TestIdentity_4_3_2 + TestIdentity_4_0_3 + TestIdentity_4_2_2 + TestIdentity_4_3_4 + TestIdentity_4_2_4 + TestIdentity_4_0_4 + TestIdentity_4_1_4 + AskForSection_4_3 + AskForSection_4_2 + AskForSection_4_1 + AskForSection_4_0 + Idle_4 + CS_4 = 1
inv : Turn_1_2 + Turn_1_3 + Turn_1_0 + Turn_1_1 + Turn_1_4 = 1
inv : IsEndLoop_0_0_0 + IsEndLoop_0_1_0 + IsEndLoop_0_2_0 + IsEndLoop_0_3_0 + IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_2_2 + IsEndLoop_0_3_2 + IsEndLoop_0_0_3 + IsEndLoop_0_1_3 + IsEndLoop_0_3_3 + IsEndLoop_0_2_3 + IsEndLoop_0_0_4 + IsEndLoop_0_2_4 + IsEndLoop_0_1_4 + EndTurn_0_0 + IsEndLoop_0_3_4 + EndTurn_0_1 + EndTurn_0_3 + EndTurn_0_2 + BeginLoop_0_0_0 + BeginLoop_0_3_0 + BeginLoop_0_0_1 + BeginLoop_0_1_0 + BeginLoop_0_2_0 + BeginLoop_0_2_1 + BeginLoop_0_3_1 + BeginLoop_0_1_1 + BeginLoop_0_1_2 + BeginLoop_0_2_2 + BeginLoop_0_0_2 + BeginLoop_0_1_3 + BeginLoop_0_3_2 + BeginLoop_0_0_3 + BeginLoop_0_0_4 + BeginLoop_0_3_3 + BeginLoop_0_2_3 + BeginLoop_0_3_4 + BeginLoop_0_2_4 + BeginLoop_0_1_4 + TestAlone_0_1_1 + TestAlone_0_0_1 + TestAlone_0_2_2 + TestAlone_0_3_2 + TestAlone_0_0_3 + TestAlone_0_1_3 + TestAlone_0_2_1 + TestAlone_0_3_1 + TestAlone_0_0_2 + TestAlone_0_1_2 + TestAlone_0_2_4 + TestAlone_0_3_4 + TestTurn_0_0 + TestTurn_0_1 + TestAlone_0_2_3 + TestAlone_0_3_3 + TestAlone_0_0_4 + TestAlone_0_1_4 + TestIdentity_0_2_0 + TestIdentity_0_1_0 + TestIdentity_0_3_0 + TestTurn_0_2 + TestIdentity_0_0_0 + TestTurn_0_3 + TestIdentity_0_0_2 + TestIdentity_0_3_1 + TestIdentity_0_2_2 + TestIdentity_0_1_2 + TestIdentity_0_1_1 + TestIdentity_0_0_1 + TestIdentity_0_2_1 + TestIdentity_0_3_3 + TestIdentity_0_0_4 + TestIdentity_0_2_3 + TestIdentity_0_0_3 + TestIdentity_0_1_3 + TestIdentity_0_3_2 + TestIdentity_0_3_4 + TestIdentity_0_1_4 + TestIdentity_0_2_4 + CS_0 + AskForSection_0_3 + AskForSection_0_2 + AskForSection_0_1 + AskForSection_0_0 + Idle_0 = 1
inv : WantSection_2_T + Idle_2 = 1
inv : WantSection_1_T + Idle_1 = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_0_1 + IsEndLoop_1_1_1 + IsEndLoop_1_2_1 + IsEndLoop_1_3_1 + IsEndLoop_1_0_2 + IsEndLoop_1_1_2 + IsEndLoop_1_2_2 + IsEndLoop_1_3_2 + IsEndLoop_1_1_3 + IsEndLoop_1_0_3 + IsEndLoop_1_3_3 + IsEndLoop_1_2_3 + IsEndLoop_1_0_4 + IsEndLoop_1_2_4 + IsEndLoop_1_1_4 + IsEndLoop_1_3_4 + EndTurn_1_1 + EndTurn_1_0 + EndTurn_1_3 + EndTurn_1_2 + BeginLoop_1_0_0 + BeginLoop_1_3_0 + BeginLoop_1_1_0 + BeginLoop_1_2_0 + BeginLoop_1_2_1 + BeginLoop_1_3_1 + BeginLoop_1_0_1 + BeginLoop_1_1_1 + BeginLoop_1_1_2 + BeginLoop_1_2_2 + BeginLoop_1_0_2 + BeginLoop_1_0_3 + BeginLoop_1_1_3 + BeginLoop_1_3_2 + BeginLoop_1_0_4 + BeginLoop_1_3_3 + BeginLoop_1_2_3 + BeginLoop_1_3_4 + BeginLoop_1_2_4 + BeginLoop_1_1_4 + TestAlone_1_1_0 + TestAlone_1_0_0 + TestAlone_1_3_0 + TestAlone_1_2_0 + TestAlone_1_2_2 + TestAlone_1_3_2 + TestAlone_1_0_3 + TestAlone_1_1_3 + TestAlone_1_0_2 + TestAlone_1_1_2 + TestAlone_1_2_4 + TestAlone_1_3_4 + TestTurn_1_0 + TestTurn_1_1 + TestAlone_1_2_3 + TestAlone_1_3_3 + TestAlone_1_0_4 + TestAlone_1_1_4 + TestIdentity_1_1_0 + TestIdentity_1_3_0 + TestIdentity_1_2_0 + TestTurn_1_2 + TestIdentity_1_0_0 + TestTurn_1_3 + TestIdentity_1_0_2 + TestIdentity_1_3_1 + TestIdentity_1_1_2 + TestIdentity_1_1_1 + TestIdentity_1_0_1 + TestIdentity_1_2_1 + TestIdentity_1_3_3 + TestIdentity_1_0_4 + TestIdentity_1_2_3 + TestIdentity_1_0_3 + TestIdentity_1_1_3 + TestIdentity_1_2_2 + TestIdentity_1_3_2 + TestIdentity_1_2_4 + TestIdentity_1_3_4 + TestIdentity_1_1_4 + CS_1 + AskForSection_1_3 + AskForSection_1_2 + AskForSection_1_1 + AskForSection_1_0 + Idle_1 = 1
inv : Turn_0_2 + Turn_0_3 + Turn_0_0 + Turn_0_1 + Turn_0_4 = 1
inv : WantSection_4_F - Idle_4 = 0
inv : WantSection_3_T + Idle_3 = 1
inv : WantSection_0_F - Idle_0 = 0
inv : Turn_3_1 + Turn_3_2 + Turn_3_0 + Turn_3_4 + Turn_3_3 = 1
Total of 19 invariants.
[2020-05-21 01:09:59] [INFO ] Computed 19 place invariants in 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph3288575418239509514.txt, -o, /tmp/graph3288575418239509514.bin, -w, /tmp/graph3288575418239509514.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph3288575418239509514.bin, -l, -1, -v, -w, /tmp/graph3288575418239509514.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 01:09:59] [INFO ] Decomposing Gal with order
[2020-05-21 01:09:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 01:10:00] [INFO ] Removed a total of 305 redundant transitions.
[2020-05-21 01:10:00] [INFO ] Flatten gal took : 481 ms
[2020-05-21 01:10:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 260 labels/synchronizations in 27 ms.
[2020-05-21 01:10:00] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 11 ms
[2020-05-21 01:10:00] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 10 LTL properties
[2020-05-21 01:10:00] [INFO ] Proved 480 variables to be positive in 838 ms
[2020-05-21 01:10:00] [INFO ] Computing symmetric may disable matrix : 690 transitions.
[2020-05-21 01:10:00] [INFO ] Computation of disable matrix completed :0/690 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Checking formula 0 : !((F(("((((((((((((((((((((gu1.EndTurn_0_0+gu1.EndTurn_2_1)+gu1.EndTurn_3_1)+gu1.EndTurn_0_1)+gu1.EndTurn_1_1)+gu1.EndTurn_3_0)+gu1.EndTurn_4_0)+gu1.EndTurn_1_0)+gu1.EndTurn_2_0)+gu1.EndTurn_1_3)+gu1.EndTurn_0_3)+gu1.EndTurn_4_2)+gu1.EndTurn_3_2)+gu1.EndTurn_2_2)+gu1.EndTurn_1_2)+gu1.EndTurn_0_2)+gu1.EndTurn_4_1)+gu1.EndTurn_4_3)+gu1.EndTurn_3_3)+gu1.EndTurn_2_3)>=1)")||((F("((((((((((((((((((((gu1.EndTurn_0_0+gu1.EndTurn_2_1)+gu1.EndTurn_3_1)+gu1.EndTurn_0_1)+gu1.EndTurn_1_1)+gu1.EndTurn_3_0)+gu1.EndTurn_4_0)+gu1.EndTurn_1_0)+gu1.EndTurn_2_0)+gu1.EndTurn_1_3)+gu1.EndTurn_0_3)+gu1.EndTurn_4_2)+gu1.EndTurn_3_2)+gu1.EndTurn_2_2)+gu1.EndTurn_1_2)+gu1.EndTurn_0_2)+gu1.EndTurn_4_1)+gu1.EndTurn_4_3)+gu1.EndTurn_3_3)+gu1.EndTurn_2_3)>=1)"))&&("((((((((((((((((((((gu0.AskForSection_3_3+gu0.AskForSection_4_3)+gu0.AskForSection_1_3)+gu0.AskForSection_2_3)+gu0.AskForSection_4_2)+gu0.AskForSection_0_3)+gu0.AskForSection_2_2)+gu0.AskForSection_3_2)+gu0.AskForSection_0_2)+gu0.AskForSection_1_2)+gu0.AskForSection_3_1)+gu0.AskForSection_4_1)+gu0.AskForSection_1_1)+gu0.AskForSection_2_1)+gu0.AskForSection_0_1)+gu0.AskForSection_4_0)+gu0.AskForSection_3_0)+gu0.AskForSection_2_0)+gu0.AskForSection_1_0)+gu0.AskForSection_0_0)>(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_4_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_4_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_4_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_1_3_0)+gu0.IsEndLoop_0_3_0)+gu0.IsEndLoop_3_3_0)+gu0.IsEndLoop_2_3_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_4_3_0)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_4_0_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_4_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_0_3_1)+gu0.IsEndLoop_1_3_1)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_4_2_1)+gu0.IsEndLoop_4_3_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_2_3_1)+gu0.IsEndLoop_3_3_1)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_4_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_4_1_2)+gu0.IsEndLoop_1_3_2)+gu0.IsEndLoop_0_3_2)+gu0.IsEndLoop_4_2_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_4_3_2)+gu0.IsEndLoop_3_3_2)+gu0.IsEndLoop_2_3_2)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_4_0_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_4_2_3)+gu0.IsEndLoop_0_3_3)+gu0.IsEndLoop_1_3_3)+gu0.IsEndLoop_4_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_1_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_2_0_4)+gu0.IsEndLoop_1_0_4)+gu0.IsEndLoop_4_0_4)+gu0.IsEndLoop_3_0_4)+gu0.IsEndLoop_3_3_3)+gu0.IsEndLoop_2_3_3)+gu0.IsEndLoop_0_0_4)+gu0.IsEndLoop_4_3_3)+gu0.IsEndLoop_0_2_4)+gu0.IsEndLoop_4_1_4)+gu0.IsEndLoop_2_2_4)+gu0.IsEndLoop_1_2_4)+gu0.IsEndLoop_1_1_4)+gu0.IsEndLoop_0_1_4)+gu0.IsEndLoop_3_1_4)+gu0.IsEndLoop_2_1_4)+gu0.IsEndLoop_4_3_4)+gu0.IsEndLoop_2_3_4)+gu0.IsEndLoop_3_3_4)+gu0.IsEndLoop_0_3_4)+gu0.IsEndLoop_1_3_4)+gu0.IsEndLoop_3_2_4)+gu0.IsEndLoop_4_2_4))")))))
Formula 0 simplified : !F("((((((((((((((((((((gu1.EndTurn_0_0+gu1.EndTurn_2_1)+gu1.EndTurn_3_1)+gu1.EndTurn_0_1)+gu1.EndTurn_1_1)+gu1.EndTurn_3_0)+gu1.EndTurn_4_0)+gu1.EndTurn_1_0)+gu1.EndTurn_2_0)+gu1.EndTurn_1_3)+gu1.EndTurn_0_3)+gu1.EndTurn_4_2)+gu1.EndTurn_3_2)+gu1.EndTurn_2_2)+gu1.EndTurn_1_2)+gu1.EndTurn_0_2)+gu1.EndTurn_4_1)+gu1.EndTurn_4_3)+gu1.EndTurn_3_3)+gu1.EndTurn_2_3)>=1)" | ("((((((((((((((((((((gu0.AskForSection_3_3+gu0.AskForSection_4_3)+gu0.AskForSection_1_3)+gu0.AskForSection_2_3)+gu0.AskForSection_4_2)+gu0.AskForSection_0_3)+gu0.AskForSection_2_2)+gu0.AskForSection_3_2)+gu0.AskForSection_0_2)+gu0.AskForSection_1_2)+gu0.AskForSection_3_1)+gu0.AskForSection_4_1)+gu0.AskForSection_1_1)+gu0.AskForSection_2_1)+gu0.AskForSection_0_1)+gu0.AskForSection_4_0)+gu0.AskForSection_3_0)+gu0.AskForSection_2_0)+gu0.AskForSection_1_0)+gu0.AskForSection_0_0)>(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu0.IsEndLoop_0_0_0+gu0.IsEndLoop_1_0_0)+gu0.IsEndLoop_2_0_0)+gu0.IsEndLoop_3_0_0)+gu0.IsEndLoop_4_0_0)+gu0.IsEndLoop_0_1_0)+gu0.IsEndLoop_1_1_0)+gu0.IsEndLoop_2_1_0)+gu0.IsEndLoop_3_1_0)+gu0.IsEndLoop_4_1_0)+gu0.IsEndLoop_0_2_0)+gu0.IsEndLoop_1_2_0)+gu0.IsEndLoop_2_2_0)+gu0.IsEndLoop_4_2_0)+gu0.IsEndLoop_3_2_0)+gu0.IsEndLoop_1_3_0)+gu0.IsEndLoop_0_3_0)+gu0.IsEndLoop_3_3_0)+gu0.IsEndLoop_2_3_0)+gu0.IsEndLoop_0_0_1)+gu0.IsEndLoop_4_3_0)+gu0.IsEndLoop_2_0_1)+gu0.IsEndLoop_1_0_1)+gu0.IsEndLoop_4_0_1)+gu0.IsEndLoop_3_0_1)+gu0.IsEndLoop_1_1_1)+gu0.IsEndLoop_0_1_1)+gu0.IsEndLoop_3_1_1)+gu0.IsEndLoop_2_1_1)+gu0.IsEndLoop_1_2_1)+gu0.IsEndLoop_2_2_1)+gu0.IsEndLoop_4_1_1)+gu0.IsEndLoop_0_2_1)+gu0.IsEndLoop_0_3_1)+gu0.IsEndLoop_1_3_1)+gu0.IsEndLoop_3_2_1)+gu0.IsEndLoop_4_2_1)+gu0.IsEndLoop_4_3_1)+gu0.IsEndLoop_0_0_2)+gu0.IsEndLoop_2_3_1)+gu0.IsEndLoop_3_3_1)+gu0.IsEndLoop_3_0_2)+gu0.IsEndLoop_4_0_2)+gu0.IsEndLoop_1_0_2)+gu0.IsEndLoop_2_0_2)+gu0.IsEndLoop_3_1_2)+gu0.IsEndLoop_2_1_2)+gu0.IsEndLoop_1_1_2)+gu0.IsEndLoop_0_1_2)+gu0.IsEndLoop_2_2_2)+gu0.IsEndLoop_1_2_2)+gu0.IsEndLoop_0_2_2)+gu0.IsEndLoop_4_1_2)+gu0.IsEndLoop_1_3_2)+gu0.IsEndLoop_0_3_2)+gu0.IsEndLoop_4_2_2)+gu0.IsEndLoop_3_2_2)+gu0.IsEndLoop_0_0_3)+gu0.IsEndLoop_4_3_2)+gu0.IsEndLoop_3_3_2)+gu0.IsEndLoop_2_3_2)+gu0.IsEndLoop_0_1_3)+gu0.IsEndLoop_1_1_3)+gu0.IsEndLoop_2_1_3)+gu0.IsEndLoop_3_1_3)+gu0.IsEndLoop_1_0_3)+gu0.IsEndLoop_2_0_3)+gu0.IsEndLoop_3_0_3)+gu0.IsEndLoop_4_0_3)+gu0.IsEndLoop_3_2_3)+gu0.IsEndLoop_4_2_3)+gu0.IsEndLoop_0_3_3)+gu0.IsEndLoop_1_3_3)+gu0.IsEndLoop_4_1_3)+gu0.IsEndLoop_0_2_3)+gu0.IsEndLoop_1_2_3)+gu0.IsEndLoop_2_2_3)+gu0.IsEndLoop_2_0_4)+gu0.IsEndLoop_1_0_4)+gu0.IsEndLoop_4_0_4)+gu0.IsEndLoop_3_0_4)+gu0.IsEndLoop_3_3_3)+gu0.IsEndLoop_2_3_3)+gu0.IsEndLoop_0_0_4)+gu0.IsEndLoop_4_3_3)+gu0.IsEndLoop_0_2_4)+gu0.IsEndLoop_4_1_4)+gu0.IsEndLoop_2_2_4)+gu0.IsEndLoop_1_2_4)+gu0.IsEndLoop_1_1_4)+gu0.IsEndLoop_0_1_4)+gu0.IsEndLoop_3_1_4)+gu0.IsEndLoop_2_1_4)+gu0.IsEndLoop_4_3_4)+gu0.IsEndLoop_2_3_4)+gu0.IsEndLoop_3_3_4)+gu0.IsEndLoop_0_3_4)+gu0.IsEndLoop_1_3_4)+gu0.IsEndLoop_3_2_4)+gu0.IsEndLoop_4_2_4))" & F"((((((((((((((((((((gu1.EndTurn_0_0+gu1.EndTurn_2_1)+gu1.EndTurn_3_1)+gu1.EndTurn_0_1)+gu1.EndTurn_1_1)+gu1.EndTurn_3_0)+gu1.EndTurn_4_0)+gu1.EndTurn_1_0)+gu1.EndTurn_2_0)+gu1.EndTurn_1_3)+gu1.EndTurn_0_3)+gu1.EndTurn_4_2)+gu1.EndTurn_3_2)+gu1.EndTurn_2_2)+gu1.EndTurn_1_2)+gu1.EndTurn_0_2)+gu1.EndTurn_4_1)+gu1.EndTurn_4_3)+gu1.EndTurn_3_3)+gu1.EndTurn_2_3)>=1)"))
[2020-05-21 01:10:00] [INFO ] Computation of Complete disable matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:10:00] [INFO ] Computing symmetric may enable matrix : 690 transitions.
[2020-05-21 01:10:00] [INFO ] Computation of Complete enable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 01:10:17] [INFO ] Computing symmetric co enabling matrix : 690 transitions.
[2020-05-21 01:10:17] [INFO ] Computation of co-enabling matrix(0/690) took 107 ms. Total solver calls (SAT/UNSAT): 137(0/137)
[2020-05-21 01:10:20] [INFO ] Computation of co-enabling matrix(32/690) took 3201 ms. Total solver calls (SAT/UNSAT): 4428(0/4428)
[2020-05-21 01:10:23] [INFO ] Computation of co-enabling matrix(63/690) took 6213 ms. Total solver calls (SAT/UNSAT): 8390(0/8390)
[2020-05-21 01:10:27] [INFO ] Computation of co-enabling matrix(66/690) took 10386 ms. Total solver calls (SAT/UNSAT): 8880(23/8857)
[2020-05-21 01:10:31] [INFO ] Computation of co-enabling matrix(68/690) took 13553 ms. Total solver calls (SAT/UNSAT): 9201(34/9167)
[2020-05-21 01:10:34] [INFO ] Computation of co-enabling matrix(71/690) took 16737 ms. Total solver calls (SAT/UNSAT): 9676(53/9623)
[2020-05-21 01:10:38] [INFO ] Computation of co-enabling matrix(73/690) took 20809 ms. Total solver calls (SAT/UNSAT): 9987(68/9919)
[2020-05-21 01:10:41] [INFO ] Computation of co-enabling matrix(75/690) took 23927 ms. Total solver calls (SAT/UNSAT): 10295(79/10216)
[2020-05-21 01:10:44] [INFO ] Computation of co-enabling matrix(78/690) took 27087 ms. Total solver calls (SAT/UNSAT): 10748(97/10651)
[2020-05-21 01:10:48] [INFO ] Computation of co-enabling matrix(88/690) took 30523 ms. Total solver calls (SAT/UNSAT): 12009(107/11902)
[2020-05-21 01:10:52] [INFO ] Computation of co-enabling matrix(92/690) took 35010 ms. Total solver calls (SAT/UNSAT): 12585(131/12454)
[2020-05-21 01:10:55] [INFO ] Computation of co-enabling matrix(94/690) took 38141 ms. Total solver calls (SAT/UNSAT): 12868(142/12726)
[2020-05-21 01:10:58] [INFO ] Computation of co-enabling matrix(120/690) took 41151 ms. Total solver calls (SAT/UNSAT): 15902(146/15756)
[2020-05-21 01:11:03] [INFO ] Computation of co-enabling matrix(146/690) took 46357 ms. Total solver calls (SAT/UNSAT): 18829(194/18635)
[2020-05-21 01:11:06] [INFO ] Computation of co-enabling matrix(147/690) took 49405 ms. Total solver calls (SAT/UNSAT): 18953(210/18743)
[2020-05-21 01:11:10] [INFO ] Computation of co-enabling matrix(148/690) took 53374 ms. Total solver calls (SAT/UNSAT): 19077(226/18851)
[2020-05-21 01:11:13] [INFO ] Computation of co-enabling matrix(188/690) took 56406 ms. Total solver calls (SAT/UNSAT): 23222(226/22996)
[2020-05-21 01:11:16] [INFO ] Computation of co-enabling matrix(235/690) took 59431 ms. Total solver calls (SAT/UNSAT): 27687(226/27461)
[2020-05-21 01:11:20] [INFO ] Computation of co-enabling matrix(242/690) took 63133 ms. Total solver calls (SAT/UNSAT): 28330(240/28090)
[2020-05-21 01:11:23] [INFO ] Computation of co-enabling matrix(244/690) took 66412 ms. Total solver calls (SAT/UNSAT): 28532(267/28265)
[2020-05-21 01:11:30] [INFO ] Computation of co-enabling matrix(246/690) took 72484 ms. Total solver calls (SAT/UNSAT): 28732(292/28440)
[2020-05-21 01:11:35] [INFO ] Computation of co-enabling matrix(249/690) took 78236 ms. Total solver calls (SAT/UNSAT): 29030(329/28701)
[2020-05-21 01:11:39] [INFO ] Computation of co-enabling matrix(250/690) took 81502 ms. Total solver calls (SAT/UNSAT): 29129(342/28787)
[2020-05-21 01:11:42] [INFO ] Computation of co-enabling matrix(252/690) took 84645 ms. Total solver calls (SAT/UNSAT): 29327(368/28959)
[2020-05-21 01:11:47] [INFO ] Computation of co-enabling matrix(254/690) took 90451 ms. Total solver calls (SAT/UNSAT): 29523(392/29131)
[2020-05-21 01:11:51] [INFO ] Computation of co-enabling matrix(255/690) took 93780 ms. Total solver calls (SAT/UNSAT): 29622(406/29216)
[2020-05-21 01:11:54] [INFO ] Computation of co-enabling matrix(256/690) took 96807 ms. Total solver calls (SAT/UNSAT): 29718(418/29300)
[2020-05-21 01:12:00] [INFO ] Computation of co-enabling matrix(259/690) took 102836 ms. Total solver calls (SAT/UNSAT): 30008(453/29555)
[2020-05-21 01:12:06] [INFO ] Computation of co-enabling matrix(261/690) took 108487 ms. Total solver calls (SAT/UNSAT): 30200(476/29724)
[2020-05-21 01:12:11] [INFO ] Computation of co-enabling matrix(264/690) took 113726 ms. Total solver calls (SAT/UNSAT): 30484(508/29976)
[2020-05-21 01:12:16] [INFO ] Computation of co-enabling matrix(267/690) took 118558 ms. Total solver calls (SAT/UNSAT): 30763(538/30225)
[2020-05-21 01:12:20] [INFO ] Computation of co-enabling matrix(269/690) took 122929 ms. Total solver calls (SAT/UNSAT): 30946(555/30391)
[2020-05-21 01:12:25] [INFO ] Computation of co-enabling matrix(272/690) took 127859 ms. Total solver calls (SAT/UNSAT): 31222(585/30637)
[2020-05-21 01:12:31] [INFO ] Computation of co-enabling matrix(281/690) took 133536 ms. Total solver calls (SAT/UNSAT): 31977(604/31373)
[2020-05-21 01:12:35] [INFO ] Computation of co-enabling matrix(283/690) took 138189 ms. Total solver calls (SAT/UNSAT): 32156(623/31533)
[2020-05-21 01:12:39] [INFO ] Computation of co-enabling matrix(286/690) took 142247 ms. Total solver calls (SAT/UNSAT): 32418(647/31771)
[2020-05-21 01:12:42] [INFO ] Computation of co-enabling matrix(288/690) took 145461 ms. Total solver calls (SAT/UNSAT): 32588(660/31928)
[2020-05-21 01:12:46] [INFO ] Computation of co-enabling matrix(291/690) took 148801 ms. Total solver calls (SAT/UNSAT): 32845(681/32164)
[2020-05-21 01:12:49] [INFO ] Computation of co-enabling matrix(294/690) took 151941 ms. Total solver calls (SAT/UNSAT): 33098(701/32397)
[2020-05-21 01:12:54] [INFO ] Computation of co-enabling matrix(298/690) took 156926 ms. Total solver calls (SAT/UNSAT): 33437(732/32705)
[2020-05-21 01:12:58] [INFO ] Computation of co-enabling matrix(300/690) took 160824 ms. Total solver calls (SAT/UNSAT): 33606(748/32858)
[2020-05-21 01:13:01] [INFO ] Computation of co-enabling matrix(302/690) took 164389 ms. Total solver calls (SAT/UNSAT): 33773(762/33011)
[2020-05-21 01:13:07] [INFO ] Computation of co-enabling matrix(307/690) took 170450 ms. Total solver calls (SAT/UNSAT): 34193(802/33391)
[2020-05-21 01:13:13] [INFO ] Computation of co-enabling matrix(309/690) took 175648 ms. Total solver calls (SAT/UNSAT): 34368(823/33545)
[2020-05-21 01:13:16] [INFO ] Computation of co-enabling matrix(311/690) took 178686 ms. Total solver calls (SAT/UNSAT): 34542(844/33698)
[2020-05-21 01:13:19] [INFO ] Computation of co-enabling matrix(314/690) took 181744 ms. Total solver calls (SAT/UNSAT): 34800(874/33926)
[2020-05-21 01:13:24] [INFO ] Computation of co-enabling matrix(316/690) took 187443 ms. Total solver calls (SAT/UNSAT): 34973(897/34076)
[2020-05-21 01:13:30] [INFO ] Computation of co-enabling matrix(319/690) took 192881 ms. Total solver calls (SAT/UNSAT): 35228(928/34300)
[2020-05-21 01:13:35] [INFO ] Computation of co-enabling matrix(322/690) took 197924 ms. Total solver calls (SAT/UNSAT): 35481(958/34523)
[2020-05-21 01:13:39] [INFO ] Computation of co-enabling matrix(326/690) took 202115 ms. Total solver calls (SAT/UNSAT): 35806(991/34815)
[2020-05-21 01:13:43] [INFO ] Computation of co-enabling matrix(329/690) took 205930 ms. Total solver calls (SAT/UNSAT): 36045(1012/35033)
[2020-05-21 01:13:48] [INFO ] Computation of co-enabling matrix(333/690) took 210550 ms. Total solver calls (SAT/UNSAT): 36366(1045/35321)
[2020-05-21 01:13:53] [INFO ] Computation of co-enabling matrix(336/690) took 215726 ms. Total solver calls (SAT/UNSAT): 36608(1072/35536)
[2020-05-21 01:13:56] [INFO ] Computation of co-enabling matrix(338/690) took 219203 ms. Total solver calls (SAT/UNSAT): 36763(1086/35677)
[2020-05-21 01:13:59] [INFO ] Computation of co-enabling matrix(342/690) took 222403 ms. Total solver calls (SAT/UNSAT): 37052(1103/35949)
[2020-05-21 01:14:03] [INFO ] Computation of co-enabling matrix(346/690) took 225524 ms. Total solver calls (SAT/UNSAT): 37337(1117/36220)
[2020-05-21 01:14:06] [INFO ] Computation of co-enabling matrix(350/690) took 229155 ms. Total solver calls (SAT/UNSAT): 37621(1133/36488)
[2020-05-21 01:14:10] [INFO ] Computation of co-enabling matrix(353/690) took 232492 ms. Total solver calls (SAT/UNSAT): 37831(1146/36685)
[2020-05-21 01:14:14] [INFO ] Computation of co-enabling matrix(355/690) took 236761 ms. Total solver calls (SAT/UNSAT): 37983(1163/36820)
[2020-05-21 01:14:18] [INFO ] Computation of co-enabling matrix(358/690) took 240648 ms. Total solver calls (SAT/UNSAT): 38206(1184/37022)
[2020-05-21 01:14:21] [INFO ] Computation of co-enabling matrix(360/690) took 243986 ms. Total solver calls (SAT/UNSAT): 38351(1197/37154)
[2020-05-21 01:14:24] [INFO ] Computation of co-enabling matrix(364/690) took 247265 ms. Total solver calls (SAT/UNSAT): 38627(1215/37412)
[2020-05-21 01:14:29] [INFO ] Computation of co-enabling matrix(379/690) took 251729 ms. Total solver calls (SAT/UNSAT): 39600(1244/38356)
[2020-05-21 01:14:32] [INFO ] Computation of co-enabling matrix(383/690) took 255412 ms. Total solver calls (SAT/UNSAT): 39861(1258/38603)
[2020-05-21 01:14:36] [INFO ] Computation of co-enabling matrix(402/690) took 258790 ms. Total solver calls (SAT/UNSAT): 40993(1271/39722)
[2020-05-21 01:14:40] [INFO ] Computation of co-enabling matrix(410/690) took 262888 ms. Total solver calls (SAT/UNSAT): 41476(1297/40179)
[2020-05-21 01:14:43] [INFO ] Computation of co-enabling matrix(414/690) took 266102 ms. Total solver calls (SAT/UNSAT): 41719(1315/40404)
[2020-05-21 01:14:46] [INFO ] Computation of co-enabling matrix(419/690) took 269399 ms. Total solver calls (SAT/UNSAT): 42009(1330/40679)
[2020-05-21 01:14:49] [INFO ] Computation of co-enabling matrix(449/690) took 272435 ms. Total solver calls (SAT/UNSAT): 43554(1346/42208)
[2020-05-21 01:14:54] [INFO ] Computation of co-enabling matrix(498/690) took 276559 ms. Total solver calls (SAT/UNSAT): 45681(1354/44327)
[2020-05-21 01:14:57] [INFO ] Computation of co-enabling matrix(503/690) took 280124 ms. Total solver calls (SAT/UNSAT): 46057(1388/44669)
[2020-05-21 01:15:00] [INFO ] Computation of co-enabling matrix(509/690) took 283448 ms. Total solver calls (SAT/UNSAT): 46488(1427/45061)
[2020-05-21 01:15:05] [INFO ] Computation of co-enabling matrix(514/690) took 287484 ms. Total solver calls (SAT/UNSAT): 46826(1461/45365)
[2020-05-21 01:15:08] [INFO ] Computation of co-enabling matrix(516/690) took 290996 ms. Total solver calls (SAT/UNSAT): 46966(1474/45492)
[2020-05-21 01:15:12] [INFO ] Computation of co-enabling matrix(519/690) took 294478 ms. Total solver calls (SAT/UNSAT): 47169(1495/45674)
[2020-05-21 01:15:15] [INFO ] Computation of co-enabling matrix(523/690) took 297660 ms. Total solver calls (SAT/UNSAT): 47426(1521/45905)
[2020-05-21 01:15:18] [INFO ] Computation of co-enabling matrix(527/690) took 300722 ms. Total solver calls (SAT/UNSAT): 47668(1547/46121)
[2020-05-21 01:15:21] [INFO ] Computation of co-enabling matrix(531/690) took 304215 ms. Total solver calls (SAT/UNSAT): 47924(1573/46351)
[2020-05-21 01:15:25] [INFO ] Computation of co-enabling matrix(533/690) took 307536 ms. Total solver calls (SAT/UNSAT): 48060(1586/46474)
[2020-05-21 01:15:28] [INFO ] Computation of co-enabling matrix(536/690) took 311086 ms. Total solver calls (SAT/UNSAT): 48257(1607/46650)
[2020-05-21 01:15:31] [INFO ] Computation of co-enabling matrix(539/690) took 314338 ms. Total solver calls (SAT/UNSAT): 48447(1627/46820)
[2020-05-21 01:15:34] [INFO ] Computation of co-enabling matrix(542/690) took 317357 ms. Total solver calls (SAT/UNSAT): 48623(1643/46980)
[2020-05-21 01:15:38] [INFO ] Computation of co-enabling matrix(544/690) took 320606 ms. Total solver calls (SAT/UNSAT): 48739(1656/47083)
[2020-05-21 01:15:41] [INFO ] Computation of co-enabling matrix(555/690) took 324142 ms. Total solver calls (SAT/UNSAT): 49096(1669/47427)
[2020-05-21 01:15:45] [INFO ] Computation of co-enabling matrix(560/690) took 327644 ms. Total solver calls (SAT/UNSAT): 49304(1687/47617)
[2020-05-21 01:15:48] [INFO ] Computation of co-enabling matrix(563/690) took 331290 ms. Total solver calls (SAT/UNSAT): 49448(1701/47747)
[2020-05-21 01:15:51] [INFO ] Computation of co-enabling matrix(569/690) took 334312 ms. Total solver calls (SAT/UNSAT): 49714(1720/47994)
[2020-05-21 01:15:55] [INFO ] Computation of co-enabling matrix(579/690) took 338255 ms. Total solver calls (SAT/UNSAT): 50044(1737/48307)
[2020-05-21 01:15:59] [INFO ] Computation of co-enabling matrix(584/690) took 342184 ms. Total solver calls (SAT/UNSAT): 50244(1760/48484)
[2020-05-21 01:16:02] [INFO ] Computation of co-enabling matrix(592/690) took 345201 ms. Total solver calls (SAT/UNSAT): 50587(1792/48795)
[2020-05-21 01:16:05] [INFO ] Computation of co-enabling matrix(595/690) took 348423 ms. Total solver calls (SAT/UNSAT): 50690(1804/48886)
[2020-05-21 01:16:09] [INFO ] Computation of co-enabling matrix(602/690) took 351496 ms. Total solver calls (SAT/UNSAT): 50911(1815/49096)
[2020-05-21 01:16:12] [INFO ] Computation of co-enabling matrix(611/690) took 354927 ms. Total solver calls (SAT/UNSAT): 51143(1827/49316)
[2020-05-21 01:16:15] [INFO ] Computation of co-enabling matrix(617/690) took 358232 ms. Total solver calls (SAT/UNSAT): 51255(1839/49416)
[2020-05-21 01:16:19] [INFO ] Computation of co-enabling matrix(624/690) took 361783 ms. Total solver calls (SAT/UNSAT): 51488(1873/49615)
[2020-05-21 01:16:22] [INFO ] Computation of co-enabling matrix(642/690) took 364845 ms. Total solver calls (SAT/UNSAT): 51918(1911/50007)
[2020-05-21 01:16:25] [INFO ] Computation of co-enabling matrix(652/690) took 368120 ms. Total solver calls (SAT/UNSAT): 52085(1937/50148)
[2020-05-21 01:16:29] [INFO ] Computation of co-enabling matrix(662/690) took 371655 ms. Total solver calls (SAT/UNSAT): 52261(1954/50307)
[2020-05-21 01:16:32] [INFO ] Computation of co-enabling matrix(670/690) took 374754 ms. Total solver calls (SAT/UNSAT): 52357(1973/50384)
[2020-05-21 01:16:35] [INFO ] Computation of co-enabling matrix(678/690) took 378026 ms. Total solver calls (SAT/UNSAT): 52426(1986/50440)
[2020-05-21 01:16:38] [INFO ] Computation of Finished co-enabling matrix. took 380730 ms. Total solver calls (SAT/UNSAT): 52465(2000/50465)
[2020-05-21 01:16:38] [INFO ] Computing Do-Not-Accords matrix : 690 transitions.
[2020-05-21 01:16:38] [INFO ] Computation of Completed DNA matrix. took 277 ms. Total solver calls (SAT/UNSAT): 80(0/80)
[2020-05-21 01:16:38] [INFO ] Built C files in 399337ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 9512 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 62 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(( (LTLAP0==true)) || ( ( <>((LTLAP0==true)) ) && ( (LTLAP1==true) )) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(( (LTLAP0==true)) || ( ( <>((LTLAP0==true)) ) && ( (LTLAP1==true) )) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>(( (LTLAP0==true)) || ( ( <>((LTLAP0==true)) ) && ( (LTLAP1==true) )) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2020-05-21 01:30:51] [INFO ] Flatten gal took : 409 ms
[2020-05-21 01:30:51] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 39 ms
[2020-05-21 01:30:51] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 17 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 10 LTL properties
Checking formula 0 : !((F(("((((((((((((((((((((EndTurn_0_0+EndTurn_2_1)+EndTurn_3_1)+EndTurn_0_1)+EndTurn_1_1)+EndTurn_3_0)+EndTurn_4_0)+EndTurn_1_0)+EndTurn_2_0)+EndTurn_1_3)+EndTurn_0_3)+EndTurn_4_2)+EndTurn_3_2)+EndTurn_2_2)+EndTurn_1_2)+EndTurn_0_2)+EndTurn_4_1)+EndTurn_4_3)+EndTurn_3_3)+EndTurn_2_3)>=1)")||((F("((((((((((((((((((((EndTurn_0_0+EndTurn_2_1)+EndTurn_3_1)+EndTurn_0_1)+EndTurn_1_1)+EndTurn_3_0)+EndTurn_4_0)+EndTurn_1_0)+EndTurn_2_0)+EndTurn_1_3)+EndTurn_0_3)+EndTurn_4_2)+EndTurn_3_2)+EndTurn_2_2)+EndTurn_1_2)+EndTurn_0_2)+EndTurn_4_1)+EndTurn_4_3)+EndTurn_3_3)+EndTurn_2_3)>=1)"))&&("((((((((((((((((((((AskForSection_3_3+AskForSection_4_3)+AskForSection_1_3)+AskForSection_2_3)+AskForSection_4_2)+AskForSection_0_3)+AskForSection_2_2)+AskForSection_3_2)+AskForSection_0_2)+AskForSection_1_2)+AskForSection_3_1)+AskForSection_4_1)+AskForSection_1_1)+AskForSection_2_1)+AskForSection_0_1)+AskForSection_4_0)+AskForSection_3_0)+AskForSection_2_0)+AskForSection_1_0)+AskForSection_0_0)>(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((IsEndLoop_0_0_0+IsEndLoop_1_0_0)+IsEndLoop_2_0_0)+IsEndLoop_3_0_0)+IsEndLoop_4_0_0)+IsEndLoop_0_1_0)+IsEndLoop_1_1_0)+IsEndLoop_2_1_0)+IsEndLoop_3_1_0)+IsEndLoop_4_1_0)+IsEndLoop_0_2_0)+IsEndLoop_1_2_0)+IsEndLoop_2_2_0)+IsEndLoop_4_2_0)+IsEndLoop_3_2_0)+IsEndLoop_1_3_0)+IsEndLoop_0_3_0)+IsEndLoop_3_3_0)+IsEndLoop_2_3_0)+IsEndLoop_0_0_1)+IsEndLoop_4_3_0)+IsEndLoop_2_0_1)+IsEndLoop_1_0_1)+IsEndLoop_4_0_1)+IsEndLoop_3_0_1)+IsEndLoop_1_1_1)+IsEndLoop_0_1_1)+IsEndLoop_3_1_1)+IsEndLoop_2_1_1)+IsEndLoop_1_2_1)+IsEndLoop_2_2_1)+IsEndLoop_4_1_1)+IsEndLoop_0_2_1)+IsEndLoop_0_3_1)+IsEndLoop_1_3_1)+IsEndLoop_3_2_1)+IsEndLoop_4_2_1)+IsEndLoop_4_3_1)+IsEndLoop_0_0_2)+IsEndLoop_2_3_1)+IsEndLoop_3_3_1)+IsEndLoop_3_0_2)+IsEndLoop_4_0_2)+IsEndLoop_1_0_2)+IsEndLoop_2_0_2)+IsEndLoop_3_1_2)+IsEndLoop_2_1_2)+IsEndLoop_1_1_2)+IsEndLoop_0_1_2)+IsEndLoop_2_2_2)+IsEndLoop_1_2_2)+IsEndLoop_0_2_2)+IsEndLoop_4_1_2)+IsEndLoop_1_3_2)+IsEndLoop_0_3_2)+IsEndLoop_4_2_2)+IsEndLoop_3_2_2)+IsEndLoop_0_0_3)+IsEndLoop_4_3_2)+IsEndLoop_3_3_2)+IsEndLoop_2_3_2)+IsEndLoop_0_1_3)+IsEndLoop_1_1_3)+IsEndLoop_2_1_3)+IsEndLoop_3_1_3)+IsEndLoop_1_0_3)+IsEndLoop_2_0_3)+IsEndLoop_3_0_3)+IsEndLoop_4_0_3)+IsEndLoop_3_2_3)+IsEndLoop_4_2_3)+IsEndLoop_0_3_3)+IsEndLoop_1_3_3)+IsEndLoop_4_1_3)+IsEndLoop_0_2_3)+IsEndLoop_1_2_3)+IsEndLoop_2_2_3)+IsEndLoop_2_0_4)+IsEndLoop_1_0_4)+IsEndLoop_4_0_4)+IsEndLoop_3_0_4)+IsEndLoop_3_3_3)+IsEndLoop_2_3_3)+IsEndLoop_0_0_4)+IsEndLoop_4_3_3)+IsEndLoop_0_2_4)+IsEndLoop_4_1_4)+IsEndLoop_2_2_4)+IsEndLoop_1_2_4)+IsEndLoop_1_1_4)+IsEndLoop_0_1_4)+IsEndLoop_3_1_4)+IsEndLoop_2_1_4)+IsEndLoop_4_3_4)+IsEndLoop_2_3_4)+IsEndLoop_3_3_4)+IsEndLoop_0_3_4)+IsEndLoop_1_3_4)+IsEndLoop_3_2_4)+IsEndLoop_4_2_4))")))))
Formula 0 simplified : !F("((((((((((((((((((((EndTurn_0_0+EndTurn_2_1)+EndTurn_3_1)+EndTurn_0_1)+EndTurn_1_1)+EndTurn_3_0)+EndTurn_4_0)+EndTurn_1_0)+EndTurn_2_0)+EndTurn_1_3)+EndTurn_0_3)+EndTurn_4_2)+EndTurn_3_2)+EndTurn_2_2)+EndTurn_1_2)+EndTurn_0_2)+EndTurn_4_1)+EndTurn_4_3)+EndTurn_3_3)+EndTurn_2_3)>=1)" | ("((((((((((((((((((((AskForSection_3_3+AskForSection_4_3)+AskForSection_1_3)+AskForSection_2_3)+AskForSection_4_2)+AskForSection_0_3)+AskForSection_2_2)+AskForSection_3_2)+AskForSection_0_2)+AskForSection_1_2)+AskForSection_3_1)+AskForSection_4_1)+AskForSection_1_1)+AskForSection_2_1)+AskForSection_0_1)+AskForSection_4_0)+AskForSection_3_0)+AskForSection_2_0)+AskForSection_1_0)+AskForSection_0_0)>(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((IsEndLoop_0_0_0+IsEndLoop_1_0_0)+IsEndLoop_2_0_0)+IsEndLoop_3_0_0)+IsEndLoop_4_0_0)+IsEndLoop_0_1_0)+IsEndLoop_1_1_0)+IsEndLoop_2_1_0)+IsEndLoop_3_1_0)+IsEndLoop_4_1_0)+IsEndLoop_0_2_0)+IsEndLoop_1_2_0)+IsEndLoop_2_2_0)+IsEndLoop_4_2_0)+IsEndLoop_3_2_0)+IsEndLoop_1_3_0)+IsEndLoop_0_3_0)+IsEndLoop_3_3_0)+IsEndLoop_2_3_0)+IsEndLoop_0_0_1)+IsEndLoop_4_3_0)+IsEndLoop_2_0_1)+IsEndLoop_1_0_1)+IsEndLoop_4_0_1)+IsEndLoop_3_0_1)+IsEndLoop_1_1_1)+IsEndLoop_0_1_1)+IsEndLoop_3_1_1)+IsEndLoop_2_1_1)+IsEndLoop_1_2_1)+IsEndLoop_2_2_1)+IsEndLoop_4_1_1)+IsEndLoop_0_2_1)+IsEndLoop_0_3_1)+IsEndLoop_1_3_1)+IsEndLoop_3_2_1)+IsEndLoop_4_2_1)+IsEndLoop_4_3_1)+IsEndLoop_0_0_2)+IsEndLoop_2_3_1)+IsEndLoop_3_3_1)+IsEndLoop_3_0_2)+IsEndLoop_4_0_2)+IsEndLoop_1_0_2)+IsEndLoop_2_0_2)+IsEndLoop_3_1_2)+IsEndLoop_2_1_2)+IsEndLoop_1_1_2)+IsEndLoop_0_1_2)+IsEndLoop_2_2_2)+IsEndLoop_1_2_2)+IsEndLoop_0_2_2)+IsEndLoop_4_1_2)+IsEndLoop_1_3_2)+IsEndLoop_0_3_2)+IsEndLoop_4_2_2)+IsEndLoop_3_2_2)+IsEndLoop_0_0_3)+IsEndLoop_4_3_2)+IsEndLoop_3_3_2)+IsEndLoop_2_3_2)+IsEndLoop_0_1_3)+IsEndLoop_1_1_3)+IsEndLoop_2_1_3)+IsEndLoop_3_1_3)+IsEndLoop_1_0_3)+IsEndLoop_2_0_3)+IsEndLoop_3_0_3)+IsEndLoop_4_0_3)+IsEndLoop_3_2_3)+IsEndLoop_4_2_3)+IsEndLoop_0_3_3)+IsEndLoop_1_3_3)+IsEndLoop_4_1_3)+IsEndLoop_0_2_3)+IsEndLoop_1_2_3)+IsEndLoop_2_2_3)+IsEndLoop_2_0_4)+IsEndLoop_1_0_4)+IsEndLoop_4_0_4)+IsEndLoop_3_0_4)+IsEndLoop_3_3_3)+IsEndLoop_2_3_3)+IsEndLoop_0_0_4)+IsEndLoop_4_3_3)+IsEndLoop_0_2_4)+IsEndLoop_4_1_4)+IsEndLoop_2_2_4)+IsEndLoop_1_2_4)+IsEndLoop_1_1_4)+IsEndLoop_0_1_4)+IsEndLoop_3_1_4)+IsEndLoop_2_1_4)+IsEndLoop_4_3_4)+IsEndLoop_2_3_4)+IsEndLoop_3_3_4)+IsEndLoop_0_3_4)+IsEndLoop_1_3_4)+IsEndLoop_3_2_4)+IsEndLoop_4_2_4))" & F"((((((((((((((((((((EndTurn_0_0+EndTurn_2_1)+EndTurn_3_1)+EndTurn_0_1)+EndTurn_1_1)+EndTurn_3_0)+EndTurn_4_0)+EndTurn_1_0)+EndTurn_2_0)+EndTurn_1_3)+EndTurn_0_3)+EndTurn_4_2)+EndTurn_3_2)+EndTurn_2_2)+EndTurn_1_2)+EndTurn_0_2)+EndTurn_4_1)+EndTurn_4_3)+EndTurn_3_3)+EndTurn_2_3)>=1)"))
Detected timeout of ITS tools.
[2020-05-21 01:51:40] [INFO ] Flatten gal took : 592 ms
[2020-05-21 01:51:41] [INFO ] Input system was already deterministic with 690 transitions.
[2020-05-21 01:51:41] [INFO ] Transformed 480 places.
[2020-05-21 01:51:41] [INFO ] Transformed 690 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//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//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
[2020-05-21 01:51:41] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 10 ms
[2020-05-21 01:51:41] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 7 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 10 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("((((((((((((((((((((EndTurn_0_0+EndTurn_2_1)+EndTurn_3_1)+EndTurn_0_1)+EndTurn_1_1)+EndTurn_3_0)+EndTurn_4_0)+EndTurn_1_0)+EndTurn_2_0)+EndTurn_1_3)+EndTurn_0_3)+EndTurn_4_2)+EndTurn_3_2)+EndTurn_2_2)+EndTurn_1_2)+EndTurn_0_2)+EndTurn_4_1)+EndTurn_4_3)+EndTurn_3_3)+EndTurn_2_3)>=1)")||((F("((((((((((((((((((((EndTurn_0_0+EndTurn_2_1)+EndTurn_3_1)+EndTurn_0_1)+EndTurn_1_1)+EndTurn_3_0)+EndTurn_4_0)+EndTurn_1_0)+EndTurn_2_0)+EndTurn_1_3)+EndTurn_0_3)+EndTurn_4_2)+EndTurn_3_2)+EndTurn_2_2)+EndTurn_1_2)+EndTurn_0_2)+EndTurn_4_1)+EndTurn_4_3)+EndTurn_3_3)+EndTurn_2_3)>=1)"))&&("((((((((((((((((((((AskForSection_3_3+AskForSection_4_3)+AskForSection_1_3)+AskForSection_2_3)+AskForSection_4_2)+AskForSection_0_3)+AskForSection_2_2)+AskForSection_3_2)+AskForSection_0_2)+AskForSection_1_2)+AskForSection_3_1)+AskForSection_4_1)+AskForSection_1_1)+AskForSection_2_1)+AskForSection_0_1)+AskForSection_4_0)+AskForSection_3_0)+AskForSection_2_0)+AskForSection_1_0)+AskForSection_0_0)>(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((IsEndLoop_0_0_0+IsEndLoop_1_0_0)+IsEndLoop_2_0_0)+IsEndLoop_3_0_0)+IsEndLoop_4_0_0)+IsEndLoop_0_1_0)+IsEndLoop_1_1_0)+IsEndLoop_2_1_0)+IsEndLoop_3_1_0)+IsEndLoop_4_1_0)+IsEndLoop_0_2_0)+IsEndLoop_1_2_0)+IsEndLoop_2_2_0)+IsEndLoop_4_2_0)+IsEndLoop_3_2_0)+IsEndLoop_1_3_0)+IsEndLoop_0_3_0)+IsEndLoop_3_3_0)+IsEndLoop_2_3_0)+IsEndLoop_0_0_1)+IsEndLoop_4_3_0)+IsEndLoop_2_0_1)+IsEndLoop_1_0_1)+IsEndLoop_4_0_1)+IsEndLoop_3_0_1)+IsEndLoop_1_1_1)+IsEndLoop_0_1_1)+IsEndLoop_3_1_1)+IsEndLoop_2_1_1)+IsEndLoop_1_2_1)+IsEndLoop_2_2_1)+IsEndLoop_4_1_1)+IsEndLoop_0_2_1)+IsEndLoop_0_3_1)+IsEndLoop_1_3_1)+IsEndLoop_3_2_1)+IsEndLoop_4_2_1)+IsEndLoop_4_3_1)+IsEndLoop_0_0_2)+IsEndLoop_2_3_1)+IsEndLoop_3_3_1)+IsEndLoop_3_0_2)+IsEndLoop_4_0_2)+IsEndLoop_1_0_2)+IsEndLoop_2_0_2)+IsEndLoop_3_1_2)+IsEndLoop_2_1_2)+IsEndLoop_1_1_2)+IsEndLoop_0_1_2)+IsEndLoop_2_2_2)+IsEndLoop_1_2_2)+IsEndLoop_0_2_2)+IsEndLoop_4_1_2)+IsEndLoop_1_3_2)+IsEndLoop_0_3_2)+IsEndLoop_4_2_2)+IsEndLoop_3_2_2)+IsEndLoop_0_0_3)+IsEndLoop_4_3_2)+IsEndLoop_3_3_2)+IsEndLoop_2_3_2)+IsEndLoop_0_1_3)+IsEndLoop_1_1_3)+IsEndLoop_2_1_3)+IsEndLoop_3_1_3)+IsEndLoop_1_0_3)+IsEndLoop_2_0_3)+IsEndLoop_3_0_3)+IsEndLoop_4_0_3)+IsEndLoop_3_2_3)+IsEndLoop_4_2_3)+IsEndLoop_0_3_3)+IsEndLoop_1_3_3)+IsEndLoop_4_1_3)+IsEndLoop_0_2_3)+IsEndLoop_1_2_3)+IsEndLoop_2_2_3)+IsEndLoop_2_0_4)+IsEndLoop_1_0_4)+IsEndLoop_4_0_4)+IsEndLoop_3_0_4)+IsEndLoop_3_3_3)+IsEndLoop_2_3_3)+IsEndLoop_0_0_4)+IsEndLoop_4_3_3)+IsEndLoop_0_2_4)+IsEndLoop_4_1_4)+IsEndLoop_2_2_4)+IsEndLoop_1_2_4)+IsEndLoop_1_1_4)+IsEndLoop_0_1_4)+IsEndLoop_3_1_4)+IsEndLoop_2_1_4)+IsEndLoop_4_3_4)+IsEndLoop_2_3_4)+IsEndLoop_3_3_4)+IsEndLoop_0_3_4)+IsEndLoop_1_3_4)+IsEndLoop_3_2_4)+IsEndLoop_4_2_4))")))))
Formula 0 simplified : !F("((((((((((((((((((((EndTurn_0_0+EndTurn_2_1)+EndTurn_3_1)+EndTurn_0_1)+EndTurn_1_1)+EndTurn_3_0)+EndTurn_4_0)+EndTurn_1_0)+EndTurn_2_0)+EndTurn_1_3)+EndTurn_0_3)+EndTurn_4_2)+EndTurn_3_2)+EndTurn_2_2)+EndTurn_1_2)+EndTurn_0_2)+EndTurn_4_1)+EndTurn_4_3)+EndTurn_3_3)+EndTurn_2_3)>=1)" | ("((((((((((((((((((((AskForSection_3_3+AskForSection_4_3)+AskForSection_1_3)+AskForSection_2_3)+AskForSection_4_2)+AskForSection_0_3)+AskForSection_2_2)+AskForSection_3_2)+AskForSection_0_2)+AskForSection_1_2)+AskForSection_3_1)+AskForSection_4_1)+AskForSection_1_1)+AskForSection_2_1)+AskForSection_0_1)+AskForSection_4_0)+AskForSection_3_0)+AskForSection_2_0)+AskForSection_1_0)+AskForSection_0_0)>(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((IsEndLoop_0_0_0+IsEndLoop_1_0_0)+IsEndLoop_2_0_0)+IsEndLoop_3_0_0)+IsEndLoop_4_0_0)+IsEndLoop_0_1_0)+IsEndLoop_1_1_0)+IsEndLoop_2_1_0)+IsEndLoop_3_1_0)+IsEndLoop_4_1_0)+IsEndLoop_0_2_0)+IsEndLoop_1_2_0)+IsEndLoop_2_2_0)+IsEndLoop_4_2_0)+IsEndLoop_3_2_0)+IsEndLoop_1_3_0)+IsEndLoop_0_3_0)+IsEndLoop_3_3_0)+IsEndLoop_2_3_0)+IsEndLoop_0_0_1)+IsEndLoop_4_3_0)+IsEndLoop_2_0_1)+IsEndLoop_1_0_1)+IsEndLoop_4_0_1)+IsEndLoop_3_0_1)+IsEndLoop_1_1_1)+IsEndLoop_0_1_1)+IsEndLoop_3_1_1)+IsEndLoop_2_1_1)+IsEndLoop_1_2_1)+IsEndLoop_2_2_1)+IsEndLoop_4_1_1)+IsEndLoop_0_2_1)+IsEndLoop_0_3_1)+IsEndLoop_1_3_1)+IsEndLoop_3_2_1)+IsEndLoop_4_2_1)+IsEndLoop_4_3_1)+IsEndLoop_0_0_2)+IsEndLoop_2_3_1)+IsEndLoop_3_3_1)+IsEndLoop_3_0_2)+IsEndLoop_4_0_2)+IsEndLoop_1_0_2)+IsEndLoop_2_0_2)+IsEndLoop_3_1_2)+IsEndLoop_2_1_2)+IsEndLoop_1_1_2)+IsEndLoop_0_1_2)+IsEndLoop_2_2_2)+IsEndLoop_1_2_2)+IsEndLoop_0_2_2)+IsEndLoop_4_1_2)+IsEndLoop_1_3_2)+IsEndLoop_0_3_2)+IsEndLoop_4_2_2)+IsEndLoop_3_2_2)+IsEndLoop_0_0_3)+IsEndLoop_4_3_2)+IsEndLoop_3_3_2)+IsEndLoop_2_3_2)+IsEndLoop_0_1_3)+IsEndLoop_1_1_3)+IsEndLoop_2_1_3)+IsEndLoop_3_1_3)+IsEndLoop_1_0_3)+IsEndLoop_2_0_3)+IsEndLoop_3_0_3)+IsEndLoop_4_0_3)+IsEndLoop_3_2_3)+IsEndLoop_4_2_3)+IsEndLoop_0_3_3)+IsEndLoop_1_3_3)+IsEndLoop_4_1_3)+IsEndLoop_0_2_3)+IsEndLoop_1_2_3)+IsEndLoop_2_2_3)+IsEndLoop_2_0_4)+IsEndLoop_1_0_4)+IsEndLoop_4_0_4)+IsEndLoop_3_0_4)+IsEndLoop_3_3_3)+IsEndLoop_2_3_3)+IsEndLoop_0_0_4)+IsEndLoop_4_3_3)+IsEndLoop_0_2_4)+IsEndLoop_4_1_4)+IsEndLoop_2_2_4)+IsEndLoop_1_2_4)+IsEndLoop_1_1_4)+IsEndLoop_0_1_4)+IsEndLoop_3_1_4)+IsEndLoop_2_1_4)+IsEndLoop_4_3_4)+IsEndLoop_2_3_4)+IsEndLoop_3_3_4)+IsEndLoop_0_3_4)+IsEndLoop_1_3_4)+IsEndLoop_3_2_4)+IsEndLoop_4_2_4))" & F"((((((((((((((((((((EndTurn_0_0+EndTurn_2_1)+EndTurn_3_1)+EndTurn_0_1)+EndTurn_1_1)+EndTurn_3_0)+EndTurn_4_0)+EndTurn_1_0)+EndTurn_2_0)+EndTurn_1_3)+EndTurn_0_3)+EndTurn_4_2)+EndTurn_3_2)+EndTurn_2_2)+EndTurn_1_2)+EndTurn_0_2)+EndTurn_4_1)+EndTurn_4_3)+EndTurn_3_3)+EndTurn_2_3)>=1)"))

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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-4"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Peterson-PT-4, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961258100721"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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