About the Execution of ITS-Tools for DES-PT-30b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15741.200 | 347391.00 | 481807.00 | 194.30 | TTTTFTTFTFTFTTTT | 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-158902546000287.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-30b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546000287
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 3.3K Mar 30 01:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 01:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 28 16:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:19 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.3K Apr 8 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 08:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 08:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 26 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 103K 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-30b-ReachabilityFireability-00
FORMULA_NAME DES-PT-30b-ReachabilityFireability-01
FORMULA_NAME DES-PT-30b-ReachabilityFireability-02
FORMULA_NAME DES-PT-30b-ReachabilityFireability-03
FORMULA_NAME DES-PT-30b-ReachabilityFireability-04
FORMULA_NAME DES-PT-30b-ReachabilityFireability-05
FORMULA_NAME DES-PT-30b-ReachabilityFireability-06
FORMULA_NAME DES-PT-30b-ReachabilityFireability-07
FORMULA_NAME DES-PT-30b-ReachabilityFireability-08
FORMULA_NAME DES-PT-30b-ReachabilityFireability-09
FORMULA_NAME DES-PT-30b-ReachabilityFireability-10
FORMULA_NAME DES-PT-30b-ReachabilityFireability-11
FORMULA_NAME DES-PT-30b-ReachabilityFireability-12
FORMULA_NAME DES-PT-30b-ReachabilityFireability-13
FORMULA_NAME DES-PT-30b-ReachabilityFireability-14
FORMULA_NAME DES-PT-30b-ReachabilityFireability-15
=== Now, execution of the tool begins
BK_START 1589548196495
[2020-05-15 13:09:59] [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 13:09:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-15 13:09:59] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2020-05-15 13:09:59] [INFO ] Transformed 399 places.
[2020-05-15 13:09:59] [INFO ] Transformed 350 transitions.
[2020-05-15 13:09:59] [INFO ] Found NUPN structural information;
[2020-05-15 13:09:59] [INFO ] Parsed PT model containing 399 places and 350 transitions in 241 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 65 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 78 resets, run finished after 147 ms. (steps per millisecond=68 ) properties seen :[0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0]
FORMULA DES-PT-30b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA DES-PT-30b-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 12 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 11 resets, run finished after 35 ms. (steps per millisecond=285 ) 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 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 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 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 10 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 15 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 12 resets, run finished after 120 ms. (steps per millisecond=83 ) 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 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 350 rows 399 cols
[2020-05-15 13:10:00] [INFO ] Computed 65 place invariants in 54 ms
[2020-05-15 13:10:00] [INFO ] [Real]Absence check using 39 positive place invariants in 67 ms returned sat
[2020-05-15 13:10:01] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 41 ms returned sat
[2020-05-15 13:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:01] [INFO ] [Real]Absence check using state equation in 831 ms returned sat
[2020-05-15 13:10:02] [INFO ] Deduced a trap composed of 8 places in 228 ms
[2020-05-15 13:10:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2020-05-15 13:10:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:10:02] [INFO ] [Nat]Absence check using 39 positive place invariants in 79 ms returned sat
[2020-05-15 13:10:02] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 74 ms returned sat
[2020-05-15 13:10:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:03] [INFO ] [Nat]Absence check using state equation in 1047 ms returned sat
[2020-05-15 13:10:03] [INFO ] Deduced a trap composed of 18 places in 151 ms
[2020-05-15 13:10:04] [INFO ] Deduced a trap composed of 10 places in 126 ms
[2020-05-15 13:10:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 446 ms
[2020-05-15 13:10:04] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 41 ms.
[2020-05-15 13:10:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t297 0) (and (and (> t157 0) (< o157 o297)) (and (> t100 0) (< o100 o297))))") while checking expression at index 0
[2020-05-15 13:10:07] [INFO ] [Real]Absence check using 39 positive place invariants in 64 ms returned sat
[2020-05-15 13:10:07] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 71 ms returned sat
[2020-05-15 13:10:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:09] [INFO ] [Real]Absence check using state equation in 1716 ms returned sat
[2020-05-15 13:10:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:10:09] [INFO ] [Nat]Absence check using 39 positive place invariants in 69 ms returned sat
[2020-05-15 13:10:09] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 80 ms returned sat
[2020-05-15 13:10:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:11] [INFO ] [Nat]Absence check using state equation in 1423 ms returned sat
[2020-05-15 13:10:11] [INFO ] Deduced a trap composed of 45 places in 233 ms
[2020-05-15 13:10:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2020-05-15 13:10:11] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 39 ms.
[2020-05-15 13:10:14] [INFO ] Added : 225 causal constraints over 45 iterations in 3040 ms. Result :(error "Failed to check-sat")
[2020-05-15 13:10:14] [INFO ] [Real]Absence check using 39 positive place invariants in 45 ms returned sat
[2020-05-15 13:10:14] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 37 ms returned sat
[2020-05-15 13:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:15] [INFO ] [Real]Absence check using state equation in 873 ms returned sat
[2020-05-15 13:10:15] [INFO ] Deduced a trap composed of 12 places in 294 ms
[2020-05-15 13:10:16] [INFO ] Deduced a trap composed of 14 places in 246 ms
[2020-05-15 13:10:16] [INFO ] Deduced a trap composed of 15 places in 236 ms
[2020-05-15 13:10:16] [INFO ] Deduced a trap composed of 16 places in 244 ms
[2020-05-15 13:10:17] [INFO ] Deduced a trap composed of 12 places in 251 ms
[2020-05-15 13:10:17] [INFO ] Deduced a trap composed of 23 places in 279 ms
[2020-05-15 13:10:17] [INFO ] Deduced a trap composed of 14 places in 222 ms
[2020-05-15 13:10:17] [INFO ] Deduced a trap composed of 20 places in 216 ms
[2020-05-15 13:10:18] [INFO ] Deduced a trap composed of 15 places in 213 ms
[2020-05-15 13:10:18] [INFO ] Deduced a trap composed of 14 places in 242 ms
[2020-05-15 13:10:18] [INFO ] Deduced a trap composed of 28 places in 330 ms
[2020-05-15 13:10:19] [INFO ] Deduced a trap composed of 19 places in 355 ms
[2020-05-15 13:10:19] [INFO ] Deduced a trap composed of 16 places in 489 ms
[2020-05-15 13:10:19] [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 (> (+ s0 s128 s129 s187 s188 s189 s191 s315 s316 s317 s326 s327 s328 s329 s344 s351) 0)") while checking expression at index 2
[2020-05-15 13:10:20] [INFO ] [Real]Absence check using 39 positive place invariants in 67 ms returned sat
[2020-05-15 13:10:20] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 49 ms returned sat
[2020-05-15 13:10:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:21] [INFO ] [Real]Absence check using state equation in 1047 ms returned sat
[2020-05-15 13:10:21] [INFO ] Deduced a trap composed of 14 places in 263 ms
[2020-05-15 13:10:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 342 ms
[2020-05-15 13:10:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:10:21] [INFO ] [Nat]Absence check using 39 positive place invariants in 133 ms returned sat
[2020-05-15 13:10:22] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 106 ms returned sat
[2020-05-15 13:10:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:23] [INFO ] [Nat]Absence check using state equation in 1636 ms returned sat
[2020-05-15 13:10:23] [INFO ] Deduced a trap composed of 8 places in 145 ms
[2020-05-15 13:10:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2020-05-15 13:10:24] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 41 ms.
[2020-05-15 13:10:26] [INFO ] Added : 200 causal constraints over 40 iterations in 2720 ms. Result :unknown
[2020-05-15 13:10:26] [INFO ] [Real]Absence check using 39 positive place invariants in 67 ms returned sat
[2020-05-15 13:10:26] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 54 ms returned sat
[2020-05-15 13:10:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:27] [INFO ] [Real]Absence check using state equation in 987 ms returned sat
[2020-05-15 13:10:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:10:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 67 ms returned sat
[2020-05-15 13:10:28] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 56 ms returned sat
[2020-05-15 13:10:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:29] [INFO ] [Nat]Absence check using state equation in 1052 ms returned sat
[2020-05-15 13:10:29] [INFO ] Deduced a trap composed of 8 places in 146 ms
[2020-05-15 13:10:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2020-05-15 13:10:29] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 43 ms.
[2020-05-15 13:10:32] [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 (=> (> t335 0) (and (and (> t69 0) (< o69 o335)) (and (> t320 0) (< o320 o335))))") while checking expression at index 4
[2020-05-15 13:10:33] [INFO ] [Real]Absence check using 39 positive place invariants in 44 ms returned sat
[2020-05-15 13:10:33] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 34 ms returned sat
[2020-05-15 13:10:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:33] [INFO ] [Real]Absence check using state equation in 762 ms returned sat
[2020-05-15 13:10:34] [INFO ] Deduced a trap composed of 14 places in 194 ms
[2020-05-15 13:10:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 261 ms
[2020-05-15 13:10:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:10:34] [INFO ] [Nat]Absence check using 39 positive place invariants in 77 ms returned sat
[2020-05-15 13:10:34] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 47 ms returned sat
[2020-05-15 13:10:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:35] [INFO ] [Nat]Absence check using state equation in 994 ms returned sat
[2020-05-15 13:10:35] [INFO ] Deduced a trap composed of 9 places in 259 ms
[2020-05-15 13:10:35] [INFO ] Deduced a trap composed of 29 places in 223 ms
[2020-05-15 13:10:36] [INFO ] Deduced a trap composed of 39 places in 148 ms
[2020-05-15 13:10:36] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 848 ms
[2020-05-15 13:10:36] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 38 ms.
[2020-05-15 13:10:39] [INFO ] Added : 195 causal constraints over 39 iterations in 2932 ms. Result :unknown
[2020-05-15 13:10:39] [INFO ] [Real]Absence check using 39 positive place invariants in 59 ms returned sat
[2020-05-15 13:10:39] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 61 ms returned sat
[2020-05-15 13:10:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:42] [INFO ] [Real]Absence check using state equation in 3072 ms returned sat
[2020-05-15 13:10:42] [INFO ] Deduced a trap composed of 8 places in 196 ms
[2020-05-15 13:10:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 319 ms
[2020-05-15 13:10:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:10:43] [INFO ] [Nat]Absence check using 39 positive place invariants in 81 ms returned sat
[2020-05-15 13:10:43] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 54 ms returned sat
[2020-05-15 13:10:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:44] [INFO ] [Nat]Absence check using state equation in 1788 ms returned sat
[2020-05-15 13:10:45] [INFO ] Deduced a trap composed of 8 places in 322 ms
[2020-05-15 13:10:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 409 ms
[2020-05-15 13:10:45] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 59 ms.
[2020-05-15 13:10:47] [INFO ] Added : 180 causal constraints over 36 iterations in 2592 ms. Result :(error "Failed to check-sat")
[2020-05-15 13:10:48] [INFO ] [Real]Absence check using 39 positive place invariants in 80 ms returned sat
[2020-05-15 13:10:48] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 77 ms returned sat
[2020-05-15 13:10:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:50] [INFO ] [Real]Absence check using state equation in 1800 ms returned sat
[2020-05-15 13:10:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:10:50] [INFO ] [Nat]Absence check using 39 positive place invariants in 93 ms returned sat
[2020-05-15 13:10:50] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 63 ms returned sat
[2020-05-15 13:10:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:52] [INFO ] [Nat]Absence check using state equation in 1823 ms returned sat
[2020-05-15 13:10:52] [INFO ] Deduced a trap composed of 8 places in 241 ms
[2020-05-15 13:10:52] [INFO ] Deduced a trap composed of 14 places in 169 ms
[2020-05-15 13:10:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 576 ms
[2020-05-15 13:10:53] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 76 ms.
[2020-05-15 13:10:55] [INFO ] Added : 130 causal constraints over 26 iterations in 2364 ms. Result :unknown
[2020-05-15 13:10:55] [INFO ] [Real]Absence check using 39 positive place invariants in 61 ms returned sat
[2020-05-15 13:10:55] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 68 ms returned sat
[2020-05-15 13:10:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:10:57] [INFO ] [Real]Absence check using state equation in 1887 ms returned sat
[2020-05-15 13:10:57] [INFO ] Deduced a trap composed of 12 places in 172 ms
[2020-05-15 13:10:58] [INFO ] Deduced a trap composed of 30 places in 142 ms
[2020-05-15 13:10:58] [INFO ] Deduced a trap composed of 8 places in 145 ms
[2020-05-15 13:10:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 618 ms
[2020-05-15 13:10:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:10:58] [INFO ] [Nat]Absence check using 39 positive place invariants in 67 ms returned sat
[2020-05-15 13:10:58] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 98 ms returned sat
[2020-05-15 13:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:11:00] [INFO ] [Nat]Absence check using state equation in 1531 ms returned sat
[2020-05-15 13:11:00] [INFO ] Deduced a trap composed of 14 places in 285 ms
[2020-05-15 13:11:00] [INFO ] Deduced a trap composed of 8 places in 292 ms
[2020-05-15 13:11:00] [INFO ] Deduced a trap composed of 19 places in 170 ms
[2020-05-15 13:11:01] [INFO ] Deduced a trap composed of 22 places in 161 ms
[2020-05-15 13:11:01] [INFO ] Deduced a trap composed of 24 places in 135 ms
[2020-05-15 13:11:01] [INFO ] Deduced a trap composed of 22 places in 74 ms
[2020-05-15 13:11:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1568 ms
[2020-05-15 13:11:01] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 40 ms.
[2020-05-15 13:11:03] [INFO ] Added : 110 causal constraints over 22 iterations in 1655 ms. Result :(error "Failed to check-sat")
[2020-05-15 13:11:03] [INFO ] [Real]Absence check using 39 positive place invariants in 48 ms returned sat
[2020-05-15 13:11:03] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 54 ms returned sat
[2020-05-15 13:11:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:11:04] [INFO ] [Real]Absence check using state equation in 1144 ms returned sat
[2020-05-15 13:11:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:11:04] [INFO ] [Nat]Absence check using 39 positive place invariants in 71 ms returned sat
[2020-05-15 13:11:04] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 81 ms returned sat
[2020-05-15 13:11:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:11:07] [INFO ] [Nat]Absence check using state equation in 2898 ms returned sat
[2020-05-15 13:11:08] [INFO ] Deduced a trap composed of 17 places in 202 ms
[2020-05-15 13:11:08] [INFO ] Deduced a trap composed of 23 places in 216 ms
[2020-05-15 13:11:08] [INFO ] Deduced a trap composed of 8 places in 115 ms
[2020-05-15 13:11:08] [INFO ] Deduced a trap composed of 32 places in 155 ms
[2020-05-15 13:11:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 901 ms
[2020-05-15 13:11:08] [INFO ] Computed and/alt/rep : 349/847/349 causal constraints in 59 ms.
[2020-05-15 13:11:09] [INFO ] Added : 55 causal constraints over 11 iterations in 970 ms. Result :unknown
Incomplete Parikh walk after 441700 steps, including 4713 resets, run finished after 2325 ms. (steps per millisecond=189 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0] could not realise parikh vector
FORMULA DES-PT-30b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 391900 steps, including 4068 resets, run finished after 1997 ms. (steps per millisecond=196 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 449500 steps, including 4754 resets, run finished after 2224 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0, 1, 0, 0, 0] could not realise parikh vector
FORMULA DES-PT-30b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 422900 steps, including 4470 resets, run finished after 1932 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 72 out of 399 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 399/399 places, 350/350 transitions.
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (complete) has 858 edges and 399 vertex of which 388 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.16 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 388 transition count 333
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 23 place count 378 transition count 333
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 23 place count 378 transition count 326
Deduced a syphon composed of 7 places in 7 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 37 place count 371 transition count 326
Symmetric choice reduction at 2 with 15 rule applications. Total rules 52 place count 371 transition count 326
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 82 place count 356 transition count 311
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 356 transition count 311
Deduced a syphon composed of 8 places in 4 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 106 place count 348 transition count 303
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 115 place count 348 transition count 294
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 118 place count 346 transition count 293
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 202 place count 304 transition count 251
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 204 place count 303 transition count 252
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 208 place count 303 transition count 248
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 212 place count 299 transition count 248
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 215 place count 299 transition count 245
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 218 place count 296 transition count 245
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 219 place count 296 transition count 245
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 220 place count 295 transition count 244
Applied a total of 220 rules in 321 ms. Remains 295 /399 variables (removed 104) and now considering 244/350 (removed 106) transitions.
Finished structural reductions, in 1 iterations. Remains : 295/399 places, 244/350 transitions.
Incomplete random walk after 1000000 steps, including 14330 resets, run finished after 4402 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2155 resets, run finished after 1807 ms. (steps per millisecond=553 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2287 resets, run finished after 2033 ms. (steps per millisecond=491 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2233 resets, run finished after 1987 ms. (steps per millisecond=503 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2360 resets, run finished after 2367 ms. (steps per millisecond=422 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2324 resets, run finished after 2096 ms. (steps per millisecond=477 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2180 resets, run finished after 2818 ms. (steps per millisecond=354 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3108 resets, run finished after 2355 ms. (steps per millisecond=424 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2520 resets, run finished after 3084 ms. (steps per millisecond=324 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1]
FORMULA DES-PT-30b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 244 rows 295 cols
[2020-05-15 13:11:41] [INFO ] Computed 61 place invariants in 19 ms
[2020-05-15 13:11:41] [INFO ] [Real]Absence check using 36 positive place invariants in 42 ms returned sat
[2020-05-15 13:11:41] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 36 ms returned sat
[2020-05-15 13:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:11:42] [INFO ] [Real]Absence check using state equation in 532 ms returned sat
[2020-05-15 13:11:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:11:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 52 ms returned sat
[2020-05-15 13:11:42] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 87 ms returned sat
[2020-05-15 13:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:11:43] [INFO ] [Nat]Absence check using state equation in 813 ms returned sat
[2020-05-15 13:11:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 13:11:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-05-15 13:11:43] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 29 ms.
[2020-05-15 13:11:46] [INFO ] Added : 234 causal constraints over 47 iterations in 2915 ms. Result :sat
[2020-05-15 13:11:46] [INFO ] Deduced a trap composed of 25 places in 208 ms
[2020-05-15 13:11:46] [INFO ] Deduced a trap composed of 21 places in 139 ms
[2020-05-15 13:11:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 534 ms
Attempting to minimize the solution found.
Minimization took 45 ms.
[2020-05-15 13:11:46] [INFO ] [Real]Absence check using 36 positive place invariants in 67 ms returned sat
[2020-05-15 13:11:47] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 59 ms returned sat
[2020-05-15 13:11:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:11:47] [INFO ] [Real]Absence check using state equation in 772 ms returned sat
[2020-05-15 13:11:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:11:48] [INFO ] [Nat]Absence check using 36 positive place invariants in 47 ms returned sat
[2020-05-15 13:11:48] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 202 ms returned sat
[2020-05-15 13:11:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:11:48] [INFO ] [Nat]Absence check using state equation in 660 ms returned sat
[2020-05-15 13:11:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2020-05-15 13:11:48] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 34 ms.
[2020-05-15 13:11:52] [INFO ] Added : 230 causal constraints over 46 iterations in 3919 ms. Result :sat
[2020-05-15 13:11:52] [INFO ] Deduced a trap composed of 24 places in 75 ms
[2020-05-15 13:11:53] [INFO ] Deduced a trap composed of 33 places in 80 ms
[2020-05-15 13:11:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
Attempting to minimize the solution found.
Minimization took 36 ms.
[2020-05-15 13:11:53] [INFO ] [Real]Absence check using 36 positive place invariants in 71 ms returned sat
[2020-05-15 13:11:53] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 42 ms returned sat
[2020-05-15 13:11:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:11:54] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2020-05-15 13:11:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:11:54] [INFO ] [Nat]Absence check using 36 positive place invariants in 41 ms returned sat
[2020-05-15 13:11:54] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 113 ms returned sat
[2020-05-15 13:11:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:11:55] [INFO ] [Nat]Absence check using state equation in 849 ms returned sat
[2020-05-15 13:11:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2020-05-15 13:11:55] [INFO ] Deduced a trap composed of 25 places in 91 ms
[2020-05-15 13:11:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2020-05-15 13:11:55] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 27 ms.
[2020-05-15 13:11:58] [INFO ] Added : 194 causal constraints over 40 iterations in 2641 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-05-15 13:11:58] [INFO ] [Real]Absence check using 36 positive place invariants in 38 ms returned sat
[2020-05-15 13:11:58] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 50 ms returned sat
[2020-05-15 13:11:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:11:59] [INFO ] [Real]Absence check using state equation in 1019 ms returned sat
[2020-05-15 13:11:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:11:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 56 ms returned sat
[2020-05-15 13:11:59] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 137 ms returned sat
[2020-05-15 13:11:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:12:00] [INFO ] [Nat]Absence check using state equation in 661 ms returned sat
[2020-05-15 13:12:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2020-05-15 13:12:00] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 25 ms.
[2020-05-15 13:12:03] [INFO ] Added : 229 causal constraints over 47 iterations in 3082 ms. Result :sat
[2020-05-15 13:12:03] [INFO ] Deduced a trap composed of 23 places in 219 ms
[2020-05-15 13:12:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
Attempting to minimize the solution found.
Minimization took 33 ms.
[2020-05-15 13:12:04] [INFO ] [Real]Absence check using 36 positive place invariants in 38 ms returned sat
[2020-05-15 13:12:04] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 60 ms returned sat
[2020-05-15 13:12:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:12:05] [INFO ] [Real]Absence check using state equation in 799 ms returned sat
[2020-05-15 13:12:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:12:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 79 ms returned sat
[2020-05-15 13:12:06] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 955 ms returned sat
[2020-05-15 13:12:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:12:07] [INFO ] [Nat]Absence check using state equation in 1082 ms returned sat
[2020-05-15 13:12:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-05-15 13:12:07] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 38 ms.
[2020-05-15 13:12:09] [INFO ] Added : 175 causal constraints over 35 iterations in 2292 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-05-15 13:12:09] [INFO ] [Real]Absence check using 36 positive place invariants in 34 ms returned sat
[2020-05-15 13:12:09] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 42 ms returned sat
[2020-05-15 13:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:12:11] [INFO ] [Real]Absence check using state equation in 1910 ms returned sat
[2020-05-15 13:12:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:12:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 40 ms returned sat
[2020-05-15 13:12:12] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 88 ms returned sat
[2020-05-15 13:12:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:12:13] [INFO ] [Nat]Absence check using state equation in 1115 ms returned sat
[2020-05-15 13:12:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2020-05-15 13:12:13] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 28 ms.
[2020-05-15 13:12:17] [INFO ] Added : 226 causal constraints over 46 iterations in 3889 ms. Result :sat
[2020-05-15 13:12:17] [INFO ] Deduced a trap composed of 43 places in 152 ms
[2020-05-15 13:12:17] [INFO ] Deduced a trap composed of 34 places in 135 ms
[2020-05-15 13:12:17] [INFO ] Deduced a trap composed of 34 places in 124 ms
[2020-05-15 13:12:17] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 743 ms
Attempting to minimize the solution found.
Minimization took 47 ms.
[2020-05-15 13:12:18] [INFO ] [Real]Absence check using 36 positive place invariants in 94 ms returned sat
[2020-05-15 13:12:18] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 59 ms returned sat
[2020-05-15 13:12:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:12:19] [INFO ] [Real]Absence check using state equation in 854 ms returned sat
[2020-05-15 13:12:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:12:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 54 ms returned sat
[2020-05-15 13:12:19] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 219 ms returned sat
[2020-05-15 13:12:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:12:20] [INFO ] [Nat]Absence check using state equation in 847 ms returned sat
[2020-05-15 13:12:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2020-05-15 13:12:20] [INFO ] Deduced a trap composed of 16 places in 34 ms
[2020-05-15 13:12:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2020-05-15 13:12:20] [INFO ] Computed and/alt/rep : 242/1006/242 causal constraints in 28 ms.
[2020-05-15 13:12:23] [INFO ] Added : 223 causal constraints over 45 iterations in 3473 ms. Result :sat
[2020-05-15 13:12:24] [INFO ] Deduced a trap composed of 36 places in 291 ms
[2020-05-15 13:12:24] [INFO ] Deduced a trap composed of 37 places in 156 ms
[2020-05-15 13:12:24] [INFO ] Deduced a trap composed of 36 places in 121 ms
[2020-05-15 13:12:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 833 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
Incomplete Parikh walk after 241000 steps, including 4304 resets, run finished after 1104 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 96600 steps, including 1616 resets, run finished after 410 ms. (steps per millisecond=235 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 182100 steps, including 3221 resets, run finished after 770 ms. (steps per millisecond=236 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 253900 steps, including 4528 resets, run finished after 1082 ms. (steps per millisecond=234 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 127600 steps, including 2267 resets, run finished after 539 ms. (steps per millisecond=236 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 118900 steps, including 2016 resets, run finished after 498 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 160600 steps, including 2917 resets, run finished after 742 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 50 out of 295 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 295/295 places, 244/244 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 295 transition count 242
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 293 transition count 242
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 293 transition count 239
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 290 transition count 239
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 290 transition count 239
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 289 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 289 transition count 237
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 38 place count 277 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 276 transition count 224
Applied a total of 39 rules in 90 ms. Remains 276 /295 variables (removed 19) and now considering 224/244 (removed 20) transitions.
Finished structural reductions, in 1 iterations. Remains : 276/295 places, 224/244 transitions.
Incomplete random walk after 1000000 steps, including 17214 resets, run finished after 4024 ms. (steps per millisecond=248 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2710 resets, run finished after 1694 ms. (steps per millisecond=590 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2642 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 2720 resets, run finished after 1908 ms. (steps per millisecond=524 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 2767 resets, run finished after 2305 ms. (steps per millisecond=433 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2777 resets, run finished after 2051 ms. (steps per millisecond=487 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 2638 resets, run finished after 2860 ms. (steps per millisecond=349 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 3872 resets, run finished after 2282 ms. (steps per millisecond=438 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 7621867 steps, run timeout after 30001 ms. (steps per millisecond=254 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 7621867 steps, saw 1010930 distinct states, run finished after 30002 ms. (steps per millisecond=254 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 224 rows 276 cols
[2020-05-15 13:13:19] [INFO ] Computed 61 place invariants in 12 ms
[2020-05-15 13:13:19] [INFO ] [Real]Absence check using 37 positive place invariants in 42 ms returned sat
[2020-05-15 13:13:19] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 75 ms returned sat
[2020-05-15 13:13:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:19] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2020-05-15 13:13:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:13:20] [INFO ] [Nat]Absence check using 37 positive place invariants in 39 ms returned sat
[2020-05-15 13:13:20] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 61 ms returned sat
[2020-05-15 13:13:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:20] [INFO ] [Nat]Absence check using state equation in 793 ms returned sat
[2020-05-15 13:13:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 13:13:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 24 ms returned sat
[2020-05-15 13:13:21] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 88 ms.
[2020-05-15 13:13:23] [INFO ] Added : 191 causal constraints over 39 iterations in 2759 ms. Result :sat
[2020-05-15 13:13:23] [INFO ] Deduced a trap composed of 12 places in 188 ms
[2020-05-15 13:13:24] [INFO ] Deduced a trap composed of 31 places in 277 ms
[2020-05-15 13:13:24] [INFO ] Deduced a trap composed of 10 places in 115 ms
[2020-05-15 13:13:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 821 ms
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-05-15 13:13:24] [INFO ] [Real]Absence check using 37 positive place invariants in 77 ms returned sat
[2020-05-15 13:13:24] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 34 ms returned sat
[2020-05-15 13:13:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:25] [INFO ] [Real]Absence check using state equation in 638 ms returned sat
[2020-05-15 13:13:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:13:25] [INFO ] [Nat]Absence check using 37 positive place invariants in 44 ms returned sat
[2020-05-15 13:13:25] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 80 ms returned sat
[2020-05-15 13:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:26] [INFO ] [Nat]Absence check using state equation in 966 ms returned sat
[2020-05-15 13:13:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-05-15 13:13:26] [INFO ] Deduced a trap composed of 12 places in 106 ms
[2020-05-15 13:13:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2020-05-15 13:13:27] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 28 ms.
[2020-05-15 13:13:28] [INFO ] Added : 177 causal constraints over 36 iterations in 1907 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-05-15 13:13:29] [INFO ] [Real]Absence check using 37 positive place invariants in 45 ms returned sat
[2020-05-15 13:13:29] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 33 ms returned sat
[2020-05-15 13:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:29] [INFO ] [Real]Absence check using state equation in 491 ms returned sat
[2020-05-15 13:13:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:13:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 48 ms returned sat
[2020-05-15 13:13:30] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 148 ms returned sat
[2020-05-15 13:13:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:30] [INFO ] [Nat]Absence check using state equation in 604 ms returned sat
[2020-05-15 13:13:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-05-15 13:13:30] [INFO ] Deduced a trap composed of 10 places in 158 ms
[2020-05-15 13:13:30] [INFO ] Deduced a trap composed of 21 places in 128 ms
[2020-05-15 13:13:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 363 ms
[2020-05-15 13:13:31] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 27 ms.
[2020-05-15 13:13:32] [INFO ] Added : 167 causal constraints over 34 iterations in 1980 ms. Result :sat
[2020-05-15 13:13:33] [INFO ] Deduced a trap composed of 22 places in 134 ms
[2020-05-15 13:13:33] [INFO ] Deduced a trap composed of 26 places in 103 ms
[2020-05-15 13:13:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 397 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-05-15 13:13:33] [INFO ] [Real]Absence check using 37 positive place invariants in 37 ms returned sat
[2020-05-15 13:13:33] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 34 ms returned sat
[2020-05-15 13:13:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:34] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2020-05-15 13:13:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:13:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 71 ms returned sat
[2020-05-15 13:13:35] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 242 ms returned sat
[2020-05-15 13:13:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:35] [INFO ] [Nat]Absence check using state equation in 523 ms returned sat
[2020-05-15 13:13:35] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2020-05-15 13:13:35] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 30 ms.
[2020-05-15 13:13:38] [INFO ] Added : 208 causal constraints over 42 iterations in 2269 ms. Result :sat
[2020-05-15 13:13:38] [INFO ] Deduced a trap composed of 18 places in 139 ms
[2020-05-15 13:13:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
[2020-05-15 13:13:38] [INFO ] [Real]Absence check using 37 positive place invariants in 38 ms returned sat
[2020-05-15 13:13:38] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 25 ms returned sat
[2020-05-15 13:13:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:39] [INFO ] [Real]Absence check using state equation in 536 ms returned sat
[2020-05-15 13:13:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:13:39] [INFO ] [Nat]Absence check using 37 positive place invariants in 41 ms returned sat
[2020-05-15 13:13:39] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 71 ms returned sat
[2020-05-15 13:13:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:39] [INFO ] [Nat]Absence check using state equation in 657 ms returned sat
[2020-05-15 13:13:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2020-05-15 13:13:40] [INFO ] Deduced a trap composed of 12 places in 101 ms
[2020-05-15 13:13:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 165 ms
[2020-05-15 13:13:40] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 22 ms.
[2020-05-15 13:13:42] [INFO ] Added : 151 causal constraints over 31 iterations in 1899 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-05-15 13:13:42] [INFO ] [Real]Absence check using 37 positive place invariants in 39 ms returned sat
[2020-05-15 13:13:42] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 38 ms returned sat
[2020-05-15 13:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:43] [INFO ] [Real]Absence check using state equation in 1483 ms returned sat
[2020-05-15 13:13:43] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:13:43] [INFO ] [Nat]Absence check using 37 positive place invariants in 48 ms returned sat
[2020-05-15 13:13:43] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 46 ms returned sat
[2020-05-15 13:13:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:45] [INFO ] [Nat]Absence check using state equation in 1371 ms returned sat
[2020-05-15 13:13:45] [INFO ] [Nat]Added 2 Read/Feed constraints in 28 ms returned sat
[2020-05-15 13:13:45] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 24 ms.
[2020-05-15 13:13:48] [INFO ] Added : 205 causal constraints over 41 iterations in 2857 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-05-15 13:13:48] [INFO ] [Real]Absence check using 37 positive place invariants in 47 ms returned sat
[2020-05-15 13:13:48] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 36 ms returned sat
[2020-05-15 13:13:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:50] [INFO ] [Real]Absence check using state equation in 1551 ms returned sat
[2020-05-15 13:13:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:13:50] [INFO ] [Nat]Absence check using 37 positive place invariants in 35 ms returned sat
[2020-05-15 13:13:50] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 77 ms returned sat
[2020-05-15 13:13:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:13:51] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2020-05-15 13:13:51] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2020-05-15 13:13:51] [INFO ] Deduced a trap composed of 15 places in 48 ms
[2020-05-15 13:13:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2020-05-15 13:13:51] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 22 ms.
[2020-05-15 13:13:53] [INFO ] Added : 199 causal constraints over 40 iterations in 2692 ms. Result :sat
[2020-05-15 13:13:53] [INFO ] Deduced a trap composed of 12 places in 146 ms
[2020-05-15 13:13:54] [INFO ] Deduced a trap composed of 21 places in 135 ms
[2020-05-15 13:13:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 436 ms
Attempting to minimize the solution found.
Minimization took 32 ms.
Incomplete Parikh walk after 213500 steps, including 4547 resets, run finished after 969 ms. (steps per millisecond=220 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 243400 steps, including 5335 resets, run finished after 1191 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 153400 steps, including 3258 resets, run finished after 743 ms. (steps per millisecond=206 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 232500 steps, including 5253 resets, run finished after 1032 ms. (steps per millisecond=225 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 126400 steps, including 2717 resets, run finished after 627 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 102100 steps, including 2166 resets, run finished after 446 ms. (steps per millisecond=228 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 136000 steps, including 3062 resets, run finished after 671 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 50 out of 276 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 276/276 places, 224/224 transitions.
Applied a total of 0 rules in 55 ms. Remains 276 /276 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 224/224 transitions.
Starting structural reductions, iteration 0 : 276/276 places, 224/224 transitions.
Applied a total of 0 rules in 30 ms. Remains 276 /276 variables (removed 0) and now considering 224/224 (removed 0) transitions.
// Phase 1: matrix 224 rows 276 cols
[2020-05-15 13:14:00] [INFO ] Computed 61 place invariants in 11 ms
[2020-05-15 13:14:01] [INFO ] Implicit Places using invariants in 1422 ms returned []
// Phase 1: matrix 224 rows 276 cols
[2020-05-15 13:14:01] [INFO ] Computed 61 place invariants in 14 ms
[2020-05-15 13:14:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 13:14:03] [INFO ] Implicit Places using invariants and state equation in 2435 ms returned []
Implicit Place search using SMT with State Equation took 3860 ms to find 0 implicit places.
[2020-05-15 13:14:03] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 224 rows 276 cols
[2020-05-15 13:14:03] [INFO ] Computed 61 place invariants in 6 ms
[2020-05-15 13:14:04] [INFO ] Dead Transitions using invariants and state equation in 983 ms returned []
Finished structural reductions, in 1 iterations. Remains : 276/276 places, 224/224 transitions.
Incomplete random walk after 100000 steps, including 1730 resets, run finished after 462 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 224 rows 276 cols
[2020-05-15 13:14:05] [INFO ] Computed 61 place invariants in 9 ms
[2020-05-15 13:14:05] [INFO ] [Real]Absence check using 37 positive place invariants in 31 ms returned sat
[2020-05-15 13:14:05] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 26 ms returned sat
[2020-05-15 13:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:06] [INFO ] [Real]Absence check using state equation in 766 ms returned sat
[2020-05-15 13:14:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:14:06] [INFO ] [Nat]Absence check using 37 positive place invariants in 37 ms returned sat
[2020-05-15 13:14:06] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 31 ms returned sat
[2020-05-15 13:14:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:07] [INFO ] [Nat]Absence check using state equation in 856 ms returned sat
[2020-05-15 13:14:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-15 13:14:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-05-15 13:14:07] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 39 ms.
[2020-05-15 13:14:10] [INFO ] Added : 191 causal constraints over 39 iterations in 2773 ms. Result :sat
[2020-05-15 13:14:10] [INFO ] Deduced a trap composed of 12 places in 188 ms
[2020-05-15 13:14:10] [INFO ] Deduced a trap composed of 31 places in 138 ms
[2020-05-15 13:14:10] [INFO ] Deduced a trap composed of 10 places in 212 ms
[2020-05-15 13:14:11] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 827 ms
[2020-05-15 13:14:11] [INFO ] [Real]Absence check using 37 positive place invariants in 67 ms returned sat
[2020-05-15 13:14:11] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 31 ms returned sat
[2020-05-15 13:14:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:11] [INFO ] [Real]Absence check using state equation in 571 ms returned sat
[2020-05-15 13:14:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:14:12] [INFO ] [Nat]Absence check using 37 positive place invariants in 62 ms returned sat
[2020-05-15 13:14:12] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 133 ms returned sat
[2020-05-15 13:14:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:13] [INFO ] [Nat]Absence check using state equation in 905 ms returned sat
[2020-05-15 13:14:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-05-15 13:14:13] [INFO ] Deduced a trap composed of 12 places in 181 ms
[2020-05-15 13:14:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 305 ms
[2020-05-15 13:14:13] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 27 ms.
[2020-05-15 13:14:15] [INFO ] Added : 177 causal constraints over 36 iterations in 2005 ms. Result :sat
[2020-05-15 13:14:15] [INFO ] [Real]Absence check using 37 positive place invariants in 44 ms returned sat
[2020-05-15 13:14:15] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 36 ms returned sat
[2020-05-15 13:14:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:16] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2020-05-15 13:14:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:14:16] [INFO ] [Nat]Absence check using 37 positive place invariants in 41 ms returned sat
[2020-05-15 13:14:16] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 189 ms returned sat
[2020-05-15 13:14:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:17] [INFO ] [Nat]Absence check using state equation in 777 ms returned sat
[2020-05-15 13:14:17] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-05-15 13:14:17] [INFO ] Deduced a trap composed of 10 places in 188 ms
[2020-05-15 13:14:17] [INFO ] Deduced a trap composed of 21 places in 118 ms
[2020-05-15 13:14:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 372 ms
[2020-05-15 13:14:17] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 20 ms.
[2020-05-15 13:14:19] [INFO ] Added : 167 causal constraints over 34 iterations in 1950 ms. Result :sat
[2020-05-15 13:14:19] [INFO ] Deduced a trap composed of 22 places in 129 ms
[2020-05-15 13:14:19] [INFO ] Deduced a trap composed of 26 places in 105 ms
[2020-05-15 13:14:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 428 ms
[2020-05-15 13:14:20] [INFO ] [Real]Absence check using 37 positive place invariants in 37 ms returned sat
[2020-05-15 13:14:20] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 33 ms returned sat
[2020-05-15 13:14:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:20] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2020-05-15 13:14:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:14:21] [INFO ] [Nat]Absence check using 37 positive place invariants in 50 ms returned sat
[2020-05-15 13:14:21] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 226 ms returned sat
[2020-05-15 13:14:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:21] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2020-05-15 13:14:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2020-05-15 13:14:21] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 25 ms.
[2020-05-15 13:14:23] [INFO ] Added : 208 causal constraints over 42 iterations in 2020 ms. Result :sat
[2020-05-15 13:14:24] [INFO ] Deduced a trap composed of 18 places in 130 ms
[2020-05-15 13:14:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2020-05-15 13:14:24] [INFO ] [Real]Absence check using 37 positive place invariants in 40 ms returned sat
[2020-05-15 13:14:24] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 28 ms returned sat
[2020-05-15 13:14:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:24] [INFO ] [Real]Absence check using state equation in 490 ms returned sat
[2020-05-15 13:14:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:14:24] [INFO ] [Nat]Absence check using 37 positive place invariants in 46 ms returned sat
[2020-05-15 13:14:25] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 84 ms returned sat
[2020-05-15 13:14:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:25] [INFO ] [Nat]Absence check using state equation in 643 ms returned sat
[2020-05-15 13:14:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2020-05-15 13:14:25] [INFO ] Deduced a trap composed of 12 places in 59 ms
[2020-05-15 13:14:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2020-05-15 13:14:25] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 29 ms.
[2020-05-15 13:14:27] [INFO ] Added : 151 causal constraints over 31 iterations in 1936 ms. Result :sat
[2020-05-15 13:14:27] [INFO ] [Real]Absence check using 37 positive place invariants in 46 ms returned sat
[2020-05-15 13:14:27] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 43 ms returned sat
[2020-05-15 13:14:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:29] [INFO ] [Real]Absence check using state equation in 1241 ms returned sat
[2020-05-15 13:14:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:14:29] [INFO ] [Nat]Absence check using 37 positive place invariants in 35 ms returned sat
[2020-05-15 13:14:29] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 76 ms returned sat
[2020-05-15 13:14:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:30] [INFO ] [Nat]Absence check using state equation in 1493 ms returned sat
[2020-05-15 13:14:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 28 ms returned sat
[2020-05-15 13:14:31] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 82 ms.
[2020-05-15 13:14:33] [INFO ] Added : 205 causal constraints over 41 iterations in 2755 ms. Result :sat
[2020-05-15 13:14:34] [INFO ] [Real]Absence check using 37 positive place invariants in 65 ms returned sat
[2020-05-15 13:14:34] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 34 ms returned sat
[2020-05-15 13:14:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:35] [INFO ] [Real]Absence check using state equation in 1561 ms returned sat
[2020-05-15 13:14:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:14:35] [INFO ] [Nat]Absence check using 37 positive place invariants in 50 ms returned sat
[2020-05-15 13:14:35] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 94 ms returned sat
[2020-05-15 13:14:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:36] [INFO ] [Nat]Absence check using state equation in 873 ms returned sat
[2020-05-15 13:14:36] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2020-05-15 13:14:36] [INFO ] Deduced a trap composed of 15 places in 75 ms
[2020-05-15 13:14:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 124 ms
[2020-05-15 13:14:36] [INFO ] Computed and/alt/rep : 220/950/220 causal constraints in 60 ms.
[2020-05-15 13:14:39] [INFO ] Added : 199 causal constraints over 40 iterations in 2667 ms. Result :sat
[2020-05-15 13:14:39] [INFO ] Deduced a trap composed of 12 places in 137 ms
[2020-05-15 13:14:39] [INFO ] Deduced a trap composed of 21 places in 112 ms
[2020-05-15 13:14:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
Applied a total of 0 rules in 18 ms. Remains 276 /276 variables (removed 0) and now considering 224/224 (removed 0) transitions.
// Phase 1: matrix 224 rows 276 cols
[2020-05-15 13:14:40] [INFO ] Computed 61 place invariants in 4 ms
[2020-05-15 13:14:40] [INFO ] [Real]Absence check using 37 positive place invariants in 39 ms returned sat
[2020-05-15 13:14:40] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 24 ms returned sat
[2020-05-15 13:14:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:40] [INFO ] [Real]Absence check using state equation in 502 ms returned sat
[2020-05-15 13:14:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:14:40] [INFO ] [Nat]Absence check using 37 positive place invariants in 54 ms returned sat
[2020-05-15 13:14:40] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 38 ms returned sat
[2020-05-15 13:14:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:41] [INFO ] [Nat]Absence check using state equation in 822 ms returned sat
[2020-05-15 13:14:41] [INFO ] Deduced a trap composed of 7 places in 109 ms
[2020-05-15 13:14:41] [INFO ] Deduced a trap composed of 4 places in 86 ms
[2020-05-15 13:14:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 278 ms
[2020-05-15 13:14:41] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 25 ms.
[2020-05-15 13:14:44] [INFO ] Added : 213 causal constraints over 43 iterations in 2441 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 27 ms.
[2020-05-15 13:14:44] [INFO ] [Real]Absence check using 37 positive place invariants in 47 ms returned sat
[2020-05-15 13:14:44] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 47 ms returned sat
[2020-05-15 13:14:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:45] [INFO ] [Real]Absence check using state equation in 879 ms returned sat
[2020-05-15 13:14:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:14:45] [INFO ] [Nat]Absence check using 37 positive place invariants in 49 ms returned sat
[2020-05-15 13:14:45] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 88 ms returned sat
[2020-05-15 13:14:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:46] [INFO ] [Nat]Absence check using state equation in 987 ms returned sat
[2020-05-15 13:14:46] [INFO ] Deduced a trap composed of 12 places in 88 ms
[2020-05-15 13:14:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2020-05-15 13:14:46] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 27 ms.
[2020-05-15 13:14:48] [INFO ] Added : 179 causal constraints over 36 iterations in 1932 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-05-15 13:14:49] [INFO ] [Real]Absence check using 37 positive place invariants in 42 ms returned sat
[2020-05-15 13:14:49] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 28 ms returned sat
[2020-05-15 13:14:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:49] [INFO ] [Real]Absence check using state equation in 435 ms returned sat
[2020-05-15 13:14:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:14:49] [INFO ] [Nat]Absence check using 37 positive place invariants in 56 ms returned sat
[2020-05-15 13:14:49] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 182 ms returned sat
[2020-05-15 13:14:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:50] [INFO ] [Nat]Absence check using state equation in 591 ms returned sat
[2020-05-15 13:14:50] [INFO ] Deduced a trap composed of 24 places in 223 ms
[2020-05-15 13:14:50] [INFO ] Deduced a trap composed of 25 places in 153 ms
[2020-05-15 13:14:51] [INFO ] Deduced a trap composed of 10 places in 243 ms
[2020-05-15 13:14:51] [INFO ] Deduced a trap composed of 22 places in 227 ms
[2020-05-15 13:14:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 985 ms
[2020-05-15 13:14:51] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 69 ms.
[2020-05-15 13:14:53] [INFO ] Added : 154 causal constraints over 31 iterations in 1679 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 21 ms.
[2020-05-15 13:14:53] [INFO ] [Real]Absence check using 37 positive place invariants in 38 ms returned sat
[2020-05-15 13:14:53] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 38 ms returned sat
[2020-05-15 13:14:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:54] [INFO ] [Real]Absence check using state equation in 878 ms returned sat
[2020-05-15 13:14:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:14:54] [INFO ] [Nat]Absence check using 37 positive place invariants in 45 ms returned sat
[2020-05-15 13:14:54] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 237 ms returned sat
[2020-05-15 13:14:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:55] [INFO ] [Nat]Absence check using state equation in 534 ms returned sat
[2020-05-15 13:14:55] [INFO ] Deduced a trap composed of 5 places in 170 ms
[2020-05-15 13:14:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2020-05-15 13:14:55] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 26 ms.
[2020-05-15 13:14:57] [INFO ] Added : 212 causal constraints over 43 iterations in 2258 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 25 ms.
[2020-05-15 13:14:57] [INFO ] [Real]Absence check using 37 positive place invariants in 40 ms returned sat
[2020-05-15 13:14:57] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 27 ms returned sat
[2020-05-15 13:14:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:58] [INFO ] [Real]Absence check using state equation in 492 ms returned sat
[2020-05-15 13:14:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:14:58] [INFO ] [Nat]Absence check using 37 positive place invariants in 44 ms returned sat
[2020-05-15 13:14:58] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 82 ms returned sat
[2020-05-15 13:14:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:14:59] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2020-05-15 13:14:59] [INFO ] Deduced a trap composed of 12 places in 90 ms
[2020-05-15 13:14:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
[2020-05-15 13:14:59] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 28 ms.
[2020-05-15 13:15:01] [INFO ] Added : 151 causal constraints over 31 iterations in 1667 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 48 ms.
[2020-05-15 13:15:01] [INFO ] [Real]Absence check using 37 positive place invariants in 33 ms returned sat
[2020-05-15 13:15:01] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 35 ms returned sat
[2020-05-15 13:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:15:02] [INFO ] [Real]Absence check using state equation in 1295 ms returned sat
[2020-05-15 13:15:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:15:02] [INFO ] [Nat]Absence check using 37 positive place invariants in 35 ms returned sat
[2020-05-15 13:15:03] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 43 ms returned sat
[2020-05-15 13:15:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:15:04] [INFO ] [Nat]Absence check using state equation in 1195 ms returned sat
[2020-05-15 13:15:04] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 26 ms.
[2020-05-15 13:15:06] [INFO ] Added : 181 causal constraints over 37 iterations in 2575 ms. Result :sat
[2020-05-15 13:15:07] [INFO ] Deduced a trap composed of 28 places in 170 ms
[2020-05-15 13:15:07] [INFO ] Deduced a trap composed of 32 places in 136 ms
[2020-05-15 13:15:07] [INFO ] Deduced a trap composed of 31 places in 103 ms
[2020-05-15 13:15:07] [INFO ] Deduced a trap composed of 36 places in 95 ms
[2020-05-15 13:15:07] [INFO ] Deduced a trap composed of 31 places in 102 ms
[2020-05-15 13:15:08] [INFO ] Deduced a trap composed of 35 places in 160 ms
[2020-05-15 13:15:08] [INFO ] Deduced a trap composed of 10 places in 183 ms
[2020-05-15 13:15:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1534 ms
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-05-15 13:15:08] [INFO ] [Real]Absence check using 37 positive place invariants in 36 ms returned sat
[2020-05-15 13:15:08] [INFO ] [Real]Absence check using 37 positive and 24 generalized place invariants in 36 ms returned sat
[2020-05-15 13:15:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-15 13:15:10] [INFO ] [Real]Absence check using state equation in 1579 ms returned sat
[2020-05-15 13:15:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-15 13:15:10] [INFO ] [Nat]Absence check using 37 positive place invariants in 41 ms returned sat
[2020-05-15 13:15:10] [INFO ] [Nat]Absence check using 37 positive and 24 generalized place invariants in 82 ms returned sat
[2020-05-15 13:15:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-15 13:15:11] [INFO ] [Nat]Absence check using state equation in 708 ms returned sat
[2020-05-15 13:15:11] [INFO ] Deduced a trap composed of 15 places in 41 ms
[2020-05-15 13:15:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2020-05-15 13:15:11] [INFO ] Computed and/alt/rep : 220/944/220 causal constraints in 28 ms.
[2020-05-15 13:15:13] [INFO ] Added : 200 causal constraints over 40 iterations in 2253 ms. Result :sat
[2020-05-15 13:15:13] [INFO ] Deduced a trap composed of 37 places in 144 ms
[2020-05-15 13:15:13] [INFO ] Deduced a trap composed of 36 places in 122 ms
[2020-05-15 13:15:13] [INFO ] Deduced a trap composed of 35 places in 116 ms
[2020-05-15 13:15:14] [INFO ] Deduced a trap composed of 30 places in 177 ms
[2020-05-15 13:15:14] [INFO ] Deduced a trap composed of 32 places in 114 ms
[2020-05-15 13:15:14] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1139 ms
Attempting to minimize the solution found.
Minimization took 44 ms.
[2020-05-15 13:15:15] [INFO ] Flatten gal took : 154 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-15 13:15:15] [INFO ] Applying decomposition
[2020-05-15 13:15:15] [INFO ] Flatten gal took : 101 ms
[2020-05-15 13:15:15] [INFO ] Flatten gal took : 101 ms
[2020-05-15 13:15:15] [INFO ] Input system was already deterministic with 224 transitions.
[2020-05-15 13:15:15] [INFO ] Input system was already deterministic with 224 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/graph8089056099396169956.txt, -o, /tmp/graph8089056099396169956.bin, -w, /tmp/graph8089056099396169956.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph8089056099396169956.bin, -l, -1, -v, -w, /tmp/graph8089056099396169956.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-15 13:15:15] [INFO ] Decomposing Gal with order
[2020-05-15 13:15:15] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 224 rows 276 cols
[2020-05-15 13:15:15] [INFO ] Computed 61 place invariants in 7 ms
inv : p246 + p256 + p327 + p344 + p345 + p352 + p353 = 1
inv : p246 + p256 + p267 + p312 + p314 = 1
inv : p246 + p256 + p267 + p268 + p269 + p291 + p292 = 1
inv : p246 + p256 + p267 + p268 + p269 + p271 + p275 + p281 + p292 - p308 + p323 + p339 - p349 = 1
inv : p246 + p256 + p327 + p336 + p337 + p352 + p353 = 1
inv : p187 + p227 + p233 + p239 + p240 = 1
inv : p174 + p176 + p181 = 1
inv : p187 + p189 + p190 + p191 = 1
inv : p246 + p256 + p327 + p340 + p341 + p352 + p353 = 1
inv : p246 + p378 + p379 + p380 + p381 + p383 + p386 + p390 = 1
inv : p246 + p256 + p267 + p309 + p310 + p311 = 1
inv : p288 - p292 + p317 - p323 - p345 + p349 = 0
inv : -p1 - p3 + 29*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 + 21*p27 + 22*p28 + 23*p29 + 24*p30 + 25*p31 + 26*p32 + 27*p33 + 28*p34 - 30*p35 - p37 - 2*p38 - 3*p39 - 4*p40 - 5*p41 - 6*p42 - 7*p43 - 8*p44 - 9*p45 - 10*p46 - 11*p47 - 12*p48 - 13*p49 - 14*p50 - 15*p51 - 16*p52 - 17*p53 - 18*p54 - 19*p55 - 20*p56 - 21*p57 - 22*p58 - 23*p59 - 24*p60 - 25*p61 - 26*p62 - 27*p63 - 28*p64 - 29*p65 + p168 + p172 + p173 - p176 - p181 + p246 - p250 - p254 - p256 - p264 - p357 - p358 - p359 - p365 - p370 - p371 - p376 - p377 + p378 + p379 + p391 + p396 = 0
inv : p187 + p227 + p233 + p241 + p242 = 1
inv : p290 - p292 + p320 - p323 - p347 + p349 = 0
inv : p246 + p248 + p249 + p250 + p253 + p254 = 1
inv : p187 + p243 + p244 + p245 = 1
inv : p246 + p256 + p267 + p300 + p302 = 1
inv : p246 + p256 + p267 + p268 + p269 + p271 + p283 + p292 - p311 + p323 + p341 - p349 = 1
inv : p246 + p256 + p327 + p334 + p335 + p352 + p353 = 1
inv : p133 + p135 + p136 + p141 = 1
inv : p246 + p256 + p357 + p358 + p359 + p360 + p363 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p376 + p377 = 1
inv : p246 + p256 + p267 + p268 + p269 + p271 + p275 + p276 + p277 + p292 - p302 + p323 + p335 - p349 = 1
inv : p246 + p256 + p327 + p348 + p349 + p352 + p353 = 1
inv : p187 + p206 + p214 + p219 + p220 + p223 + p224 = 1
inv : p246 + p256 + p267 + p318 + p320 = 1
inv : p246 + p391 + p397 + p398 = 1
inv : p284 - p292 + p311 - p323 - p341 + p349 = 0
inv : -2*p1 - 2*p3 + 58*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 + 42*p27 + 44*p28 + 46*p29 + 48*p30 + 50*p31 + 52*p32 + 54*p33 + 56*p34 - 60*p35 - 2*p37 - 4*p38 - 6*p39 - 8*p40 - 10*p41 - 12*p42 - 14*p43 - 16*p44 - 18*p45 - 20*p46 - 22*p47 - 24*p48 - 26*p49 - 28*p50 - 30*p51 - 32*p52 - 34*p53 - 36*p54 - 38*p55 - 40*p56 - 42*p57 - 44*p58 - 46*p59 - 48*p60 - 50*p61 - 52*p62 - 54*p63 - 56*p64 - 58*p65 + 2*p246 - 2*p250 - p252 - p254 - p264 - p359 - p365 - p370 - p371 + p373 - p376 - p380 - p383 - p386 + 2*p391 + p396 + p398 = 0
inv : p286 - p292 + p314 - p323 - p343 + p349 = 0
inv : p374 + p375 - p376 - p377 = 0
inv : p246 + p256 + p267 + p268 + p269 + p271 + p275 + p276 + p279 + p292 - p305 + p323 + p337 - p349 = 1
inv : -p1 - p3 + 29*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 + 21*p27 + 22*p28 + 23*p29 + 24*p30 + 25*p31 + 26*p32 + 27*p33 + 28*p34 - 30*p35 - p37 - 2*p38 - 3*p39 - 4*p40 - 5*p41 - 6*p42 - 7*p43 - 8*p44 - 9*p45 - 10*p46 - 11*p47 - 12*p48 - 13*p49 - 14*p50 - 15*p51 - 16*p52 - 17*p53 - 18*p54 - 19*p55 - 20*p56 - 21*p57 - 22*p58 - 23*p59 - 24*p60 - 25*p61 - 26*p62 - 27*p63 - 28*p64 - 29*p65 + 3*p246 - p250 - p252 + 2*p256 + p258 + p261 - p292 - p323 + p349 + p352 - p356 - p359 - p365 - p370 - p374 + p391 + p396 = 2
inv : p246 + p256 + p327 + p342 + p343 + p352 + p353 = 1
inv : p246 + p256 + p258 + p263 + p264 = 1
inv : p1 + p3 - 29*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 - 21*p27 - 22*p28 - 23*p29 - 24*p30 - 25*p31 - 26*p32 - 27*p33 - 28*p34 + 30*p35 + p37 + 2*p38 + 3*p39 + 4*p40 + 5*p41 + 6*p42 + 7*p43 + 8*p44 + 9*p45 + 10*p46 + 11*p47 + 12*p48 + 13*p49 + 14*p50 + 15*p51 + 16*p52 + 17*p53 + 18*p54 + 19*p55 + 20*p56 + 21*p57 + 22*p58 + 23*p59 + 24*p60 + 25*p61 + 26*p62 + 27*p63 + 28*p64 + 29*p65 + p166 + p176 + p181 - p246 + p250 + p254 + p256 + p264 + p357 + p358 + p359 + p365 + p370 + p371 + p376 + p377 - p378 - p379 - p391 - p396 = 1
inv : p246 + p256 + p267 + p268 + p269 + p271 + p289 + p292 - p320 + p323 + p347 - p349 = 1
inv : p246 + p256 + p327 + p346 + p347 + p352 + p353 = 1
inv : p217 + p218 - p219 - p220 = 0
inv : p246 + p256 + p267 + p268 + p269 + p271 + p285 + p292 - p314 + p323 + p343 - p349 = 1
inv : p246 + p256 + p267 + p303 + p305 = 1
inv : p246 + p256 + p267 + p268 + p269 + p271 + p287 + p292 - p317 + p323 + p345 - p349 = 1
inv : p133 + p149 + p150 + p151 + p162 = 1
inv : p246 + p256 + p267 + p315 + p317 = 1
inv : p246 + p248 + p249 + p250 + p251 + p252 = 1
inv : p133 + p142 + p145 + p146 + p147 = 1
inv : p246 + p256 + p267 + p321 + p323 = 1
inv : p183 + p184 + p185 = 1
inv : p282 - p292 + p308 - p323 - p339 + p349 = 0
inv : p350 + p351 - p352 - p353 = 0
inv : p187 + p206 + p214 + p219 + p220 + p221 + p222 = 1
inv : p246 + p391 + p395 + p396 = 1
inv : p280 - p292 + p305 - p323 - p337 + p349 = 0
inv : 2*p1 - 28*p3 - 58*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 - 42*p27 - 44*p28 - 46*p29 - 48*p30 - 50*p31 - 52*p32 - 54*p33 - 56*p34 + 30*p35 + p37 + 2*p38 + 3*p39 + 4*p40 + 5*p41 + 6*p42 + 7*p43 + 8*p44 + 9*p45 + 10*p46 + 11*p47 + 12*p48 + 13*p49 + 14*p50 + 15*p51 + 16*p52 + 17*p53 + 18*p54 + 19*p55 + 20*p56 + 21*p57 + 22*p58 + 23*p59 + 24*p60 + 25*p61 + 26*p62 + 27*p63 + 28*p64 + 29*p65 + 30*p97 + p99 + 2*p100 + 3*p101 + 4*p102 + 5*p103 + 6*p104 + 7*p105 + 8*p106 + 9*p107 + 10*p108 + 11*p109 + 12*p110 + 13*p111 + 14*p112 + 15*p113 + 16*p114 + 17*p115 + 18*p116 + 19*p117 + 20*p118 + 21*p119 + 22*p120 + 23*p121 + 24*p122 + 25*p123 + 26*p124 + 27*p125 + 28*p126 + 29*p127 + p150 + p176 + p181 - p191 - p219 - p222 - p227 - p233 - p242 - 2*p246 + 2*p250 + p252 + p254 + p264 - p351 + p353 + p356 + p359 + p365 + p370 + p374 - p378 - p379 - p391 - p396 = 0
inv : p1 + p3 - 29*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 - 21*p27 - 22*p28 - 23*p29 - 24*p30 - 25*p31 - 26*p32 - 27*p33 - 28*p34 + 30*p35 + p37 + 2*p38 + 3*p39 + 4*p40 + 5*p41 + 6*p42 + 7*p43 + 8*p44 + 9*p45 + 10*p46 + 11*p47 + 12*p48 + 13*p49 + 14*p50 + 15*p51 + 16*p52 + 17*p53 + 18*p54 + 19*p55 + 20*p56 + 21*p57 + 22*p58 + 23*p59 + 24*p60 + 25*p61 + 26*p62 + 27*p63 + 28*p64 + 29*p65 - 2*p246 + p250 + p252 - p256 + p262 + p292 + p323 - p349 - p352 + p356 + p359 + p365 + p370 + p374 - p391 - p396 = -1
inv : p187 + p194 + p195 + p196 + p204 = 1
inv : p278 - p292 + p302 - p323 - p335 + p349 = 0
inv : p246 + p256 + p327 + p338 + p339 + p352 + p353 = 1
inv : p246 + p256 + p267 + p306 + p308 = 1
inv : p246 + p256 + p354 + p356 = 1
inv : 2*p1 + 2*p3 - 58*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 - 42*p27 - 44*p28 - 46*p29 - 48*p30 - 50*p31 - 52*p32 - 54*p33 - 56*p34 + 60*p35 + 2*p37 + 4*p38 + 6*p39 + 8*p40 + 10*p41 + 12*p42 + 14*p43 + 16*p44 + 18*p45 + 20*p46 + 22*p47 + 24*p48 + 26*p49 + 28*p50 + 30*p51 + 32*p52 + 34*p53 + 36*p54 + 38*p55 + 40*p56 + 42*p57 + 44*p58 + 46*p59 + 48*p60 + 50*p61 + 52*p62 + 54*p63 + 56*p64 + 58*p65 - 2*p246 + 2*p250 + p252 + p254 + p264 + p359 + p365 + p372 + p376 + p380 + p383 + p386 - 2*p391 - p396 - p398 = 0
Total of 61 invariants.
[2020-05-15 13:15:15] [INFO ] Computed 61 place invariants in 28 ms
[2020-05-15 13:15:15] [INFO ] Ran tautology test, simplified 0 / 7 in 515 ms.
[2020-05-15 13:15:15] [INFO ] Removed a total of 50 redundant transitions.
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-02(UNSAT) depth K=0 took 15 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-03(UNSAT) depth K=0 took 3 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-04(UNSAT) depth K=0 took 13 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-06(UNSAT) depth K=0 took 1 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-07(UNSAT) depth K=0 took 15 ms
[2020-05-15 13:15:16] [INFO ] Flatten gal took : 136 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-09(UNSAT) depth K=0 took 8 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-10(UNSAT) depth K=0 took 8 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-02(UNSAT) depth K=1 took 6 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-03(UNSAT) depth K=1 took 12 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-04(UNSAT) depth K=1 took 8 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-06(UNSAT) depth K=1 took 2 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-07(UNSAT) depth K=1 took 9 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-09(UNSAT) depth K=1 took 8 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-10(UNSAT) depth K=1 took 12 ms
[2020-05-15 13:15:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 35 ms.
[2020-05-15 13:15:16] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 15 ms
[2020-05-15 13:15:16] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 4 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]
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 [reachable] property : DES-PT-30b-ReachabilityFireability-02 with value :((u14.p73==1)&&(u14.p243==1))
Read [reachable] property : DES-PT-30b-ReachabilityFireability-03 with value :(((u52.p46==1)&&(u52.p391==1))||(((i0.i2.u6.p183==1)&&(u14.p78==1))&&(u14.p243==1)))
Read [invariant] property : DES-PT-30b-ReachabilityFireability-04 with value :(((((i0.i3.u7.p190!=1)||(u16.p24!=1))||(u16.p250!=1))||(i0.i3.u34.p327==1))||((u16.p8==1)&&(u16.p250==1)))
Read [reachable] property : DES-PT-30b-ReachabilityFireability-06 with value :((((u52.p39==1)&&(u52.p391==1))&&(((i0.i2.u5.p181!=1)||(u16.p253!=1))||(i7.i2.u51.p380!=1)))&&(((i0.i4.u9.p221==1)&&(i0.i4.u13.p227==1))||(((((i7.i2.u49.p376==1)&&(i7.i2.u51.p381==1))&&(i0.i3.u7.p190==1))&&(u52.p42==1))&&(i6.i0.u19.p268==1))))
Read [invariant] property : DES-PT-30b-ReachabilityFireability-07 with value :((((((((u52.p58!=1)||(u52.p391!=1))||(u16.p249==1))||(i7.i1.u45.p367==1))||(u14.p72!=1))||(u14.p243!=1))||(i0.i1.u2.p146==1))||(i7.i1.u47.p369!=1))
Read [invariant] property : DES-PT-30b-ReachabilityFireability-09 with value :(((((((((u14.p82!=1)||(u14.p243!=1))||((u52.p60==1)&&(u52.p391==1)))||((u52.p65==1)&&(u52.p391==1)))||((u14.p81==1)&&(u14.p243==1)))||((i7.i1.u4.p172==1)&&(i7.i1.u44.p357==1)))||((((i7.i1.u4.p168==1)&&(i7.i1.u44.p357==1))&&(u16.p30==1))&&(u16.p250==1)))||((((i0.i4.u9.p221==1)&&(i0.i4.u13.p233==1))&&(i6.i3.u25.p289==1))&&(i6.i3.u32.p320==1)))||((((i2.u3.p120==1)&&(i2.u3.p149==1))&&(u14.p96==1))&&(u14.p243==1)))
Read [reachable] property : DES-PT-30b-ReachabilityFireability-10 with value :(((((i2.u3.p108==1)&&(i2.u3.p149==1))&&(((i7.i0.u18.p263==1)&&(i7.i0.u18.p386==1))||((i0.i4.u9.p214!=1)&&(i2.u0.p3!=1))))&&((i6.i2.u29.p310!=1)||(i7.i0.u50.p379!=1)))&&((i5.i0.u21.p276==1)||(i0.i0.u1.p136==1)))
built 12 ordering constraints for composite.
built 21 ordering constraints for composite.
built 3 ordering constraints for composite.
built 9 ordering constraints for composite.
built 24 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 22 ordering constraints for composite.
built 9 ordering constraints for composite.
built 18 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 5 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 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
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-02(UNSAT) depth K=2 took 201 ms
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 224 rows 276 cols
[2020-05-15 13:15:16] [INFO ] Computed 61 place invariants in 5 ms
inv : p246 + p256 + p327 + p344 + p345 + p352 + p353 = 1
inv : p246 + p256 + p267 + p312 + p314 = 1
inv : p246 + p256 + p267 + p268 + p269 + p291 + p292 = 1
inv : p246 + p256 + p267 + p268 + p269 + p271 + p275 + p281 + p292 - p308 + p323 + p339 - p349 = 1
inv : p246 + p256 + p327 + p336 + p337 + p352 + p353 = 1
inv : p187 + p227 + p233 + p239 + p240 = 1
inv : p174 + p176 + p181 = 1
inv : p187 + p189 + p190 + p191 = 1
inv : p246 + p256 + p327 + p340 + p341 + p352 + p353 = 1
inv : p246 + p378 + p379 + p380 + p381 + p383 + p386 + p390 = 1
inv : p246 + p256 + p267 + p309 + p310 + p311 = 1
inv : p288 - p292 + p317 - p323 - p345 + p349 = 0
inv : -p1 - p3 + 29*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 + 21*p27 + 22*p28 + 23*p29 + 24*p30 + 25*p31 + 26*p32 + 27*p33 + 28*p34 - 30*p35 - p37 - 2*p38 - 3*p39 - 4*p40 - 5*p41 - 6*p42 - 7*p43 - 8*p44 - 9*p45 - 10*p46 - 11*p47 - 12*p48 - 13*p49 - 14*p50 - 15*p51 - 16*p52 - 17*p53 - 18*p54 - 19*p55 - 20*p56 - 21*p57 - 22*p58 - 23*p59 - 24*p60 - 25*p61 - 26*p62 - 27*p63 - 28*p64 - 29*p65 + p168 + p172 + p173 - p176 - p181 + p246 - p250 - p254 - p256 - p264 - p357 - p358 - p359 - p365 - p370 - p371 - p376 - p377 + p378 + p379 + p391 + p396 = 0
inv : p187 + p227 + p233 + p241 + p242 = 1
inv : p290 - p292 + p320 - p323 - p347 + p349 = 0
inv : p246 + p248 + p249 + p250 + p253 + p254 = 1
inv : p187 + p243 + p244 + p245 = 1
inv : p246 + p256 + p267 + p300 + p302 = 1
inv : p246 + p256 + p267 + p268 + p269 + p271 + p283 + p292 - p311 + p323 + p341 - p349 = 1
inv : p246 + p256 + p327 + p334 + p335 + p352 + p353 = 1
inv : p133 + p135 + p136 + p141 = 1
inv : p246 + p256 + p357 + p358 + p359 + p360 + p363 + p365 + p366 + p367 + p368 + p369 + p370 + p371 + p376 + p377 = 1
inv : p246 + p256 + p267 + p268 + p269 + p271 + p275 + p276 + p277 + p292 - p302 + p323 + p335 - p349 = 1
inv : p246 + p256 + p327 + p348 + p349 + p352 + p353 = 1
inv : p187 + p206 + p214 + p219 + p220 + p223 + p224 = 1
inv : p246 + p256 + p267 + p318 + p320 = 1
inv : p246 + p391 + p397 + p398 = 1
inv : p284 - p292 + p311 - p323 - p341 + p349 = 0
inv : -2*p1 - 2*p3 + 58*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 + 42*p27 + 44*p28 + 46*p29 + 48*p30 + 50*p31 + 52*p32 + 54*p33 + 56*p34 - 60*p35 - 2*p37 - 4*p38 - 6*p39 - 8*p40 - 10*p41 - 12*p42 - 14*p43 - 16*p44 - 18*p45 - 20*p46 - 22*p47 - 24*p48 - 26*p49 - 28*p50 - 30*p51 - 32*p52 - 34*p53 - 36*p54 - 38*p55 - 40*p56 - 42*p57 - 44*p58 - 46*p59 - 48*p60 - 50*p61 - 52*p62 - 54*p63 - 56*p64 - 58*p65 + 2*p246 - 2*p250 - p252 - p254 - p264 - p359 - p365 - p370 - p371 + p373 - p376 - p380 - p383 - p386 + 2*p391 + p396 + p398 = 0
inv : p286 - p292 + p314 - p323 - p343 + p349 = 0
inv : p374 + p375 - p376 - p377 = 0
inv : p246 + p256 + p267 + p268 + p269 + p271 + p275 + p276 + p279 + p292 - p305 + p323 + p337 - p349 = 1
inv : -p1 - p3 + 29*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 + 21*p27 + 22*p28 + 23*p29 + 24*p30 + 25*p31 + 26*p32 + 27*p33 + 28*p34 - 30*p35 - p37 - 2*p38 - 3*p39 - 4*p40 - 5*p41 - 6*p42 - 7*p43 - 8*p44 - 9*p45 - 10*p46 - 11*p47 - 12*p48 - 13*p49 - 14*p50 - 15*p51 - 16*p52 - 17*p53 - 18*p54 - 19*p55 - 20*p56 - 21*p57 - 22*p58 - 23*p59 - 24*p60 - 25*p61 - 26*p62 - 27*p63 - 28*p64 - 29*p65 + 3*p246 - p250 - p252 + 2*p256 + p258 + p261 - p292 - p323 + p349 + p352 - p356 - p359 - p365 - p370 - p374 + p391 + p396 = 2
inv : p246 + p256 + p327 + p342 + p343 + p352 + p353 = 1
inv : p246 + p256 + p258 + p263 + p264 = 1
inv : p1 + p3 - 29*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 - 21*p27 - 22*p28 - 23*p29 - 24*p30 - 25*p31 - 26*p32 - 27*p33 - 28*p34 + 30*p35 + p37 + 2*p38 + 3*p39 + 4*p40 + 5*p41 + 6*p42 + 7*p43 + 8*p44 + 9*p45 + 10*p46 + 11*p47 + 12*p48 + 13*p49 + 14*p50 + 15*p51 + 16*p52 + 17*p53 + 18*p54 + 19*p55 + 20*p56 + 21*p57 + 22*p58 + 23*p59 + 24*p60 + 25*p61 + 26*p62 + 27*p63 + 28*p64 + 29*p65 + p166 + p176 + p181 - p246 + p250 + p254 + p256 + p264 + p357 + p358 + p359 + p365 + p370 + p371 + p376 + p377 - p378 - p379 - p391 - p396 = 1
inv : p246 + p256 + p267 + p268 + p269 + p271 + p289 + p292 - p320 + p323 + p347 - p349 = 1
inv : p246 + p256 + p327 + p346 + p347 + p352 + p353 = 1
inv : p217 + p218 - p219 - p220 = 0
inv : p246 + p256 + p267 + p268 + p269 + p271 + p285 + p292 - p314 + p323 + p343 - p349 = 1
inv : p246 + p256 + p267 + p303 + p305 = 1
inv : p246 + p256 + p267 + p268 + p269 + p271 + p287 + p292 - p317 + p323 + p345 - p349 = 1
inv : p133 + p149 + p150 + p151 + p162 = 1
inv : p246 + p256 + p267 + p315 + p317 = 1
inv : p246 + p248 + p249 + p250 + p251 + p252 = 1
inv : p133 + p142 + p145 + p146 + p147 = 1
inv : p246 + p256 + p267 + p321 + p323 = 1
inv : p183 + p184 + p185 = 1
inv : p282 - p292 + p308 - p323 - p339 + p349 = 0
inv : p350 + p351 - p352 - p353 = 0
inv : p187 + p206 + p214 + p219 + p220 + p221 + p222 = 1
inv : p246 + p391 + p395 + p396 = 1
inv : p280 - p292 + p305 - p323 - p337 + p349 = 0
inv : 2*p1 - 28*p3 - 58*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 - 42*p27 - 44*p28 - 46*p29 - 48*p30 - 50*p31 - 52*p32 - 54*p33 - 56*p34 + 30*p35 + p37 + 2*p38 + 3*p39 + 4*p40 + 5*p41 + 6*p42 + 7*p43 + 8*p44 + 9*p45 + 10*p46 + 11*p47 + 12*p48 + 13*p49 + 14*p50 + 15*p51 + 16*p52 + 17*p53 + 18*p54 + 19*p55 + 20*p56 + 21*p57 + 22*p58 + 23*p59 + 24*p60 + 25*p61 + 26*p62 + 27*p63 + 28*p64 + 29*p65 + 30*p97 + p99 + 2*p100 + 3*p101 + 4*p102 + 5*p103 + 6*p104 + 7*p105 + 8*p106 + 9*p107 + 10*p108 + 11*p109 + 12*p110 + 13*p111 + 14*p112 + 15*p113 + 16*p114 + 17*p115 + 18*p116 + 19*p117 + 20*p118 + 21*p119 + 22*p120 + 23*p121 + 24*p122 + 25*p123 + 26*p124 + 27*p125 + 28*p126 + 29*p127 + p150 + p176 + p181 - p191 - p219 - p222 - p227 - p233 - p242 - 2*p246 + 2*p250 + p252 + p254 + p264 - p351 + p353 + p356 + p359 + p365 + p370 + p374 - p378 - p379 - p391 - p396 = 0
inv : p1 + p3 - 29*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 - 21*p27 - 22*p28 - 23*p29 - 24*p30 - 25*p31 - 26*p32 - 27*p33 - 28*p34 + 30*p35 + p37 + 2*p38 + 3*p39 + 4*p40 + 5*p41 + 6*p42 + 7*p43 + 8*p44 + 9*p45 + 10*p46 + 11*p47 + 12*p48 + 13*p49 + 14*p50 + 15*p51 + 16*p52 + 17*p53 + 18*p54 + 19*p55 + 20*p56 + 21*p57 + 22*p58 + 23*p59 + 24*p60 + 25*p61 + 26*p62 + 27*p63 + 28*p64 + 29*p65 - 2*p246 + p250 + p252 - p256 + p262 + p292 + p323 - p349 - p352 + p356 + p359 + p365 + p370 + p374 - p391 - p396 = -1
inv : p187 + p194 + p195 + p196 + p204 = 1
inv : p278 - p292 + p302 - p323 - p335 + p349 = 0
inv : p246 + p256 + p327 + p338 + p339 + p352 + p353 = 1
inv : p246 + p256 + p267 + p306 + p308 = 1
inv : p246 + p256 + p354 + p356 = 1
inv : 2*p1 + 2*p3 - 58*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 - 42*p27 - 44*p28 - 46*p29 - 48*p30 - 50*p31 - 52*p32 - 54*p33 - 56*p34 + 60*p35 + 2*p37 + 4*p38 + 6*p39 + 8*p40 + 10*p41 + 12*p42 + 14*p43 + 16*p44 + 18*p45 + 20*p46 + 22*p47 + 24*p48 + 26*p49 + 28*p50 + 30*p51 + 32*p52 + 34*p53 + 36*p54 + 38*p55 + 40*p56 + 42*p57 + 44*p58 + 46*p59 + 48*p60 + 50*p61 + 52*p62 + 54*p63 + 56*p64 + 58*p65 - 2*p246 + 2*p250 + p252 + p254 + p264 + p359 + p365 + p372 + p376 + p380 + p383 + p386 - 2*p391 - p396 - p398 = 0
Total of 61 invariants.
[2020-05-15 13:15:16] [INFO ] Computed 61 place invariants in 20 ms
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-03(UNSAT) depth K=2 took 230 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-04(UNSAT) depth K=2 took 125 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-06(UNSAT) depth K=2 took 94 ms
[2020-05-15 13:15:16] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-07(UNSAT) depth K=2 took 76 ms
SDD proceeding with computation, new max is 2048
[2020-05-15 13:15:17] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-09(UNSAT) depth K=2 took 138 ms
[2020-05-15 13:15:17] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-10(UNSAT) depth K=2 took 117 ms
Invariant property DES-PT-30b-ReachabilityFireability-09 does not hold.
FORMULA DES-PT-30b-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-30b-ReachabilityFireability-03 is true.
FORMULA DES-PT-30b-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property DES-PT-30b-ReachabilityFireability-02 is true.
FORMULA DES-PT-30b-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 4096
[2020-05-15 13:15:17] [INFO ] Proved 276 variables to be positive in 1208 ms
[2020-05-15 13:15:17] [INFO ] Proved 276 variables to be positive in 1821 ms
[2020-05-15 13:15:17] [INFO ] Computing symmetric may disable matrix : 224 transitions.
[2020-05-15 13:15:17] [INFO ] Computation of disable matrix completed :0/224 took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 13:15:17] [INFO ] Computation of Complete disable matrix. took 60 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 13:15:17] [INFO ] Computing symmetric may enable matrix : 224 transitions.
[2020-05-15 13:15:17] [INFO ] Computation of Complete enable matrix. took 44 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-15 13:15:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30b-ReachabilityFireability-04
[2020-05-15 13:15:18] [INFO ] KInduction solution for property DES-PT-30b-ReachabilityFireability-04(SAT) depth K=0 took 483 ms
[2020-05-15 13:15:18] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-02(UNSAT) depth K=3 took 1003 ms
[2020-05-15 13:15:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30b-ReachabilityFireability-06
[2020-05-15 13:15:19] [INFO ] KInduction solution for property DES-PT-30b-ReachabilityFireability-06(SAT) depth K=0 took 1137 ms
[2020-05-15 13:15:19] [INFO ] Computing symmetric co enabling matrix : 224 transitions.
[2020-05-15 13:15:19] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-04(UNSAT) depth K=3 took 1634 ms
[2020-05-15 13:15:19] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30b-ReachabilityFireability-07
[2020-05-15 13:15:19] [INFO ] KInduction solution for property DES-PT-30b-ReachabilityFireability-07(SAT) depth K=0 took 624 ms
SDD proceeding with computation, new max is 8192
[2020-05-15 13:15:20] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-06(UNSAT) depth K=3 took 951 ms
[2020-05-15 13:15:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30b-ReachabilityFireability-10
[2020-05-15 13:15:20] [INFO ] KInduction solution for property DES-PT-30b-ReachabilityFireability-10(SAT) depth K=0 took 938 ms
[2020-05-15 13:15:20] [INFO ] Computation of co-enabling matrix(2/224) took 1388 ms. Total solver calls (SAT/UNSAT): 405(346/59)
[2020-05-15 13:15:21] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-07(UNSAT) depth K=3 took 904 ms
[2020-05-15 13:15:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30b-ReachabilityFireability-04
[2020-05-15 13:15:23] [INFO ] KInduction solution for property DES-PT-30b-ReachabilityFireability-04(SAT) depth K=1 took 2865 ms
[2020-05-15 13:15:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30b-ReachabilityFireability-06
[2020-05-15 13:15:23] [INFO ] KInduction solution for property DES-PT-30b-ReachabilityFireability-06(SAT) depth K=1 took 105 ms
[2020-05-15 13:15:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30b-ReachabilityFireability-07
[2020-05-15 13:15:23] [INFO ] KInduction solution for property DES-PT-30b-ReachabilityFireability-07(SAT) depth K=1 took 135 ms
[2020-05-15 13:15:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30b-ReachabilityFireability-10
[2020-05-15 13:15:24] [INFO ] KInduction solution for property DES-PT-30b-ReachabilityFireability-10(SAT) depth K=1 took 126 ms
[2020-05-15 13:15:24] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-10(UNSAT) depth K=3 took 2765 ms
[2020-05-15 13:15:24] [INFO ] Computation of co-enabling matrix(32/224) took 4817 ms. Total solver calls (SAT/UNSAT): 1589(1181/408)
SDD proceeding with computation, new max is 16384
[2020-05-15 13:15:27] [INFO ] Computation of co-enabling matrix(39/224) took 8293 ms. Total solver calls (SAT/UNSAT): 2464(2035/429)
[2020-05-15 13:15:31] [INFO ] Computation of co-enabling matrix(46/224) took 11424 ms. Total solver calls (SAT/UNSAT): 3290(2840/450)
[2020-05-15 13:15:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDES-PT-30b-ReachabilityFireability-04
[2020-05-15 13:15:33] [INFO ] KInduction solution for property DES-PT-30b-ReachabilityFireability-04(SAT) depth K=2 took 9188 ms
[2020-05-15 13:15:34] [INFO ] Computation of co-enabling matrix(53/224) took 14815 ms. Total solver calls (SAT/UNSAT): 4067(3596/471)
Reachability property DES-PT-30b-ReachabilityFireability-10 is true.
FORMULA DES-PT-30b-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-30b-ReachabilityFireability-07 does not hold.
FORMULA DES-PT-30b-ReachabilityFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property DES-PT-30b-ReachabilityFireability-04 does not hold.
FORMULA DES-PT-30b-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 32768
[2020-05-15 13:15:37] [INFO ] Computation of co-enabling matrix(60/224) took 18242 ms. Total solver calls (SAT/UNSAT): 4795(4303/492)
[2020-05-15 13:15:39] [INFO ] BMC solution for property DES-PT-30b-ReachabilityFireability-04(UNSAT) depth K=4 took 15364 ms
[2020-05-15 13:15:41] [INFO ] Computation of co-enabling matrix(68/224) took 21450 ms. Total solver calls (SAT/UNSAT): 5455(4899/556)
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,4.48168e+16,25.1337,338424,11257,3516,761449,20473,551,674167,334,191615,0
Total reachable state count : 44816762058453792
Verifying 7 reachability properties.
Reachability property DES-PT-30b-ReachabilityFireability-02 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-30b-ReachabilityFireability-02,5.72844e+09,25.2095,338688,542,276,761449,20473,558,674167,340,191615,0
Reachability property DES-PT-30b-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-30b-ReachabilityFireability-03,3.73248e+06,25.2162,338688,107,183,761449,20473,578,674167,348,191615,4
Invariant property DES-PT-30b-ReachabilityFireability-04 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-30b-ReachabilityFireability-04,1.67189e+10,25.5018,338688,729,404,761449,20473,607,674167,360,191615,7475
Reachability property DES-PT-30b-ReachabilityFireability-06 is true.
FORMULA DES-PT-30b-ReachabilityFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
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-30b-ReachabilityFireability-06,4.69056e+12,25.5407,338688,906,504,761449,20473,636,674167,364,191615,8833
Invariant property DES-PT-30b-ReachabilityFireability-07 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-30b-ReachabilityFireability-07,2.32836e+11,26.371,338688,739,319,761449,20473,671,674167,374,191615,25499
Invariant property DES-PT-30b-ReachabilityFireability-09 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-30b-ReachabilityFireability-09,4.95919e+14,26.8616,338688,5542,3380,761449,20473,782,674167,403,191615,47088
Reachability property DES-PT-30b-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-30b-ReachabilityFireability-10,331776,26.8667,338688,156,177,761449,20473,827,674167,408,191615,47199
[2020-05-15 13:15:43] [WARNING] Interrupting SMT solver.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
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)
[2020-05-15 13:15:43] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-15 13:15:43] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-30b-ReachabilityFireability-06 SMT depth 4
java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:410)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.access$0(Gal2SMTFrontEnd.java:356)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$1.run(Gal2SMTFrontEnd.java:163)
at java.base/java.lang.Thread.run(Thread.java:834)
Caused by: java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verifyAssertion(NextBMCSolver.java:454)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.verify(NextBMCSolver.java:437)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runBMC(Gal2SMTFrontEnd.java:384)
... 3 more
[2020-05-15 13:15:43] [INFO ] During BMC, SMT solver timed out at depth 4
[2020-05-15 13:15:43] [INFO ] BMC solving timed out (3600000 secs) at depth 4
[2020-05-15 13:15:43] [WARNING] SMT solver unexpectedly returned 'unknown' answer, retrying.
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
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 13:15:43] [WARNING] Unexpected error occurred while running SMT. Was verifying DES-PT-30b-ReachabilityFireability-06 K-induction depth 2
Exception in thread "Thread-5" java.lang.RuntimeException: java.lang.RuntimeException: SMT solver raised an error :unknown
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 error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:320)
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:307)
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 13:15:43] [INFO ] SMT solved 0/ 7 properties. Interrupting SMT analysis.
[2020-05-15 13:15:43] [INFO ] Built C files in 28229ms 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 1589548543886
--------------------
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-30b"
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-30b, 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-158902546000287"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30b.tgz
mv DES-PT-30b 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 '
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 ;