fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r051-ebro-158902545900271
Last Updated
Jun 28, 2020

About the Execution of ITS-Tools for DES-PT-20b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15743.120 292155.00 382857.00 364.30 FTFTTFTFTFTFTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r051-ebro-158902545900271.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-20b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902545900271
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 3.9K Mar 30 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 30 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 27 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 26 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 91K Mar 24 05:37 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 DES-PT-20b-ReachabilityFireability-00
FORMULA_NAME DES-PT-20b-ReachabilityFireability-01
FORMULA_NAME DES-PT-20b-ReachabilityFireability-02
FORMULA_NAME DES-PT-20b-ReachabilityFireability-03
FORMULA_NAME DES-PT-20b-ReachabilityFireability-04
FORMULA_NAME DES-PT-20b-ReachabilityFireability-05
FORMULA_NAME DES-PT-20b-ReachabilityFireability-06
FORMULA_NAME DES-PT-20b-ReachabilityFireability-07
FORMULA_NAME DES-PT-20b-ReachabilityFireability-08
FORMULA_NAME DES-PT-20b-ReachabilityFireability-09
FORMULA_NAME DES-PT-20b-ReachabilityFireability-10
FORMULA_NAME DES-PT-20b-ReachabilityFireability-11
FORMULA_NAME DES-PT-20b-ReachabilityFireability-12
FORMULA_NAME DES-PT-20b-ReachabilityFireability-13
FORMULA_NAME DES-PT-20b-ReachabilityFireability-14
FORMULA_NAME DES-PT-20b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1589542989087

[2020-05-15 11:43:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -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-15 11:43:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 11:43:13] [INFO ] Load time of PNML (sax parser for PT used): 155 ms
[2020-05-15 11:43:13] [INFO ] Transformed 360 places.
[2020-05-15 11:43:13] [INFO ] Transformed 311 transitions.
[2020-05-15 11:43:13] [INFO ] Found NUPN structural information;
[2020-05-15 11:43:13] [INFO ] Parsed PT model containing 360 places and 311 transitions in 247 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 57 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 86 resets, run finished after 148 ms. (steps per millisecond=67 ) properties seen :[0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0]
FORMULA DES-PT-20b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-20b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 39 ms. (steps per millisecond=256 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DES-PT-20b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 58 ms. (steps per millisecond=172 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 73 ms. (steps per millisecond=136 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 97 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 311 rows 360 cols
[2020-05-15 11:43:14] [INFO ] Computed 65 place invariants in 49 ms
[2020-05-15 11:43:14] [INFO ] [Real]Absence check using 39 positive place invariants in 68 ms returned sat
[2020-05-15 11:43:14] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 48 ms returned sat
[2020-05-15 11:43:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:15] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2020-05-15 11:43:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:43:16] [INFO ] [Nat]Absence check using 39 positive place invariants in 83 ms returned sat
[2020-05-15 11:43:16] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 75 ms returned sat
[2020-05-15 11:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:17] [INFO ] [Nat]Absence check using state equation in 1083 ms returned sat
[2020-05-15 11:43:17] [INFO ] Deduced a trap composed of 13 places in 239 ms
[2020-05-15 11:43:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 371 ms
[2020-05-15 11:43:17] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 51 ms.
[2020-05-15 11:43:20] [INFO ] Added : 235 causal constraints over 47 iterations in 3296 ms. Result :unknown
[2020-05-15 11:43:21] [INFO ] [Real]Absence check using 39 positive place invariants in 215 ms returned sat
[2020-05-15 11:43:21] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 52 ms returned sat
[2020-05-15 11:43:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:22] [INFO ] [Real]Absence check using state equation in 1324 ms returned sat
[2020-05-15 11:43:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:43:22] [INFO ] [Nat]Absence check using 39 positive place invariants in 64 ms returned sat
[2020-05-15 11:43:22] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 61 ms returned sat
[2020-05-15 11:43:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:23] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2020-05-15 11:43:24] [INFO ] Deduced a trap composed of 8 places in 458 ms
[2020-05-15 11:43:24] [INFO ] Deduced a trap composed of 35 places in 312 ms
[2020-05-15 11:43:25] [INFO ] Deduced a trap composed of 29 places in 287 ms
[2020-05-15 11:43:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1271 ms
[2020-05-15 11:43:25] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 37 ms.
[2020-05-15 11:43:27] [INFO ] Added : 200 causal constraints over 40 iterations in 2599 ms. Result :(error "Failed to check-sat")
[2020-05-15 11:43:27] [INFO ] [Real]Absence check using 39 positive place invariants in 44 ms returned sat
[2020-05-15 11:43:27] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 92 ms returned sat
[2020-05-15 11:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:29] [INFO ] [Real]Absence check using state equation in 1537 ms returned sat
[2020-05-15 11:43:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:43:29] [INFO ] [Nat]Absence check using 39 positive place invariants in 88 ms returned sat
[2020-05-15 11:43:29] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 105 ms returned sat
[2020-05-15 11:43:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:30] [INFO ] [Nat]Absence check using state equation in 1098 ms returned sat
[2020-05-15 11:43:31] [INFO ] Deduced a trap composed of 15 places in 278 ms
[2020-05-15 11:43:31] [INFO ] Deduced a trap composed of 9 places in 265 ms
[2020-05-15 11:43:31] [INFO ] Deduced a trap composed of 33 places in 83 ms
[2020-05-15 11:43:31] [INFO ] Deduced a trap composed of 21 places in 78 ms
[2020-05-15 11:43:31] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 885 ms
[2020-05-15 11:43:31] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 35 ms.
[2020-05-15 11:43:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t229 0) (and (and (> t167 0) (< o167 o229)) (or (and (> t138 0) (< o138 o229)) (and (> t141 0) (< o141 o229)))))") while checking expression at index 2
[2020-05-15 11:43:34] [INFO ] [Real]Absence check using 39 positive place invariants in 47 ms returned sat
[2020-05-15 11:43:34] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 36 ms returned sat
[2020-05-15 11:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:35] [INFO ] [Real]Absence check using state equation in 1248 ms returned sat
[2020-05-15 11:43:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:43:36] [INFO ] [Nat]Absence check using 39 positive place invariants in 66 ms returned sat
[2020-05-15 11:43:36] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 58 ms returned sat
[2020-05-15 11:43:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:37] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2020-05-15 11:43:37] [INFO ] Deduced a trap composed of 16 places in 137 ms
[2020-05-15 11:43:37] [INFO ] Deduced a trap composed of 10 places in 88 ms
[2020-05-15 11:43:37] [INFO ] Deduced a trap composed of 14 places in 108 ms
[2020-05-15 11:43:37] [INFO ] Deduced a trap composed of 12 places in 87 ms
[2020-05-15 11:43:37] [INFO ] Deduced a trap composed of 12 places in 79 ms
[2020-05-15 11:43:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 795 ms
[2020-05-15 11:43:38] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 120 ms.
[2020-05-15 11:43:41] [INFO ] Added : 200 causal constraints over 40 iterations in 3023 ms. Result :(error "Failed to check-sat")
[2020-05-15 11:43:41] [INFO ] [Real]Absence check using 39 positive place invariants in 43 ms returned sat
[2020-05-15 11:43:41] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2020-05-15 11:43:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:42] [INFO ] [Real]Absence check using state equation in 922 ms returned sat
[2020-05-15 11:43:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:43:42] [INFO ] [Nat]Absence check using 39 positive place invariants in 65 ms returned sat
[2020-05-15 11:43:42] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 33 ms returned sat
[2020-05-15 11:43:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:43] [INFO ] [Nat]Absence check using state equation in 771 ms returned sat
[2020-05-15 11:43:44] [INFO ] Deduced a trap composed of 8 places in 1044 ms
[2020-05-15 11:43:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1099 ms
[2020-05-15 11:43:44] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 106 ms.
[2020-05-15 11:43:47] [INFO ] Added : 140 causal constraints over 28 iterations in 2935 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-15 11:43:47] [INFO ] [Real]Absence check using 39 positive place invariants in 193 ms returned sat
[2020-05-15 11:43:47] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 284 ms returned sat
[2020-05-15 11:43:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:49] [INFO ] [Real]Absence check using state equation in 1465 ms returned sat
[2020-05-15 11:43:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:43:49] [INFO ] [Nat]Absence check using 39 positive place invariants in 80 ms returned sat
[2020-05-15 11:43:49] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 208 ms returned sat
[2020-05-15 11:43:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:51] [INFO ] [Nat]Absence check using state equation in 1975 ms returned sat
[2020-05-15 11:43:51] [INFO ] Deduced a trap composed of 30 places in 112 ms
[2020-05-15 11:43:52] [INFO ] Deduced a trap composed of 35 places in 201 ms
[2020-05-15 11:43:52] [INFO ] Deduced a trap composed of 33 places in 87 ms
[2020-05-15 11:43:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 560 ms
[2020-05-15 11:43:52] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 37 ms.
[2020-05-15 11:43:54] [INFO ] Added : 160 causal constraints over 32 iterations in 2101 ms. Result :(error "Failed to check-sat")
[2020-05-15 11:43:54] [INFO ] [Real]Absence check using 39 positive place invariants in 135 ms returned sat
[2020-05-15 11:43:54] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 99 ms returned sat
[2020-05-15 11:43:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:55] [INFO ] [Real]Absence check using state equation in 1108 ms returned sat
[2020-05-15 11:43:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:43:56] [INFO ] [Nat]Absence check using 39 positive place invariants in 85 ms returned sat
[2020-05-15 11:43:56] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 67 ms returned sat
[2020-05-15 11:43:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:43:57] [INFO ] [Nat]Absence check using state equation in 1301 ms returned sat
[2020-05-15 11:43:57] [INFO ] Deduced a trap composed of 14 places in 183 ms
[2020-05-15 11:43:57] [INFO ] Deduced a trap composed of 16 places in 302 ms
[2020-05-15 11:43:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 593 ms
[2020-05-15 11:43:58] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 136 ms.
[2020-05-15 11:44:00] [INFO ] Added : 210 causal constraints over 42 iterations in 2870 ms. Result :unknown
[2020-05-15 11:44:01] [INFO ] [Real]Absence check using 39 positive place invariants in 41 ms returned sat
[2020-05-15 11:44:01] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 39 ms returned sat
[2020-05-15 11:44:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:44:02] [INFO ] [Real]Absence check using state equation in 1145 ms returned sat
[2020-05-15 11:44:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:44:02] [INFO ] [Nat]Absence check using 39 positive place invariants in 101 ms returned sat
[2020-05-15 11:44:02] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 63 ms returned sat
[2020-05-15 11:44:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:44:03] [INFO ] [Nat]Absence check using state equation in 883 ms returned sat
[2020-05-15 11:44:03] [INFO ] Deduced a trap composed of 18 places in 258 ms
[2020-05-15 11:44:04] [INFO ] Deduced a trap composed of 9 places in 154 ms
[2020-05-15 11:44:04] [INFO ] Deduced a trap composed of 39 places in 158 ms
[2020-05-15 11:44:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 714 ms
[2020-05-15 11:44:04] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 35 ms.
[2020-05-15 11:44:07] [INFO ] Added : 210 causal constraints over 42 iterations in 2884 ms. Result :(error "Failed to check-sat")
[2020-05-15 11:44:07] [INFO ] [Real]Absence check using 39 positive place invariants in 161 ms returned sat
[2020-05-15 11:44:07] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 24 ms returned unsat
[2020-05-15 11:44:07] [INFO ] [Real]Absence check using 39 positive place invariants in 76 ms returned sat
[2020-05-15 11:44:08] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 130 ms returned sat
[2020-05-15 11:44:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:44:09] [INFO ] [Real]Absence check using state equation in 1268 ms returned sat
[2020-05-15 11:44:09] [INFO ] Deduced a trap composed of 7 places in 262 ms
[2020-05-15 11:44:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2020-05-15 11:44:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:44:09] [INFO ] [Nat]Absence check using 39 positive place invariants in 78 ms returned sat
[2020-05-15 11:44:09] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 71 ms returned sat
[2020-05-15 11:44:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:44:11] [INFO ] [Nat]Absence check using state equation in 1338 ms returned sat
[2020-05-15 11:44:11] [INFO ] Deduced a trap composed of 12 places in 572 ms
[2020-05-15 11:44:12] [INFO ] Deduced a trap composed of 20 places in 229 ms
[2020-05-15 11:44:12] [INFO ] Deduced a trap composed of 16 places in 223 ms
[2020-05-15 11:44:12] [INFO ] Deduced a trap composed of 8 places in 202 ms
[2020-05-15 11:44:12] [INFO ] Deduced a trap composed of 15 places in 103 ms
[2020-05-15 11:44:13] [INFO ] Deduced a trap composed of 17 places in 131 ms
[2020-05-15 11:44:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1760 ms
[2020-05-15 11:44:13] [INFO ] Computed and/alt/rep : 310/700/310 causal constraints in 37 ms.
[2020-05-15 11:44:14] [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 (=> (> t169 0) (and (> t168 0) (< o168 o169)))") while checking expression at index 9
FORMULA DES-PT-20b-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 304500 steps, including 3172 resets, run finished after 1718 ms. (steps per millisecond=177 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 210100 steps, including 2181 resets, run finished after 992 ms. (steps per millisecond=211 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 61 out of 360 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 360/360 places, 311/311 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 741 edges and 360 vertex of which 349 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.20 ms
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 349 transition count 293
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 337 transition count 293
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 26 place count 337 transition count 286
Deduced a syphon composed of 7 places in 5 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 40 place count 330 transition count 286
Symmetric choice reduction at 2 with 15 rule applications. Total rules 55 place count 330 transition count 286
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 15 places and 15 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 85 place count 315 transition count 271
Symmetric choice reduction at 2 with 10 rule applications. Total rules 95 place count 315 transition count 271
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 10 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 115 place count 305 transition count 261
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 124 place count 305 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 125 place count 304 transition count 252
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 2 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 227 place count 253 transition count 201
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 235 place count 253 transition count 193
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 243 place count 245 transition count 193
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 245 place count 245 transition count 193
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 245 transition count 192
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 247 place count 244 transition count 191
Applied a total of 247 rules in 405 ms. Remains 244 /360 variables (removed 116) and now considering 191/311 (removed 120) transitions.
Finished structural reductions, in 1 iterations. Remains : 244/360 places, 191/311 transitions.
Incomplete random walk after 1000000 steps, including 15421 resets, run finished after 4609 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3100 resets, run finished after 2515 ms. (steps per millisecond=397 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3188 resets, run finished after 2360 ms. (steps per millisecond=423 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 3157 resets, run finished after 2130 ms. (steps per millisecond=469 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2879 resets, run finished after 1700 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3715 resets, run finished after 1782 ms. (steps per millisecond=561 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2780 resets, run finished after 2367 ms. (steps per millisecond=422 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2796 resets, run finished after 2554 ms. (steps per millisecond=391 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA DES-PT-20b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 2786 resets, run finished after 1879 ms. (steps per millisecond=532 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3716 resets, run finished after 2367 ms. (steps per millisecond=422 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 191 rows 244 cols
[2020-05-15 11:44:42] [INFO ] Computed 60 place invariants in 31 ms
[2020-05-15 11:44:42] [INFO ] [Real]Absence check using 34 positive place invariants in 31 ms returned sat
[2020-05-15 11:44:42] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 33 ms returned sat
[2020-05-15 11:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:44:43] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2020-05-15 11:44:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:44:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 71 ms returned sat
[2020-05-15 11:44:44] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 350 ms returned sat
[2020-05-15 11:44:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:44:45] [INFO ] [Nat]Absence check using state equation in 1156 ms returned sat
[2020-05-15 11:44:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-15 11:44:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2020-05-15 11:44:45] [INFO ] Computed and/alt/rep : 190/608/190 causal constraints in 43 ms.
[2020-05-15 11:44:47] [INFO ] Added : 169 causal constraints over 34 iterations in 2068 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 53 ms.
[2020-05-15 11:44:47] [INFO ] [Real]Absence check using 34 positive place invariants in 39 ms returned sat
[2020-05-15 11:44:47] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 58 ms returned sat
[2020-05-15 11:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:44:48] [INFO ] [Real]Absence check using state equation in 739 ms returned sat
[2020-05-15 11:44:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:44:48] [INFO ] [Nat]Absence check using 34 positive place invariants in 71 ms returned sat
[2020-05-15 11:44:48] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 166 ms returned sat
[2020-05-15 11:44:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:44:49] [INFO ] [Nat]Absence check using state equation in 938 ms returned sat
[2020-05-15 11:44:49] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2020-05-15 11:44:50] [INFO ] Computed and/alt/rep : 190/608/190 causal constraints in 38 ms.
[2020-05-15 11:44:51] [INFO ] Added : 188 causal constraints over 38 iterations in 1857 ms. Result :sat
[2020-05-15 11:44:52] [INFO ] Deduced a trap composed of 20 places in 134 ms
[2020-05-15 11:44:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-05-15 11:44:52] [INFO ] [Real]Absence check using 34 positive place invariants in 63 ms returned sat
[2020-05-15 11:44:52] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 66 ms returned sat
[2020-05-15 11:44:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:44:53] [INFO ] [Real]Absence check using state equation in 912 ms returned sat
[2020-05-15 11:44:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:44:53] [INFO ] [Nat]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-05-15 11:44:53] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 37 ms returned sat
[2020-05-15 11:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:44:54] [INFO ] [Nat]Absence check using state equation in 859 ms returned sat
[2020-05-15 11:44:54] [INFO ] [Nat]Added 1 Read/Feed constraints in 19 ms returned sat
[2020-05-15 11:44:54] [INFO ] Computed and/alt/rep : 190/608/190 causal constraints in 75 ms.
[2020-05-15 11:44:56] [INFO ] Added : 164 causal constraints over 33 iterations in 2180 ms. Result :sat
[2020-05-15 11:44:56] [INFO ] Deduced a trap composed of 28 places in 83 ms
[2020-05-15 11:44:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
Attempting to minimize the solution found.
Minimization took 48 ms.
[2020-05-15 11:44:57] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2020-05-15 11:44:57] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 29 ms returned sat
[2020-05-15 11:44:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:44:57] [INFO ] [Real]Absence check using state equation in 442 ms returned sat
[2020-05-15 11:44:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:44:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-05-15 11:44:57] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 41 ms returned sat
[2020-05-15 11:44:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:44:58] [INFO ] [Nat]Absence check using state equation in 961 ms returned sat
[2020-05-15 11:44:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 35 ms returned sat
[2020-05-15 11:44:58] [INFO ] Deduced a trap composed of 21 places in 95 ms
[2020-05-15 11:44:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2020-05-15 11:44:59] [INFO ] Computed and/alt/rep : 190/608/190 causal constraints in 86 ms.
[2020-05-15 11:45:00] [INFO ] Added : 110 causal constraints over 22 iterations in 1102 ms. Result :unsat
[2020-05-15 11:45:00] [INFO ] [Real]Absence check using 34 positive place invariants in 42 ms returned sat
[2020-05-15 11:45:00] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 34 ms returned sat
[2020-05-15 11:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:45:00] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2020-05-15 11:45:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:45:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-05-15 11:45:00] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 113 ms returned sat
[2020-05-15 11:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:45:01] [INFO ] [Nat]Absence check using state equation in 827 ms returned sat
[2020-05-15 11:45:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-05-15 11:45:01] [INFO ] Computed and/alt/rep : 190/608/190 causal constraints in 94 ms.
[2020-05-15 11:45:04] [INFO ] Added : 168 causal constraints over 34 iterations in 2381 ms. Result :sat
[2020-05-15 11:45:04] [INFO ] Deduced a trap composed of 29 places in 171 ms
[2020-05-15 11:45:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-05-15 11:45:04] [INFO ] [Real]Absence check using 34 positive place invariants in 36 ms returned sat
[2020-05-15 11:45:04] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 34 ms returned sat
[2020-05-15 11:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:45:05] [INFO ] [Real]Absence check using state equation in 494 ms returned sat
[2020-05-15 11:45:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:45:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 48 ms returned sat
[2020-05-15 11:45:05] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 39 ms returned sat
[2020-05-15 11:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:45:06] [INFO ] [Nat]Absence check using state equation in 768 ms returned sat
[2020-05-15 11:45:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 30 ms returned sat
[2020-05-15 11:45:06] [INFO ] Computed and/alt/rep : 190/608/190 causal constraints in 78 ms.
[2020-05-15 11:45:07] [INFO ] Added : 167 causal constraints over 34 iterations in 1694 ms. Result :sat
[2020-05-15 11:45:08] [INFO ] Deduced a trap composed of 16 places in 97 ms
[2020-05-15 11:45:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
Attempting to minimize the solution found.
Minimization took 69 ms.
[2020-05-15 11:45:08] [INFO ] [Real]Absence check using 34 positive place invariants in 28 ms returned sat
[2020-05-15 11:45:08] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 40 ms returned sat
[2020-05-15 11:45:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:45:08] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2020-05-15 11:45:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:45:08] [INFO ] [Nat]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-05-15 11:45:09] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 50 ms returned sat
[2020-05-15 11:45:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:45:09] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2020-05-15 11:45:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2020-05-15 11:45:09] [INFO ] Computed and/alt/rep : 190/608/190 causal constraints in 19 ms.
[2020-05-15 11:45:11] [INFO ] Added : 139 causal constraints over 28 iterations in 1517 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-05-15 11:45:11] [INFO ] [Real]Absence check using 34 positive place invariants in 40 ms returned sat
[2020-05-15 11:45:11] [INFO ] [Real]Absence check using 34 positive and 26 generalized place invariants in 85 ms returned sat
[2020-05-15 11:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:45:12] [INFO ] [Real]Absence check using state equation in 1229 ms returned sat
[2020-05-15 11:45:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:45:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 45 ms returned sat
[2020-05-15 11:45:13] [INFO ] [Nat]Absence check using 34 positive and 26 generalized place invariants in 257 ms returned sat
[2020-05-15 11:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:45:14] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2020-05-15 11:45:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-05-15 11:45:14] [INFO ] Computed and/alt/rep : 190/608/190 causal constraints in 31 ms.
[2020-05-15 11:45:15] [INFO ] Added : 186 causal constraints over 38 iterations in 1740 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 34 ms.
FORMULA DES-PT-20b-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 190500 steps, including 3255 resets, run finished after 828 ms. (steps per millisecond=230 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 36100 steps, including 559 resets, run finished after 179 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 107500 steps, including 1726 resets, run finished after 431 ms. (steps per millisecond=249 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 137700 steps, including 2444 resets, run finished after 552 ms. (steps per millisecond=249 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 134400 steps, including 2146 resets, run finished after 529 ms. (steps per millisecond=254 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 176300 steps, including 2775 resets, run finished after 739 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 110900 steps, including 1660 resets, run finished after 514 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 47 out of 244 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 244/244 places, 191/191 transitions.
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 244 transition count 191
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 243 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 243 transition count 188
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 242 transition count 188
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 235 transition count 181
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 235 transition count 180
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 234 transition count 179
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 234 transition count 179
Applied a total of 24 rules in 101 ms. Remains 234 /244 variables (removed 10) and now considering 179/191 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/244 places, 179/191 transitions.
Incomplete random walk after 1000000 steps, including 17530 resets, run finished after 3988 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3849 resets, run finished after 2506 ms. (steps per millisecond=399 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3814 resets, run finished after 2375 ms. (steps per millisecond=421 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3471 resets, run finished after 2024 ms. (steps per millisecond=494 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4183 resets, run finished after 1939 ms. (steps per millisecond=515 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3392 resets, run finished after 2280 ms. (steps per millisecond=438 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3388 resets, run finished after 1950 ms. (steps per millisecond=512 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 4182 resets, run finished after 2229 ms. (steps per millisecond=448 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 7938833 steps, run timeout after 30001 ms. (steps per millisecond=264 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 7938833 steps, saw 945986 distinct states, run finished after 30001 ms. (steps per millisecond=264 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 179 rows 234 cols
[2020-05-15 11:46:09] [INFO ] Computed 60 place invariants in 24 ms
[2020-05-15 11:46:09] [INFO ] [Real]Absence check using 33 positive place invariants in 82 ms returned sat
[2020-05-15 11:46:09] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 75 ms returned sat
[2020-05-15 11:46:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:10] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2020-05-15 11:46:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:46:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 76 ms returned sat
[2020-05-15 11:46:11] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 236 ms returned sat
[2020-05-15 11:46:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:11] [INFO ] [Nat]Absence check using state equation in 576 ms returned sat
[2020-05-15 11:46:11] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 11:46:11] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2020-05-15 11:46:11] [INFO ] Deduced a trap composed of 26 places in 170 ms
[2020-05-15 11:46:12] [INFO ] Deduced a trap composed of 22 places in 343 ms
[2020-05-15 11:46:12] [INFO ] Deduced a trap composed of 26 places in 212 ms
[2020-05-15 11:46:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 938 ms
[2020-05-15 11:46:12] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 59 ms.
[2020-05-15 11:46:14] [INFO ] Added : 156 causal constraints over 32 iterations in 1795 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 30 ms.
[2020-05-15 11:46:14] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2020-05-15 11:46:14] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 45 ms returned sat
[2020-05-15 11:46:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:15] [INFO ] [Real]Absence check using state equation in 792 ms returned sat
[2020-05-15 11:46:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:46:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2020-05-15 11:46:15] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 234 ms returned sat
[2020-05-15 11:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:16] [INFO ] [Nat]Absence check using state equation in 761 ms returned sat
[2020-05-15 11:46:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 29 ms returned sat
[2020-05-15 11:46:16] [INFO ] Deduced a trap composed of 20 places in 154 ms
[2020-05-15 11:46:17] [INFO ] Deduced a trap composed of 22 places in 141 ms
[2020-05-15 11:46:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 467 ms
[2020-05-15 11:46:17] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 21 ms.
[2020-05-15 11:46:18] [INFO ] Added : 120 causal constraints over 25 iterations in 1661 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 49 ms.
[2020-05-15 11:46:19] [INFO ] [Real]Absence check using 33 positive place invariants in 54 ms returned sat
[2020-05-15 11:46:19] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 105 ms returned sat
[2020-05-15 11:46:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:20] [INFO ] [Real]Absence check using state equation in 1036 ms returned sat
[2020-05-15 11:46:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:46:20] [INFO ] [Nat]Absence check using 33 positive place invariants in 63 ms returned sat
[2020-05-15 11:46:20] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 299 ms returned sat
[2020-05-15 11:46:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:21] [INFO ] [Nat]Absence check using state equation in 969 ms returned sat
[2020-05-15 11:46:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2020-05-15 11:46:21] [INFO ] Deduced a trap composed of 22 places in 64 ms
[2020-05-15 11:46:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2020-05-15 11:46:21] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 35 ms.
[2020-05-15 11:46:23] [INFO ] Added : 154 causal constraints over 31 iterations in 1506 ms. Result :sat
[2020-05-15 11:46:23] [INFO ] Deduced a trap composed of 20 places in 111 ms
[2020-05-15 11:46:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 175 ms
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-05-15 11:46:24] [INFO ] [Real]Absence check using 33 positive place invariants in 58 ms returned sat
[2020-05-15 11:46:24] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 67 ms returned sat
[2020-05-15 11:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:24] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2020-05-15 11:46:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:46:24] [INFO ] [Nat]Absence check using 33 positive place invariants in 58 ms returned sat
[2020-05-15 11:46:25] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 162 ms returned sat
[2020-05-15 11:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:25] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2020-05-15 11:46:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2020-05-15 11:46:25] [INFO ] Deduced a trap composed of 22 places in 72 ms
[2020-05-15 11:46:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
[2020-05-15 11:46:25] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 22 ms.
[2020-05-15 11:46:27] [INFO ] Added : 157 causal constraints over 32 iterations in 1842 ms. Result :sat
[2020-05-15 11:46:27] [INFO ] Deduced a trap composed of 21 places in 157 ms
[2020-05-15 11:46:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 232 ms
Attempting to minimize the solution found.
Minimization took 35 ms.
[2020-05-15 11:46:28] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2020-05-15 11:46:28] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 42 ms returned sat
[2020-05-15 11:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:28] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2020-05-15 11:46:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:46:28] [INFO ] [Nat]Absence check using 33 positive place invariants in 68 ms returned sat
[2020-05-15 11:46:29] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 123 ms returned sat
[2020-05-15 11:46:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:29] [INFO ] [Nat]Absence check using state equation in 889 ms returned sat
[2020-05-15 11:46:29] [INFO ] [Nat]Added 2 Read/Feed constraints in 30 ms returned sat
[2020-05-15 11:46:30] [INFO ] Deduced a trap composed of 22 places in 132 ms
[2020-05-15 11:46:30] [INFO ] Deduced a trap composed of 14 places in 119 ms
[2020-05-15 11:46:30] [INFO ] Deduced a trap composed of 16 places in 226 ms
[2020-05-15 11:46:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 605 ms
[2020-05-15 11:46:30] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 21 ms.
[2020-05-15 11:46:32] [INFO ] Added : 155 causal constraints over 31 iterations in 1638 ms. Result :sat
[2020-05-15 11:46:32] [INFO ] Deduced a trap composed of 20 places in 101 ms
[2020-05-15 11:46:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-05-15 11:46:32] [INFO ] [Real]Absence check using 33 positive place invariants in 41 ms returned sat
[2020-05-15 11:46:32] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 49 ms returned sat
[2020-05-15 11:46:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:33] [INFO ] [Real]Absence check using state equation in 737 ms returned sat
[2020-05-15 11:46:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:46:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 47 ms returned sat
[2020-05-15 11:46:33] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 111 ms returned sat
[2020-05-15 11:46:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:34] [INFO ] [Nat]Absence check using state equation in 585 ms returned sat
[2020-05-15 11:46:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 102 ms returned sat
[2020-05-15 11:46:34] [INFO ] Deduced a trap composed of 22 places in 43 ms
[2020-05-15 11:46:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2020-05-15 11:46:34] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 23 ms.
[2020-05-15 11:46:35] [INFO ] Added : 112 causal constraints over 23 iterations in 1358 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 51 ms.
[2020-05-15 11:46:35] [INFO ] [Real]Absence check using 33 positive place invariants in 39 ms returned sat
[2020-05-15 11:46:36] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 46 ms returned sat
[2020-05-15 11:46:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:37] [INFO ] [Real]Absence check using state equation in 988 ms returned sat
[2020-05-15 11:46:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:46:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 36 ms returned sat
[2020-05-15 11:46:37] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 74 ms returned sat
[2020-05-15 11:46:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:38] [INFO ] [Nat]Absence check using state equation in 949 ms returned sat
[2020-05-15 11:46:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2020-05-15 11:46:38] [INFO ] Deduced a trap composed of 22 places in 61 ms
[2020-05-15 11:46:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2020-05-15 11:46:38] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 73 ms.
[2020-05-15 11:46:40] [INFO ] Added : 173 causal constraints over 35 iterations in 2022 ms. Result :sat
[2020-05-15 11:46:40] [INFO ] Deduced a trap composed of 20 places in 75 ms
[2020-05-15 11:46:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 173 ms
Attempting to minimize the solution found.
Minimization took 37 ms.
Incomplete Parikh walk after 169400 steps, including 3480 resets, run finished after 743 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 32800 steps, including 593 resets, run finished after 143 ms. (steps per millisecond=229 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 111100 steps, including 2379 resets, run finished after 518 ms. (steps per millisecond=214 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 129600 steps, including 2894 resets, run finished after 549 ms. (steps per millisecond=236 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 127300 steps, including 2826 resets, run finished after 505 ms. (steps per millisecond=252 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 52700 steps, including 1000 resets, run finished after 258 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 105500 steps, including 1982 resets, run finished after 427 ms. (steps per millisecond=247 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 47 out of 234 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 234/234 places, 179/179 transitions.
Applied a total of 0 rules in 25 ms. Remains 234 /234 variables (removed 0) and now considering 179/179 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 234/234 places, 179/179 transitions.
Starting structural reductions, iteration 0 : 234/234 places, 179/179 transitions.
Applied a total of 0 rules in 30 ms. Remains 234 /234 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 234 cols
[2020-05-15 11:46:43] [INFO ] Computed 60 place invariants in 6 ms
[2020-05-15 11:46:44] [INFO ] Implicit Places using invariants in 1047 ms returned []
// Phase 1: matrix 179 rows 234 cols
[2020-05-15 11:46:44] [INFO ] Computed 60 place invariants in 20 ms
[2020-05-15 11:46:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 11:46:47] [INFO ] Implicit Places using invariants and state equation in 2686 ms returned []
Implicit Place search using SMT with State Equation took 3746 ms to find 0 implicit places.
[2020-05-15 11:46:47] [INFO ] Redundant transitions in 32 ms returned []
// Phase 1: matrix 179 rows 234 cols
[2020-05-15 11:46:47] [INFO ] Computed 60 place invariants in 10 ms
[2020-05-15 11:46:48] [INFO ] Dead Transitions using invariants and state equation in 619 ms returned []
Finished structural reductions, in 1 iterations. Remains : 234/234 places, 179/179 transitions.
Incomplete random walk after 100000 steps, including 1748 resets, run finished after 428 ms. (steps per millisecond=233 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 179 rows 234 cols
[2020-05-15 11:46:48] [INFO ] Computed 60 place invariants in 4 ms
[2020-05-15 11:46:48] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2020-05-15 11:46:48] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 38 ms returned sat
[2020-05-15 11:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:49] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2020-05-15 11:46:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:46:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 48 ms returned sat
[2020-05-15 11:46:49] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 170 ms returned sat
[2020-05-15 11:46:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:50] [INFO ] [Nat]Absence check using state equation in 882 ms returned sat
[2020-05-15 11:46:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 11:46:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 42 ms returned sat
[2020-05-15 11:46:50] [INFO ] Deduced a trap composed of 26 places in 278 ms
[2020-05-15 11:46:51] [INFO ] Deduced a trap composed of 22 places in 113 ms
[2020-05-15 11:46:51] [INFO ] Deduced a trap composed of 26 places in 108 ms
[2020-05-15 11:46:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 744 ms
[2020-05-15 11:46:51] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 68 ms.
[2020-05-15 11:46:53] [INFO ] Added : 156 causal constraints over 32 iterations in 1763 ms. Result :sat
[2020-05-15 11:46:53] [INFO ] [Real]Absence check using 33 positive place invariants in 64 ms returned sat
[2020-05-15 11:46:53] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 86 ms returned sat
[2020-05-15 11:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:54] [INFO ] [Real]Absence check using state equation in 1181 ms returned sat
[2020-05-15 11:46:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:46:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 105 ms returned sat
[2020-05-15 11:46:55] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 257 ms returned sat
[2020-05-15 11:46:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:55] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2020-05-15 11:46:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 29 ms returned sat
[2020-05-15 11:46:56] [INFO ] Deduced a trap composed of 20 places in 126 ms
[2020-05-15 11:46:56] [INFO ] Deduced a trap composed of 22 places in 59 ms
[2020-05-15 11:46:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 348 ms
[2020-05-15 11:46:56] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 33 ms.
[2020-05-15 11:46:57] [INFO ] Added : 120 causal constraints over 25 iterations in 1531 ms. Result :sat
[2020-05-15 11:46:58] [INFO ] [Real]Absence check using 33 positive place invariants in 62 ms returned sat
[2020-05-15 11:46:58] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 85 ms returned sat
[2020-05-15 11:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:46:59] [INFO ] [Real]Absence check using state equation in 999 ms returned sat
[2020-05-15 11:46:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:46:59] [INFO ] [Nat]Absence check using 33 positive place invariants in 54 ms returned sat
[2020-05-15 11:46:59] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 169 ms returned sat
[2020-05-15 11:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:01] [INFO ] [Nat]Absence check using state equation in 1378 ms returned sat
[2020-05-15 11:47:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 19 ms returned sat
[2020-05-15 11:47:01] [INFO ] Deduced a trap composed of 22 places in 23 ms
[2020-05-15 11:47:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
[2020-05-15 11:47:01] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 62 ms.
[2020-05-15 11:47:03] [INFO ] Added : 154 causal constraints over 31 iterations in 1898 ms. Result :sat
[2020-05-15 11:47:03] [INFO ] Deduced a trap composed of 20 places in 259 ms
[2020-05-15 11:47:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 340 ms
[2020-05-15 11:47:03] [INFO ] [Real]Absence check using 33 positive place invariants in 49 ms returned sat
[2020-05-15 11:47:03] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 31 ms returned sat
[2020-05-15 11:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:04] [INFO ] [Real]Absence check using state equation in 1001 ms returned sat
[2020-05-15 11:47:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:47:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 34 ms returned sat
[2020-05-15 11:47:04] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 99 ms returned sat
[2020-05-15 11:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:06] [INFO ] [Nat]Absence check using state equation in 1347 ms returned sat
[2020-05-15 11:47:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 31 ms returned sat
[2020-05-15 11:47:06] [INFO ] Deduced a trap composed of 22 places in 32 ms
[2020-05-15 11:47:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2020-05-15 11:47:06] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 56 ms.
[2020-05-15 11:47:08] [INFO ] Added : 157 causal constraints over 32 iterations in 2105 ms. Result :sat
[2020-05-15 11:47:08] [INFO ] Deduced a trap composed of 21 places in 120 ms
[2020-05-15 11:47:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2020-05-15 11:47:08] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2020-05-15 11:47:08] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 37 ms returned sat
[2020-05-15 11:47:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:09] [INFO ] [Real]Absence check using state equation in 518 ms returned sat
[2020-05-15 11:47:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:47:09] [INFO ] [Nat]Absence check using 33 positive place invariants in 69 ms returned sat
[2020-05-15 11:47:09] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 166 ms returned sat
[2020-05-15 11:47:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:10] [INFO ] [Nat]Absence check using state equation in 671 ms returned sat
[2020-05-15 11:47:10] [INFO ] [Nat]Added 2 Read/Feed constraints in 27 ms returned sat
[2020-05-15 11:47:11] [INFO ] Deduced a trap composed of 22 places in 574 ms
[2020-05-15 11:47:11] [INFO ] Deduced a trap composed of 14 places in 285 ms
[2020-05-15 11:47:11] [INFO ] Deduced a trap composed of 16 places in 325 ms
[2020-05-15 11:47:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1407 ms
[2020-05-15 11:47:12] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 70 ms.
[2020-05-15 11:47:13] [INFO ] Added : 155 causal constraints over 31 iterations in 1977 ms. Result :sat
[2020-05-15 11:47:14] [INFO ] Deduced a trap composed of 20 places in 78 ms
[2020-05-15 11:47:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 236 ms
[2020-05-15 11:47:14] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2020-05-15 11:47:14] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 32 ms returned sat
[2020-05-15 11:47:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:14] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2020-05-15 11:47:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:47:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 69 ms returned sat
[2020-05-15 11:47:15] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 191 ms returned sat
[2020-05-15 11:47:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:16] [INFO ] [Nat]Absence check using state equation in 916 ms returned sat
[2020-05-15 11:47:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 80 ms returned sat
[2020-05-15 11:47:16] [INFO ] Deduced a trap composed of 22 places in 31 ms
[2020-05-15 11:47:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2020-05-15 11:47:16] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 66 ms.
[2020-05-15 11:47:17] [INFO ] Added : 112 causal constraints over 23 iterations in 1021 ms. Result :sat
[2020-05-15 11:47:17] [INFO ] [Real]Absence check using 33 positive place invariants in 37 ms returned sat
[2020-05-15 11:47:17] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 46 ms returned sat
[2020-05-15 11:47:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:18] [INFO ] [Real]Absence check using state equation in 705 ms returned sat
[2020-05-15 11:47:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:47:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 48 ms returned sat
[2020-05-15 11:47:18] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 84 ms returned sat
[2020-05-15 11:47:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:19] [INFO ] [Nat]Absence check using state equation in 786 ms returned sat
[2020-05-15 11:47:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 26 ms returned sat
[2020-05-15 11:47:19] [INFO ] Deduced a trap composed of 22 places in 31 ms
[2020-05-15 11:47:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2020-05-15 11:47:19] [INFO ] Computed and/alt/rep : 178/594/178 causal constraints in 58 ms.
[2020-05-15 11:47:21] [INFO ] Added : 173 causal constraints over 35 iterations in 1646 ms. Result :sat
[2020-05-15 11:47:21] [INFO ] Deduced a trap composed of 20 places in 59 ms
[2020-05-15 11:47:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 179
Applied a total of 1 rules in 39 ms. Remains 234 /234 variables (removed 0) and now considering 179/179 (removed 0) transitions.
// Phase 1: matrix 179 rows 234 cols
[2020-05-15 11:47:21] [INFO ] Computed 60 place invariants in 5 ms
[2020-05-15 11:47:21] [INFO ] [Real]Absence check using 33 positive place invariants in 57 ms returned sat
[2020-05-15 11:47:21] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 78 ms returned sat
[2020-05-15 11:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:22] [INFO ] [Real]Absence check using state equation in 1037 ms returned sat
[2020-05-15 11:47:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:47:22] [INFO ] [Nat]Absence check using 33 positive place invariants in 42 ms returned sat
[2020-05-15 11:47:22] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 131 ms returned sat
[2020-05-15 11:47:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:23] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2020-05-15 11:47:23] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 18 ms.
[2020-05-15 11:47:25] [INFO ] Added : 156 causal constraints over 32 iterations in 1534 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 35 ms.
[2020-05-15 11:47:25] [INFO ] [Real]Absence check using 33 positive place invariants in 62 ms returned sat
[2020-05-15 11:47:25] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 41 ms returned sat
[2020-05-15 11:47:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:26] [INFO ] [Real]Absence check using state equation in 832 ms returned sat
[2020-05-15 11:47:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:47:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 72 ms returned sat
[2020-05-15 11:47:27] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 264 ms returned sat
[2020-05-15 11:47:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:28] [INFO ] [Nat]Absence check using state equation in 1242 ms returned sat
[2020-05-15 11:47:28] [INFO ] Deduced a trap composed of 8 places in 139 ms
[2020-05-15 11:47:28] [INFO ] Deduced a trap composed of 15 places in 359 ms
[2020-05-15 11:47:29] [INFO ] Deduced a trap composed of 18 places in 197 ms
[2020-05-15 11:47:29] [INFO ] Deduced a trap composed of 19 places in 145 ms
[2020-05-15 11:47:29] [INFO ] Deduced a trap composed of 14 places in 94 ms
[2020-05-15 11:47:29] [INFO ] Deduced a trap composed of 16 places in 139 ms
[2020-05-15 11:47:29] [INFO ] Deduced a trap composed of 18 places in 69 ms
[2020-05-15 11:47:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1379 ms
[2020-05-15 11:47:29] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 30 ms.
[2020-05-15 11:47:31] [INFO ] Added : 142 causal constraints over 29 iterations in 2072 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-05-15 11:47:32] [INFO ] [Real]Absence check using 33 positive place invariants in 86 ms returned sat
[2020-05-15 11:47:32] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 55 ms returned sat
[2020-05-15 11:47:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:32] [INFO ] [Real]Absence check using state equation in 559 ms returned sat
[2020-05-15 11:47:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:47:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 97 ms returned sat
[2020-05-15 11:47:33] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 182 ms returned sat
[2020-05-15 11:47:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:34] [INFO ] [Nat]Absence check using state equation in 870 ms returned sat
[2020-05-15 11:47:34] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 21 ms.
[2020-05-15 11:47:35] [INFO ] Added : 152 causal constraints over 31 iterations in 1671 ms. Result :sat
[2020-05-15 11:47:36] [INFO ] Deduced a trap composed of 20 places in 171 ms
[2020-05-15 11:47:36] [INFO ] Deduced a trap composed of 26 places in 100 ms
[2020-05-15 11:47:36] [INFO ] Deduced a trap composed of 26 places in 89 ms
[2020-05-15 11:47:36] [INFO ] Deduced a trap composed of 28 places in 69 ms
[2020-05-15 11:47:36] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 696 ms
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-05-15 11:47:36] [INFO ] [Real]Absence check using 33 positive place invariants in 29 ms returned sat
[2020-05-15 11:47:36] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 27 ms returned sat
[2020-05-15 11:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:37] [INFO ] [Real]Absence check using state equation in 350 ms returned sat
[2020-05-15 11:47:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:47:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 60 ms returned sat
[2020-05-15 11:47:37] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 125 ms returned sat
[2020-05-15 11:47:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:38] [INFO ] [Nat]Absence check using state equation in 865 ms returned sat
[2020-05-15 11:47:38] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 24 ms.
[2020-05-15 11:47:40] [INFO ] Added : 157 causal constraints over 32 iterations in 1571 ms. Result :sat
[2020-05-15 11:47:40] [INFO ] Deduced a trap composed of 26 places in 163 ms
[2020-05-15 11:47:40] [INFO ] Deduced a trap composed of 27 places in 113 ms
[2020-05-15 11:47:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 429 ms
Attempting to minimize the solution found.
Minimization took 48 ms.
[2020-05-15 11:47:40] [INFO ] [Real]Absence check using 33 positive place invariants in 40 ms returned sat
[2020-05-15 11:47:40] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 51 ms returned sat
[2020-05-15 11:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:41] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2020-05-15 11:47:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:47:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 69 ms returned sat
[2020-05-15 11:47:41] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 220 ms returned sat
[2020-05-15 11:47:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:42] [INFO ] [Nat]Absence check using state equation in 680 ms returned sat
[2020-05-15 11:47:42] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 22 ms.
[2020-05-15 11:47:44] [INFO ] Added : 155 causal constraints over 31 iterations in 1501 ms. Result :sat
[2020-05-15 11:47:44] [INFO ] Deduced a trap composed of 16 places in 141 ms
[2020-05-15 11:47:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 227 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-05-15 11:47:44] [INFO ] [Real]Absence check using 33 positive place invariants in 41 ms returned sat
[2020-05-15 11:47:44] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 41 ms returned sat
[2020-05-15 11:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:45] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2020-05-15 11:47:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:47:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 55 ms returned sat
[2020-05-15 11:47:45] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 126 ms returned sat
[2020-05-15 11:47:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:46] [INFO ] [Nat]Absence check using state equation in 813 ms returned sat
[2020-05-15 11:47:46] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 22 ms.
[2020-05-15 11:47:48] [INFO ] Added : 115 causal constraints over 23 iterations in 1978 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-05-15 11:47:48] [INFO ] [Real]Absence check using 33 positive place invariants in 40 ms returned sat
[2020-05-15 11:47:48] [INFO ] [Real]Absence check using 33 positive and 27 generalized place invariants in 97 ms returned sat
[2020-05-15 11:47:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:49] [INFO ] [Real]Absence check using state equation in 1237 ms returned sat
[2020-05-15 11:47:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 11:47:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 77 ms returned sat
[2020-05-15 11:47:50] [INFO ] [Nat]Absence check using 33 positive and 27 generalized place invariants in 115 ms returned sat
[2020-05-15 11:47:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 11:47:51] [INFO ] [Nat]Absence check using state equation in 1053 ms returned sat
[2020-05-15 11:47:51] [INFO ] Computed and/alt/rep : 178/593/178 causal constraints in 46 ms.
[2020-05-15 11:47:52] [INFO ] Added : 171 causal constraints over 35 iterations in 1700 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 39 ms.
[2020-05-15 11:47:53] [INFO ] Flatten gal took : 211 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 11:47:54] [INFO ] Flatten gal took : 88 ms
[2020-05-15 11:47:54] [INFO ] Applying decomposition
[2020-05-15 11:47:54] [INFO ] Flatten gal took : 112 ms
[2020-05-15 11:47:54] [INFO ] Input system was already deterministic with 179 transitions.
[2020-05-15 11:47:54] [INFO ] Input system was already deterministic with 179 transitions.
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/graph1541810927632182074.txt, -o, /tmp/graph1541810927632182074.bin, -w, /tmp/graph1541810927632182074.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph1541810927632182074.bin, -l, -1, -v, -w, /tmp/graph1541810927632182074.weights, -q, 0, -e, 0.001], workingDir=null]
// Phase 1: matrix 179 rows 234 cols
[2020-05-15 11:47:54] [INFO ] Ran tautology test, simplified 0 / 7 in 492 ms.
[2020-05-15 11:47:54] [INFO ] Computed 60 place invariants in 9 ms
inv : p89 + p207 + p217 + p218 + p226 + p315 + p317 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p303 + p304 + p313 + p314 = 1
inv : p89 + p207 + p217 + p218 + p220 + p221 + p224 + p225 = 1
inv : p245 - p253 + p272 - p284 - p302 + p310 = 0
inv : -p335 - p336 + p337 + p338 = 0
inv : p89 + p90 + p204 + p206 = 1
inv : p89 + p90 + p150 + p151 + p152 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p282 + p284 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p261 + p263 = 1
inv : p89 + p90 + p94 + p103 + p106 + p108 + p109 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p301 + p302 + p313 + p314 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p264 + p266 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p236 + p238 + p253 - p263 + p284 + p296 - p310 = 1
inv : 60*p5 + 3*p7 + 6*p8 + 9*p9 + 12*p10 + 15*p11 + 18*p12 + 21*p13 + 24*p14 + 27*p15 + 30*p16 + 33*p17 + 36*p18 + 39*p19 + 42*p20 + 45*p21 + 48*p22 + 51*p23 + 54*p24 + 57*p25 - 40*p26 - 2*p28 - 4*p29 - 6*p30 - 8*p31 - 10*p32 - 12*p33 - 14*p34 - 16*p35 - 18*p36 - 20*p37 - 22*p38 - 24*p39 - 26*p40 - 28*p41 - 30*p42 - 32*p43 - 34*p44 - 36*p45 - 38*p46 - 20*p68 - p70 - 2*p71 - 3*p72 - 4*p73 - 5*p74 - 6*p75 - 7*p76 - 8*p77 - 9*p78 - 10*p79 - 11*p80 - 12*p81 - 13*p82 - 14*p83 - 15*p84 - 16*p85 - 17*p86 - 18*p87 - 19*p88 + 2*p89 - 2*p90 - p125 - p126 + p127 + p128 + p130 - p150 - p151 - p167 - p181 + p183 - p184 - p185 - p202 + 4*p207 - 3*p211 - 2*p213 - p215 + p217 - p221 - p225 - p311 + p313 - p317 + p318 + p319 - p320 - p323 - p331 + p334 - p335 + p338 + p339 + p345 + p351 + 2*p352 + 2*p353 + p357 + p359 = 2
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p305 + p306 + p313 + p314 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p248 + p253 - p278 + p284 + p306 - p310 = 1
inv : p89 + p207 + p211 + p214 + p215 = 1
inv : -40*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 + 40*p26 + 2*p28 + 4*p29 + 6*p30 + 8*p31 + 10*p32 + 12*p33 + 14*p34 + 16*p35 + 18*p36 + 20*p37 + 22*p38 + 24*p39 + 26*p40 + 28*p41 + 30*p42 + 32*p43 + 34*p44 + 36*p45 + 38*p46 - 3*p89 - 3*p207 + 2*p211 + p213 + p215 + p221 + p225 + p320 + p323 + p331 + p332 - p334 + p335 + p336 - p338 - p339 - p345 - p351 - 2*p352 - 2*p353 - p357 - p359 = -3
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p307 + p308 + p313 + p314 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p270 + p271 + p272 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p250 + p253 - p281 + p284 + p308 - p310 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p293 + p299 + p300 + p313 + p314 = 1
inv : p178 + p179 - p180 - p181 = 0
inv : -40*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 + 40*p26 + 2*p28 + 4*p29 + 6*p30 + 8*p31 + 10*p32 + 12*p33 + 14*p34 + 16*p35 + 18*p36 + 20*p37 + 22*p38 + 24*p39 + 26*p40 + 28*p41 + 30*p42 + 32*p43 + 34*p44 + 36*p45 + 38*p46 - 3*p89 - 3*p207 + 2*p211 + p213 + p215 + p221 + p225 + p320 + p323 + p333 + p335 + p336 - p338 - p339 - p345 - p351 - 2*p352 - 2*p353 - p357 - p359 = -3
inv : p89 + p207 + p352 + p353 + p358 + p359 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p293 + p294 + p295 + p296 + p313 + p314 = 1
inv : p89 + p90 + p188 + p196 + p197 + p198 + p202 + p203 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p276 + p278 = 1
inv : p89 + p90 + p94 + p110 + p124 + p125 + p126 = 1
inv : p89 + p207 + p211 + p212 + p213 = 1
inv : 40*p5 + 2*p7 + 4*p8 + 6*p9 + 8*p10 + 10*p11 + 12*p12 + 14*p13 + 16*p14 + 18*p15 + 20*p16 + 22*p17 + 24*p18 + 26*p19 + 28*p20 + 30*p21 + 32*p22 + 34*p23 + 36*p24 + 38*p25 - 40*p26 - 2*p28 - 4*p29 - 6*p30 - 8*p31 - 10*p32 - 12*p33 - 14*p34 - 16*p35 - 18*p36 - 20*p37 - 22*p38 - 24*p39 - 26*p40 - 28*p41 - 30*p42 - 32*p43 - 34*p44 - 36*p45 - 38*p46 + 4*p89 + 4*p207 - 2*p211 - p213 - p215 + p217 - p221 - p225 + p318 + p319 + p321 + p330 + p334 + p338 + p339 + p345 + p351 + 2*p352 + 2*p353 + p357 + p359 = 4
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p293 + p294 + p297 + p298 + p313 + p314 = 1
inv : p243 - p253 + p269 - p284 - p300 + p310 = 0
inv : p251 - p253 + p281 - p284 - p308 + p310 = 0
inv : -40*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 + 20*p26 + p28 + 2*p29 + 3*p30 + 4*p31 + 5*p32 + 6*p33 + 7*p34 + 8*p35 + 9*p36 + 10*p37 + 11*p38 + 12*p39 + 13*p40 + 14*p41 + 15*p42 + 16*p43 + 17*p44 + 18*p45 + 19*p46 + 20*p68 + p70 + 2*p71 + 3*p72 + 4*p73 + 5*p74 + 6*p75 + 7*p76 + 8*p77 + 9*p78 + 10*p79 + 11*p80 + 12*p81 + 13*p82 + 14*p83 + 15*p84 + 16*p85 + 17*p86 + 18*p87 + 19*p88 + p89 + 3*p90 + p125 + p126 + p137 + p142 + p150 + p151 + p167 + p181 - p183 + p184 + p185 + p202 - 2*p207 + 2*p211 + p213 + p215 + p221 + p225 + p311 - p313 + p317 + p320 + p323 + p331 + p335 - p339 - p352 - p353 - p357 = 1
inv : p249 - p253 + p278 - p284 - p306 + p310 = 0
inv : p89 + p207 + p352 + p353 + p356 + p357 = 1
inv : p89 + p90 + p155 + p156 + p157 + p162 + p165 = 1
inv : 20*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 + 10*p16 + 11*p17 + 12*p18 + 13*p19 + 14*p20 + 15*p21 + 16*p22 + 17*p23 + 18*p24 + 19*p25 - 20*p26 - p28 - 2*p29 - 3*p30 - 4*p31 - 5*p32 - 6*p33 - 7*p34 - 8*p35 - 9*p36 - 10*p37 - 11*p38 - 12*p39 - 13*p40 - 14*p41 - 15*p42 - 16*p43 - 17*p44 - 18*p45 - 19*p46 + 3*p89 + 3*p207 - p211 - p213 + 2*p217 + 2*p218 + p220 + p222 + p226 + p227 - p253 - p284 + p285 + p286 + p310 + p313 - p317 - p320 - p323 - p331 - p335 + p352 + p353 + p357 = 3
inv : -20*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 - 10*p16 - 11*p17 - 12*p18 - 13*p19 - 14*p20 - 15*p21 - 16*p22 - 17*p23 - 18*p24 - 19*p25 + 20*p26 + p28 + 2*p29 + 3*p30 + 4*p31 + 5*p32 + 6*p33 + 7*p34 + 8*p35 + 9*p36 + 10*p37 + 11*p38 + 12*p39 + 13*p40 + 14*p41 + 15*p42 + 16*p43 + 17*p44 + 18*p45 + 19*p46 - 2*p89 - 2*p207 + p211 + p213 - p217 - p218 + p221 + p223 - p226 - p227 + p253 + p284 - p285 - p286 - p310 - p313 + p317 + p320 + p323 + p331 + p335 - p352 - p353 - p357 = -2
inv : 40*p5 + 2*p7 + 4*p8 + 6*p9 + 8*p10 + 10*p11 + 12*p12 + 14*p13 + 16*p14 + 18*p15 + 20*p16 + 22*p17 + 24*p18 + 26*p19 + 28*p20 + 30*p21 + 32*p22 + 34*p23 + 36*p24 + 38*p25 - 20*p26 - p28 - 2*p29 - 3*p30 - 4*p31 - 5*p32 - 6*p33 - 7*p34 - 8*p35 - 9*p36 - 10*p37 - 11*p38 - 12*p39 - 13*p40 - 14*p41 - 15*p42 - 16*p43 - 17*p44 - 18*p45 - 19*p46 - 20*p68 - p70 - 2*p71 - 3*p72 - 4*p73 - 5*p74 - 6*p75 - 7*p76 - 8*p77 - 9*p78 - 10*p79 - 11*p80 - 12*p81 - 13*p82 - 14*p83 - 15*p84 - 16*p85 - 17*p86 - 18*p87 - 19*p88 - 2*p90 - p125 - p126 + p135 - p150 - p151 - p167 - p181 + p183 - p184 - p185 - p202 + 2*p207 - 2*p211 - p213 - p215 - p221 - p225 - p311 + p313 - p317 - p320 - p323 - p331 - p335 + p339 + p352 + p353 + p357 = 0
inv : p241 - p253 + p266 - p284 - p298 + p310 = 0
inv : p89 + p207 + p217 + p218 + p226 + p227 + p273 + p275 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p236 + p242 + p253 - p269 + p284 + p300 - p310 = 1
inv : -60*p5 - 3*p7 - 6*p8 - 9*p9 - 12*p10 - 15*p11 - 18*p12 - 21*p13 - 24*p14 - 27*p15 - 30*p16 - 33*p17 - 36*p18 - 39*p19 - 42*p20 - 45*p21 - 48*p22 - 51*p23 - 54*p24 - 57*p25 + 40*p26 + 2*p28 + 4*p29 + 6*p30 + 8*p31 + 10*p32 + 12*p33 + 14*p34 + 16*p35 + 18*p36 + 20*p37 + 22*p38 + 24*p39 + 26*p40 + 28*p41 + 30*p42 + 32*p43 + 34*p44 + 36*p45 + 38*p46 + 20*p68 + p70 + 2*p71 + 3*p72 + 4*p73 + 5*p74 + 6*p75 + 7*p76 + 8*p77 + 9*p78 + 10*p79 + 11*p80 + 12*p81 + 13*p82 + 14*p83 + 15*p84 + 16*p85 + 17*p86 + 18*p87 + 19*p88 - p89 + 3*p90 + p125 + p126 + p129 + p134 + p150 + p151 + p167 + p181 - p183 + p184 + p185 + p202 - 4*p207 + 3*p211 + 2*p213 + p215 - p217 + p221 + p225 + p311 - p313 + p317 - p318 - p319 + p320 + p323 + p331 - p334 + p335 - p338 - p339 - p345 - p351 - 2*p352 - 2*p353 - p357 - p359 = -1
inv : p182 + p183 - p184 - p185 = 0
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p309 + p310 + p313 + p314 = 1
inv : p89 + p207 + p339 + p341 + p344 + p345 + p351 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p246 + p253 - p275 + p284 + p304 - p310 = 1
inv : p89 + p90 + p144 + p145 + p146 = 1
inv : p89 + p90 + p188 + p196 + p197 + p198 + p200 + p201 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p279 + p281 = 1
inv : p239 - p253 + p263 - p284 - p296 + p310 = 0
inv : p89 + p90 + p94 + p96 + p99 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p244 + p253 - p272 + p284 + p302 - p310 = 1
inv : p247 - p253 + p275 - p284 - p304 + p310 = 0
inv : p89 + p207 + p217 + p218 + p226 + p227 + p267 + p269 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p252 + p253 = 1
inv : p311 + p312 - p313 - p314 = 0
inv : p89 + p207 + p217 + p218 + p226 + p227 + p236 + p240 + p253 - p266 + p284 + p298 - p310 = 1
Total of 60 invariants.
[2020-05-15 11:47:54] [INFO ] Computed 60 place invariants in 50 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-02(UNSAT) depth K=0 took 31 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-03(UNSAT) depth K=0 took 16 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-06(UNSAT) depth K=0 took 15 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-08(UNSAT) depth K=0 took 0 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-10(UNSAT) depth K=0 took 1 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-12(UNSAT) depth K=0 took 1 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-15(UNSAT) depth K=0 took 7 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-02(UNSAT) depth K=1 took 21 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-03(UNSAT) depth K=1 took 20 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-06(UNSAT) depth K=1 took 3 ms
[2020-05-15 11:47:54] [INFO ] Decomposing Gal with order
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-08(UNSAT) depth K=1 took 22 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-10(UNSAT) depth K=1 took 22 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-12(UNSAT) depth K=1 took 2 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-15(UNSAT) depth K=1 took 2 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 179 rows 234 cols
[2020-05-15 11:47:54] [INFO ] Computed 60 place invariants in 5 ms
inv : p89 + p207 + p217 + p218 + p226 + p315 + p317 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p303 + p304 + p313 + p314 = 1
inv : p89 + p207 + p217 + p218 + p220 + p221 + p224 + p225 = 1
inv : p245 - p253 + p272 - p284 - p302 + p310 = 0
inv : -p335 - p336 + p337 + p338 = 0
inv : p89 + p90 + p204 + p206 = 1
inv : p89 + p90 + p150 + p151 + p152 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p282 + p284 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p261 + p263 = 1
inv : p89 + p90 + p94 + p103 + p106 + p108 + p109 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p301 + p302 + p313 + p314 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p264 + p266 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p236 + p238 + p253 - p263 + p284 + p296 - p310 = 1
inv : 60*p5 + 3*p7 + 6*p8 + 9*p9 + 12*p10 + 15*p11 + 18*p12 + 21*p13 + 24*p14 + 27*p15 + 30*p16 + 33*p17 + 36*p18 + 39*p19 + 42*p20 + 45*p21 + 48*p22 + 51*p23 + 54*p24 + 57*p25 - 40*p26 - 2*p28 - 4*p29 - 6*p30 - 8*p31 - 10*p32 - 12*p33 - 14*p34 - 16*p35 - 18*p36 - 20*p37 - 22*p38 - 24*p39 - 26*p40 - 28*p41 - 30*p42 - 32*p43 - 34*p44 - 36*p45 - 38*p46 - 20*p68 - p70 - 2*p71 - 3*p72 - 4*p73 - 5*p74 - 6*p75 - 7*p76 - 8*p77 - 9*p78 - 10*p79 - 11*p80 - 12*p81 - 13*p82 - 14*p83 - 15*p84 - 16*p85 - 17*p86 - 18*p87 - 19*p88 + 2*p89 - 2*p90 - p125 - p126 + p127 + p128 + p130 - p150 - p151 - p167 - p181 + p183 - p184 - p185 - p202 + 4*p207 - 3*p211 - 2*p213 - p215 + p217 - p221 - p225 - p311 + p313 - p317 + p318 + p319 - p320 - p323 - p331 + p334 - p335 + p338 + p339 + p345 + p351 + 2*p352 + 2*p353 + p357 + p359 = 2
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p305 + p306 + p313 + p314 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p248 + p253 - p278 + p284 + p306 - p310 = 1
inv : p89 + p207 + p211 + p214 + p215 = 1
inv : -40*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 + 40*p26 + 2*p28 + 4*p29 + 6*p30 + 8*p31 + 10*p32 + 12*p33 + 14*p34 + 16*p35 + 18*p36 + 20*p37 + 22*p38 + 24*p39 + 26*p40 + 28*p41 + 30*p42 + 32*p43 + 34*p44 + 36*p45 + 38*p46 - 3*p89 - 3*p207 + 2*p211 + p213 + p215 + p221 + p225 + p320 + p323 + p331 + p332 - p334 + p335 + p336 - p338 - p339 - p345 - p351 - 2*p352 - 2*p353 - p357 - p359 = -3
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p307 + p308 + p313 + p314 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p270 + p271 + p272 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p250 + p253 - p281 + p284 + p308 - p310 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p293 + p299 + p300 + p313 + p314 = 1
inv : p178 + p179 - p180 - p181 = 0
inv : -40*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 + 40*p26 + 2*p28 + 4*p29 + 6*p30 + 8*p31 + 10*p32 + 12*p33 + 14*p34 + 16*p35 + 18*p36 + 20*p37 + 22*p38 + 24*p39 + 26*p40 + 28*p41 + 30*p42 + 32*p43 + 34*p44 + 36*p45 + 38*p46 - 3*p89 - 3*p207 + 2*p211 + p213 + p215 + p221 + p225 + p320 + p323 + p333 + p335 + p336 - p338 - p339 - p345 - p351 - 2*p352 - 2*p353 - p357 - p359 = -3
inv : p89 + p207 + p352 + p353 + p358 + p359 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p293 + p294 + p295 + p296 + p313 + p314 = 1
inv : p89 + p90 + p188 + p196 + p197 + p198 + p202 + p203 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p276 + p278 = 1
inv : p89 + p90 + p94 + p110 + p124 + p125 + p126 = 1
inv : p89 + p207 + p211 + p212 + p213 = 1
inv : 40*p5 + 2*p7 + 4*p8 + 6*p9 + 8*p10 + 10*p11 + 12*p12 + 14*p13 + 16*p14 + 18*p15 + 20*p16 + 22*p17 + 24*p18 + 26*p19 + 28*p20 + 30*p21 + 32*p22 + 34*p23 + 36*p24 + 38*p25 - 40*p26 - 2*p28 - 4*p29 - 6*p30 - 8*p31 - 10*p32 - 12*p33 - 14*p34 - 16*p35 - 18*p36 - 20*p37 - 22*p38 - 24*p39 - 26*p40 - 28*p41 - 30*p42 - 32*p43 - 34*p44 - 36*p45 - 38*p46 + 4*p89 + 4*p207 - 2*p211 - p213 - p215 + p217 - p221 - p225 + p318 + p319 + p321 + p330 + p334 + p338 + p339 + p345 + p351 + 2*p352 + 2*p353 + p357 + p359 = 4
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p293 + p294 + p297 + p298 + p313 + p314 = 1
inv : p243 - p253 + p269 - p284 - p300 + p310 = 0
inv : p251 - p253 + p281 - p284 - p308 + p310 = 0
inv : -40*p5 - 2*p7 - 4*p8 - 6*p9 - 8*p10 - 10*p11 - 12*p12 - 14*p13 - 16*p14 - 18*p15 - 20*p16 - 22*p17 - 24*p18 - 26*p19 - 28*p20 - 30*p21 - 32*p22 - 34*p23 - 36*p24 - 38*p25 + 20*p26 + p28 + 2*p29 + 3*p30 + 4*p31 + 5*p32 + 6*p33 + 7*p34 + 8*p35 + 9*p36 + 10*p37 + 11*p38 + 12*p39 + 13*p40 + 14*p41 + 15*p42 + 16*p43 + 17*p44 + 18*p45 + 19*p46 + 20*p68 + p70 + 2*p71 + 3*p72 + 4*p73 + 5*p74 + 6*p75 + 7*p76 + 8*p77 + 9*p78 + 10*p79 + 11*p80 + 12*p81 + 13*p82 + 14*p83 + 15*p84 + 16*p85 + 17*p86 + 18*p87 + 19*p88 + p89 + 3*p90 + p125 + p126 + p137 + p142 + p150 + p151 + p167 + p181 - p183 + p184 + p185 + p202 - 2*p207 + 2*p211 + p213 + p215 + p221 + p225 + p311 - p313 + p317 + p320 + p323 + p331 + p335 - p339 - p352 - p353 - p357 = 1
inv : p249 - p253 + p278 - p284 - p306 + p310 = 0
inv : p89 + p207 + p352 + p353 + p356 + p357 = 1
inv : p89 + p90 + p155 + p156 + p157 + p162 + p165 = 1
inv : 20*p5 + p7 + 2*p8 + 3*p9 + 4*p10 + 5*p11 + 6*p12 + 7*p13 + 8*p14 + 9*p15 + 10*p16 + 11*p17 + 12*p18 + 13*p19 + 14*p20 + 15*p21 + 16*p22 + 17*p23 + 18*p24 + 19*p25 - 20*p26 - p28 - 2*p29 - 3*p30 - 4*p31 - 5*p32 - 6*p33 - 7*p34 - 8*p35 - 9*p36 - 10*p37 - 11*p38 - 12*p39 - 13*p40 - 14*p41 - 15*p42 - 16*p43 - 17*p44 - 18*p45 - 19*p46 + 3*p89 + 3*p207 - p211 - p213 + 2*p217 + 2*p218 + p220 + p222 + p226 + p227 - p253 - p284 + p285 + p286 + p310 + p313 - p317 - p320 - p323 - p331 - p335 + p352 + p353 + p357 = 3
inv : -20*p5 - p7 - 2*p8 - 3*p9 - 4*p10 - 5*p11 - 6*p12 - 7*p13 - 8*p14 - 9*p15 - 10*p16 - 11*p17 - 12*p18 - 13*p19 - 14*p20 - 15*p21 - 16*p22 - 17*p23 - 18*p24 - 19*p25 + 20*p26 + p28 + 2*p29 + 3*p30 + 4*p31 + 5*p32 + 6*p33 + 7*p34 + 8*p35 + 9*p36 + 10*p37 + 11*p38 + 12*p39 + 13*p40 + 14*p41 + 15*p42 + 16*p43 + 17*p44 + 18*p45 + 19*p46 - 2*p89 - 2*p207 + p211 + p213 - p217 - p218 + p221 + p223 - p226 - p227 + p253 + p284 - p285 - p286 - p310 - p313 + p317 + p320 + p323 + p331 + p335 - p352 - p353 - p357 = -2
inv : 40*p5 + 2*p7 + 4*p8 + 6*p9 + 8*p10 + 10*p11 + 12*p12 + 14*p13 + 16*p14 + 18*p15 + 20*p16 + 22*p17 + 24*p18 + 26*p19 + 28*p20 + 30*p21 + 32*p22 + 34*p23 + 36*p24 + 38*p25 - 20*p26 - p28 - 2*p29 - 3*p30 - 4*p31 - 5*p32 - 6*p33 - 7*p34 - 8*p35 - 9*p36 - 10*p37 - 11*p38 - 12*p39 - 13*p40 - 14*p41 - 15*p42 - 16*p43 - 17*p44 - 18*p45 - 19*p46 - 20*p68 - p70 - 2*p71 - 3*p72 - 4*p73 - 5*p74 - 6*p75 - 7*p76 - 8*p77 - 9*p78 - 10*p79 - 11*p80 - 12*p81 - 13*p82 - 14*p83 - 15*p84 - 16*p85 - 17*p86 - 18*p87 - 19*p88 - 2*p90 - p125 - p126 + p135 - p150 - p151 - p167 - p181 + p183 - p184 - p185 - p202 + 2*p207 - 2*p211 - p213 - p215 - p221 - p225 - p311 + p313 - p317 - p320 - p323 - p331 - p335 + p339 + p352 + p353 + p357 = 0
inv : p241 - p253 + p266 - p284 - p298 + p310 = 0
inv : p89 + p207 + p217 + p218 + p226 + p227 + p273 + p275 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p236 + p242 + p253 - p269 + p284 + p300 - p310 = 1
inv : -60*p5 - 3*p7 - 6*p8 - 9*p9 - 12*p10 - 15*p11 - 18*p12 - 21*p13 - 24*p14 - 27*p15 - 30*p16 - 33*p17 - 36*p18 - 39*p19 - 42*p20 - 45*p21 - 48*p22 - 51*p23 - 54*p24 - 57*p25 + 40*p26 + 2*p28 + 4*p29 + 6*p30 + 8*p31 + 10*p32 + 12*p33 + 14*p34 + 16*p35 + 18*p36 + 20*p37 + 22*p38 + 24*p39 + 26*p40 + 28*p41 + 30*p42 + 32*p43 + 34*p44 + 36*p45 + 38*p46 + 20*p68 + p70 + 2*p71 + 3*p72 + 4*p73 + 5*p74 + 6*p75 + 7*p76 + 8*p77 + 9*p78 + 10*p79 + 11*p80 + 12*p81 + 13*p82 + 14*p83 + 15*p84 + 16*p85 + 17*p86 + 18*p87 + 19*p88 - p89 + 3*p90 + p125 + p126 + p129 + p134 + p150 + p151 + p167 + p181 - p183 + p184 + p185 + p202 - 4*p207 + 3*p211 + 2*p213 + p215 - p217 + p221 + p225 + p311 - p313 + p317 - p318 - p319 + p320 + p323 + p331 - p334 + p335 - p338 - p339 - p345 - p351 - 2*p352 - 2*p353 - p357 - p359 = -1
inv : p182 + p183 - p184 - p185 = 0
inv : p89 + p207 + p217 + p218 + p226 + p227 + p285 + p286 + p309 + p310 + p313 + p314 = 1
inv : p89 + p207 + p339 + p341 + p344 + p345 + p351 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p246 + p253 - p275 + p284 + p304 - p310 = 1
inv : p89 + p90 + p144 + p145 + p146 = 1
inv : p89 + p90 + p188 + p196 + p197 + p198 + p200 + p201 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p279 + p281 = 1
inv : p239 - p253 + p263 - p284 - p296 + p310 = 0
inv : p89 + p90 + p94 + p96 + p99 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p244 + p253 - p272 + p284 + p302 - p310 = 1
inv : p247 - p253 + p275 - p284 - p304 + p310 = 0
inv : p89 + p207 + p217 + p218 + p226 + p227 + p267 + p269 = 1
inv : p89 + p207 + p217 + p218 + p226 + p227 + p252 + p253 = 1
inv : p311 + p312 - p313 - p314 = 0
inv : p89 + p207 + p217 + p218 + p226 + p227 + p236 + p240 + p253 - p266 + p284 + p298 - p310 = 1
Total of 60 invariants.
[2020-05-15 11:47:54] [INFO ] Computed 60 place invariants in 32 ms
[2020-05-15 11:47:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-02(UNSAT) depth K=2 took 68 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-03(UNSAT) depth K=2 took 2 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-06(UNSAT) depth K=2 took 2 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-08(UNSAT) depth K=2 took 1 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-10(UNSAT) depth K=2 took 15 ms
[2020-05-15 11:47:54] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-12(UNSAT) depth K=2 took 2 ms
[2020-05-15 11:47:55] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-15(UNSAT) depth K=2 took 2 ms
[2020-05-15 11:47:55] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-02(UNSAT) depth K=3 took 137 ms
[2020-05-15 11:47:55] [INFO ] Removed a total of 22 redundant transitions.
[2020-05-15 11:47:55] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-03(UNSAT) depth K=3 took 82 ms
[2020-05-15 11:47:55] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-06(UNSAT) depth K=3 took 63 ms
[2020-05-15 11:47:55] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-08(UNSAT) depth K=3 took 69 ms
[2020-05-15 11:47:55] [INFO ] Flatten gal took : 332 ms
[2020-05-15 11:47:55] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-10(UNSAT) depth K=3 took 82 ms
[2020-05-15 11:47:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 35 ms.
[2020-05-15 11:47:55] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-12(UNSAT) depth K=3 took 99 ms
[2020-05-15 11:47:55] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 29 ms
[2020-05-15 11:47:55] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 2 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-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]
[2020-05-15 11:47:55] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-15(UNSAT) depth K=3 took 48 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness
Loading property file ReachabilityFireability.prop.
Read [invariant] property : DES-PT-20b-ReachabilityFireability-02 with value :((((((((i6.i0.u19.p242!=1)||(i6.i2.u27.p269!=1))||(u3.p126==1))||(i9.u48.p34!=1))||(i9.u48.p352!=1))||(i5.i0.u16.p220!=1))||(((i8.i4.u18.p226==1)&&(i3.i1.u13.p183==1))&&(i3.i1.u12.p185==1)))||(((((i6.i1.u34.p294==1)&&(i3.i1.u10.p174==1))&&(i5.i1.u0.p90==1))&&(i9.u49.p357==1))&&(i9.u49.p359==1)))
Read [reachable] property : DES-PT-20b-ReachabilityFireability-03 with value :((((i5.i1.u45.p333==1)&&(i5.i1.u47.p345==1))&&(((i9.u48.p43==1)&&(i9.u48.p352==1))||((i3.i1.u13.p182==1)&&(i3.i1.u13.p196==1))))&&((u3.p126!=1)||(((i5.i1.u6.p142==1)&&(i3.i1.u13.p182==1))&&(i3.i1.u13.p196==1))))
Read [reachable] property : DES-PT-20b-ReachabilityFireability-06 with value :(((((u3.p80==1)&&(u3.p110==1))&&(i3.i0.u2.p109==1))&&(i3.i1.u13.p197!=1))&&((u15.p9!=1)||(u15.p211!=1)))
Read [reachable] property : DES-PT-20b-ReachabilityFireability-08 with value :((u3.p79==1)&&(u3.p110==1))
Read [reachable] property : DES-PT-20b-ReachabilityFireability-10 with value :(((i1.u7.p145==1)&&(((i1.u7.p144!=1)||(i8.i4.u33.p286==1))||((u15.p11==1)&&(u15.p211==1))))&&(((u15.p15==1)&&(u15.p211==1))||(((i1.u4.p128==1)&&(i1.u4.p130==1))&&(i7.u28.p271==1))))
Read [reachable] property : DES-PT-20b-ReachabilityFireability-12 with value :(((((i1.u5.p129==1)&&(i5.i0.u42.p318==1))&&(u15.p25==1))&&(u15.p211==1))&&(i3.i1.u13.p198==1))
Read [reachable] property : DES-PT-20b-ReachabilityFireability-15 with value :(((u3.p72==1)&&(u3.p110==1))&&((((i8.i4.u33.p285!=1)||(i3.i0.u2.p108!=1))||(i3.i1.u12.p184!=1))||((((i5.i0.u17.p221==1)&&(i5.i0.u43.p321==1))&&(i3.i1.u8.p151==1))&&(i3.i0.u9.p162==1))))
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 8 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 22 ordering constraints for composite.
built 19 ordering constraints for composite.
built 29 ordering constraints for composite.
built 11 ordering constraints for composite.
built 19 ordering constraints for composite.
built 15 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
Reachability property DES-PT-20b-ReachabilityFireability-03 is true.
FORMULA DES-PT-20b-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 1024
[2020-05-15 11:47:56] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-02(UNSAT) depth K=4 took 665 ms
SDD proceeding with computation, new max is 2048
[2020-05-15 11:47:56] [INFO ] Proved 234 variables to be positive in 1564 ms
SDD proceeding with computation, new max is 4096
[2020-05-15 11:47:57] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-06(UNSAT) depth K=4 took 759 ms
[2020-05-15 11:47:57] [INFO ] Proved 234 variables to be positive in 2560 ms
[2020-05-15 11:47:57] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2020-05-15 11:47:57] [INFO ] Computation of disable matrix completed :0/179 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 11:47:57] [INFO ] Computation of Complete disable matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 11:47:57] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2020-05-15 11:47:57] [INFO ] Computation of Complete enable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 11:47:57] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-08(UNSAT) depth K=4 took 753 ms
[2020-05-15 11:47:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-20b-ReachabilityFireability-02
[2020-05-15 11:47:57] [INFO ] KInduction solution for property DES-PT-20b-ReachabilityFireability-02(SAT) depth K=0 took 1328 ms
SDD proceeding with computation, new max is 8192
[2020-05-15 11:47:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-20b-ReachabilityFireability-06
[2020-05-15 11:47:58] [INFO ] KInduction solution for property DES-PT-20b-ReachabilityFireability-06(SAT) depth K=0 took 570 ms
[2020-05-15 11:47:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-20b-ReachabilityFireability-08
[2020-05-15 11:47:58] [INFO ] KInduction solution for property DES-PT-20b-ReachabilityFireability-08(SAT) depth K=0 took 385 ms
[2020-05-15 11:47:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-20b-ReachabilityFireability-10
[2020-05-15 11:47:58] [INFO ] KInduction solution for property DES-PT-20b-ReachabilityFireability-10(SAT) depth K=0 took 64 ms
[2020-05-15 11:47:59] [INFO ] Computing symmetric co enabling matrix : 179 transitions.
Reachability property DES-PT-20b-ReachabilityFireability-15 is true.
FORMULA DES-PT-20b-ReachabilityFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-20b-ReachabilityFireability-12 is true.
FORMULA DES-PT-20b-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-20b-ReachabilityFireability-10 is true.
FORMULA DES-PT-20b-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-20b-ReachabilityFireability-08 is true.
FORMULA DES-PT-20b-ReachabilityFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-20b-ReachabilityFireability-06 is true.
FORMULA DES-PT-20b-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-20b-ReachabilityFireability-02 does not hold.
FORMULA DES-PT-20b-ReachabilityFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 8193 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,5.14439e+15,4.45042,85216,6691,1645,205697,13111,515,179690,257,87179,0
Total reachable state count : 5144387734960136

Verifying 7 reachability properties.
Invariant property DES-PT-20b-ReachabilityFireability-02 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityFireability-02,9.00605e+11,4.51006,85480,602,442,205697,13111,601,179690,281,87179,6013
Reachability property DES-PT-20b-ReachabilityFireability-03 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityFireability-03,3.02093e+06,4.51521,85480,139,179,205697,13111,652,179690,288,87179,6770
Reachability property DES-PT-20b-ReachabilityFireability-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityFireability-06,933120,4.53304,85480,117,155,205697,13111,681,179690,299,87179,7850
Reachability property DES-PT-20b-ReachabilityFireability-08 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityFireability-08,1.79159e+07,4.53439,85480,136,177,205697,13111,687,179690,303,87179,7850
Reachability property DES-PT-20b-ReachabilityFireability-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityFireability-10,114688,4.59607,85480,104,159,205697,13111,724,179690,311,87179,20891
Reachability property DES-PT-20b-ReachabilityFireability-12 is true.

[2020-05-15 11:48:00] [INFO ] BMC solution for property DES-PT-20b-ReachabilityFireability-10(UNSAT) depth K=4 took 2748 ms
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityFireability-12,5760,4.59823,85480,98,118,205697,13111,745,179690,317,87179,20984
Reachability property DES-PT-20b-ReachabilityFireability-15 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-20b-ReachabilityFireability-15,4.06426e+07,4.6893,85480,134,156,205697,13111,788,179690,321,87179,25211
[2020-05-15 11:48:00] [WARNING] Interrupting SMT solver.
[2020-05-15 11:48:00] [WARNING] Script execution failed on command (assert (= (+ (* 40 (select s0 0)) (* 2 (select s0 1)) (* 4 (select s0 2)) (* 6 (select s0 3)) (* 8 (select s0 4)) (* 10 (select s0 5)) (* 12 (select s0 6)) (* 14 (select s0 7)) (* 16 (select s0 8)) (* 18 (select s0 9)) (* 20 (select s0 10)) (* 22 (select s0 11)) (* 24 (select s0 12)) (* 26 (select s0 13)) (* 28 (select s0 14)) (* 30 (select s0 15)) (* 32 (select s0 16)) (* 34 (select s0 17)) (* 36 (select s0 18)) (* 38 (select s0 19)) (select s0 120) (* 2 (select s0 133)) (select s0 205) (select s0 223) (select s0 228) (select s0 229) (select s0 231) 1) (+ (* 20 (select s0 20)) (select s0 21) (* 2 (select s0 22)) (* 3 (select s0 23)) (* 4 (select s0 24)) (* 5 (select s0 25)) (* 6 (select s0 26)) (* 7 (select s0 27)) (* 8 (select s0 28)) (* 9 (select s0 29)) (* 10 (select s0 30)) (* 11 (select s0 31)) (* 12 (select s0 32)) (* 13 (select s0 33)) (* 14 (select s0 34)) (* 15 (select s0 35)) (* 16 (select s0 36)) (* 17 (select s0 37)) (* 18 (select s0 38)) (* 19 (select s0 39)) (* 20 (select s0 60)) (select s0 61) (* 2 (select s0 62)) (* 3 (select s0 63)) (* 4 (select s0 64)) (* 5 (select s0 65)) (* 6 (select s0 66)) (* 7 (select s0 67)) (* 8 (select s0 68)) (* 9 (select s0 69)) (* 10 (select s0 70)) (* 11 (select s0 71)) (* 12 (select s0 72)) (* 13 (select s0 73)) (* 14 (select s0 74)) (* 15 (select s0 75)) (* 16 (select s0 76)) (* 17 (select s0 77)) (* 18 (select s0 78)) (* 19 (select s0 79)) (select s0 80) (* 3 (select s0 81)) (select s0 91) (select s0 92) (select s0 99) (select s0 100) (select s0 104) (select s0 105) (select s0 112) (select s0 118) (select s0 121) (select s0 122) (select s0 129) (* 2 (select s0 134)) (select s0 136) (select s0 138) (select s0 142) (select s0 146) (select s0 203) (select s0 208) (select s0 211) (select s0 213) (select s0 215) (select s0 219)))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (= (+ (* 40 (select s0 0)) (* 2 (select s0 1)) (* 4 (select s0 2)) (* 6 (select s0 3)) (* 8 (select s0 4)) (* 10 (select s0 5)) (* 12 (select s0 6)) (* 14 (select s0 7)) (* 16 (select s0 8)) (* 18 (select s0 9)) (* 20 (select s0 10)) (* 22 (select s0 11)) (* 24 (select s0 12)) (* 26 (select s0 13)) (* 28 (select s0 14)) (* 30 (select s0 15)) (* 32 (select s0 16)) (* 34 (select s0 17)) (* 36 (select s0 18)) (* 38 (select s0 19)) (select s0 120) (* 2 (select s0 133)) (select s0 205) (select s0 223) (select s0 228) (select s0 229) (select s0 231) 1) (+ (* 20 (select s0 20)) (select s0 21) (* 2 (select s0 22)) (* 3 (select s0 23)) (* 4 (select s0 24)) (* 5 (select s0 25)) (* 6 (select s0 26)) (* 7 (select s0 27)) (* 8 (select s0 28)) (* 9 (select s0 29)) (* 10 (select s0 30)) (* 11 (select s0 31)) (* 12 (select s0 32)) (* 13 (select s0 33)) (* 14 (select s0 34)) (* 15 (select s0 35)) (* 16 (select s0 36)) (* 17 (select s0 37)) (* 18 (select s0 38)) (* 19 (select s0 39)) (* 20 (select s0 60)) (select s0 61) (* 2 (select s0 62)) (* 3 (select s0 63)) (* 4 (select s0 64)) (* 5 (select s0 65)) (* 6 (select s0 66)) (* 7 (select s0 67)) (* 8 (select s0 68)) (* 9 (select s0 69)) (* 10 (select s0 70)) (* 11 (select s0 71)) (* 12 (select s0 72)) (* 13 (select s0 73)) (* 14 (select s0 74)) (* 15 (select s0 75)) (* 16 (select s0 76)) (* 17 (select s0 77)) (* 18 (select s0 78)) (* 19 (select s0 79)) (select s0 80) (* 3 (select s0 81)) (select s0 91) (select s0 92) (select s0 99) (select s0 100) (select s0 104) (select s0 105) (select s0 112) (select s0 118) (select s0 121) (select s0 122) (select s0 129) (* 2 (select s0 134)) (select s0 136) (select s0 138) (select s0 142) (select s0 146) (select s0 203) (select s0 208) (select s0 211) (select s0 213) (select s0 215) (select s0 219)))")
[(declare-fun s0 () (Array Int Int)), (assert (= (+ (* 40 (select s0 20)) (* 2 (select s0 21)) (* 4 (select s0 22)) (* 6 (select s0 23)) (* 8 (select s0 24)) (* 10 (select s0 25)) (* 12 (select s0 26)) (* 14 (select s0 27)) (* 16 (select s0 28)) (* 18 (select s0 29)) (* 20 (select s0 30)) (* 22 (select s0 31)) (* 24 (select s0 32)) (* 26 (select s0 33)) (* 28 (select s0 34)) (* 30 (select s0 35)) (* 32 (select s0 36)) (* 34 (select s0 37)) (* 36 (select s0 38)) (* 38 (select s0 39)) (* 20 (select s0 60)) (select s0 61) (* 2 (select s0 62)) (* 3 (select s0 63)) (* 4 (select s0 64)) (* 5 (select s0 65)) (* 6 (select s0 66)) (* 7 (select s0 67)) (* 8 (select s0 68)) (* 9 (select s0 69)) (* 10 (select s0 70)) (* 11 (select s0 71)) (* 12 (select s0 72)) (* 13 (select s0 73)) (* 14 (select s0 74)) (* 15 (select s0 75)) (* 16 (select s0 76)) (* 17 (select s0 77)) (* 18 (select s0 78)) (* 19 (select s0 79)) (* 2 (select s0 81)) (select s0 91) (select s0 92) (select s0 104) (select s0 105) (select s0 112) (select s0 118) (select s0 121) (select s0 122) (select s0 129) (* 3 (select s0 134)) (* 2 (select s0 136)) (select s0 138) (select s0 142) (select s0 146) (select s0 203) (select s0 208) (select s0 211) (select s0 213) (select s0 215) (select s0 219) 2) (+ (* 60 (select s0 0)) (* 3 (select s0 1)) (* 6 (select s0 2)) (* 9 (select s0 3)) (* 12 (select s0 4)) (* 15 (select s0 5)) (* 18 (select s0 6)) (* 21 (select s0 7)) (* 24 (select s0 8)) (* 27 (select s0 9)) (* 30 (select s0 10)) (* 33 (select s0 11)) (* 36 (select s0 12)) (* 39 (select s0 13)) (* 42 (select s0 14)) (* 45 (select s0 15)) (* 48 (select s0 16)) (* 51 (select s0 17)) (* 54 (select s0 18)) (* 57 (select s0 19)) (* 2 (select s0 80)) (select s0 93) (select s0 94) (select s0 96) (select s0 120) (* 4 (select s0 133)) (select s0 139) (select s0 205) (select s0 209) (select s0 210) (select s0 218) (select s0 222) (select s0 223) (select s0 226) (select s0 227) (* 2 (select s0 228)) (* 2 (select s0 229)) (select s0 231) (select s0 233)))), (assert (= 1 (+ (select s0 80) (select s0 133) (select s0 134) (select s0 137) (select s0 138)))), (assert (= (+ (* 40 (select s0 0)) (* 2 (select s0 1)) (* 4 (select s0 2)) (* 6 (select s0 3)) (* 8 (select s0 4)) (* 10 (select s0 5)) (* 12 (select s0 6)) (* 14 (select s0 7)) (* 16 (select s0 8)) (* 18 (select s0 9)) (* 20 (select s0 10)) (* 22 (select s0 11)) (* 24 (select s0 12)) (* 26 (select s0 13)) (* 28 (select s0 14)) (* 30 (select s0 15)) (* 32 (select s0 16)) (* 34 (select s0 17)) (* 36 (select s0 18)) (* 38 (select s0 19)) (* 3 (select s0 80)) (* 3 (select s0 133)) (select s0 218) (select s0 222) (select s0 223) (select s0 226) (select s0 227) (* 2 (select s0 228)) (* 2 (select s0 229)) (select s0 231) (select s0 233) -3) (+ (* 40 (select s0 20)) (* 2 (select s0 21)) (* 4 (select s0 22)) (* 6 (select s0 23)) (* 8 (select s0 24)) (* 10 (select s0 25)) (* 12 (select s0 26)) (* 14 (select s0 27)) (* 16 (select s0 28)) (* 18 (select s0 29)) (* 20 (select s0 30)) (* 22 (select s0 31)) (* 24 (select s0 32)) (* 26 (select s0 33)) (* 28 (select s0 34)) (* 30 (select s0 35)) (* 32 (select s0 36)) (* 34 (select s0 37)) (* 36 (select s0 38)) (* 38 (select s0 39)) (* 2 (select s0 134)) (select s0 136) (select s0 138) (select s0 142) (select s0 146) (select s0 211) (select s0 213) (select s0 215) (select s0 216) (select s0 219) (select s0 220)))), (assert (= (+ (* 40 (select s0 0)) (* 2 (select s0 1)) (* 4 (select s0 2)) (* 6 (select s0 3)) (* 8 (select s0 4)) (* 10 (select s0 5)) (* 12 (select s0 6)) (* 14 (select s0 7)) (* 16 (select s0 8)) (* 18 (select s0 9)) (* 20 (select s0 10)) (* 22 (select s0 11)) (* 24 (select s0 12)) (* 26 (select s0 13)) (* 28 (select s0 14)) (* 30 (select s0 15)) (* 32 (select s0 16)) (* 34 (select s0 17)) (* 36 (select s0 18)) (* 38 (select s0 19)) (* 3 (select s0 80)) (* 3 (select s0 133)) (select s0 222) (select s0 223) (select s0 226) (select s0 227) (* 2 (select s0 228)) (* 2 (select s0 229)) (select s0 231) (select s0 233) -3) (+ (* 40 (select s0 20)) (* 2 (select s0 21)) (* 4 (select s0 22)) (* 6 (select s0 23)) (* 8 (select s0 24)) (* 10 (select s0 25)) (* 12 (select s0 26)) (* 14 (select s0 27)) (* 16 (select s0 28)) (* 18 (select s0 29)) (* 20 (select s0 30)) (* 22 (select s0 31)) (* 24 (select s0 32)) (* 26 (select s0 33)) (* 28 (select s0 34)) (* 30 (select s0 35)) (* 32 (select s0 36)) (* 34 (select s0 37)) (* 36 (select s0 38)) (* 38 (select s0 39)) (* 2 (select s0 134)) (select s0 136) (select s0 138) (select s0 142) (select s0 146) (select s0 211) (select s0 213) (select s0 217) (select s0 219) (select s0 220)))), (assert (= 1 (+ (select s0 80) (select s0 133) (select s0 134) (select s0 135) (select s0 136)))), (assert (= (+ (* 40 (select s0 20)) (* 2 (select s0 21)) (* 4 (select s0 22)) (* 6 (select s0 23)) (* 8 (select s0 24)) (* 10 (select s0 25)) (* 12 (select s0 26)) (* 14 (select s0 27)) (* 16 (select s0 28)) (* 18 (select s0 29)) (* 20 (select s0 30)) (* 22 (select s0 31)) (* 24 (select s0 32)) (* 26 (select s0 33)) (* 28 (select s0 34)) (* 30 (select s0 35)) (* 32 (select s0 36)) (* 34 (select s0 37)) (* 36 (select s0 38)) (* 38 (select s0 39)) (* 2 (select s0 134)) (select s0 136) (select s0 138) (select s0 142) (select s0 146) 4) (+ (* 40 (select s0 0)) (* 2 (select s0 1)) (* 4 (select s0 2)) (* 6 (select s0 3)) (* 8 (select s0 4)) (* 10 (select s0 5)) (* 12 (select s0 6)) (* 14 (select s0 7)) (* 16 (select s0 8)) (* 18 (select s0 9)) (* 20 (select s0 10)) (* 22 (select s0 11)) (* 24 (select s0 12)) (* 26 (select s0 13)) (* 28 (select s0 14)) (* 30 (select s0 15)) (* 32 (select s0 16)) (* 34 (select s0 17)) (* 36 (select s0 18)) (* 38 (select s0 19)) (* 4 (select s0 80)) (* 4 (select s0 133)) (select s0 139) (select s0 209) (select s0 210) (select s0 212) (select s0 214) (select s0 218) (select s0 222) (select s0 223) (select s0 226) (select s0 227) (* 2 (select s0 228)) (* 2 (select s0 229)) (select s0 231) (select s0 233)))), (assert (= (+ (* 40 (select s0 0)) (* 2 (select s0 1)) (* 4 (select s0 2)) (* 6 (select s0 3)) (* 8 (select s0 4)) (* 10 (select s0 5)) (* 12 (select s0 6)) (* 14 (select s0 7)) (* 16 (select s0 8)) (* 18 (select s0 9)) (* 20 (select s0 10)) (* 22 (select s0 11)) (* 24 (select s0 12)) (* 26 (select s0 13)) (* 28 (select s0 14)) (* 30 (select s0 15)) (* 32 (select s0 16)) (* 34 (select s0 17)) (* 36 (select s0 18)) (* 38 (select s0 19)) (select s0 120) (* 2 (select s0 133)) (select s0 205) (select s0 223) (select s0 228) (select s0 229) (select s0 231) 1) (+ (* 20 (select s0 20)) (select s0 21) (* 2 (select s0 22)) (* 3 (select s0 23)) (* 4 (select s0 24)) (* 5 (select s0 25)) (* 6 (select s0 26)) (* 7 (select s0 27)) (* 8 (select s0 28)) (* 9 (select s0 29)) (* 10 (select s0 30)) (* 11 (select s0 31)) (* 12 (select s0 32)) (* 13 (select s0 33)) (* 14 (select s0 34)) (* 15 (select s0 35)) (* 16 (select s0 36)) (* 17 (select s0 37)) (* 18 (select s0 38)) (* 19 (select s0 39)) (* 20 (select s0 60)) (select s0 61) (* 2 (select s0 62)) (* 3 (select s0 63)) (* 4 (select s0 64)) (* 5 (select s0 65)) (* 6 (select s0 66)) (* 7 (select s0 67)) (* 8 (select s0 68)) (* 9 (select s0 69)) (* 10 (select s0 70)) (* 11 (select s0 71)) (* 12 (select s0 72)) (* 13 (select s0 73)) (* 14 (select s0 74)) (* 15 (select s0 75)) (* 16 (select s0 76)) (* 17 (select s0 77)) (* 18 (select s0 78)) (* 19 (select s0 79)) (select s0 80) (* 3 (select s0 81)) (select s0 91) (select s0 92) (select s0 99) (select s0 100) (select s0 104) (select s0 105) (select s0 112) (select s0 118) (select s0 121) (select s0 122) (select s0 129) (* 2 (select s0 134)) (select s0 136) (select s0 138) (select s0 142) (select s0 146) (select s0 203) (select s0 208) (select s0 211) (select s0 213) (select s0 215) (select s0 219)))), (assert (= (+ (* 20 (select s0 20)) (select s0 21) (* 2 (select s0 22)) (* 3 (select s0 23)) (* 4 (select s0 24)) (* 5 (select s0 25)) (* 6 (select s0 26)) (* 7 (select s0 27)) (* 8 (select s0 28)) (* 9 (select s0 29)) (* 10 (select s0 30)) (* 11 (select s0 31)) (* 12 (select s0 32)) (* 13 (select s0 33)) (* 14 (select s0 34)) (* 15 (select s0 35)) (* 16 (select s0 36)) (* 17 (select s0 37)) (* 18 (select s0 38)) (* 19 (select s0 39)) (select s0 134) (select s0 136) (select s0 165) (select s0 182) (select s0 208) (select s0 211) (select s0 213) (select s0 215) (select s0 219) 3) (+ (* 20 (select s0 0)) (select s0 1) (* 2 (select s0 2)) (* 3 (select s0 3)) (* 4 (select s0 4)) (* 5 (select s0 5)) (* 6 (select s0 6)) (* 7 (select s0 7)) (* 8 (select s0 8)) (* 9 (select s0 9)) (* 10 (select s0 10)) (* 11 (select s0 11)) (* 12 (select s0 12)) (* 13 (select s0 13)) (* 14 (select s0 14)) (* 15 (select s0 15)) (* 16 (select s0 16)) (* 17 (select s0 17)) (* 18 (select s0 18)) (* 19 (select s0 19)) (* 3 (select s0 80)) (* 3 (select s0 133)) (* 2 (select s0 139)) (* 2 (select s0 140)) (select s0 141) (select s0 143) (select s0 147) (select s0 148) (select s0 183) (select s0 184) (select s0 202) (select s0 205) (select s0 228) (select s0 229) (select s0 231)))), (assert (= (+ (* 20 (select s0 0)) (select s0 1) (* 2 (select s0 2)) (* 3 (select s0 3)) (* 4 (select s0 4)) (* 5 (select s0 5)) (* 6 (select s0 6)) (* 7 (select s0 7)) (* 8 (select s0 8)) (* 9 (select s0 9)) (* 10 (select s0 10)) (* 11 (select s0 11)) (* 12 (select s0 12)) (* 13 (select s0 13)) (* 14 (select s0 14)) (* 15 (select s0 15)) (* 16 (select s0 16)) (* 17 (select s0 17)) (* 18 (select s0 18)) (* 19 (select s0 19)) (* 2 (select s0 80)) (* 2 (select s0 133)) (select s0 139) (select s0 140) (select s0 147) (select s0 148) (select s0 183) (select s0 184) (select s0 202) (select s0 205) (select s0 228) (select s0 229) (select s0 231) -2) (+ (* 20 (select s0 20)) (select s0 21) (* 2 (select s0 22)) (* 3 (select s0 23)) (* 4 (select s0 24)) (* 5 (select s0 25)) (* 6 (select s0 26)) (* 7 (select s0 27)) (* 8 (select s0 28)) (* 9 (select s0 29)) (* 10 (select s0 30)) (* 11 (select s0 31)) (* 12 (select s0 32)) (* 13 (select s0 33)) (* 14 (select s0 34)) (* 15 (select s0 35)) (* 16 (select s0 36)) (* 17 (select s0 37)) (* 18 (select s0 38)) (* 19 (select s0 39)) (select s0 134) (select s0 136) (select s0 142) (select s0 144) (select s0 165) (select s0 182) (select s0 208) (select s0 211) (select s0 213) (select s0 215) (select s0 219)))), (assert (= (+ (* 20 (select s0 20)) (select s0 21) (* 2 (select s0 22)) (* 3 (select s0 23)) (* 4 (select s0 24)) (* 5 (select s0 25)) (* 6 (select s0 26)) (* 7 (select s0 27)) (* 8 (select s0 28)) (* 9 (select s0 29)) (* 10 (select s0 30)) (* 11 (select s0 31)) (* 12 (select s0 32)) (* 13 (select s0 33)) (* 14 (select s0 34)) (* 15 (select s0 35)) (* 16 (select s0 36)) (* 17 (select s0 37)) (* 18 (select s0 38)) (* 19 (select s0 39)) (* 20 (select s0 60)) (select s0 61) (* 2 (select s0 62)) (* 3 (select s0 63)) (* 4 (select s0 64)) (* 5 (select s0 65)) (* 6 (select s0 66)) (* 7 (select s0 67)) (* 8 (select s0 68)) (* 9 (select s0 69)) (* 10 (select s0 70)) (* 11 (select s0 71)) (* 12 (select s0 72)) (* 13 (select s0 73)) (* 14 (select s0 74)) (* 15 (select s0 75)) (* 16 (select s0 76)) (* 17 (select s0 77)) (* 18 (select s0 78)) (* 19 (select s0 79)) (* 2 (select s0 81)) (select s0 91) (select s0 92) (select s0 104) (select s0 105) (select s0 112) (select s0 118) (select s0 121) (select s0 122) (select s0 129) (* 2 (select s0 134)) (select s0 136) (select s0 138) (select s0 142) (select s0 146) (select s0 203) (select s0 208) (select s0 211) (select s0 213) (select s0 215) (select s0 219) 0) (+ (* 40 (select s0 0)) (* 2 (select s0 1)) (* 4 (select s0 2)) (* 6 (select s0 3)) (* 8 (select s0 4)) (* 10 (select s0 5)) (* 12 (select s0 6)) (* 14 (select s0 7)) (* 16 (select s0 8)) (* 18 (select s0 9)) (* 20 (select s0 10)) (* 22 (select s0 11)) (* 24 (select s0 12)) (* 26 (select s0 13)) (* 28 (select s0 14)) (* 30 (select s0 15)) (* 32 (select s0 16)) (* 34 (select s0 17)) (* 36 (select s0 18)) (* 38 (select s0 19)) (select s0 98) (select s0 120) (* 2 (select s0 133)) (select s0 205) (select s0 223) (select s0 228) (select s0 229) (select s0 231)))), (assert (= (+ (* 60 (select s0 0)) (* 3 (select s0 1)) (* 6 (select s0 2)) (* 9 (select s0 3)) (* 12 (select s0 4)) (* 15 (select s0 5)) (* 18 (select s0 6)) (* 21 (select s0 7)) (* 24 (select s0 8)) (* 27 (select s0 9)) (* 30 (select s0 10)) (* 33 (select s0 11)) (* 36 (select s0 12)) (* 39 (select s0 13)) (* 42 (select s0 14)) (* 45 (select s0 15)) (* 48 (select s0 16)) (* 51 (select s0 17)) (* 54 (select s0 18)) (* 57 (select s0 19)) (select s0 80) (select s0 120) (* 4 (select s0 133)) (select s0 139) (select s0 205) (select s0 209) (select s0 210) (select s0 218) (select s0 222) (select s0 223) (select s0 226) (select s0 227) (* 2 (select s0 228)) (* 2 (select s0 229)) (select s0 231) (select s0 233) -1) (+ (* 40 (select s0 20)) (* 2 (select s0 21)) (* 4 (select s0 22)) (* 6 (select s0 23)) (* 8 (select s0 24)) (* 10 (select s0 25)) (* 12 (select s0 26)) (* 14 (select s0 27)) (* 16 (select s0 28)) (* 18 (select s0 29)) (* 20 (select s0 30)) (* 22 (select s0 31)) (* 24 (select s0 32)) (* 26 (select s0 33)) (* 28 (select s0 34)) (* 30 (select s0 35)) (* 32 (select s0 36)) (* 34 (select s0 37)) (* 36 (select s0 38)) (* 38 (select s0 39)) (* 20 (select s0 60)) (select s0 61) (* 2 (select s0 62)) (* 3 (select s0 63)) (* 4 (select s0 64)) (* 5 (select s0 65)) (* 6 (select s0 66)) (* 7 (select s0 67)) (* 8 (select s0 68)) (* 9 (select s0 69)) (* 10 (select s0 70)) (* 11 (select s0 71)) (* 12 (select s0 72)) (* 13 (select s0 73)) (* 14 (select s0 74)) (* 15 (select s0 75)) (* 16 (select s0 76)) (* 17 (select s0 77)) (* 18 (select s0 78)) (* 19 (select s0 79)) (* 3 (select s0 81)) (select s0 91) (select s0 92) (select s0 95) (select s0 97) (select s0 104) (select s0 105) (select s0 112) (select s0 118) (select s0 121) (select s0 122) (select s0 129) (* 3 (select s0 134)) (* 2 (select s0 136)) (select s0 138) (select s0 142) (select s0 146) (select s0 203) (select s0 208) (select s0 211) (select s0 213) (select s0 215) (select s0 219)))), (assert (and (>= (select s0 136) 1) (>= (select s0 138) 1))), (assert (>= (select s0 0) 0)), (assert (>= (select s0 1) 0)), (assert (>= (select s0 2) 0)), (assert (>= (select s0 3) 0)), (assert (>= (select s0 4) 0)), (assert (>= (select s0 5) 0)), (assert (>= (select s0 6) 0)), (assert (>= (select s0 7) 0)), (assert (>= (select s0 8) 0)), (assert (>= (select s0 9) 0)), (assert (>= (select s0 10) 0)), (assert (>= (select s0 11) 0)), (assert (>= (select s0 12) 0)), (assert (>= (select s0 13) 0)), (assert (>= (select s0 14) 0)), (assert (>= (select s0 15) 0)), (assert (>= (select s0 16) 0)), (assert (>= (select s0 17) 0)), (assert (>= (select s0 18) 0)), (assert (>= (select s0 19) 0)), (assert (>= (select s0 20) 0)), (assert (>= (select s0 21) 0)), (assert (>= (select s0 22) 0)), (assert (>= (select s0 23) 0)), (assert (>= (select s0 24) 0)), (assert (>= (select s0 25) 0)), (assert (>= (select s0 26) 0)), (assert (>= (select s0 27) 0)), (assert (>= (select s0 28) 0)), (assert (>= (select s0 29) 0)), (assert (>= (select s0 30) 0)), (assert (>= (select s0 31) 0)), (assert (>= (select s0 32) 0)), (assert (>= (select s0 33) 0)), (assert (>= (select s0 34) 0)), (assert (>= (select s0 35) 0)), (assert (>= (select s0 36) 0)), (assert (>= (select s0 37) 0)), (assert (>= (select s0 38) 0)), (assert (>= (select s0 39) 0)), (assert (>= (select s0 60) 0)), (assert (>= (select s0 61) 0)), (assert (>= (select s0 62) 0)), (assert (>= (select s0 63) 0)), (assert (>= (select s0 64) 0)), (assert (>= (select s0 65) 0)), (assert (>= (select s0 66) 0)), (assert (>= (select s0 67) 0)), (assert (>= (select s0 68) 0)), (assert (>= (select s0 69) 0)), (assert (>= (select s0 70) 0)), (assert (>= (select s0 71) 0)), (assert (>= (select s0 72) 0)), (assert (>= (select s0 73) 0)), (assert (>= (select s0 74) 0)), (assert (>= (select s0 75) 0)), (assert (>= (select s0 76) 0)), (assert (>= (select s0 77) 0)), (assert (>= (select s0 78) 0)), (assert (>= (select s0 79) 0)), (assert (>= (select s0 80) 0)), (assert (>= (select s0 81) 0)), (assert (>= (select s0 91) 0)), (assert (>= (select s0 92) 0)), (assert (>= (select s0 93) 0)), (assert (>= (select s0 94) 0)), (assert (>= (select s0 95) 0)), (assert (>= (select s0 96) 0)), (assert (>= (select s0 97) 0)), (assert (>= (select s0 98) 0)), (assert (>= (select s0 99) 0)), (assert (>= (select s0 100) 0)), (assert (>= (select s0 104) 0)), (assert (>= (select s0 105) 0)), (assert (>= (select s0 112) 0)), (assert (>= (select s0 118) 0)), (assert (>= (select s0 120) 0)), (assert (>= (select s0 121) 0)), (assert (>= (select s0 122) 0)), (assert (>= (select s0 129) 0)), (assert (>= (select s0 133) 0)), (assert (>= (select s0 134) 0)), (assert (>= (select s0 135) 0)), (assert (>= (select s0 136) 0)), (assert (>= (select s0 137) 0)), (assert (>= (select s0 138) 0)), (assert (>= (select s0 139) 0)), (assert (>= (select s0 140) 0)), (assert (>= (select s0 141) 0)), (assert (>= (select s0 142) 0)), (assert (>= (select s0 143) 0)), (assert (>= (select s0 144) 0)), (assert (>= (select s0 146) 0)), (assert (>= (select s0 147) 0)), (assert (>= (select s0 148) 0)), (assert (>= (select s0 165) 0)), (assert (>= (select s0 182) 0)), (assert (>= (select s0 183) 0)), (assert (>= (select s0 184) 0)), (assert (>= (select s0 202) 0)), (assert (>= (select s0 203) 0)), (assert (>= (select s0 205) 0)), (assert (>= (select s0 208) 0)), (assert (>= (select s0 209) 0)), (assert (>= (select s0 210) 0)), (assert (>= (select s0 211) 0)), (assert (>= (select s0 212) 0)), (assert (>= (select s0 213) 0)), (assert (>= (select s0 214) 0)), (assert (>= (select s0 215) 0)), (assert (>= (select s0 216) 0)), (assert (>= (select s0 217) 0)), (assert (>= (select s0 218) 0)), (assert (>= (select s0 219) 0)), (assert (>= (select s0 220) 0)), (assert (>= (select s0 222) 0)), (assert (>= (select s0 223) 0)), (assert (>= (select s0 226) 0)), (assert (>= (select s0 227) 0)), (assert (>= (select s0 228) 0)), (assert (>= (select s0 229) 0)), (assert (>= (select s0 231) 0)), (assert (>= (select s0 233) 0))]
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@69283aec
java.lang.RuntimeException: SMT solver raised an exception or timeout when executing script :
org.smtlib.impl.Script@69283aec
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:450)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 11:48:00] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-20b-ReachabilityFireability-12 K-induction depth 0
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:343)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$1(Gal2SMTFrontEnd.java:278)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:170)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.verify(KInductionSolver.java:586)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:305)
... 3 more
[2020-05-15 11:48:00] [INFO ] SMT solved 0/ 7 properties. Interrupting SMT analysis.
[2020-05-15 11:48:00] [INFO ] Built C files in 6410ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589543281242

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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="DES-PT-20b"
export BK_EXAMINATION="ReachabilityFireability"
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 DES-PT-20b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r051-ebro-158902545900271"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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