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.r210-tajo-159033475800519.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 ShieldPPPs-PT-030B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-tajo-159033475800519
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 3.2K May 14 01:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 14 01:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 13 19:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 19:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.5K May 13 13:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 13 13:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 13 08:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 528K May 12 20:42 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 ShieldPPPs-PT-030B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-030B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590599819952

[2020-05-27 17:17:02] [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-27 17:17:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 17:17:02] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2020-05-27 17:17:02] [INFO ] Transformed 2043 places.
[2020-05-27 17:17:02] [INFO ] Transformed 1893 transitions.
[2020-05-27 17:17:02] [INFO ] Found NUPN structural information;
[2020-05-27 17:17:02] [INFO ] Parsed PT model containing 2043 places and 1893 transitions in 237 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 42 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties seen :[1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0]
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 1893 rows 2043 cols
[2020-05-27 17:17:02] [INFO ] Computed 331 place invariants in 43 ms
[2020-05-27 17:17:03] [INFO ] [Real]Absence check using 331 positive place invariants in 332 ms returned sat
[2020-05-27 17:17:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:17:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 17:17:07] [INFO ] [Real]Absence check using state equation in 4382 ms returned (error "Failed to check-sat")
[2020-05-27 17:17:08] [INFO ] [Real]Absence check using 331 positive place invariants in 379 ms returned sat
[2020-05-27 17:17:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:17:12] [INFO ] [Real]Absence check using state equation in 4119 ms returned (error "Solver has unexpectedly terminated")
[2020-05-27 17:17:13] [INFO ] [Real]Absence check using 331 positive place invariants in 341 ms returned sat
[2020-05-27 17:17:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:17:17] [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: Broken pipe (= s1213 (- t839 t840))") while checking expression at index 2
[2020-05-27 17:17:18] [INFO ] [Real]Absence check using 331 positive place invariants in 461 ms returned sat
[2020-05-27 17:17:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:17:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 17:17:22] [INFO ] [Real]Absence check using state equation in 4261 ms returned (error "Failed to check-sat")
[2020-05-27 17:17:23] [INFO ] [Real]Absence check using 331 positive place invariants in 472 ms returned sat
[2020-05-27 17:17:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:17:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 17:17:27] [INFO ] [Real]Absence check using state equation in 4168 ms returned (error "Failed to check-sat")
Support contains 36 out of 2043 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2043/2043 places, 1893/1893 transitions.
Performed 204 Post agglomeration using F-continuation condition.Transition count delta: 204
Iterating post reduction 0 with 204 rules applied. Total rules applied 204 place count 2043 transition count 1689
Reduce places removed 204 places and 0 transitions.
Iterating post reduction 1 with 204 rules applied. Total rules applied 408 place count 1839 transition count 1689
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 151 Pre rules applied. Total rules applied 408 place count 1839 transition count 1538
Deduced a syphon composed of 151 places in 3 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 2 with 302 rules applied. Total rules applied 710 place count 1688 transition count 1538
Symmetric choice reduction at 2 with 206 rule applications. Total rules 916 place count 1688 transition count 1538
Deduced a syphon composed of 206 places in 9 ms
Reduce places removed 206 places and 206 transitions.
Iterating global reduction 2 with 412 rules applied. Total rules applied 1328 place count 1482 transition count 1332
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 81 Pre rules applied. Total rules applied 1328 place count 1482 transition count 1251
Deduced a syphon composed of 81 places in 13 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 1490 place count 1401 transition count 1251
Performed 434 Post agglomeration using F-continuation condition.Transition count delta: 434
Deduced a syphon composed of 434 places in 2 ms
Reduce places removed 434 places and 0 transitions.
Iterating global reduction 2 with 868 rules applied. Total rules applied 2358 place count 967 transition count 817
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 255 times.
Drop transitions removed 255 transitions
Iterating global reduction 2 with 255 rules applied. Total rules applied 2613 place count 967 transition count 817
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 2615 place count 967 transition count 817
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 2616 place count 966 transition count 816
Applied a total of 2616 rules in 1102 ms. Remains 966 /2043 variables (removed 1077) and now considering 816/1893 (removed 1077) transitions.
Finished structural reductions, in 1 iterations. Remains : 966/2043 places, 816/1893 transitions.
Incomplete random walk after 1000000 steps, including 127 resets, run finished after 8796 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8 resets, run finished after 4273 ms. (steps per millisecond=234 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 10 resets, run finished after 4645 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 14 resets, run finished after 4779 ms. (steps per millisecond=209 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 8 resets, run finished after 4786 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 1, 0]
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 12 resets, run finished after 4381 ms. (steps per millisecond=228 ) properties seen :[0, 0, 0, 1]
FORMULA ShieldPPPs-PT-030B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 816 rows 966 cols
[2020-05-27 17:18:00] [INFO ] Computed 331 place invariants in 117 ms
[2020-05-27 17:18:01] [INFO ] [Real]Absence check using 310 positive place invariants in 214 ms returned sat
[2020-05-27 17:18:01] [INFO ] [Real]Absence check using 310 positive and 21 generalized place invariants in 15 ms returned sat
[2020-05-27 17:18:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:18:02] [INFO ] [Real]Absence check using state equation in 1685 ms returned sat
[2020-05-27 17:18:02] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 17:18:03] [INFO ] [Nat]Absence check using 310 positive place invariants in 141 ms returned sat
[2020-05-27 17:18:03] [INFO ] [Nat]Absence check using 310 positive and 21 generalized place invariants in 11 ms returned sat
[2020-05-27 17:18:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 17:18:05] [INFO ] [Nat]Absence check using state equation in 2018 ms returned sat
[2020-05-27 17:18:05] [INFO ] Deduced a trap composed of 5 places in 433 ms
[2020-05-27 17:18:06] [INFO ] Deduced a trap composed of 5 places in 304 ms
[2020-05-27 17:18:06] [INFO ] Deduced a trap composed of 4 places in 352 ms
[2020-05-27 17:18:06] [INFO ] Deduced a trap composed of 5 places in 265 ms
[2020-05-27 17:18:07] [INFO ] Deduced a trap composed of 5 places in 313 ms
[2020-05-27 17:18:07] [INFO ] Deduced a trap composed of 5 places in 293 ms
[2020-05-27 17:18:07] [INFO ] Deduced a trap composed of 8 places in 254 ms
[2020-05-27 17:18:08] [INFO ] Deduced a trap composed of 3 places in 310 ms
[2020-05-27 17:18:08] [INFO ] Deduced a trap composed of 5 places in 331 ms
[2020-05-27 17:18:08] [INFO ] Deduced a trap composed of 9 places in 273 ms
[2020-05-27 17:18:09] [INFO ] Deduced a trap composed of 6 places in 234 ms
[2020-05-27 17:18:09] [INFO ] Deduced a trap composed of 4 places in 170 ms
[2020-05-27 17:18:09] [INFO ] Deduced a trap composed of 6 places in 210 ms
[2020-05-27 17:18:09] [INFO ] Deduced a trap composed of 6 places in 264 ms
[2020-05-27 17:18:10] [INFO ] Deduced a trap composed of 5 places in 164 ms
[2020-05-27 17:18:10] [INFO ] Deduced a trap composed of 11 places in 163 ms
[2020-05-27 17:18:10] [INFO ] Deduced a trap composed of 6 places in 150 ms
[2020-05-27 17:18:10] [INFO ] Deduced a trap composed of 6 places in 250 ms
[2020-05-27 17:18:11] [INFO ] Deduced a trap composed of 5 places in 214 ms
[2020-05-27 17:18:11] [INFO ] Deduced a trap composed of 9 places in 227 ms
[2020-05-27 17:18:11] [INFO ] Deduced a trap composed of 10 places in 200 ms
[2020-05-27 17:18:11] [INFO ] Deduced a trap composed of 8 places in 218 ms
[2020-05-27 17:18:12] [INFO ] Deduced a trap composed of 9 places in 253 ms
[2020-05-27 17:18:12] [INFO ] Deduced a trap composed of 4 places in 174 ms
[2020-05-27 17:18:12] [INFO ] Deduced a trap composed of 6 places in 270 ms
[2020-05-27 17:18:12] [INFO ] Deduced a trap composed of 6 places in 214 ms
[2020-05-27 17:18:13] [INFO ] Deduced a trap composed of 5 places in 225 ms
[2020-05-27 17:18:13] [INFO ] Deduced a trap composed of 17 places in 240 ms
[2020-05-27 17:18:13] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 8179 ms
[2020-05-27 17:18:13] [INFO ] Computed and/alt/rep : 800/2517/800 causal constraints in 68 ms.
[2020-05-27 17:18:34] [INFO ] Added : 739 causal constraints over 148 iterations in 21181 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 64 ms.
[2020-05-27 17:18:35] [INFO ] [Real]Absence check using 310 positive place invariants in 147 ms returned sat
[2020-05-27 17:18:35] [INFO ] [Real]Absence check using 310 positive and 21 generalized place invariants in 11 ms returned sat
[2020-05-27 17:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:18:37] [INFO ] [Real]Absence check using state equation in 2099 ms returned sat
[2020-05-27 17:18:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 17:18:37] [INFO ] [Nat]Absence check using 310 positive place invariants in 194 ms returned sat
[2020-05-27 17:18:37] [INFO ] [Nat]Absence check using 310 positive and 21 generalized place invariants in 16 ms returned sat
[2020-05-27 17:18:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 17:18:39] [INFO ] [Nat]Absence check using state equation in 1960 ms returned sat
[2020-05-27 17:18:39] [INFO ] Deduced a trap composed of 6 places in 337 ms
[2020-05-27 17:18:40] [INFO ] Deduced a trap composed of 9 places in 287 ms
[2020-05-27 17:18:40] [INFO ] Deduced a trap composed of 5 places in 271 ms
[2020-05-27 17:18:40] [INFO ] Deduced a trap composed of 9 places in 232 ms
[2020-05-27 17:18:41] [INFO ] Deduced a trap composed of 5 places in 258 ms
[2020-05-27 17:18:41] [INFO ] Deduced a trap composed of 5 places in 172 ms
[2020-05-27 17:18:41] [INFO ] Deduced a trap composed of 6 places in 164 ms
[2020-05-27 17:18:41] [INFO ] Deduced a trap composed of 5 places in 162 ms
[2020-05-27 17:18:41] [INFO ] Deduced a trap composed of 4 places in 166 ms
[2020-05-27 17:18:42] [INFO ] Deduced a trap composed of 3 places in 165 ms
[2020-05-27 17:18:42] [INFO ] Deduced a trap composed of 6 places in 153 ms
[2020-05-27 17:18:42] [INFO ] Deduced a trap composed of 6 places in 170 ms
[2020-05-27 17:18:42] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2020-05-27 17:18:42] [INFO ] Deduced a trap composed of 5 places in 152 ms
[2020-05-27 17:18:43] [INFO ] Deduced a trap composed of 6 places in 162 ms
[2020-05-27 17:18:43] [INFO ] Deduced a trap composed of 14 places in 148 ms
[2020-05-27 17:18:43] [INFO ] Deduced a trap composed of 6 places in 161 ms
[2020-05-27 17:18:43] [INFO ] Deduced a trap composed of 6 places in 155 ms
[2020-05-27 17:18:43] [INFO ] Deduced a trap composed of 6 places in 164 ms
[2020-05-27 17:18:44] [INFO ] Deduced a trap composed of 6 places in 166 ms
[2020-05-27 17:18:44] [INFO ] Deduced a trap composed of 4 places in 153 ms
[2020-05-27 17:18:44] [INFO ] Deduced a trap composed of 7 places in 152 ms
[2020-05-27 17:18:44] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2020-05-27 17:18:44] [INFO ] Deduced a trap composed of 5 places in 252 ms
[2020-05-27 17:18:45] [INFO ] Deduced a trap composed of 6 places in 183 ms
[2020-05-27 17:18:45] [INFO ] Deduced a trap composed of 4 places in 147 ms
[2020-05-27 17:18:45] [INFO ] Deduced a trap composed of 7 places in 145 ms
[2020-05-27 17:18:45] [INFO ] Deduced a trap composed of 8 places in 145 ms
[2020-05-27 17:18:45] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2020-05-27 17:18:45] [INFO ] Deduced a trap composed of 4 places in 140 ms
[2020-05-27 17:18:46] [INFO ] Deduced a trap composed of 9 places in 146 ms
[2020-05-27 17:18:46] [INFO ] Deduced a trap composed of 6 places in 130 ms
[2020-05-27 17:18:46] [INFO ] Deduced a trap composed of 6 places in 139 ms
[2020-05-27 17:18:46] [INFO ] Deduced a trap composed of 5 places in 125 ms
[2020-05-27 17:18:46] [INFO ] Deduced a trap composed of 5 places in 128 ms
[2020-05-27 17:18:46] [INFO ] Deduced a trap composed of 9 places in 132 ms
[2020-05-27 17:18:47] [INFO ] Deduced a trap composed of 4 places in 142 ms
[2020-05-27 17:18:47] [INFO ] Deduced a trap composed of 7 places in 131 ms
[2020-05-27 17:18:47] [INFO ] Deduced a trap composed of 5 places in 139 ms
[2020-05-27 17:18:47] [INFO ] Deduced a trap composed of 4 places in 138 ms
[2020-05-27 17:18:47] [INFO ] Deduced a trap composed of 4 places in 82 ms
[2020-05-27 17:18:47] [INFO ] Deduced a trap composed of 8 places in 83 ms
[2020-05-27 17:18:47] [INFO ] Deduced a trap composed of 9 places in 78 ms
[2020-05-27 17:18:48] [INFO ] Deduced a trap composed of 8 places in 73 ms
[2020-05-27 17:18:48] [INFO ] Deduced a trap composed of 6 places in 106 ms
[2020-05-27 17:18:48] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-05-27 17:18:48] [INFO ] Deduced a trap composed of 6 places in 64 ms
[2020-05-27 17:18:48] [INFO ] Deduced a trap composed of 4 places in 56 ms
[2020-05-27 17:18:48] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 8972 ms
[2020-05-27 17:18:48] [INFO ] Computed and/alt/rep : 800/2517/800 causal constraints in 36 ms.
[2020-05-27 17:19:09] [INFO ] Added : 731 causal constraints over 149 iterations in 21006 ms.(timeout) Result :sat
[2020-05-27 17:19:09] [INFO ] Deduced a trap composed of 23 places in 191 ms
[2020-05-27 17:19:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
Attempting to minimize the solution found.
Minimization took 94 ms.
[2020-05-27 17:19:10] [INFO ] [Real]Absence check using 310 positive place invariants in 205 ms returned sat
[2020-05-27 17:19:10] [INFO ] [Real]Absence check using 310 positive and 21 generalized place invariants in 17 ms returned sat
[2020-05-27 17:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:19:12] [INFO ] [Real]Absence check using state equation in 1876 ms returned sat
[2020-05-27 17:19:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 17:19:12] [INFO ] [Nat]Absence check using 310 positive place invariants in 239 ms returned sat
[2020-05-27 17:19:12] [INFO ] [Nat]Absence check using 310 positive and 21 generalized place invariants in 18 ms returned sat
[2020-05-27 17:19:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 17:19:14] [INFO ] [Nat]Absence check using state equation in 1979 ms returned sat
[2020-05-27 17:19:15] [INFO ] Deduced a trap composed of 6 places in 376 ms
[2020-05-27 17:19:15] [INFO ] Deduced a trap composed of 4 places in 374 ms
[2020-05-27 17:19:15] [INFO ] Deduced a trap composed of 6 places in 264 ms
[2020-05-27 17:19:16] [INFO ] Deduced a trap composed of 5 places in 274 ms
[2020-05-27 17:19:16] [INFO ] Deduced a trap composed of 6 places in 235 ms
[2020-05-27 17:19:16] [INFO ] Deduced a trap composed of 6 places in 213 ms
[2020-05-27 17:19:16] [INFO ] Deduced a trap composed of 5 places in 210 ms
[2020-05-27 17:19:17] [INFO ] Deduced a trap composed of 6 places in 267 ms
[2020-05-27 17:19:17] [INFO ] Deduced a trap composed of 5 places in 270 ms
[2020-05-27 17:19:17] [INFO ] Deduced a trap composed of 4 places in 255 ms
[2020-05-27 17:19:18] [INFO ] Deduced a trap composed of 5 places in 271 ms
[2020-05-27 17:19:18] [INFO ] Deduced a trap composed of 9 places in 236 ms
[2020-05-27 17:19:18] [INFO ] Deduced a trap composed of 7 places in 220 ms
[2020-05-27 17:19:18] [INFO ] Deduced a trap composed of 4 places in 247 ms
[2020-05-27 17:19:19] [INFO ] Deduced a trap composed of 6 places in 219 ms
[2020-05-27 17:19:19] [INFO ] Deduced a trap composed of 3 places in 219 ms
[2020-05-27 17:19:19] [INFO ] Deduced a trap composed of 5 places in 214 ms
[2020-05-27 17:19:19] [INFO ] Deduced a trap composed of 6 places in 210 ms
[2020-05-27 17:19:20] [INFO ] Deduced a trap composed of 6 places in 193 ms
[2020-05-27 17:19:20] [INFO ] Deduced a trap composed of 4 places in 192 ms
[2020-05-27 17:19:20] [INFO ] Deduced a trap composed of 6 places in 203 ms
[2020-05-27 17:19:20] [INFO ] Deduced a trap composed of 6 places in 182 ms
[2020-05-27 17:19:20] [INFO ] Deduced a trap composed of 9 places in 177 ms
[2020-05-27 17:19:21] [INFO ] Deduced a trap composed of 8 places in 285 ms
[2020-05-27 17:19:21] [INFO ] Deduced a trap composed of 6 places in 262 ms
[2020-05-27 17:19:21] [INFO ] Deduced a trap composed of 4 places in 267 ms
[2020-05-27 17:19:22] [INFO ] Deduced a trap composed of 4 places in 337 ms
[2020-05-27 17:19:22] [INFO ] Deduced a trap composed of 6 places in 296 ms
[2020-05-27 17:19:22] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2020-05-27 17:19:23] [INFO ] Deduced a trap composed of 4 places in 268 ms
[2020-05-27 17:19:23] [INFO ] Deduced a trap composed of 6 places in 257 ms
[2020-05-27 17:19:23] [INFO ] Deduced a trap composed of 6 places in 181 ms
[2020-05-27 17:19:23] [INFO ] Deduced a trap composed of 6 places in 176 ms
[2020-05-27 17:19:24] [INFO ] Deduced a trap composed of 8 places in 181 ms
[2020-05-27 17:19:24] [INFO ] Deduced a trap composed of 6 places in 255 ms
[2020-05-27 17:19:24] [INFO ] Deduced a trap composed of 6 places in 157 ms
[2020-05-27 17:19:24] [INFO ] Deduced a trap composed of 4 places in 148 ms
[2020-05-27 17:19:25] [INFO ] Deduced a trap composed of 6 places in 230 ms
[2020-05-27 17:19:25] [INFO ] Deduced a trap composed of 6 places in 162 ms
[2020-05-27 17:19:25] [INFO ] Deduced a trap composed of 7 places in 188 ms
[2020-05-27 17:19:25] [INFO ] Deduced a trap composed of 6 places in 234 ms
[2020-05-27 17:19:25] [INFO ] Deduced a trap composed of 10 places in 140 ms
[2020-05-27 17:19:26] [INFO ] Deduced a trap composed of 7 places in 223 ms
[2020-05-27 17:19:26] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2020-05-27 17:19:26] [INFO ] Deduced a trap composed of 6 places in 232 ms
[2020-05-27 17:19:26] [INFO ] Deduced a trap composed of 6 places in 203 ms
[2020-05-27 17:19:27] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-05-27 17:19:27] [INFO ] Deduced a trap composed of 8 places in 209 ms
[2020-05-27 17:19:27] [INFO ] Deduced a trap composed of 6 places in 266 ms
[2020-05-27 17:19:27] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-05-27 17:19:28] [INFO ] Deduced a trap composed of 8 places in 285 ms
[2020-05-27 17:19:28] [INFO ] Deduced a trap composed of 9 places in 235 ms
[2020-05-27 17:19:28] [INFO ] Deduced a trap composed of 8 places in 231 ms
[2020-05-27 17:19:28] [INFO ] Deduced a trap composed of 7 places in 245 ms
[2020-05-27 17:19:29] [INFO ] Deduced a trap composed of 20 places in 232 ms
[2020-05-27 17:19:29] [INFO ] Deduced a trap composed of 24 places in 248 ms
[2020-05-27 17:19:29] [INFO ] Deduced a trap composed of 9 places in 192 ms
[2020-05-27 17:19:29] [INFO ] Deduced a trap composed of 6 places in 120 ms
[2020-05-27 17:19:29] [INFO ] Deduced a trap composed of 11 places in 115 ms
[2020-05-27 17:19:30] [INFO ] Deduced a trap composed of 5 places in 192 ms
[2020-05-27 17:19:30] [INFO ] Deduced a trap composed of 5 places in 158 ms
[2020-05-27 17:19:30] [INFO ] Deduced a trap composed of 6 places in 176 ms
[2020-05-27 17:19:30] [INFO ] Deduced a trap composed of 18 places in 152 ms
[2020-05-27 17:19:30] [INFO ] Deduced a trap composed of 7 places in 163 ms
[2020-05-27 17:19:31] [INFO ] Deduced a trap composed of 7 places in 140 ms
[2020-05-27 17:19:31] [INFO ] Deduced a trap composed of 12 places in 136 ms
[2020-05-27 17:19:31] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 16504 ms
[2020-05-27 17:19:31] [INFO ] Computed and/alt/rep : 800/2517/800 causal constraints in 56 ms.
[2020-05-27 17:19:54] [INFO ] Added : 745 causal constraints over 149 iterations in 22847 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 73 ms.
Incomplete Parikh walk after 65900 steps, including 614 resets, run finished after 559 ms. (steps per millisecond=117 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 36500 steps, including 320 resets, run finished after 254 ms. (steps per millisecond=143 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 67400 steps, including 712 resets, run finished after 374 ms. (steps per millisecond=180 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 18 out of 966 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 966/966 places, 816/816 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 966 transition count 815
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 965 transition count 815
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 965 transition count 813
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 963 transition count 813
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 22 place count 955 transition count 805
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 955 transition count 805
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 29 place count 955 transition count 805
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 954 transition count 804
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 953 transition count 803
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 952 transition count 802
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 951 transition count 801
Applied a total of 33 rules in 314 ms. Remains 951 /966 variables (removed 15) and now considering 801/816 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/966 places, 801/816 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7469 ms. (steps per millisecond=133 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 4013 ms. (steps per millisecond=249 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 4086 ms. (steps per millisecond=244 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3752 ms. (steps per millisecond=266 ) properties seen :[0, 0, 0]
Interrupted probabilistic random walk after 2446809 steps, run timeout after 30001 ms. (steps per millisecond=81 ) properties seen :[0, 0, 0]
Probabilistic random walk after 2446809 steps, saw 226108 distinct states, run finished after 30001 ms. (steps per millisecond=81 ) properties seen :[0, 0, 0]
// Phase 1: matrix 801 rows 951 cols
[2020-05-27 17:20:45] [INFO ] Computed 331 place invariants in 8 ms
[2020-05-27 17:20:45] [INFO ] [Real]Absence check using 315 positive place invariants in 198 ms returned sat
[2020-05-27 17:20:45] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2020-05-27 17:20:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:20:47] [INFO ] [Real]Absence check using state equation in 1785 ms returned sat
[2020-05-27 17:20:47] [INFO ] Deduced a trap composed of 6 places in 389 ms
[2020-05-27 17:20:48] [INFO ] Deduced a trap composed of 4 places in 341 ms
[2020-05-27 17:20:48] [INFO ] Deduced a trap composed of 6 places in 333 ms
[2020-05-27 17:20:48] [INFO ] Deduced a trap composed of 4 places in 279 ms
[2020-05-27 17:20:49] [INFO ] Deduced a trap composed of 7 places in 232 ms
[2020-05-27 17:20:49] [INFO ] Deduced a trap composed of 7 places in 276 ms
[2020-05-27 17:20:49] [INFO ] Deduced a trap composed of 5 places in 179 ms
[2020-05-27 17:20:49] [INFO ] Deduced a trap composed of 5 places in 175 ms
[2020-05-27 17:20:50] [INFO ] Deduced a trap composed of 6 places in 272 ms
[2020-05-27 17:20:50] [INFO ] Deduced a trap composed of 5 places in 246 ms
[2020-05-27 17:20:50] [INFO ] Deduced a trap composed of 6 places in 474 ms
[2020-05-27 17:20:51] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-05-27 17:20:51] [INFO ] Deduced a trap composed of 13 places in 239 ms
[2020-05-27 17:20:51] [INFO ] Deduced a trap composed of 9 places in 244 ms
[2020-05-27 17:20:52] [INFO ] Deduced a trap composed of 6 places in 259 ms
[2020-05-27 17:20:52] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-05-27 17:20:52] [INFO ] Deduced a trap composed of 6 places in 247 ms
[2020-05-27 17:20:52] [INFO ] Deduced a trap composed of 6 places in 240 ms
[2020-05-27 17:20:53] [INFO ] Deduced a trap composed of 5 places in 250 ms
[2020-05-27 17:20:53] [INFO ] Deduced a trap composed of 20 places in 248 ms
[2020-05-27 17:20:53] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-05-27 17:20:54] [INFO ] Deduced a trap composed of 9 places in 239 ms
[2020-05-27 17:20:54] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2020-05-27 17:20:54] [INFO ] Deduced a trap composed of 8 places in 230 ms
[2020-05-27 17:20:54] [INFO ] Deduced a trap composed of 9 places in 220 ms
[2020-05-27 17:20:55] [INFO ] Deduced a trap composed of 9 places in 232 ms
[2020-05-27 17:20:55] [INFO ] Deduced a trap composed of 6 places in 250 ms
[2020-05-27 17:20:55] [INFO ] Deduced a trap composed of 11 places in 253 ms
[2020-05-27 17:20:55] [INFO ] Deduced a trap composed of 9 places in 234 ms
[2020-05-27 17:20:56] [INFO ] Deduced a trap composed of 19 places in 232 ms
[2020-05-27 17:20:56] [INFO ] Deduced a trap composed of 11 places in 158 ms
[2020-05-27 17:20:56] [INFO ] Deduced a trap composed of 11 places in 155 ms
[2020-05-27 17:20:56] [INFO ] Deduced a trap composed of 14 places in 233 ms
[2020-05-27 17:20:56] [INFO ] Deduced a trap composed of 9 places in 134 ms
[2020-05-27 17:20:57] [INFO ] Deduced a trap composed of 6 places in 228 ms
[2020-05-27 17:20:57] [INFO ] Deduced a trap composed of 23 places in 221 ms
[2020-05-27 17:20:57] [INFO ] Deduced a trap composed of 6 places in 212 ms
[2020-05-27 17:20:57] [INFO ] Deduced a trap composed of 15 places in 230 ms
[2020-05-27 17:20:58] [INFO ] Deduced a trap composed of 11 places in 217 ms
[2020-05-27 17:20:58] [INFO ] Deduced a trap composed of 9 places in 199 ms
[2020-05-27 17:20:58] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 11123 ms
[2020-05-27 17:20:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 17:20:58] [INFO ] [Nat]Absence check using 315 positive place invariants in 203 ms returned sat
[2020-05-27 17:20:58] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 11 ms returned sat
[2020-05-27 17:20:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 17:21:00] [INFO ] [Nat]Absence check using state equation in 1913 ms returned sat
[2020-05-27 17:21:01] [INFO ] Deduced a trap composed of 6 places in 322 ms
[2020-05-27 17:21:01] [INFO ] Deduced a trap composed of 6 places in 299 ms
[2020-05-27 17:21:01] [INFO ] Deduced a trap composed of 6 places in 289 ms
[2020-05-27 17:21:02] [INFO ] Deduced a trap composed of 4 places in 326 ms
[2020-05-27 17:21:02] [INFO ] Deduced a trap composed of 6 places in 299 ms
[2020-05-27 17:21:02] [INFO ] Deduced a trap composed of 6 places in 296 ms
[2020-05-27 17:21:03] [INFO ] Deduced a trap composed of 6 places in 314 ms
[2020-05-27 17:21:03] [INFO ] Deduced a trap composed of 5 places in 321 ms
[2020-05-27 17:21:03] [INFO ] Deduced a trap composed of 6 places in 266 ms
[2020-05-27 17:21:04] [INFO ] Deduced a trap composed of 5 places in 295 ms
[2020-05-27 17:21:04] [INFO ] Deduced a trap composed of 4 places in 291 ms
[2020-05-27 17:21:04] [INFO ] Deduced a trap composed of 6 places in 265 ms
[2020-05-27 17:21:05] [INFO ] Deduced a trap composed of 7 places in 273 ms
[2020-05-27 17:21:05] [INFO ] Deduced a trap composed of 4 places in 304 ms
[2020-05-27 17:21:05] [INFO ] Deduced a trap composed of 5 places in 292 ms
[2020-05-27 17:21:06] [INFO ] Deduced a trap composed of 4 places in 269 ms
[2020-05-27 17:21:06] [INFO ] Deduced a trap composed of 4 places in 296 ms
[2020-05-27 17:21:06] [INFO ] Deduced a trap composed of 5 places in 290 ms
[2020-05-27 17:21:07] [INFO ] Deduced a trap composed of 6 places in 282 ms
[2020-05-27 17:21:07] [INFO ] Deduced a trap composed of 4 places in 294 ms
[2020-05-27 17:21:07] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-05-27 17:21:08] [INFO ] Deduced a trap composed of 6 places in 247 ms
[2020-05-27 17:21:08] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-05-27 17:21:08] [INFO ] Deduced a trap composed of 8 places in 239 ms
[2020-05-27 17:21:08] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-05-27 17:21:09] [INFO ] Deduced a trap composed of 5 places in 262 ms
[2020-05-27 17:21:09] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2020-05-27 17:21:09] [INFO ] Deduced a trap composed of 4 places in 238 ms
[2020-05-27 17:21:10] [INFO ] Deduced a trap composed of 9 places in 244 ms
[2020-05-27 17:21:10] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-05-27 17:21:10] [INFO ] Deduced a trap composed of 12 places in 214 ms
[2020-05-27 17:21:10] [INFO ] Deduced a trap composed of 6 places in 224 ms
[2020-05-27 17:21:11] [INFO ] Deduced a trap composed of 6 places in 236 ms
[2020-05-27 17:21:11] [INFO ] Deduced a trap composed of 4 places in 228 ms
[2020-05-27 17:21:11] [INFO ] Deduced a trap composed of 14 places in 229 ms
[2020-05-27 17:21:11] [INFO ] Deduced a trap composed of 5 places in 230 ms
[2020-05-27 17:21:12] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-05-27 17:21:12] [INFO ] Deduced a trap composed of 6 places in 237 ms
[2020-05-27 17:21:12] [INFO ] Deduced a trap composed of 12 places in 217 ms
[2020-05-27 17:21:13] [INFO ] Deduced a trap composed of 4 places in 213 ms
[2020-05-27 17:21:13] [INFO ] Deduced a trap composed of 6 places in 210 ms
[2020-05-27 17:21:13] [INFO ] Deduced a trap composed of 7 places in 244 ms
[2020-05-27 17:21:13] [INFO ] Deduced a trap composed of 6 places in 231 ms
[2020-05-27 17:21:14] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2020-05-27 17:21:14] [INFO ] Deduced a trap composed of 5 places in 259 ms
[2020-05-27 17:21:14] [INFO ] Deduced a trap composed of 8 places in 287 ms
[2020-05-27 17:21:14] [INFO ] Deduced a trap composed of 6 places in 268 ms
[2020-05-27 17:21:15] [INFO ] Deduced a trap composed of 6 places in 266 ms
[2020-05-27 17:21:15] [INFO ] Deduced a trap composed of 6 places in 247 ms
[2020-05-27 17:21:15] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2020-05-27 17:21:16] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-05-27 17:21:16] [INFO ] Deduced a trap composed of 12 places in 264 ms
[2020-05-27 17:21:16] [INFO ] Deduced a trap composed of 8 places in 258 ms
[2020-05-27 17:21:17] [INFO ] Deduced a trap composed of 5 places in 288 ms
[2020-05-27 17:21:17] [INFO ] Deduced a trap composed of 6 places in 276 ms
[2020-05-27 17:21:17] [INFO ] Deduced a trap composed of 8 places in 225 ms
[2020-05-27 17:21:17] [INFO ] Deduced a trap composed of 4 places in 265 ms
[2020-05-27 17:21:18] [INFO ] Deduced a trap composed of 7 places in 213 ms
[2020-05-27 17:21:18] [INFO ] Deduced a trap composed of 6 places in 261 ms
[2020-05-27 17:21:18] [INFO ] Deduced a trap composed of 6 places in 213 ms
[2020-05-27 17:21:19] [INFO ] Deduced a trap composed of 12 places in 283 ms
[2020-05-27 17:21:19] [INFO ] Deduced a trap composed of 14 places in 263 ms
[2020-05-27 17:21:19] [INFO ] Deduced a trap composed of 12 places in 247 ms
[2020-05-27 17:21:19] [INFO ] Deduced a trap composed of 6 places in 200 ms
[2020-05-27 17:21:19] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 19066 ms
[2020-05-27 17:21:19] [INFO ] Computed and/alt/rep : 791/2505/791 causal constraints in 41 ms.
[2020-05-27 17:21:43] [INFO ] Added : 717 causal constraints over 147 iterations in 23658 ms.(timeout) Result :unknown
[2020-05-27 17:21:43] [INFO ] [Real]Absence check using 315 positive place invariants in 154 ms returned sat
[2020-05-27 17:21:43] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 8 ms returned sat
[2020-05-27 17:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:21:45] [INFO ] [Real]Absence check using state equation in 1641 ms returned sat
[2020-05-27 17:21:45] [INFO ] Deduced a trap composed of 4 places in 336 ms
[2020-05-27 17:21:46] [INFO ] Deduced a trap composed of 6 places in 293 ms
[2020-05-27 17:21:46] [INFO ] Deduced a trap composed of 5 places in 290 ms
[2020-05-27 17:21:46] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-05-27 17:21:47] [INFO ] Deduced a trap composed of 5 places in 292 ms
[2020-05-27 17:21:47] [INFO ] Deduced a trap composed of 4 places in 275 ms
[2020-05-27 17:21:47] [INFO ] Deduced a trap composed of 6 places in 266 ms
[2020-05-27 17:21:48] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2020-05-27 17:21:48] [INFO ] Deduced a trap composed of 5 places in 266 ms
[2020-05-27 17:21:48] [INFO ] Deduced a trap composed of 19 places in 243 ms
[2020-05-27 17:21:49] [INFO ] Deduced a trap composed of 8 places in 251 ms
[2020-05-27 17:21:49] [INFO ] Deduced a trap composed of 11 places in 251 ms
[2020-05-27 17:21:49] [INFO ] Deduced a trap composed of 6 places in 229 ms
[2020-05-27 17:21:49] [INFO ] Deduced a trap composed of 6 places in 246 ms
[2020-05-27 17:21:50] [INFO ] Deduced a trap composed of 6 places in 225 ms
[2020-05-27 17:21:50] [INFO ] Deduced a trap composed of 9 places in 220 ms
[2020-05-27 17:21:50] [INFO ] Deduced a trap composed of 11 places in 215 ms
[2020-05-27 17:21:50] [INFO ] Deduced a trap composed of 6 places in 196 ms
[2020-05-27 17:21:51] [INFO ] Deduced a trap composed of 5 places in 218 ms
[2020-05-27 17:21:51] [INFO ] Deduced a trap composed of 6 places in 201 ms
[2020-05-27 17:21:51] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5904 ms
[2020-05-27 17:21:51] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 17:21:51] [INFO ] [Nat]Absence check using 315 positive place invariants in 202 ms returned sat
[2020-05-27 17:21:51] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2020-05-27 17:21:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 17:21:53] [INFO ] [Nat]Absence check using state equation in 2007 ms returned sat
[2020-05-27 17:21:54] [INFO ] Deduced a trap composed of 6 places in 371 ms
[2020-05-27 17:21:54] [INFO ] Deduced a trap composed of 4 places in 310 ms
[2020-05-27 17:21:54] [INFO ] Deduced a trap composed of 6 places in 282 ms
[2020-05-27 17:21:55] [INFO ] Deduced a trap composed of 11 places in 302 ms
[2020-05-27 17:21:55] [INFO ] Deduced a trap composed of 11 places in 247 ms
[2020-05-27 17:21:55] [INFO ] Deduced a trap composed of 4 places in 230 ms
[2020-05-27 17:21:56] [INFO ] Deduced a trap composed of 5 places in 222 ms
[2020-05-27 17:21:56] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2020-05-27 17:21:56] [INFO ] Deduced a trap composed of 4 places in 226 ms
[2020-05-27 17:21:56] [INFO ] Deduced a trap composed of 4 places in 218 ms
[2020-05-27 17:21:57] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2020-05-27 17:21:57] [INFO ] Deduced a trap composed of 5 places in 233 ms
[2020-05-27 17:21:57] [INFO ] Deduced a trap composed of 5 places in 224 ms
[2020-05-27 17:21:57] [INFO ] Deduced a trap composed of 6 places in 219 ms
[2020-05-27 17:21:58] [INFO ] Deduced a trap composed of 6 places in 236 ms
[2020-05-27 17:21:58] [INFO ] Deduced a trap composed of 5 places in 225 ms
[2020-05-27 17:21:58] [INFO ] Deduced a trap composed of 5 places in 210 ms
[2020-05-27 17:21:58] [INFO ] Deduced a trap composed of 6 places in 215 ms
[2020-05-27 17:21:59] [INFO ] Deduced a trap composed of 4 places in 221 ms
[2020-05-27 17:21:59] [INFO ] Deduced a trap composed of 5 places in 233 ms
[2020-05-27 17:21:59] [INFO ] Deduced a trap composed of 9 places in 223 ms
[2020-05-27 17:21:59] [INFO ] Deduced a trap composed of 6 places in 224 ms
[2020-05-27 17:22:00] [INFO ] Deduced a trap composed of 5 places in 207 ms
[2020-05-27 17:22:00] [INFO ] Deduced a trap composed of 5 places in 219 ms
[2020-05-27 17:22:00] [INFO ] Deduced a trap composed of 6 places in 217 ms
[2020-05-27 17:22:00] [INFO ] Deduced a trap composed of 4 places in 211 ms
[2020-05-27 17:22:01] [INFO ] Deduced a trap composed of 10 places in 205 ms
[2020-05-27 17:22:01] [INFO ] Deduced a trap composed of 6 places in 261 ms
[2020-05-27 17:22:01] [INFO ] Deduced a trap composed of 8 places in 200 ms
[2020-05-27 17:22:01] [INFO ] Deduced a trap composed of 7 places in 205 ms
[2020-05-27 17:22:02] [INFO ] Deduced a trap composed of 13 places in 198 ms
[2020-05-27 17:22:02] [INFO ] Deduced a trap composed of 11 places in 214 ms
[2020-05-27 17:22:02] [INFO ] Deduced a trap composed of 6 places in 196 ms
[2020-05-27 17:22:02] [INFO ] Deduced a trap composed of 8 places in 195 ms
[2020-05-27 17:22:03] [INFO ] Deduced a trap composed of 4 places in 215 ms
[2020-05-27 17:22:03] [INFO ] Deduced a trap composed of 6 places in 184 ms
[2020-05-27 17:22:03] [INFO ] Deduced a trap composed of 6 places in 234 ms
[2020-05-27 17:22:03] [INFO ] Deduced a trap composed of 6 places in 175 ms
[2020-05-27 17:22:03] [INFO ] Deduced a trap composed of 4 places in 176 ms
[2020-05-27 17:22:04] [INFO ] Deduced a trap composed of 6 places in 255 ms
[2020-05-27 17:22:04] [INFO ] Deduced a trap composed of 9 places in 239 ms
[2020-05-27 17:22:04] [INFO ] Deduced a trap composed of 8 places in 184 ms
[2020-05-27 17:22:04] [INFO ] Deduced a trap composed of 8 places in 194 ms
[2020-05-27 17:22:05] [INFO ] Deduced a trap composed of 6 places in 205 ms
[2020-05-27 17:22:05] [INFO ] Deduced a trap composed of 9 places in 218 ms
[2020-05-27 17:22:05] [INFO ] Deduced a trap composed of 9 places in 202 ms
[2020-05-27 17:22:05] [INFO ] Deduced a trap composed of 8 places in 198 ms
[2020-05-27 17:22:06] [INFO ] Deduced a trap composed of 9 places in 199 ms
[2020-05-27 17:22:06] [INFO ] Deduced a trap composed of 11 places in 173 ms
[2020-05-27 17:22:06] [INFO ] Deduced a trap composed of 8 places in 196 ms
[2020-05-27 17:22:06] [INFO ] Deduced a trap composed of 8 places in 175 ms
[2020-05-27 17:22:07] [INFO ] Deduced a trap composed of 6 places in 172 ms
[2020-05-27 17:22:07] [INFO ] Deduced a trap composed of 14 places in 179 ms
[2020-05-27 17:22:07] [INFO ] Deduced a trap composed of 9 places in 173 ms
[2020-05-27 17:22:07] [INFO ] Deduced a trap composed of 9 places in 169 ms
[2020-05-27 17:22:07] [INFO ] Deduced a trap composed of 18 places in 180 ms
[2020-05-27 17:22:08] [INFO ] Deduced a trap composed of 5 places in 182 ms
[2020-05-27 17:22:08] [INFO ] Deduced a trap composed of 13 places in 165 ms
[2020-05-27 17:22:08] [INFO ] Deduced a trap composed of 10 places in 170 ms
[2020-05-27 17:22:08] [INFO ] Deduced a trap composed of 7 places in 165 ms
[2020-05-27 17:22:08] [INFO ] Deduced a trap composed of 4 places in 182 ms
[2020-05-27 17:22:09] [INFO ] Deduced a trap composed of 6 places in 152 ms
[2020-05-27 17:22:09] [INFO ] Deduced a trap composed of 8 places in 166 ms
[2020-05-27 17:22:09] [INFO ] Deduced a trap composed of 8 places in 176 ms
[2020-05-27 17:22:09] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 15667 ms
[2020-05-27 17:22:09] [INFO ] Computed and/alt/rep : 791/2505/791 causal constraints in 48 ms.
[2020-05-27 17:22:29] [INFO ] Added : 710 causal constraints over 142 iterations in 20109 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 71 ms.
[2020-05-27 17:22:30] [INFO ] [Real]Absence check using 315 positive place invariants in 196 ms returned sat
[2020-05-27 17:22:30] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2020-05-27 17:22:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:22:32] [INFO ] [Real]Absence check using state equation in 2091 ms returned sat
[2020-05-27 17:22:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 17:22:32] [INFO ] [Nat]Absence check using 315 positive place invariants in 193 ms returned sat
[2020-05-27 17:22:32] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2020-05-27 17:22:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 17:22:34] [INFO ] [Nat]Absence check using state equation in 2041 ms returned sat
[2020-05-27 17:22:35] [INFO ] Deduced a trap composed of 4 places in 381 ms
[2020-05-27 17:22:35] [INFO ] Deduced a trap composed of 5 places in 317 ms
[2020-05-27 17:22:35] [INFO ] Deduced a trap composed of 6 places in 324 ms
[2020-05-27 17:22:36] [INFO ] Deduced a trap composed of 7 places in 326 ms
[2020-05-27 17:22:36] [INFO ] Deduced a trap composed of 4 places in 347 ms
[2020-05-27 17:22:36] [INFO ] Deduced a trap composed of 4 places in 281 ms
[2020-05-27 17:22:37] [INFO ] Deduced a trap composed of 4 places in 231 ms
[2020-05-27 17:22:37] [INFO ] Deduced a trap composed of 5 places in 262 ms
[2020-05-27 17:22:37] [INFO ] Deduced a trap composed of 4 places in 320 ms
[2020-05-27 17:22:38] [INFO ] Deduced a trap composed of 4 places in 289 ms
[2020-05-27 17:22:38] [INFO ] Deduced a trap composed of 5 places in 293 ms
[2020-05-27 17:22:38] [INFO ] Deduced a trap composed of 9 places in 300 ms
[2020-05-27 17:22:39] [INFO ] Deduced a trap composed of 6 places in 190 ms
[2020-05-27 17:22:39] [INFO ] Deduced a trap composed of 6 places in 314 ms
[2020-05-27 17:22:39] [INFO ] Deduced a trap composed of 8 places in 223 ms
[2020-05-27 17:22:40] [INFO ] Deduced a trap composed of 9 places in 319 ms
[2020-05-27 17:22:40] [INFO ] Deduced a trap composed of 4 places in 247 ms
[2020-05-27 17:22:40] [INFO ] Deduced a trap composed of 6 places in 290 ms
[2020-05-27 17:22:40] [INFO ] Deduced a trap composed of 4 places in 264 ms
[2020-05-27 17:22:41] [INFO ] Deduced a trap composed of 6 places in 290 ms
[2020-05-27 17:22:41] [INFO ] Deduced a trap composed of 5 places in 238 ms
[2020-05-27 17:22:41] [INFO ] Deduced a trap composed of 4 places in 328 ms
[2020-05-27 17:22:42] [INFO ] Deduced a trap composed of 4 places in 264 ms
[2020-05-27 17:22:42] [INFO ] Deduced a trap composed of 8 places in 272 ms
[2020-05-27 17:22:42] [INFO ] Deduced a trap composed of 4 places in 238 ms
[2020-05-27 17:22:43] [INFO ] Deduced a trap composed of 9 places in 269 ms
[2020-05-27 17:22:43] [INFO ] Deduced a trap composed of 5 places in 250 ms
[2020-05-27 17:22:43] [INFO ] Deduced a trap composed of 8 places in 233 ms
[2020-05-27 17:22:44] [INFO ] Deduced a trap composed of 8 places in 304 ms
[2020-05-27 17:22:44] [INFO ] Deduced a trap composed of 23 places in 262 ms
[2020-05-27 17:22:44] [INFO ] Deduced a trap composed of 6 places in 225 ms
[2020-05-27 17:22:44] [INFO ] Deduced a trap composed of 6 places in 281 ms
[2020-05-27 17:22:45] [INFO ] Deduced a trap composed of 9 places in 217 ms
[2020-05-27 17:22:45] [INFO ] Deduced a trap composed of 12 places in 232 ms
[2020-05-27 17:22:45] [INFO ] Deduced a trap composed of 13 places in 209 ms
[2020-05-27 17:22:45] [INFO ] Deduced a trap composed of 6 places in 224 ms
[2020-05-27 17:22:46] [INFO ] Deduced a trap composed of 9 places in 214 ms
[2020-05-27 17:22:46] [INFO ] Deduced a trap composed of 10 places in 192 ms
[2020-05-27 17:22:46] [INFO ] Deduced a trap composed of 30 places in 172 ms
[2020-05-27 17:22:46] [INFO ] Deduced a trap composed of 9 places in 197 ms
[2020-05-27 17:22:47] [INFO ] Deduced a trap composed of 8 places in 426 ms
[2020-05-27 17:22:48] [INFO ] Deduced a trap composed of 10 places in 718 ms
[2020-05-27 17:22:48] [INFO ] Deduced a trap composed of 23 places in 269 ms
[2020-05-27 17:22:48] [INFO ] Deduced a trap composed of 8 places in 252 ms
[2020-05-27 17:22:49] [INFO ] Deduced a trap composed of 4 places in 263 ms
[2020-05-27 17:22:49] [INFO ] Deduced a trap composed of 8 places in 253 ms
[2020-05-27 17:22:49] [INFO ] Deduced a trap composed of 8 places in 233 ms
[2020-05-27 17:22:49] [INFO ] Deduced a trap composed of 7 places in 208 ms
[2020-05-27 17:22:49] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 15231 ms
[2020-05-27 17:22:50] [INFO ] Computed and/alt/rep : 791/2505/791 causal constraints in 66 ms.
[2020-05-27 17:23:15] [INFO ] Added : 740 causal constraints over 148 iterations in 25896 ms.(timeout) Result :unknown
Incomplete Parikh walk after 52000 steps, including 454 resets, run finished after 521 ms. (steps per millisecond=99 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 36900 steps, including 705 resets, run finished after 285 ms. (steps per millisecond=129 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 62900 steps, including 581 resets, run finished after 330 ms. (steps per millisecond=190 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 18 out of 951 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 951/951 places, 801/801 transitions.
Applied a total of 0 rules in 29 ms. Remains 951 /951 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 801/801 transitions.
Starting structural reductions, iteration 0 : 951/951 places, 801/801 transitions.
Applied a total of 0 rules in 29 ms. Remains 951 /951 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 951 cols
[2020-05-27 17:23:17] [INFO ] Computed 331 place invariants in 19 ms
[2020-05-27 17:23:19] [INFO ] Implicit Places using invariants in 2715 ms returned []
// Phase 1: matrix 801 rows 951 cols
[2020-05-27 17:23:19] [INFO ] Computed 331 place invariants in 18 ms
[2020-05-27 17:23:32] [INFO ] Implicit Places using invariants and state equation in 12426 ms returned []
Implicit Place search using SMT with State Equation took 15155 ms to find 0 implicit places.
[2020-05-27 17:23:32] [INFO ] Redundant transitions in 68 ms returned []
// Phase 1: matrix 801 rows 951 cols
[2020-05-27 17:23:32] [INFO ] Computed 331 place invariants in 9 ms
[2020-05-27 17:23:34] [INFO ] Dead Transitions using invariants and state equation in 1981 ms returned []
Finished structural reductions, in 1 iterations. Remains : 951/951 places, 801/801 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1088 ms. (steps per millisecond=91 ) properties seen :[0, 0, 0]
// Phase 1: matrix 801 rows 951 cols
[2020-05-27 17:23:35] [INFO ] Computed 331 place invariants in 8 ms
[2020-05-27 17:23:35] [INFO ] [Real]Absence check using 315 positive place invariants in 204 ms returned sat
[2020-05-27 17:23:35] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2020-05-27 17:23:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:23:37] [INFO ] [Real]Absence check using state equation in 1766 ms returned sat
[2020-05-27 17:23:37] [INFO ] Deduced a trap composed of 6 places in 355 ms
[2020-05-27 17:23:38] [INFO ] Deduced a trap composed of 4 places in 327 ms
[2020-05-27 17:23:38] [INFO ] Deduced a trap composed of 6 places in 294 ms
[2020-05-27 17:23:38] [INFO ] Deduced a trap composed of 4 places in 215 ms
[2020-05-27 17:23:39] [INFO ] Deduced a trap composed of 7 places in 254 ms
[2020-05-27 17:23:39] [INFO ] Deduced a trap composed of 7 places in 286 ms
[2020-05-27 17:23:39] [INFO ] Deduced a trap composed of 5 places in 296 ms
[2020-05-27 17:23:40] [INFO ] Deduced a trap composed of 5 places in 301 ms
[2020-05-27 17:23:40] [INFO ] Deduced a trap composed of 6 places in 281 ms
[2020-05-27 17:23:40] [INFO ] Deduced a trap composed of 5 places in 275 ms
[2020-05-27 17:23:41] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2020-05-27 17:23:41] [INFO ] Deduced a trap composed of 6 places in 267 ms
[2020-05-27 17:23:41] [INFO ] Deduced a trap composed of 13 places in 273 ms
[2020-05-27 17:23:42] [INFO ] Deduced a trap composed of 9 places in 269 ms
[2020-05-27 17:23:42] [INFO ] Deduced a trap composed of 6 places in 247 ms
[2020-05-27 17:23:42] [INFO ] Deduced a trap composed of 6 places in 270 ms
[2020-05-27 17:23:43] [INFO ] Deduced a trap composed of 6 places in 273 ms
[2020-05-27 17:23:43] [INFO ] Deduced a trap composed of 6 places in 256 ms
[2020-05-27 17:23:43] [INFO ] Deduced a trap composed of 5 places in 264 ms
[2020-05-27 17:23:43] [INFO ] Deduced a trap composed of 20 places in 268 ms
[2020-05-27 17:23:44] [INFO ] Deduced a trap composed of 6 places in 261 ms
[2020-05-27 17:23:44] [INFO ] Deduced a trap composed of 9 places in 263 ms
[2020-05-27 17:23:44] [INFO ] Deduced a trap composed of 6 places in 255 ms
[2020-05-27 17:23:45] [INFO ] Deduced a trap composed of 8 places in 253 ms
[2020-05-27 17:23:45] [INFO ] Deduced a trap composed of 9 places in 221 ms
[2020-05-27 17:23:45] [INFO ] Deduced a trap composed of 9 places in 250 ms
[2020-05-27 17:23:45] [INFO ] Deduced a trap composed of 6 places in 249 ms
[2020-05-27 17:23:46] [INFO ] Deduced a trap composed of 11 places in 261 ms
[2020-05-27 17:23:46] [INFO ] Deduced a trap composed of 9 places in 226 ms
[2020-05-27 17:23:46] [INFO ] Deduced a trap composed of 19 places in 225 ms
[2020-05-27 17:23:47] [INFO ] Deduced a trap composed of 11 places in 211 ms
[2020-05-27 17:23:47] [INFO ] Deduced a trap composed of 11 places in 213 ms
[2020-05-27 17:23:47] [INFO ] Deduced a trap composed of 14 places in 227 ms
[2020-05-27 17:23:47] [INFO ] Deduced a trap composed of 9 places in 211 ms
[2020-05-27 17:23:48] [INFO ] Deduced a trap composed of 6 places in 237 ms
[2020-05-27 17:23:48] [INFO ] Deduced a trap composed of 23 places in 217 ms
[2020-05-27 17:23:48] [INFO ] Deduced a trap composed of 6 places in 210 ms
[2020-05-27 17:23:48] [INFO ] Deduced a trap composed of 15 places in 212 ms
[2020-05-27 17:23:49] [INFO ] Deduced a trap composed of 11 places in 197 ms
[2020-05-27 17:23:49] [INFO ] Deduced a trap composed of 9 places in 196 ms
[2020-05-27 17:23:49] [INFO ] Trap strengthening (SAT) tested/added 41/40 trap constraints in 11721 ms
[2020-05-27 17:23:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 17:23:49] [INFO ] [Nat]Absence check using 315 positive place invariants in 197 ms returned sat
[2020-05-27 17:23:49] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 11 ms returned sat
[2020-05-27 17:23:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 17:23:51] [INFO ] [Nat]Absence check using state equation in 1599 ms returned sat
[2020-05-27 17:23:51] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-05-27 17:23:51] [INFO ] Deduced a trap composed of 6 places in 264 ms
[2020-05-27 17:23:52] [INFO ] Deduced a trap composed of 6 places in 298 ms
[2020-05-27 17:23:52] [INFO ] Deduced a trap composed of 4 places in 287 ms
[2020-05-27 17:23:52] [INFO ] Deduced a trap composed of 6 places in 231 ms
[2020-05-27 17:23:53] [INFO ] Deduced a trap composed of 6 places in 219 ms
[2020-05-27 17:23:53] [INFO ] Deduced a trap composed of 6 places in 219 ms
[2020-05-27 17:23:53] [INFO ] Deduced a trap composed of 5 places in 223 ms
[2020-05-27 17:23:53] [INFO ] Deduced a trap composed of 6 places in 220 ms
[2020-05-27 17:23:54] [INFO ] Deduced a trap composed of 5 places in 233 ms
[2020-05-27 17:23:54] [INFO ] Deduced a trap composed of 4 places in 226 ms
[2020-05-27 17:23:54] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-05-27 17:23:54] [INFO ] Deduced a trap composed of 7 places in 226 ms
[2020-05-27 17:23:55] [INFO ] Deduced a trap composed of 4 places in 231 ms
[2020-05-27 17:23:55] [INFO ] Deduced a trap composed of 5 places in 222 ms
[2020-05-27 17:23:55] [INFO ] Deduced a trap composed of 4 places in 240 ms
[2020-05-27 17:23:55] [INFO ] Deduced a trap composed of 4 places in 238 ms
[2020-05-27 17:23:56] [INFO ] Deduced a trap composed of 5 places in 237 ms
[2020-05-27 17:23:56] [INFO ] Deduced a trap composed of 6 places in 235 ms
[2020-05-27 17:23:56] [INFO ] Deduced a trap composed of 4 places in 245 ms
[2020-05-27 17:23:56] [INFO ] Deduced a trap composed of 6 places in 240 ms
[2020-05-27 17:23:57] [INFO ] Deduced a trap composed of 6 places in 282 ms
[2020-05-27 17:23:57] [INFO ] Deduced a trap composed of 6 places in 268 ms
[2020-05-27 17:23:57] [INFO ] Deduced a trap composed of 8 places in 251 ms
[2020-05-27 17:23:58] [INFO ] Deduced a trap composed of 6 places in 254 ms
[2020-05-27 17:23:58] [INFO ] Deduced a trap composed of 5 places in 252 ms
[2020-05-27 17:23:58] [INFO ] Deduced a trap composed of 6 places in 343 ms
[2020-05-27 17:23:59] [INFO ] Deduced a trap composed of 4 places in 308 ms
[2020-05-27 17:23:59] [INFO ] Deduced a trap composed of 9 places in 321 ms
[2020-05-27 17:23:59] [INFO ] Deduced a trap composed of 6 places in 320 ms
[2020-05-27 17:24:00] [INFO ] Deduced a trap composed of 12 places in 300 ms
[2020-05-27 17:24:00] [INFO ] Deduced a trap composed of 6 places in 291 ms
[2020-05-27 17:24:00] [INFO ] Deduced a trap composed of 6 places in 305 ms
[2020-05-27 17:24:01] [INFO ] Deduced a trap composed of 4 places in 312 ms
[2020-05-27 17:24:01] [INFO ] Deduced a trap composed of 14 places in 299 ms
[2020-05-27 17:24:01] [INFO ] Deduced a trap composed of 5 places in 328 ms
[2020-05-27 17:24:02] [INFO ] Deduced a trap composed of 6 places in 289 ms
[2020-05-27 17:24:02] [INFO ] Deduced a trap composed of 6 places in 311 ms
[2020-05-27 17:24:02] [INFO ] Deduced a trap composed of 12 places in 278 ms
[2020-05-27 17:24:03] [INFO ] Deduced a trap composed of 4 places in 278 ms
[2020-05-27 17:24:03] [INFO ] Deduced a trap composed of 6 places in 263 ms
[2020-05-27 17:24:03] [INFO ] Deduced a trap composed of 7 places in 247 ms
[2020-05-27 17:24:04] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-05-27 17:24:04] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2020-05-27 17:24:04] [INFO ] Deduced a trap composed of 5 places in 301 ms
[2020-05-27 17:24:05] [INFO ] Deduced a trap composed of 8 places in 307 ms
[2020-05-27 17:24:05] [INFO ] Deduced a trap composed of 6 places in 278 ms
[2020-05-27 17:24:05] [INFO ] Deduced a trap composed of 6 places in 272 ms
[2020-05-27 17:24:05] [INFO ] Deduced a trap composed of 6 places in 254 ms
[2020-05-27 17:24:06] [INFO ] Deduced a trap composed of 6 places in 278 ms
[2020-05-27 17:24:06] [INFO ] Deduced a trap composed of 6 places in 265 ms
[2020-05-27 17:24:06] [INFO ] Deduced a trap composed of 12 places in 260 ms
[2020-05-27 17:24:07] [INFO ] Deduced a trap composed of 8 places in 254 ms
[2020-05-27 17:24:07] [INFO ] Deduced a trap composed of 5 places in 250 ms
[2020-05-27 17:24:07] [INFO ] Deduced a trap composed of 6 places in 245 ms
[2020-05-27 17:24:08] [INFO ] Deduced a trap composed of 8 places in 271 ms
[2020-05-27 17:24:08] [INFO ] Deduced a trap composed of 4 places in 277 ms
[2020-05-27 17:24:08] [INFO ] Deduced a trap composed of 7 places in 252 ms
[2020-05-27 17:24:08] [INFO ] Deduced a trap composed of 6 places in 259 ms
[2020-05-27 17:24:09] [INFO ] Deduced a trap composed of 6 places in 290 ms
[2020-05-27 17:24:09] [INFO ] Deduced a trap composed of 12 places in 298 ms
[2020-05-27 17:24:09] [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 (> (+ s843 s844 s875 s884 s886 s906 s915 s917 s924 s927 s944 s945) 0)") while checking expression at index 0
[2020-05-27 17:24:09] [INFO ] [Real]Absence check using 315 positive place invariants in 144 ms returned sat
[2020-05-27 17:24:09] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 7 ms returned sat
[2020-05-27 17:24:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:24:11] [INFO ] [Real]Absence check using state equation in 1862 ms returned sat
[2020-05-27 17:24:12] [INFO ] Deduced a trap composed of 4 places in 341 ms
[2020-05-27 17:24:12] [INFO ] Deduced a trap composed of 6 places in 333 ms
[2020-05-27 17:24:12] [INFO ] Deduced a trap composed of 5 places in 318 ms
[2020-05-27 17:24:13] [INFO ] Deduced a trap composed of 6 places in 265 ms
[2020-05-27 17:24:13] [INFO ] Deduced a trap composed of 5 places in 256 ms
[2020-05-27 17:24:13] [INFO ] Deduced a trap composed of 4 places in 259 ms
[2020-05-27 17:24:13] [INFO ] Deduced a trap composed of 6 places in 241 ms
[2020-05-27 17:24:14] [INFO ] Deduced a trap composed of 6 places in 266 ms
[2020-05-27 17:24:14] [INFO ] Deduced a trap composed of 5 places in 239 ms
[2020-05-27 17:24:14] [INFO ] Deduced a trap composed of 19 places in 253 ms
[2020-05-27 17:24:15] [INFO ] Deduced a trap composed of 8 places in 233 ms
[2020-05-27 17:24:15] [INFO ] Deduced a trap composed of 11 places in 189 ms
[2020-05-27 17:24:15] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-05-27 17:24:15] [INFO ] Deduced a trap composed of 6 places in 220 ms
[2020-05-27 17:24:16] [INFO ] Deduced a trap composed of 6 places in 224 ms
[2020-05-27 17:24:16] [INFO ] Deduced a trap composed of 9 places in 222 ms
[2020-05-27 17:24:16] [INFO ] Deduced a trap composed of 11 places in 232 ms
[2020-05-27 17:24:16] [INFO ] Deduced a trap composed of 6 places in 210 ms
[2020-05-27 17:24:17] [INFO ] Deduced a trap composed of 5 places in 179 ms
[2020-05-27 17:24:17] [INFO ] Deduced a trap composed of 6 places in 206 ms
[2020-05-27 17:24:17] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 5721 ms
[2020-05-27 17:24:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 17:24:17] [INFO ] [Nat]Absence check using 315 positive place invariants in 193 ms returned sat
[2020-05-27 17:24:17] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 11 ms returned sat
[2020-05-27 17:24:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 17:24:19] [INFO ] [Nat]Absence check using state equation in 1850 ms returned sat
[2020-05-27 17:24:20] [INFO ] Deduced a trap composed of 6 places in 343 ms
[2020-05-27 17:24:20] [INFO ] Deduced a trap composed of 4 places in 298 ms
[2020-05-27 17:24:20] [INFO ] Deduced a trap composed of 6 places in 340 ms
[2020-05-27 17:24:21] [INFO ] Deduced a trap composed of 11 places in 341 ms
[2020-05-27 17:24:21] [INFO ] Deduced a trap composed of 11 places in 281 ms
[2020-05-27 17:24:21] [INFO ] Deduced a trap composed of 4 places in 246 ms
[2020-05-27 17:24:21] [INFO ] Deduced a trap composed of 5 places in 241 ms
[2020-05-27 17:24:22] [INFO ] Deduced a trap composed of 6 places in 240 ms
[2020-05-27 17:24:22] [INFO ] Deduced a trap composed of 4 places in 207 ms
[2020-05-27 17:24:22] [INFO ] Deduced a trap composed of 4 places in 293 ms
[2020-05-27 17:24:22] [INFO ] Deduced a trap composed of 6 places in 216 ms
[2020-05-27 17:24:23] [INFO ] Deduced a trap composed of 5 places in 206 ms
[2020-05-27 17:24:23] [INFO ] Deduced a trap composed of 5 places in 223 ms
[2020-05-27 17:24:23] [INFO ] Deduced a trap composed of 6 places in 218 ms
[2020-05-27 17:24:23] [INFO ] Deduced a trap composed of 6 places in 200 ms
[2020-05-27 17:24:24] [INFO ] Deduced a trap composed of 5 places in 206 ms
[2020-05-27 17:24:24] [INFO ] Deduced a trap composed of 5 places in 300 ms
[2020-05-27 17:24:24] [INFO ] Deduced a trap composed of 6 places in 192 ms
[2020-05-27 17:24:24] [INFO ] Deduced a trap composed of 4 places in 189 ms
[2020-05-27 17:24:25] [INFO ] Deduced a trap composed of 5 places in 199 ms
[2020-05-27 17:24:25] [INFO ] Deduced a trap composed of 9 places in 303 ms
[2020-05-27 17:24:25] [INFO ] Deduced a trap composed of 6 places in 188 ms
[2020-05-27 17:24:25] [INFO ] Deduced a trap composed of 5 places in 185 ms
[2020-05-27 17:24:26] [INFO ] Deduced a trap composed of 5 places in 181 ms
[2020-05-27 17:24:26] [INFO ] Deduced a trap composed of 6 places in 295 ms
[2020-05-27 17:24:26] [INFO ] Deduced a trap composed of 4 places in 256 ms
[2020-05-27 17:24:26] [INFO ] Deduced a trap composed of 10 places in 178 ms
[2020-05-27 17:24:27] [INFO ] Deduced a trap composed of 6 places in 200 ms
[2020-05-27 17:24:27] [INFO ] Deduced a trap composed of 8 places in 183 ms
[2020-05-27 17:24:27] [INFO ] Deduced a trap composed of 7 places in 177 ms
[2020-05-27 17:24:27] [INFO ] Deduced a trap composed of 13 places in 289 ms
[2020-05-27 17:24:28] [INFO ] Deduced a trap composed of 11 places in 177 ms
[2020-05-27 17:24:28] [INFO ] Deduced a trap composed of 6 places in 288 ms
[2020-05-27 17:24:28] [INFO ] Deduced a trap composed of 8 places in 290 ms
[2020-05-27 17:24:29] [INFO ] Deduced a trap composed of 4 places in 268 ms
[2020-05-27 17:24:29] [INFO ] Deduced a trap composed of 6 places in 237 ms
[2020-05-27 17:24:29] [INFO ] Deduced a trap composed of 6 places in 278 ms
[2020-05-27 17:24:29] [INFO ] Deduced a trap composed of 6 places in 176 ms
[2020-05-27 17:24:29] [INFO ] Deduced a trap composed of 4 places in 155 ms
[2020-05-27 17:24:30] [INFO ] Deduced a trap composed of 6 places in 218 ms
[2020-05-27 17:24:30] [INFO ] Deduced a trap composed of 9 places in 181 ms
[2020-05-27 17:24:30] [INFO ] Deduced a trap composed of 8 places in 211 ms
[2020-05-27 17:24:30] [INFO ] Deduced a trap composed of 8 places in 144 ms
[2020-05-27 17:24:31] [INFO ] Deduced a trap composed of 6 places in 146 ms
[2020-05-27 17:24:31] [INFO ] Deduced a trap composed of 9 places in 145 ms
[2020-05-27 17:24:31] [INFO ] Deduced a trap composed of 9 places in 144 ms
[2020-05-27 17:24:31] [INFO ] Deduced a trap composed of 8 places in 125 ms
[2020-05-27 17:24:31] [INFO ] Deduced a trap composed of 9 places in 126 ms
[2020-05-27 17:24:31] [INFO ] Deduced a trap composed of 11 places in 126 ms
[2020-05-27 17:24:31] [INFO ] Deduced a trap composed of 8 places in 137 ms
[2020-05-27 17:24:32] [INFO ] Deduced a trap composed of 8 places in 125 ms
[2020-05-27 17:24:32] [INFO ] Deduced a trap composed of 6 places in 122 ms
[2020-05-27 17:24:32] [INFO ] Deduced a trap composed of 14 places in 125 ms
[2020-05-27 17:24:32] [INFO ] Deduced a trap composed of 9 places in 130 ms
[2020-05-27 17:24:32] [INFO ] Deduced a trap composed of 9 places in 136 ms
[2020-05-27 17:24:32] [INFO ] Deduced a trap composed of 18 places in 128 ms
[2020-05-27 17:24:33] [INFO ] Deduced a trap composed of 5 places in 132 ms
[2020-05-27 17:24:33] [INFO ] Deduced a trap composed of 13 places in 122 ms
[2020-05-27 17:24:33] [INFO ] Deduced a trap composed of 10 places in 120 ms
[2020-05-27 17:24:33] [INFO ] Deduced a trap composed of 7 places in 125 ms
[2020-05-27 17:24:33] [INFO ] Deduced a trap composed of 4 places in 121 ms
[2020-05-27 17:24:33] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-05-27 17:24:33] [INFO ] Deduced a trap composed of 8 places in 113 ms
[2020-05-27 17:24:34] [INFO ] Deduced a trap composed of 8 places in 108 ms
[2020-05-27 17:24:34] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 14464 ms
[2020-05-27 17:24:34] [INFO ] Computed and/alt/rep : 791/2505/791 causal constraints in 61 ms.
[2020-05-27 17:24:37] [INFO ] Added : 205 causal constraints over 41 iterations in 3363 ms. Result :unknown
[2020-05-27 17:24:37] [INFO ] [Real]Absence check using 315 positive place invariants in 200 ms returned sat
[2020-05-27 17:24:37] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 15 ms returned sat
[2020-05-27 17:24:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:24:40] [INFO ] [Real]Absence check using state equation in 2155 ms returned sat
[2020-05-27 17:24:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 17:24:40] [INFO ] [Nat]Absence check using 315 positive place invariants in 213 ms returned sat
[2020-05-27 17:24:40] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 12 ms returned sat
[2020-05-27 17:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 17:24:42] [INFO ] [Nat]Absence check using state equation in 1839 ms returned sat
[2020-05-27 17:24:42] [INFO ] Deduced a trap composed of 4 places in 330 ms
[2020-05-27 17:24:42] [INFO ] Deduced a trap composed of 5 places in 296 ms
[2020-05-27 17:24:43] [INFO ] Deduced a trap composed of 6 places in 271 ms
[2020-05-27 17:24:43] [INFO ] Deduced a trap composed of 7 places in 218 ms
[2020-05-27 17:24:43] [INFO ] Deduced a trap composed of 4 places in 305 ms
[2020-05-27 17:24:44] [INFO ] Deduced a trap composed of 4 places in 307 ms
[2020-05-27 17:24:44] [INFO ] Deduced a trap composed of 4 places in 233 ms
[2020-05-27 17:24:44] [INFO ] Deduced a trap composed of 5 places in 228 ms
[2020-05-27 17:24:44] [INFO ] Deduced a trap composed of 4 places in 222 ms
[2020-05-27 17:24:45] [INFO ] Deduced a trap composed of 4 places in 205 ms
[2020-05-27 17:24:45] [INFO ] Deduced a trap composed of 5 places in 205 ms
[2020-05-27 17:24:45] [INFO ] Deduced a trap composed of 9 places in 205 ms
[2020-05-27 17:24:45] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-05-27 17:24:46] [INFO ] Deduced a trap composed of 6 places in 207 ms
[2020-05-27 17:24:46] [INFO ] Deduced a trap composed of 8 places in 241 ms
[2020-05-27 17:24:46] [INFO ] Deduced a trap composed of 9 places in 215 ms
[2020-05-27 17:24:46] [INFO ] Deduced a trap composed of 4 places in 209 ms
[2020-05-27 17:24:47] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-05-27 17:24:47] [INFO ] Deduced a trap composed of 4 places in 211 ms
[2020-05-27 17:24:47] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2020-05-27 17:24:47] [INFO ] Deduced a trap composed of 5 places in 212 ms
[2020-05-27 17:24:48] [INFO ] Deduced a trap composed of 4 places in 282 ms
[2020-05-27 17:24:48] [INFO ] Deduced a trap composed of 4 places in 255 ms
[2020-05-27 17:24:48] [INFO ] Deduced a trap composed of 8 places in 481 ms
[2020-05-27 17:24:49] [INFO ] Deduced a trap composed of 4 places in 365 ms
[2020-05-27 17:24:49] [INFO ] Deduced a trap composed of 9 places in 367 ms
[2020-05-27 17:24:50] [INFO ] Deduced a trap composed of 5 places in 337 ms
[2020-05-27 17:24:50] [INFO ] Deduced a trap composed of 8 places in 337 ms
[2020-05-27 17:24:50] [INFO ] Deduced a trap composed of 8 places in 371 ms
[2020-05-27 17:24:51] [INFO ] Deduced a trap composed of 23 places in 273 ms
[2020-05-27 17:24:51] [INFO ] Deduced a trap composed of 6 places in 285 ms
[2020-05-27 17:24:51] [INFO ] Deduced a trap composed of 6 places in 269 ms
[2020-05-27 17:24:52] [INFO ] Deduced a trap composed of 9 places in 307 ms
[2020-05-27 17:24:52] [INFO ] Deduced a trap composed of 12 places in 372 ms
[2020-05-27 17:24:52] [INFO ] Deduced a trap composed of 13 places in 314 ms
[2020-05-27 17:24:53] [INFO ] Deduced a trap composed of 6 places in 293 ms
[2020-05-27 17:24:53] [INFO ] Deduced a trap composed of 9 places in 305 ms
[2020-05-27 17:24:53] [INFO ] Deduced a trap composed of 10 places in 295 ms
[2020-05-27 17:24:54] [INFO ] Deduced a trap composed of 30 places in 262 ms
[2020-05-27 17:24:54] [INFO ] Deduced a trap composed of 9 places in 230 ms
[2020-05-27 17:24:54] [INFO ] Deduced a trap composed of 8 places in 277 ms
[2020-05-27 17:24:55] [INFO ] Deduced a trap composed of 10 places in 272 ms
[2020-05-27 17:24:55] [INFO ] Deduced a trap composed of 23 places in 267 ms
[2020-05-27 17:24:55] [INFO ] Deduced a trap composed of 8 places in 246 ms
[2020-05-27 17:24:56] [INFO ] Deduced a trap composed of 4 places in 264 ms
[2020-05-27 17:24:56] [INFO ] Deduced a trap composed of 8 places in 253 ms
[2020-05-27 17:24:56] [INFO ] Deduced a trap composed of 8 places in 224 ms
[2020-05-27 17:24:56] [INFO ] Deduced a trap composed of 7 places in 219 ms
[2020-05-27 17:24:56] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 14646 ms
[2020-05-27 17:24:56] [INFO ] Computed and/alt/rep : 791/2505/791 causal constraints in 58 ms.
[2020-05-27 17:25:00] [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: Broken pipe (=> (> t196 0) (or (and (> t458 0) (< o458 o196)) (and (> t559 0) (< o559 o196)) (and (> t560 0) (< o560 o196)) (and (> t761 0) (< o761 o196))))") while checking expression at index 2
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 951 transition count 801
Applied a total of 2 rules in 62 ms. Remains 951 /951 variables (removed 0) and now considering 801/801 (removed 0) transitions.
// Phase 1: matrix 801 rows 951 cols
[2020-05-27 17:25:00] [INFO ] Computed 331 place invariants in 10 ms
[2020-05-27 17:25:00] [INFO ] [Real]Absence check using 315 positive place invariants in 197 ms returned sat
[2020-05-27 17:25:00] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 11 ms returned sat
[2020-05-27 17:25:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:25:02] [INFO ] [Real]Absence check using state equation in 1704 ms returned sat
[2020-05-27 17:25:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-27 17:25:02] [INFO ] [Real]Added 2 Read/Feed constraints in 16 ms returned sat
[2020-05-27 17:25:02] [INFO ] Deduced a trap composed of 6 places in 330 ms
[2020-05-27 17:25:03] [INFO ] Deduced a trap composed of 9 places in 339 ms
[2020-05-27 17:25:03] [INFO ] Deduced a trap composed of 4 places in 341 ms
[2020-05-27 17:25:03] [INFO ] Deduced a trap composed of 5 places in 345 ms
[2020-05-27 17:25:04] [INFO ] Deduced a trap composed of 6 places in 289 ms
[2020-05-27 17:25:04] [INFO ] Deduced a trap composed of 5 places in 364 ms
[2020-05-27 17:25:04] [INFO ] Deduced a trap composed of 5 places in 303 ms
[2020-05-27 17:25:05] [INFO ] Deduced a trap composed of 9 places in 300 ms
[2020-05-27 17:25:05] [INFO ] Deduced a trap composed of 5 places in 287 ms
[2020-05-27 17:25:05] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-05-27 17:25:06] [INFO ] Deduced a trap composed of 9 places in 225 ms
[2020-05-27 17:25:06] [INFO ] Deduced a trap composed of 11 places in 226 ms
[2020-05-27 17:25:06] [INFO ] Deduced a trap composed of 6 places in 248 ms
[2020-05-27 17:25:06] [INFO ] Deduced a trap composed of 8 places in 230 ms
[2020-05-27 17:25:07] [INFO ] Deduced a trap composed of 9 places in 228 ms
[2020-05-27 17:25:07] [INFO ] Deduced a trap composed of 9 places in 213 ms
[2020-05-27 17:25:07] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2020-05-27 17:25:08] [INFO ] Deduced a trap composed of 15 places in 305 ms
[2020-05-27 17:25:08] [INFO ] Deduced a trap composed of 14 places in 193 ms
[2020-05-27 17:25:08] [INFO ] Deduced a trap composed of 17 places in 218 ms
[2020-05-27 17:25:08] [INFO ] Deduced a trap composed of 6 places in 193 ms
[2020-05-27 17:25:09] [INFO ] Deduced a trap composed of 6 places in 212 ms
[2020-05-27 17:25:09] [INFO ] Deduced a trap composed of 9 places in 202 ms
[2020-05-27 17:25:09] [INFO ] Deduced a trap composed of 9 places in 194 ms
[2020-05-27 17:25:09] [INFO ] Deduced a trap composed of 12 places in 264 ms
[2020-05-27 17:25:10] [INFO ] Deduced a trap composed of 17 places in 267 ms
[2020-05-27 17:25:10] [INFO ] Deduced a trap composed of 12 places in 260 ms
[2020-05-27 17:25:10] [INFO ] Deduced a trap composed of 11 places in 232 ms
[2020-05-27 17:25:10] [INFO ] Deduced a trap composed of 6 places in 217 ms
[2020-05-27 17:25:11] [INFO ] Deduced a trap composed of 20 places in 210 ms
[2020-05-27 17:25:11] [INFO ] Deduced a trap composed of 20 places in 210 ms
[2020-05-27 17:25:11] [INFO ] Deduced a trap composed of 8 places in 229 ms
[2020-05-27 17:25:11] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 9413 ms
[2020-05-27 17:25:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 17:25:12] [INFO ] [Nat]Absence check using 315 positive place invariants in 239 ms returned sat
[2020-05-27 17:25:12] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 13 ms returned sat
[2020-05-27 17:25:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 17:25:14] [INFO ] [Nat]Absence check using state equation in 1875 ms returned sat
[2020-05-27 17:25:14] [INFO ] [Nat]Added 2 Read/Feed constraints in 19 ms returned sat
[2020-05-27 17:25:14] [INFO ] Deduced a trap composed of 6 places in 336 ms
[2020-05-27 17:25:14] [INFO ] Deduced a trap composed of 6 places in 304 ms
[2020-05-27 17:25:15] [INFO ] Deduced a trap composed of 4 places in 311 ms
[2020-05-27 17:25:15] [INFO ] Deduced a trap composed of 6 places in 325 ms
[2020-05-27 17:25:15] [INFO ] Deduced a trap composed of 6 places in 314 ms
[2020-05-27 17:25:16] [INFO ] Deduced a trap composed of 6 places in 304 ms
[2020-05-27 17:25:16] [INFO ] Deduced a trap composed of 6 places in 314 ms
[2020-05-27 17:25:16] [INFO ] Deduced a trap composed of 8 places in 299 ms
[2020-05-27 17:25:17] [INFO ] Deduced a trap composed of 8 places in 292 ms
[2020-05-27 17:25:17] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-05-27 17:25:17] [INFO ] Deduced a trap composed of 5 places in 280 ms
[2020-05-27 17:25:18] [INFO ] Deduced a trap composed of 6 places in 276 ms
[2020-05-27 17:25:18] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2020-05-27 17:25:18] [INFO ] Deduced a trap composed of 8 places in 234 ms
[2020-05-27 17:25:19] [INFO ] Deduced a trap composed of 10 places in 234 ms
[2020-05-27 17:25:19] [INFO ] Deduced a trap composed of 4 places in 253 ms
[2020-05-27 17:25:19] [INFO ] Deduced a trap composed of 4 places in 252 ms
[2020-05-27 17:25:19] [INFO ] Deduced a trap composed of 7 places in 251 ms
[2020-05-27 17:25:20] [INFO ] Deduced a trap composed of 6 places in 273 ms
[2020-05-27 17:25:20] [INFO ] Deduced a trap composed of 6 places in 277 ms
[2020-05-27 17:25:20] [INFO ] Deduced a trap composed of 4 places in 255 ms
[2020-05-27 17:25:21] [INFO ] Deduced a trap composed of 6 places in 291 ms
[2020-05-27 17:25:21] [INFO ] Deduced a trap composed of 5 places in 261 ms
[2020-05-27 17:25:21] [INFO ] Deduced a trap composed of 6 places in 288 ms
[2020-05-27 17:25:22] [INFO ] Deduced a trap composed of 8 places in 267 ms
[2020-05-27 17:25:22] [INFO ] Deduced a trap composed of 10 places in 276 ms
[2020-05-27 17:25:22] [INFO ] Deduced a trap composed of 8 places in 272 ms
[2020-05-27 17:25:23] [INFO ] Deduced a trap composed of 6 places in 310 ms
[2020-05-27 17:25:23] [INFO ] Deduced a trap composed of 6 places in 235 ms
[2020-05-27 17:25:23] [INFO ] Deduced a trap composed of 6 places in 259 ms
[2020-05-27 17:25:23] [INFO ] Deduced a trap composed of 9 places in 240 ms
[2020-05-27 17:25:24] [INFO ] Deduced a trap composed of 6 places in 245 ms
[2020-05-27 17:25:24] [INFO ] Deduced a trap composed of 9 places in 235 ms
[2020-05-27 17:25:24] [INFO ] Deduced a trap composed of 6 places in 285 ms
[2020-05-27 17:25:25] [INFO ] Deduced a trap composed of 10 places in 250 ms
[2020-05-27 17:25:25] [INFO ] Deduced a trap composed of 5 places in 235 ms
[2020-05-27 17:25:25] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-05-27 17:25:25] [INFO ] Deduced a trap composed of 6 places in 233 ms
[2020-05-27 17:25:26] [INFO ] Deduced a trap composed of 8 places in 253 ms
[2020-05-27 17:25:26] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-05-27 17:25:26] [INFO ] Deduced a trap composed of 6 places in 248 ms
[2020-05-27 17:25:27] [INFO ] Deduced a trap composed of 4 places in 242 ms
[2020-05-27 17:25:27] [INFO ] Deduced a trap composed of 6 places in 250 ms
[2020-05-27 17:25:27] [INFO ] Deduced a trap composed of 6 places in 219 ms
[2020-05-27 17:25:27] [INFO ] Deduced a trap composed of 12 places in 243 ms
[2020-05-27 17:25:28] [INFO ] Deduced a trap composed of 6 places in 230 ms
[2020-05-27 17:25:28] [INFO ] Deduced a trap composed of 8 places in 220 ms
[2020-05-27 17:25:28] [INFO ] Deduced a trap composed of 6 places in 246 ms
[2020-05-27 17:25:29] [INFO ] Deduced a trap composed of 4 places in 335 ms
[2020-05-27 17:25:29] [INFO ] Deduced a trap composed of 11 places in 214 ms
[2020-05-27 17:25:29] [INFO ] Deduced a trap composed of 10 places in 246 ms
[2020-05-27 17:25:29] [INFO ] Deduced a trap composed of 6 places in 254 ms
[2020-05-27 17:25:30] [INFO ] Deduced a trap composed of 8 places in 225 ms
[2020-05-27 17:25:30] [INFO ] Deduced a trap composed of 8 places in 216 ms
[2020-05-27 17:25:30] [INFO ] Deduced a trap composed of 20 places in 212 ms
[2020-05-27 17:25:30] [INFO ] Deduced a trap composed of 18 places in 178 ms
[2020-05-27 17:25:31] [INFO ] Deduced a trap composed of 10 places in 197 ms
[2020-05-27 17:25:31] [INFO ] Deduced a trap composed of 7 places in 188 ms
[2020-05-27 17:25:31] [INFO ] Deduced a trap composed of 6 places in 193 ms
[2020-05-27 17:25:31] [INFO ] Deduced a trap composed of 6 places in 172 ms
[2020-05-27 17:25:31] [INFO ] Trap strengthening (SAT) tested/added 61/60 trap constraints in 17753 ms
[2020-05-27 17:25:31] [INFO ] Computed and/alt/rep : 791/2514/791 causal constraints in 62 ms.
[2020-05-27 17:25:56] [INFO ] Added : 714 causal constraints over 150 iterations in 24966 ms.(timeout) Result :unknown
[2020-05-27 17:25:57] [INFO ] [Real]Absence check using 315 positive place invariants in 216 ms returned sat
[2020-05-27 17:25:57] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 13 ms returned sat
[2020-05-27 17:25:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:25:59] [INFO ] [Real]Absence check using state equation in 1803 ms returned sat
[2020-05-27 17:25:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 17:25:59] [INFO ] [Nat]Absence check using 315 positive place invariants in 194 ms returned sat
[2020-05-27 17:25:59] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 13 ms returned sat
[2020-05-27 17:25:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 17:26:01] [INFO ] [Nat]Absence check using state equation in 2075 ms returned sat
[2020-05-27 17:26:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 58 ms returned sat
[2020-05-27 17:26:01] [INFO ] Deduced a trap composed of 5 places in 237 ms
[2020-05-27 17:26:02] [INFO ] Deduced a trap composed of 5 places in 226 ms
[2020-05-27 17:26:02] [INFO ] Deduced a trap composed of 5 places in 179 ms
[2020-05-27 17:26:02] [INFO ] Deduced a trap composed of 5 places in 213 ms
[2020-05-27 17:26:02] [INFO ] Deduced a trap composed of 6 places in 194 ms
[2020-05-27 17:26:03] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-05-27 17:26:03] [INFO ] Deduced a trap composed of 5 places in 236 ms
[2020-05-27 17:26:03] [INFO ] Deduced a trap composed of 6 places in 192 ms
[2020-05-27 17:26:03] [INFO ] Deduced a trap composed of 4 places in 189 ms
[2020-05-27 17:26:03] [INFO ] Deduced a trap composed of 6 places in 184 ms
[2020-05-27 17:26:04] [INFO ] Deduced a trap composed of 6 places in 184 ms
[2020-05-27 17:26:04] [INFO ] Deduced a trap composed of 4 places in 181 ms
[2020-05-27 17:26:04] [INFO ] Deduced a trap composed of 5 places in 255 ms
[2020-05-27 17:26:04] [INFO ] Deduced a trap composed of 5 places in 209 ms
[2020-05-27 17:26:05] [INFO ] Deduced a trap composed of 5 places in 183 ms
[2020-05-27 17:26:05] [INFO ] Deduced a trap composed of 6 places in 186 ms
[2020-05-27 17:26:05] [INFO ] Deduced a trap composed of 8 places in 171 ms
[2020-05-27 17:26:05] [INFO ] Deduced a trap composed of 4 places in 174 ms
[2020-05-27 17:26:06] [INFO ] Deduced a trap composed of 5 places in 181 ms
[2020-05-27 17:26:06] [INFO ] Deduced a trap composed of 5 places in 239 ms
[2020-05-27 17:26:06] [INFO ] Deduced a trap composed of 6 places in 196 ms
[2020-05-27 17:26:06] [INFO ] Deduced a trap composed of 5 places in 166 ms
[2020-05-27 17:26:07] [INFO ] Deduced a trap composed of 6 places in 178 ms
[2020-05-27 17:26:07] [INFO ] Deduced a trap composed of 4 places in 162 ms
[2020-05-27 17:26:07] [INFO ] Deduced a trap composed of 6 places in 176 ms
[2020-05-27 17:26:07] [INFO ] Deduced a trap composed of 6 places in 176 ms
[2020-05-27 17:26:07] [INFO ] Deduced a trap composed of 5 places in 261 ms
[2020-05-27 17:26:08] [INFO ] Deduced a trap composed of 5 places in 157 ms
[2020-05-27 17:26:08] [INFO ] Deduced a trap composed of 7 places in 157 ms
[2020-05-27 17:26:08] [INFO ] Deduced a trap composed of 6 places in 159 ms
[2020-05-27 17:26:08] [INFO ] Deduced a trap composed of 7 places in 156 ms
[2020-05-27 17:26:08] [INFO ] Deduced a trap composed of 7 places in 161 ms
[2020-05-27 17:26:09] [INFO ] Deduced a trap composed of 6 places in 158 ms
[2020-05-27 17:26:09] [INFO ] Deduced a trap composed of 6 places in 143 ms
[2020-05-27 17:26:09] [INFO ] Deduced a trap composed of 6 places in 189 ms
[2020-05-27 17:26:09] [INFO ] Deduced a trap composed of 5 places in 161 ms
[2020-05-27 17:26:09] [INFO ] Deduced a trap composed of 6 places in 131 ms
[2020-05-27 17:26:10] [INFO ] Deduced a trap composed of 4 places in 166 ms
[2020-05-27 17:26:10] [INFO ] Deduced a trap composed of 6 places in 163 ms
[2020-05-27 17:26:10] [INFO ] Deduced a trap composed of 9 places in 150 ms
[2020-05-27 17:26:10] [INFO ] Deduced a trap composed of 11 places in 126 ms
[2020-05-27 17:26:10] [INFO ] Deduced a trap composed of 6 places in 133 ms
[2020-05-27 17:26:10] [INFO ] Deduced a trap composed of 5 places in 130 ms
[2020-05-27 17:26:11] [INFO ] Deduced a trap composed of 8 places in 122 ms
[2020-05-27 17:26:11] [INFO ] Deduced a trap composed of 6 places in 109 ms
[2020-05-27 17:26:11] [INFO ] Deduced a trap composed of 6 places in 107 ms
[2020-05-27 17:26:11] [INFO ] Deduced a trap composed of 9 places in 135 ms
[2020-05-27 17:26:11] [INFO ] Deduced a trap composed of 5 places in 140 ms
[2020-05-27 17:26:11] [INFO ] Deduced a trap composed of 6 places in 151 ms
[2020-05-27 17:26:12] [INFO ] Deduced a trap composed of 6 places in 166 ms
[2020-05-27 17:26:12] [INFO ] Deduced a trap composed of 6 places in 116 ms
[2020-05-27 17:26:12] [INFO ] Deduced a trap composed of 6 places in 121 ms
[2020-05-27 17:26:12] [INFO ] Deduced a trap composed of 5 places in 107 ms
[2020-05-27 17:26:12] [INFO ] Trap strengthening (SAT) tested/added 54/53 trap constraints in 11074 ms
[2020-05-27 17:26:12] [INFO ] Computed and/alt/rep : 791/2514/791 causal constraints in 51 ms.
[2020-05-27 17:26:32] [INFO ] Added : 704 causal constraints over 145 iterations in 20333 ms.(timeout) Result :sat
[2020-05-27 17:26:33] [INFO ] Deduced a trap composed of 17 places in 175 ms
[2020-05-27 17:26:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
Attempting to minimize the solution found.
Minimization took 90 ms.
[2020-05-27 17:26:33] [INFO ] [Real]Absence check using 315 positive place invariants in 200 ms returned sat
[2020-05-27 17:26:33] [INFO ] [Real]Absence check using 315 positive and 16 generalized place invariants in 10 ms returned sat
[2020-05-27 17:26:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 17:26:35] [INFO ] [Real]Absence check using state equation in 2066 ms returned sat
[2020-05-27 17:26:35] [INFO ] [Real]Added 2 Read/Feed constraints in 15 ms returned sat
[2020-05-27 17:26:36] [INFO ] Deduced a trap composed of 5 places in 338 ms
[2020-05-27 17:26:36] [INFO ] Deduced a trap composed of 4 places in 303 ms
[2020-05-27 17:26:37] [INFO ] Deduced a trap composed of 8 places in 342 ms
[2020-05-27 17:26:37] [INFO ] Deduced a trap composed of 12 places in 318 ms
[2020-05-27 17:26:37] [INFO ] Deduced a trap composed of 5 places in 294 ms
[2020-05-27 17:26:38] [INFO ] Deduced a trap composed of 5 places in 410 ms
[2020-05-27 17:26:38] [INFO ] Deduced a trap composed of 6 places in 350 ms
[2020-05-27 17:26:38] [INFO ] Deduced a trap composed of 6 places in 253 ms
[2020-05-27 17:26:39] [INFO ] Deduced a trap composed of 6 places in 214 ms
[2020-05-27 17:26:39] [INFO ] Deduced a trap composed of 8 places in 190 ms
[2020-05-27 17:26:39] [INFO ] Deduced a trap composed of 6 places in 203 ms
[2020-05-27 17:26:39] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-05-27 17:26:40] [INFO ] Deduced a trap composed of 6 places in 195 ms
[2020-05-27 17:26:40] [INFO ] Deduced a trap composed of 7 places in 176 ms
[2020-05-27 17:26:40] [INFO ] Deduced a trap composed of 5 places in 224 ms
[2020-05-27 17:26:40] [INFO ] Deduced a trap composed of 6 places in 171 ms
[2020-05-27 17:26:40] [INFO ] Deduced a trap composed of 6 places in 212 ms
[2020-05-27 17:26:41] [INFO ] Deduced a trap composed of 5 places in 197 ms
[2020-05-27 17:26:41] [INFO ] Deduced a trap composed of 11 places in 190 ms
[2020-05-27 17:26:41] [INFO ] Deduced a trap composed of 6 places in 172 ms
[2020-05-27 17:26:41] [INFO ] Deduced a trap composed of 6 places in 158 ms
[2020-05-27 17:26:42] [INFO ] Deduced a trap composed of 6 places in 160 ms
[2020-05-27 17:26:42] [INFO ] Deduced a trap composed of 9 places in 197 ms
[2020-05-27 17:26:42] [INFO ] Deduced a trap composed of 12 places in 163 ms
[2020-05-27 17:26:42] [INFO ] Deduced a trap composed of 6 places in 172 ms
[2020-05-27 17:26:42] [INFO ] Deduced a trap composed of 5 places in 155 ms
[2020-05-27 17:26:42] [INFO ] Deduced a trap composed of 11 places in 148 ms
[2020-05-27 17:26:43] [INFO ] Deduced a trap composed of 11 places in 138 ms
[2020-05-27 17:26:43] [INFO ] Deduced a trap composed of 12 places in 163 ms
[2020-05-27 17:26:43] [INFO ] Deduced a trap composed of 6 places in 126 ms
[2020-05-27 17:26:43] [INFO ] Deduced a trap composed of 6 places in 168 ms
[2020-05-27 17:26:43] [INFO ] Deduced a trap composed of 9 places in 131 ms
[2020-05-27 17:26:44] [INFO ] Deduced a trap composed of 9 places in 162 ms
[2020-05-27 17:26:44] [INFO ] Deduced a trap composed of 8 places in 125 ms
[2020-05-27 17:26:44] [INFO ] Deduced a trap composed of 15 places in 132 ms
[2020-05-27 17:26:44] [INFO ] Deduced a trap composed of 12 places in 126 ms
[2020-05-27 17:26:44] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 8587 ms
[2020-05-27 17:26:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 17:26:44] [INFO ] [Nat]Absence check using 315 positive place invariants in 150 ms returned sat
[2020-05-27 17:26:44] [INFO ] [Nat]Absence check using 315 positive and 16 generalized place invariants in 8 ms returned sat
[2020-05-27 17:26:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 17:26:46] [INFO ] [Nat]Absence check using state equation in 1731 ms returned sat
[2020-05-27 17:26:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 23 ms returned sat
[2020-05-27 17:26:47] [INFO ] Deduced a trap composed of 4 places in 323 ms
[2020-05-27 17:26:47] [INFO ] Deduced a trap composed of 6 places in 322 ms
[2020-05-27 17:26:47] [INFO ] Deduced a trap composed of 6 places in 299 ms
[2020-05-27 17:26:48] [INFO ] Deduced a trap composed of 4 places in 288 ms
[2020-05-27 17:26:48] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-05-27 17:26:48] [INFO ] Deduced a trap composed of 5 places in 283 ms
[2020-05-27 17:26:48] [INFO ] Deduced a trap composed of 6 places in 233 ms
[2020-05-27 17:26:49] [INFO ] Deduced a trap composed of 6 places in 242 ms
[2020-05-27 17:26:49] [INFO ] Deduced a trap composed of 5 places in 222 ms
[2020-05-27 17:26:49] [INFO ] Deduced a trap composed of 4 places in 296 ms
[2020-05-27 17:26:50] [INFO ] Deduced a trap composed of 6 places in 223 ms
[2020-05-27 17:26:50] [INFO ] Deduced a trap composed of 6 places in 218 ms
[2020-05-27 17:26:50] [INFO ] Deduced a trap composed of 5 places in 201 ms
[2020-05-27 17:26:50] [INFO ] Deduced a trap composed of 8 places in 303 ms
[2020-05-27 17:26:51] [INFO ] Deduced a trap composed of 5 places in 250 ms
[2020-05-27 17:26:51] [INFO ] Deduced a trap composed of 6 places in 241 ms
[2020-05-27 17:26:51] [INFO ] Deduced a trap composed of 6 places in 231 ms
[2020-05-27 17:26:51] [INFO ] Deduced a trap composed of 6 places in 216 ms
[2020-05-27 17:26:52] [INFO ] Deduced a trap composed of 5 places in 230 ms
[2020-05-27 17:26:52] [INFO ] Deduced a trap composed of 6 places in 236 ms
[2020-05-27 17:26:52] [INFO ] Deduced a trap composed of 6 places in 259 ms
[2020-05-27 17:26:53] [INFO ] Deduced a trap composed of 6 places in 267 ms
[2020-05-27 17:26:53] [INFO ] Deduced a trap composed of 4 places in 259 ms
[2020-05-27 17:26:53] [INFO ] Deduced a trap composed of 6 places in 240 ms
[2020-05-27 17:26:53] [INFO ] Deduced a trap composed of 4 places in 216 ms
[2020-05-27 17:26:54] [INFO ] Deduced a trap composed of 5 places in 244 ms
[2020-05-27 17:26:54] [INFO ] Deduced a trap composed of 4 places in 213 ms
[2020-05-27 17:26:54] [INFO ] Deduced a trap composed of 6 places in 200 ms
[2020-05-27 17:26:54] [INFO ] Deduced a trap composed of 5 places in 209 ms
[2020-05-27 17:26:55] [INFO ] Deduced a trap composed of 4 places in 237 ms
[2020-05-27 17:26:55] [INFO ] Deduced a trap composed of 9 places in 196 ms
[2020-05-27 17:26:55] [INFO ] Deduced a trap composed of 6 places in 222 ms
[2020-05-27 17:26:55] [INFO ] Deduced a trap composed of 4 places in 192 ms
[2020-05-27 17:26:56] [INFO ] Deduced a trap composed of 8 places in 184 ms
[2020-05-27 17:26:56] [INFO ] Deduced a trap composed of 7 places in 197 ms
[2020-05-27 17:26:56] [INFO ] Deduced a trap composed of 5 places in 203 ms
[2020-05-27 17:26:56] [INFO ] Deduced a trap composed of 6 places in 170 ms
[2020-05-27 17:26:57] [INFO ] Deduced a trap composed of 6 places in 164 ms
[2020-05-27 17:26:57] [INFO ] Deduced a trap composed of 6 places in 182 ms
[2020-05-27 17:26:57] [INFO ] Deduced a trap composed of 19 places in 170 ms
[2020-05-27 17:26:57] [INFO ] Deduced a trap composed of 8 places in 142 ms
[2020-05-27 17:26:57] [INFO ] Deduced a trap composed of 8 places in 153 ms
[2020-05-27 17:26:58] [INFO ] Deduced a trap composed of 9 places in 163 ms
[2020-05-27 17:26:58] [INFO ] Deduced a trap composed of 4 places in 167 ms
[2020-05-27 17:26:58] [INFO ] Deduced a trap composed of 9 places in 163 ms
[2020-05-27 17:26:58] [INFO ] Deduced a trap composed of 6 places in 167 ms
[2020-05-27 17:26:58] [INFO ] Deduced a trap composed of 6 places in 147 ms
[2020-05-27 17:26:59] [INFO ] Deduced a trap composed of 5 places in 166 ms
[2020-05-27 17:26:59] [INFO ] Deduced a trap composed of 5 places in 186 ms
[2020-05-27 17:26:59] [INFO ] Deduced a trap composed of 9 places in 156 ms
[2020-05-27 17:26:59] [INFO ] Deduced a trap composed of 6 places in 164 ms
[2020-05-27 17:27:00] [INFO ] Deduced a trap composed of 8 places in 206 ms
[2020-05-27 17:27:00] [INFO ] Deduced a trap composed of 8 places in 160 ms
[2020-05-27 17:27:00] [INFO ] Deduced a trap composed of 7 places in 133 ms
[2020-05-27 17:27:00] [INFO ] Deduced a trap composed of 8 places in 164 ms
[2020-05-27 17:27:00] [INFO ] Deduced a trap composed of 6 places in 137 ms
[2020-05-27 17:27:01] [INFO ] Deduced a trap composed of 6 places in 162 ms
[2020-05-27 17:27:01] [INFO ] Trap strengthening (SAT) tested/added 58/57 trap constraints in 14469 ms
[2020-05-27 17:27:01] [INFO ] Computed and/alt/rep : 791/2514/791 causal constraints in 56 ms.
[2020-05-27 17:27:24] [INFO ] Added : 725 causal constraints over 145 iterations in 22984 ms.(timeout) Result :sat
[2020-05-27 17:27:24] [INFO ] Deduced a trap composed of 17 places in 107 ms
[2020-05-27 17:27:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
Attempting to minimize the solution found.
Minimization took 78 ms.
[2020-05-27 17:27:25] [INFO ] Flatten gal took : 155 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 17:27:25] [INFO ] Applying decomposition
[2020-05-27 17:27:25] [INFO ] Flatten gal took : 236 ms
[2020-05-27 17:27:25] [INFO ] Input system was already deterministic with 801 transitions.
[2020-05-27 17:27:25] [INFO ] Flatten gal took : 200 ms
[2020-05-27 17:27:25] [INFO ] Input system was already deterministic with 801 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/graph2246729346113723968.txt, -o, /tmp/graph2246729346113723968.bin, -w, /tmp/graph2246729346113723968.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/graph2246729346113723968.bin, -l, -1, -v, -w, /tmp/graph2246729346113723968.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 17:27:25] [INFO ] Decomposing Gal with order
[2020-05-27 17:27:25] [INFO ] Ran tautology test, simplified 0 / 3 in 482 ms.
[2020-05-27 17:27:25] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 801 rows 951 cols
[2020-05-27 17:27:25] [INFO ] Computed 331 place invariants in 7 ms
inv : p1451 + p1456 + p1457 = 1
inv : p971 + p972 + p1003 + p1005 + p1007 + p1009 = 1
inv : p1515 + p1517 = 1
inv : p1482 + p1484 = 1
inv : p1525 + p1530 + p1531 = 1
inv : p728 + p731 + p732 = 1
inv : p1049 + p1054 + p1055 = 1
inv : p558 + p561 + p563 + p565 = 1
inv : p2008 + p2012 + p2014 = 1
inv : p1920 + p1925 + p1926 = 1
inv : p1853 + p1856 + p1857 = 1
inv : p357 + p360 + p362 + p364 = 1
inv : p1271 + p1273 + p1275 + p1277 = 1
inv : p156 + p159 + p161 + p163 = 1
inv : p1683 + p1685 = 1
inv : p326 + p331 + p332 = 1
inv : p477 + p479 = 1
inv : p1063 + p1068 + p1069 = 1
inv : p1577 + p1578 + p1585 + p1588 + p1589 = 1
inv : p1362 + p1365 + p1367 + p1369 = 1
inv : p1532 + p1537 + p1538 = 1
inv : p1197 + p1200 + p1201 = 1
inv : p1884 + p1886 = 1
inv : p319 + p324 + p325 = 1
inv : p1257 + p1260 + p1261 = 1
inv : p1577 + p1578 + p1592 + p1595 + p1596 = 1
inv : p1793 + p1796 + p1797 = 1
inv : p1317 + p1322 + p1323 = 1
inv : p795 + p798 + p799 = 1
inv : p788 + p791 + p792 = 1
inv : p1786 + p1789 + p1790 = 1
inv : p1821 + p1823 + p1825 + p1827 = 1
inv : p504 + p505 + p513 + p518 + p519 = 1
inv : p1180 + p1182 = 1
inv : p946 + p948 = 1
inv : p2006 + p2007 = 1
inv : p259 + p261 + p264 + p265 = 1
inv : p1934 + p1939 + p1940 = 1
inv : p504 + p505 + p527 + p530 + p531 = 1
inv : p1994 + p1999 + p2000 = 1
inv : p1384 + p1389 + p1390 = 1
inv : p1190 + p1193 + p1194 = 1
inv : p504 + p505 + p534 + p536 + p538 + p540 = 1
inv : p1577 + p1578 + p1582 + p1584 = 1
inv : p1465 + p1470 + p1471 = 1
inv : p816 + p818 + p820 + p822 = 1
inv : p1056 + p1061 + p1062 = 1
inv : p58 + p60 + p63 + p64 = 1
inv : p971 + p972 + p996 + p1001 + p1002 = 1
inv : p788 + p793 + p794 = 1
inv : p1331 + p1336 + p1337 = 1
inv : p481 + p483 + p485 + p487 = 1
inv : p778 + p780 = 1
inv : p1352 + p1354 + p1356 + p1358 = 1
inv : -p1461 - p1462 + p1463 + p1464 = 0
inv : p714 + p719 + p720 = 1
inv : p1398 + p1401 + p1402 = 1
inv : p1729 + p1730 - p1731 - p1732 = 0
inv : p668 + p670 + p672 + p674 = 1
inv : p1257 + p1262 + p1263 = 1
inv : p453 + p458 + p459 = 1
inv : p1577 + p1578 + p1599 + p1602 + p1603 = 1
inv : p1264 + p1269 + p1270 = 1
inv : p1250 + p1253 + p1254 = 1
inv : p1783 + p1785 = 1
inv : p1465 + p1468 + p1469 = 1
inv : p971 + p972 + p989 + p992 + p993 = 1
inv : -p121 - p122 + p123 + p124 = 0
inv : p1391 + p1394 + p1395 = 1
inv : p178 + p181 + p182 = 1
inv : p714 + p717 + p718 = 1
inv : p1398 + p1403 + p1404 = 1
inv : p504 + p505 + p527 + p532 + p533 = 1
inv : p1733 + p1736 + p1737 = 1
inv : p379 + p384 + p385 = 1
inv : p504 + p505 + p520 + p523 + p524 = 1
inv : p1183 + p1186 + p1187 = 1
inv : -p523 - p524 + p525 + p526 = 0
inv : p936 + p938 + p940 + p942 = 1
inv : p1056 + p1059 + p1060 = 1
inv : p1348 + p1350 = 1
inv : p1917 + p1919 = 1
inv : p1080 + p1082 = 1
inv : p1105 + p1107 + p1130 + p1135 + p1136 = 1
inv : p252 + p255 + p256 = 1
inv : p737 + p739 + p741 + p743 = 1
inv : p1532 + p1535 + p1536 = 1
inv : p661 + p664 + p665 = 1
inv : p1518 + p1523 + p1524 = 1
inv : p343 + p345 = 1
inv : p1190 + p1195 + p1196 = 1
inv : p326 + p329 + p330 = 1
inv : p1324 + p1327 + p1328 = 1
inv : p467 + p469 + p471 + p473 = 1
inv : p111 + p114 + p115 = 1
inv : p312 + p317 + p318 = 1
inv : p504 + p505 + p544 + p546 = 1
inv : p781 + p784 + p785 = 1
inv : p1786 + p1791 + p1792 = 1
inv : p826 + p829 + p831 + p833 = 1
inv : p1800 + p1803 + p1804 = 1
inv : -p925 - p926 + p927 + p928 = 0
inv : p594 + p597 + p598 = 1
inv : p601 + p603 + p605 + p607 = 1
inv : p58 + p60 + p61 + p62 = 1
inv : p1850 + p1852 = 1
inv : p1518 + p1521 + p1522 = 1
inv : p400 + p402 + p404 + p406 = 1
inv : p125 + p128 + p129 = 1
inv : p1793 + p1798 + p1799 = 1
inv : p1228 + p1231 + p1233 + p1235 = 1
inv : p971 + p972 + p1017 + p1019 + p1021 + p1023 = 1
inv : p199 + p201 + p203 + p205 = 1
inv : p1577 + p1578 + p1585 + p1590 + p1591 = 1
inv : p319 + p322 + p323 = 1
inv : p1698 + p1700 + p1702 + p1704 + p1706 = 1
inv : p1955 + p1957 + p1959 + p1961 = 1
inv : p2004 + p2005 = 1
inv : p312 + p315 + p316 = 1
inv : p1920 + p1923 + p1924 = 1
inv : p1314 + p1316 = 1
inv : p108 + p110 = 1
inv : p259 + p261 + p262 + p263 = 1
inv : p1853 + p1858 + p1859 = 1
inv : p1807 + p1809 + p1811 + p1813 = 1
inv : p971 + p972 + p982 + p983 + p987 + p988 = 1
inv : p1800 + p1805 + p1806 = 1
inv : p1281 + p1283 = 1
inv : p118 + p121 + p122 = 1
inv : p1525 + p1528 + p1529 = 1
inv : p840 + p841 + p869 + p871 + p873 + p875 = 1
inv : p1994 + p1997 + p1998 = 1
inv : p1197 + p1202 + p1203 = 1
inv : p929 + p934 + p935 = 1
inv : p142 + p144 = 1
inv : p654 + p657 + p658 = 1
inv : p79 + p81 + p83 + p85 = 1
inv : p1577 + p1578 + p1599 + p1604 + p1605 = 1
inv : p1381 + p1383 = 1
inv : p280 + p282 + p284 + p286 = 1
inv : p1049 + p1052 + p1053 = 1
inv : p1553 + p1555 + p1557 + p1559 = 1
inv : p347 + p349 + p351 + p353 = 1
inv : p840 + p841 + p845 + p847 = 1
inv : p504 + p548 + p550 + p552 + p554 = 1
inv : p460 + p463 + p464 = 1
inv : p41 + p43 = 1
inv : -p724 - p725 + p726 + p727 = 0
inv : p1405 + p1407 + p1409 + p1411 = 1
inv : p1817 + p1819 = 1
inv : p1888 + p1890 + p1892 + p1894 = 1
inv : p333 + p335 + p337 + p339 = 1
inv : p1295 + p1298 + p1300 + p1302 = 1
inv : p410 + p412 = 1
inv : p1649 + p1651 = 1
inv : p178 + p183 + p184 = 1
inv : p1687 + p1689 + p1691 + p1693 = 1
inv : p132 + p134 + p136 + p138 = 1
inv : p146 + p148 + p150 + p152 = 1
inv : p1486 + p1488 + p1490 + p1492 = 1
inv : p1105 + p1107 + p1130 + p1133 + p1134 = 1
inv : p1105 + p1161 + p1164 + p1166 + p1168 = 1
inv : p1214 + p1216 = 1
inv : p460 + p465 + p466 = 1
inv : p781 + p786 + p787 = 1
inv : p647 + p650 + p651 = 1
inv : p1750 + p1752 = 1
inv : -p657 - p658 + p659 + p660 = 0
inv : p840 + p841 + p862 + p865 + p866 = 1
inv : p1331 + p1334 + p1335 = 1
inv : p1666 + p1669 + p1670 = 1
inv : p504 + p505 + p510 + p512 = 1
inv : p1740 + p1742 + p1744 + p1746 = 1
inv : p175 + p177 = 1
inv : p915 + p918 + p919 = 1
inv : p1867 + p1868 + p1870 + p1871 = 1
inv : p728 + p733 + p734 = 1
inv : p1754 + p1756 + p1758 + p1760 = 1
inv : p453 + p456 + p457 = 1
inv : p971 + p972 + p979 + p981 = 1
inv : p1472 + p1474 + p1476 + p1478 = 1
inv : p721 + p724 + p725 = 1
inv : p1084 + p1086 + p1088 + p1090 = 1
inv : p1070 + p1072 + p1074 + p1076 = 1
inv : p2018 + p2020 = 1
inv : p1384 + p1387 + p1388 = 1
inv : p276 + p278 = 1
inv : p1874 + p1876 + p1878 + p1880 = 1
inv : p1673 + p1675 + p1677 + p1679 = 1
inv : p1250 + p1255 + p1256 = 1
inv : -p992 - p993 + p994 + p995 = 0
inv : p840 + p841 + p848 + p853 + p854 = 1
inv : p912 + p914 = 1
inv : p1419 + p1421 + p1423 + p1425 = 1
inv : p1652 + p1657 + p1658 = 1
inv : p213 + p215 + p217 + p219 = 1
inv : p1867 + p1868 + p1872 + p1873 = 1
inv : p414 + p416 + p418 + p420 = 1
inv : -p1394 - p1395 + p1396 + p1397 = 0
inv : p1951 + p1953 = 1
inv : p615 + p617 + p619 + p621 = 1
inv : -p1595 - p1596 + p1597 + p1598 = 0
inv : p858 + p859 - p860 - p861 = 0
inv : p125 + p130 + p131 = 1
inv : p1046 + p1048 = 1
inv : -p188 - p189 + p190 + p191 = 0
inv : p2032 + p2035 + p2037 + p2039 = 1
inv : p678 + p680 + p681 = 1
inv : -p590 - p591 + p592 + p593 = 0
inv : p929 + p932 + p933 = 1
inv : p711 + p713 = 1
inv : p1620 + p1622 + p1624 + p1626 = 1
inv : -p389 - p390 + p391 + p392 = 0
inv : p1539 + p1541 + p1543 + p1545 = 1
inv : p1105 + p1107 + p1116 + p1119 + p1120 = 1
inv : p759 + p762 + p764 + p766 = 1
inv : p594 + p599 + p600 = 1
inv : p192 + p197 + p198 = 1
inv : p840 + p879 + p881 = 1
inv : p1941 + p1943 + p1945 + p1947 = 1
inv : p960 + p963 + p965 + p967 = 1
inv : p266 + p268 + p270 + p272 = 1
inv : p65 + p67 + p69 + p71 = 1
inv : p1716 + p1718 = 1
inv : p111 + p116 + p117 = 1
inv : p1659 + p1664 + p1665 = 1
inv : p840 + p841 + p855 + p860 + p861 = 1
inv : p1984 + p1986 = 1
inv : p1767 + p1769 + p1771 + p1773 = 1
inv : p1415 + p1417 = 1
inv : p1218 + p1220 + p1222 + p1224 = 1
inv : p661 + p666 + p667 = 1
inv : p922 + p925 + p926 = 1
inv : p971 + p972 + p982 + p983 + p985 + p986 = 1
inv : p242 + p244 = 1
inv : p1105 + p1107 + p1137 + p1139 + p1141 + p1143 + p1144 + p1145 = 1
inv : p75 + p77 = 1
inv : p971 + p972 + p1027 + p1030 + p1032 + p1034 = 1
inv : p971 + p972 + p1013 + p1015 = 1
inv : p30 + p32 = 1
inv : p580 + p585 + p586 = 1
inv : p647 + p652 + p653 = 1
inv : p443 + p445 = 1
inv : p446 + p449 + p450 = 1
inv : p682 + p684 + p686 + p688 = 1
inv : p1429 + p1432 + p1434 + p1436 = 1
inv : p883 + p885 + p887 + p889 = 1
inv : p915 + p920 + p921 = 1
inv : p1630 + p1633 + p1635 + p1637 = 1
inv : p1105 + p1107 + p1147 + p1149 = 1
inv : p749 + p751 + p753 + p755 = 1
inv : p44 + p45 + p47 + p48 = 1
inv : p1659 + p1662 + p1663 = 1
inv : p1666 + p1671 + p1672 = 1
inv : p1549 + p1551 = 1
inv : p840 + p841 + p862 + p867 + p868 = 1
inv : p1105 + p1107 + p1123 + p1126 + p1127 = 1
inv : p1105 + p1107 + p1113 + p1115 = 1
inv : p1338 + p1340 + p1342 + p1344 = 1
inv : p209 + p211 = 1
inv : p1247 + p1249 = 1
inv : -p1930 - p1931 + p1932 + p1933 = 0
inv : p1448 + p1450 = 1
inv : p1987 + p1990 + p1991 = 1
inv : p1860 + p1865 + p1866 = 1
inv : p1105 + p1107 + p1116 + p1121 + p1122 = 1
inv : p1285 + p1287 + p1289 + p1291 = 1
inv : p950 + p952 + p954 + p956 = 1
inv : p192 + p195 + p196 = 1
inv : p577 + p579 = 1
inv : p587 + p590 + p591 = 1
inv : p1898 + p1901 + p1903 + p1905 = 1
inv : p893 + p896 + p898 + p900 = 1
inv : p802 + p804 + p806 + p808 = 1
inv : p1577 + p1578 + p1606 + p1608 + p1610 + p1612 = 1
inv : p1105 + p1107 + p1123 + p1128 + p1129 = 1
inv : p393 + p396 + p397 = 1
inv : p491 + p494 + p496 + p498 = 1
inv : p1719 + p1724 + p1725 = 1
inv : p1577 + p1616 + p1618 = 1
inv : p379 + p382 + p383 = 1
inv : p1094 + p1097 + p1099 + p1101 = 1
inv : -p1990 - p1991 + p1992 + p1993 = 0
inv : p2022 + p2024 + p2026 + p2028 = 1
inv : p1733 + p1738 + p1739 = 1
inv : p812 + p814 = 1
inv : p1496 + p1499 + p1501 + p1503 = 1
inv : p376 + p378 = 1
inv : p51 + p54 + p55 = 1
inv : p446 + p451 + p452 = 1
inv : p185 + p188 + p189 = 1
inv : p840 + p841 + p848 + p851 + p852 = 1
inv : p1652 + p1655 + p1656 = 1
inv : p1927 + p1930 + p1931 = 1
inv : p245 + p248 + p249 = 1
inv : p252 + p257 + p258 = 1
inv : p89 + p92 + p94 + p96 + p97 = 1
inv : p1105 + p1107 + p1151 + p1153 + p1155 + p1157 = 1
inv : p1458 + p1461 + p1462 = 1
inv : p625 + p628 + p630 + p632 = 1
inv : p290 + p293 + p295 + p297 + p298 = 1
inv : p1204 + p1206 + p1208 + p1210 = 1
inv : p424 + p427 + p429 + p431 = 1
inv : p44 + p45 + p49 + p50 = 1
inv : p51 + p56 + p57 = 1
inv : p1317 + p1320 + p1321 = 1
inv : p1831 + p1834 + p1836 + p1838 = 1
inv : p795 + p800 + p801 = 1
inv : p1324 + p1329 + p1330 = 1
inv : p245 + p250 + p251 = 1
inv : p611 + p613 = 1
inv : p1934 + p1937 + p1938 = 1
inv : p223 + p226 + p228 + p230 = 1
inv : p644 + p646 = 1
inv : p1183 + p1188 + p1189 = 1
inv : p393 + p398 + p399 = 1
inv : p309 + p311 = 1
inv : p1563 + p1566 + p1568 + p1570 = 1
inv : p1726 + p1731 + p1732 = 1
inv : p580 + p583 + p584 = 1
inv : p1719 + p1722 + p1723 = 1
inv : p692 + p695 + p697 + p699 = 1
inv : p1451 + p1454 + p1455 = 1
inv : p971 + p972 + p996 + p999 + p1000 = 1
inv : p1063 + p1066 + p1067 = 1
inv : p1968 + p1970 + p1972 + p1974 = 1
inv : p504 + p505 + p513 + p516 + p517 = 1
inv : p386 + p389 + p390 = 1
inv : p1860 + p1863 + p1864 = 1
inv : p1264 + p1267 + p1268 = 1
inv : p745 + p747 = 1
Total of 331 invariants.
[2020-05-27 17:27:26] [INFO ] Computed 331 place invariants in 61 ms
[2020-05-27 17:27:26] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-02(UNSAT) depth K=0 took 39 ms
[2020-05-27 17:27:26] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-03(UNSAT) depth K=0 took 8 ms
[2020-05-27 17:27:26] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-04(UNSAT) depth K=0 took 18 ms
[2020-05-27 17:27:26] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-02(UNSAT) depth K=1 took 26 ms
[2020-05-27 17:27:26] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-03(UNSAT) depth K=1 took 3 ms
[2020-05-27 17:27:26] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-04(UNSAT) depth K=1 took 13 ms
[2020-05-27 17:27:26] [INFO ] Removed a total of 408 redundant transitions.
[2020-05-27 17:27:26] [INFO ] Flatten gal took : 235 ms
[2020-05-27 17:27:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 752 labels/synchronizations in 65 ms.
[2020-05-27 17:27:26] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 34 ms
[2020-05-27 17:27:26] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 1 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
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 801 rows 951 cols
[2020-05-27 17:27:26] [INFO ] Computed 331 place invariants in 6 ms
inv : p1451 + p1456 + p1457 = 1
inv : p971 + p972 + p1003 + p1005 + p1007 + p1009 = 1
inv : p1515 + p1517 = 1
inv : p1482 + p1484 = 1
inv : p1525 + p1530 + p1531 = 1
inv : p728 + p731 + p732 = 1
inv : p1049 + p1054 + p1055 = 1
inv : p558 + p561 + p563 + p565 = 1
inv : p2008 + p2012 + p2014 = 1
inv : p1920 + p1925 + p1926 = 1
inv : p1853 + p1856 + p1857 = 1
inv : p357 + p360 + p362 + p364 = 1
inv : p1271 + p1273 + p1275 + p1277 = 1
inv : p156 + p159 + p161 + p163 = 1
inv : p1683 + p1685 = 1
inv : p326 + p331 + p332 = 1
inv : p477 + p479 = 1
inv : p1063 + p1068 + p1069 = 1
inv : p1577 + p1578 + p1585 + p1588 + p1589 = 1
inv : p1362 + p1365 + p1367 + p1369 = 1
inv : p1532 + p1537 + p1538 = 1
inv : p1197 + p1200 + p1201 = 1
inv : p1884 + p1886 = 1
inv : p319 + p324 + p325 = 1
inv : p1257 + p1260 + p1261 = 1
inv : p1577 + p1578 + p1592 + p1595 + p1596 = 1
inv : p1793 + p1796 + p1797 = 1
inv : p1317 + p1322 + p1323 = 1
inv : p795 + p798 + p799 = 1
inv : p788 + p791 + p792 = 1
inv : p1786 + p1789 + p1790 = 1
inv : p1821 + p1823 + p1825 + p1827 = 1
inv : p504 + p505 + p513 + p518 + p519 = 1
inv : p1180 + p1182 = 1
inv : p946 + p948 = 1
inv : p2006 + p2007 = 1
inv : p259 + p261 + p264 + p265 = 1
inv : p1934 + p1939 + p1940 = 1
inv : p504 + p505 + p527 + p530 + p531 = 1
inv : p1994 + p1999 + p2000 = 1
inv : p1384 + p1389 + p1390 = 1
inv : p1190 + p1193 + p1194 = 1
inv : p504 + p505 + p534 + p536 + p538 + p540 = 1
inv : p1577 + p1578 + p1582 + p1584 = 1
inv : p1465 + p1470 + p1471 = 1
inv : p816 + p818 + p820 + p822 = 1
inv : p1056 + p1061 + p1062 = 1
inv : p58 + p60 + p63 + p64 = 1
inv : p971 + p972 + p996 + p1001 + p1002 = 1
inv : p788 + p793 + p794 = 1
inv : p1331 + p1336 + p1337 = 1
inv : p481 + p483 + p485 + p487 = 1
inv : p778 + p780 = 1
inv : p1352 + p1354 + p1356 + p1358 = 1
inv : -p1461 - p1462 + p1463 + p1464 = 0
inv : p714 + p719 + p720 = 1
inv : p1398 + p1401 + p1402 = 1
inv : p1729 + p1730 - p1731 - p1732 = 0
inv : p668 + p670 + p672 + p674 = 1
inv : p1257 + p1262 + p1263 = 1
inv : p453 + p458 + p459 = 1
inv : p1577 + p1578 + p1599 + p1602 + p1603 = 1
inv : p1264 + p1269 + p1270 = 1
inv : p1250 + p1253 + p1254 = 1
inv : p1783 + p1785 = 1
inv : p1465 + p1468 + p1469 = 1
inv : p971 + p972 + p989 + p992 + p993 = 1
inv : -p121 - p122 + p123 + p124 = 0
inv : p1391 + p1394 + p1395 = 1
inv : p178 + p181 + p182 = 1
inv : p714 + p717 + p718 = 1
inv : p1398 + p1403 + p1404 = 1
inv : p504 + p505 + p527 + p532 + p533 = 1
inv : p1733 + p1736 + p1737 = 1
inv : p379 + p384 + p385 = 1
inv : p504 + p505 + p520 + p523 + p524 = 1
inv : p1183 + p1186 + p1187 = 1
inv : -p523 - p524 + p525 + p526 = 0
inv : p936 + p938 + p940 + p942 = 1
inv : p1056 + p1059 + p1060 = 1
inv : p1348 + p1350 = 1
inv : p1917 + p1919 = 1
inv : p1080 + p1082 = 1
inv : p1105 + p1107 + p1130 + p1135 + p1136 = 1
inv : p252 + p255 + p256 = 1
inv : p737 + p739 + p741 + p743 = 1
inv : p1532 + p1535 + p1536 = 1
inv : p661 + p664 + p665 = 1
inv : p1518 + p1523 + p1524 = 1
inv : p343 + p345 = 1
inv : p1190 + p1195 + p1196 = 1
inv : p326 + p329 + p330 = 1
inv : p1324 + p1327 + p1328 = 1
inv : p467 + p469 + p471 + p473 = 1
inv : p111 + p114 + p115 = 1
inv : p312 + p317 + p318 = 1
inv : p504 + p505 + p544 + p546 = 1
inv : p781 + p784 + p785 = 1
inv : p1786 + p1791 + p1792 = 1
inv : p826 + p829 + p831 + p833 = 1
inv : p1800 + p1803 + p1804 = 1
inv : -p925 - p926 + p927 + p928 = 0
inv : p594 + p597 + p598 = 1
inv : p601 + p603 + p605 + p607 = 1
inv : p58 + p60 + p61 + p62 = 1
inv : p1850 + p1852 = 1
inv : p1518 + p1521 + p1522 = 1
inv : p400 + p402 + p404 + p406 = 1
inv : p125 + p128 + p129 = 1
inv : p1793 + p1798 + p1799 = 1
inv : p1228 + p1231 + p1233 + p1235 = 1
inv : p971 + p972 + p1017 + p1019 + p1021 + p1023 = 1
inv : p199 + p201 + p203 + p205 = 1
inv : p1577 + p1578 + p1585 + p1590 + p1591 = 1
inv : p319 + p322 + p323 = 1
inv : p1698 + p1700 + p1702 + p1704 + p1706 = 1
inv : p1955 + p1957 + p1959 + p1961 = 1
inv : p2004 + p2005 = 1
inv : p312 + p315 + p316 = 1
inv : p1920 + p1923 + p1924 = 1
inv : p1314 + p1316 = 1
inv : p108 + p110 = 1
inv : p259 + p261 + p262 + p263 = 1
inv : p1853 + p1858 + p1859 = 1
inv : p1807 + p1809 + p1811 + p1813 = 1
inv : p971 + p972 + p982 + p983 + p987 + p988 = 1
inv : p1800 + p1805 + p1806 = 1
inv : p1281 + p1283 = 1
inv : p118 + p121 + p122 = 1
inv : p1525 + p1528 + p1529 = 1
inv : p840 + p841 + p869 + p871 + p873 + p875 = 1
inv : p1994 + p1997 + p1998 = 1
inv : p1197 + p1202 + p1203 = 1
inv : p929 + p934 + p935 = 1
inv : p142 + p144 = 1
inv : p654 + p657 + p658 = 1
inv : p79 + p81 + p83 + p85 = 1
inv : p1577 + p1578 + p1599 + p1604 + p1605 = 1
inv : p1381 + p1383 = 1
inv : p280 + p282 + p284 + p286 = 1
inv : p1049 + p1052 + p1053 = 1
inv : p1553 + p1555 + p1557 + p1559 = 1
inv : p347 + p349 + p351 + p353 = 1
inv : p840 + p841 + p845 + p847 = 1
inv : p504 + p548 + p550 + p552 + p554 = 1
inv : p460 + p463 + p464 = 1
inv : p41 + p43 = 1
inv : -p724 - p725 + p726 + p727 = 0
inv : p1405 + p1407 + p1409 + p1411 = 1
inv : p1817 + p1819 = 1
inv : p1888 + p1890 + p1892 + p1894 = 1
inv : p333 + p335 + p337 + p339 = 1
inv : p1295 + p1298 + p1300 + p1302 = 1
inv : p410 + p412 = 1
inv : p1649 + p1651 = 1
inv : p178 + p183 + p184 = 1
inv : p1687 + p1689 + p1691 + p1693 = 1
inv : p132 + p134 + p136 + p138 = 1
inv : p146 + p148 + p150 + p152 = 1
inv : p1486 + p1488 + p1490 + p1492 = 1
inv : p1105 + p1107 + p1130 + p1133 + p1134 = 1
inv : p1105 + p1161 + p1164 + p1166 + p1168 = 1
inv : p1214 + p1216 = 1
inv : p460 + p465 + p466 = 1
inv : p781 + p786 + p787 = 1
inv : p647 + p650 + p651 = 1
inv : p1750 + p1752 = 1
inv : -p657 - p658 + p659 + p660 = 0
inv : p840 + p841 + p862 + p865 + p866 = 1
inv : p1331 + p1334 + p1335 = 1
inv : p1666 + p1669 + p1670 = 1
inv : p504 + p505 + p510 + p512 = 1
inv : p1740 + p1742 + p1744 + p1746 = 1
inv : p175 + p177 = 1
inv : p915 + p918 + p919 = 1
inv : p1867 + p1868 + p1870 + p1871 = 1
inv : p728 + p733 + p734 = 1
inv : p1754 + p1756 + p1758 + p1760 = 1
inv : p453 + p456 + p457 = 1
inv : p971 + p972 + p979 + p981 = 1
inv : p1472 + p1474 + p1476 + p1478 = 1
inv : p721 + p724 + p725 = 1
inv : p1084 + p1086 + p1088 + p1090 = 1
inv : p1070 + p1072 + p1074 + p1076 = 1
inv : p2018 + p2020 = 1
inv : p1384 + p1387 + p1388 = 1
inv : p276 + p278 = 1
inv : p1874 + p1876 + p1878 + p1880 = 1
inv : p1673 + p1675 + p1677 + p1679 = 1
inv : p1250 + p1255 + p1256 = 1
inv : -p992 - p993 + p994 + p995 = 0
inv : p840 + p841 + p848 + p853 + p854 = 1
inv : p912 + p914 = 1
inv : p1419 + p1421 + p1423 + p1425 = 1
inv : p1652 + p1657 + p1658 = 1
inv : p213 + p215 + p217 + p219 = 1
inv : p1867 + p1868 + p1872 + p1873 = 1
inv : p414 + p416 + p418 + p420 = 1
inv : -p1394 - p1395 + p1396 + p1397 = 0
inv : p1951 + p1953 = 1
inv : p615 + p617 + p619 + p621 = 1
inv : -p1595 - p1596 + p1597 + p1598 = 0
inv : p858 + p859 - p860 - p861 = 0
inv : p125 + p130 + p131 = 1
inv : p1046 + p1048 = 1
inv : -p188 - p189 + p190 + p191 = 0
inv : p2032 + p2035 + p2037 + p2039 = 1
inv : p678 + p680 + p681 = 1
inv : -p590 - p591 + p592 + p593 = 0
inv : p929 + p932 + p933 = 1
inv : p711 + p713 = 1
inv : p1620 + p1622 + p1624 + p1626 = 1
inv : -p389 - p390 + p391 + p392 = 0
inv : p1539 + p1541 + p1543 + p1545 = 1
inv : p1105 + p1107 + p1116 + p1119 + p1120 = 1
inv : p759 + p762 + p764 + p766 = 1
inv : p594 + p599 + p600 = 1
inv : p192 + p197 + p198 = 1
inv : p840 + p879 + p881 = 1
inv : p1941 + p1943 + p1945 + p1947 = 1
inv : p960 + p963 + p965 + p967 = 1
inv : p266 + p268 + p270 + p272 = 1
inv : p65 + p67 + p69 + p71 = 1
inv : p1716 + p1718 = 1
inv : p111 + p116 + p117 = 1
inv : p1659 + p1664 + p1665 = 1
inv : p840 + p841 + p855 + p860 + p861 = 1
inv : p1984 + p1986 = 1
inv : p1767 + p1769 + p1771 + p1773 = 1
inv : p1415 + p1417 = 1
inv : p1218 + p1220 + p1222 + p1224 = 1
inv : p661 + p666 + p667 = 1
inv : p922 + p925 + p926 = 1
inv : p971 + p972 + p982 + p983 + p985 + p986 = 1
inv : p242 + p244 = 1
inv : p1105 + p1107 + p1137 + p1139 + p1141 + p1143 + p1144 + p1145 = 1
inv : p75 + p77 = 1
inv : p971 + p972 + p1027 + p1030 + p1032 + p1034 = 1
inv : p971 + p972 + p1013 + p1015 = 1
inv : p30 + p32 = 1
inv : p580 + p585 + p586 = 1
inv : p647 + p652 + p653 = 1
inv : p443 + p445 = 1
inv : p446 + p449 + p450 = 1
inv : p682 + p684 + p686 + p688 = 1
inv : p1429 + p1432 + p1434 + p1436 = 1
inv : p883 + p885 + p887 + p889 = 1
inv : p915 + p920 + p921 = 1
inv : p1630 + p1633 + p1635 + p1637 = 1
inv : p1105 + p1107 + p1147 + p1149 = 1
inv : p749 + p751 + p753 + p755 = 1
inv : p44 + p45 + p47 + p48 = 1
inv : p1659 + p1662 + p1663 = 1
inv : p1666 + p1671 + p1672 = 1
inv : p1549 + p1551 = 1
inv : p840 + p841 + p862 + p867 + p868 = 1
inv : p1105 + p1107 + p1123 + p1126 + p1127 = 1
inv : p1105 + p1107 + p1113 + p1115 = 1
inv : p1338 + p1340 + p1342 + p1344 = 1
inv : p209 + p211 = 1
inv : p1247 + p1249 = 1
inv : -p1930 - p1931 + p1932 + p1933 = 0
inv : p1448 + p1450 = 1
inv : p1987 + p1990 + p1991 = 1
inv : p1860 + p1865 + p1866 = 1
inv : p1105 + p1107 + p1116 + p1121 + p1122 = 1
inv : p1285 + p1287 + p1289 + p1291 = 1
inv : p950 + p952 + p954 + p956 = 1
inv : p192 + p195 + p196 = 1
inv : p577 + p579 = 1
inv : p587 + p590 + p591 = 1
inv : p1898 + p1901 + p1903 + p1905 = 1
inv : p893 + p896 + p898 + p900 = 1
inv : p802 + p804 + p806 + p808 = 1
inv : p1577 + p1578 + p1606 + p1608 + p1610 + p1612 = 1
inv : p1105 + p1107 + p1123 + p1128 + p1129 = 1
inv : p393 + p396 + p397 = 1
inv : p491 + p494 + p496 + p498 = 1
inv : p1719 + p1724 + p1725 = 1
inv : p1577 + p1616 + p1618 = 1
inv : p379 + p382 + p383 = 1
inv : p1094 + p1097 + p1099 + p1101 = 1
inv : -p1990 - p1991 + p1992 + p1993 = 0
inv : p2022 + p2024 + p2026 + p2028 = 1
inv : p1733 + p1738 + p1739 = 1
inv : p812 + p814 = 1
inv : p1496 + p1499 + p1501 + p1503 = 1
inv : p376 + p378 = 1
inv : p51 + p54 + p55 = 1
inv : p446 + p451 + p452 = 1
inv : p185 + p188 + p189 = 1
inv : p840 + p841 + p848 + p851 + p852 = 1
inv : p1652 + p1655 + p1656 = 1
inv : p1927 + p1930 + p1931 = 1
inv : p245 + p248 + p249 = 1
inv : p252 + p257 + p258 = 1
inv : p89 + p92 + p94 + p96 + p97 = 1
inv : p1105 + p1107 + p1151 + p1153 + p1155 + p1157 = 1
inv : p1458 + p1461 + p1462 = 1
inv : p625 + p628 + p630 + p632 = 1
inv : p290 + p293 + p295 + p297 + p298 = 1
inv : p1204 + p1206 + p1208 + p1210 = 1
inv : p424 + p427 + p429 + p431 = 1
inv : p44 + p45 + p49 + p50 = 1
inv : p51 + p56 + p57 = 1
inv : p1317 + p1320 + p1321 = 1
inv : p1831 + p1834 + p1836 + p1838 = 1
inv : p795 + p800 + p801 = 1
inv : p1324 + p1329 + p1330 = 1
inv : p245 + p250 + p251 = 1
inv : p611 + p613 = 1
inv : p1934 + p1937 + p1938 = 1
inv : p223 + p226 + p228 + p230 = 1
inv : p644 + p646 = 1
inv : p1183 + p1188 + p1189 = 1
inv : p393 + p398 + p399 = 1
inv : p309 + p311 = 1
inv : p1563 + p1566 + p1568 + p1570 = 1
inv : p1726 + p1731 + p1732 = 1
inv : p580 + p583 + p584 = 1
inv : p1719 + p1722 + p1723 = 1
inv : p692 + p695 + p697 + p699 = 1
inv : p1451 + p1454 + p1455 = 1
inv : p971 + p972 + p996 + p999 + p1000 = 1
inv : p1063 + p1066 + p1067 = 1
inv : p1968 + p1970 + p1972 + p1974 = 1
inv : p504 + p505 + p513 + p516 + p517 = 1
inv : p386 + p389 + p390 = 1
inv : p1860 + p1863 + p1864 = 1
inv : p1264 + p1267 + p1268 = 1
inv : p745 + p747 = 1
Total of 331 invariants.
[2020-05-27 17:27:26] [INFO ] Computed 331 place invariants in 27 ms
Loading property file ReachabilityFireability.prop.
Read [reachable] property : ShieldPPPs-PT-030B-ReachabilityFireability-02 with value :((((i6.i1.i1.u122.p841==1)&&(i5.i0.i2.u88.p646==1))&&(i5.i1.i0.u96.p681==1))&&((i1.u8.p61!=1)||(i1.u13.p97!=1)))
Read [reachable] property : ShieldPPPs-PT-030B-ReachabilityFireability-03 with value :(((((i12.u219.p1578==1)&&(i7.i1.i0.u143.p983==1))&&(i1.u2.p45!=1))&&(i8.i0.i1.u162.p1107==1))&&((i15.i2.i0.u274.p1938!=1)||(i15.i2.i0.u275.p1940!=1)))
Read [invariant] property : ShieldPPPs-PT-030B-ReachabilityFireability-04 with value :(((((((i12.u238.p1698!=1)||(i2.i0.i0.u38.p262!=1))||(i2.i0.i0.u42.p298!=1))||(i14.i1.i2.u265.p1868!=1))||(i3.i1.i0.u73.p505!=1))||(i7.i1.i2.u141.p972==1))||(i8.i1.i1.u169.p1145!=1))
built 17 ordering constraints for composite.
built 19 ordering constraints for composite.
built 16 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 15 ordering constraints for composite.
built 9 ordering constraints for composite.
built 19 ordering constraints for composite.
built 30 ordering constraints for composite.
built 16 ordering constraints for composite.
built 24 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 16 ordering constraints for composite.
built 15 ordering constraints for composite.
built 14 ordering constraints for composite.
built 9 ordering constraints for composite.
built 5 ordering constraints for composite.
built 19 ordering constraints for composite.
built 21 ordering constraints for composite.
built 8 ordering constraints for composite.
built 16 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 19 ordering constraints for composite.
built 15 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 32 ordering constraints for composite.
built 9 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 13 ordering constraints for composite.
built 10 ordering constraints for composite.
built 18 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 14 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 13 ordering constraints for composite.
built 8 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 25 ordering constraints for composite.
built 29 ordering constraints for composite.
built 23 ordering constraints for composite.
built 17 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 11 ordering constraints for composite.
built 4 ordering constraints for composite.
built 14 ordering constraints for composite.
built 18 ordering constraints for composite.
built 11 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 6 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 9 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
[2020-05-27 17:27:27] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-02(UNSAT) depth K=2 took 1151 ms
SDD proceeding with computation, new max is 2048
[2020-05-27 17:27:27] [INFO ] Proved 951 variables to be positive in 1363 ms
[2020-05-27 17:27:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-030B-ReachabilityFireability-02
[2020-05-27 17:27:28] [INFO ] KInduction solution for property ShieldPPPs-PT-030B-ReachabilityFireability-02(SAT) depth K=0 took 47 ms
[2020-05-27 17:27:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-030B-ReachabilityFireability-03
[2020-05-27 17:27:28] [INFO ] KInduction solution for property ShieldPPPs-PT-030B-ReachabilityFireability-03(SAT) depth K=0 took 32 ms
[2020-05-27 17:27:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-030B-ReachabilityFireability-04
[2020-05-27 17:27:28] [INFO ] KInduction solution for property ShieldPPPs-PT-030B-ReachabilityFireability-04(SAT) depth K=0 took 38 ms
[2020-05-27 17:27:28] [INFO ] Proved 951 variables to be positive in 2196 ms
[2020-05-27 17:27:28] [INFO ] Computing symmetric may disable matrix : 801 transitions.
[2020-05-27 17:27:28] [INFO ] Computation of disable matrix completed :0/801 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 17:27:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-030B-ReachabilityFireability-02
[2020-05-27 17:27:28] [INFO ] KInduction solution for property ShieldPPPs-PT-030B-ReachabilityFireability-02(SAT) depth K=1 took 149 ms
[2020-05-27 17:27:28] [INFO ] Computation of Complete disable matrix. took 104 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 17:27:28] [INFO ] Computing symmetric may enable matrix : 801 transitions.
[2020-05-27 17:27:28] [INFO ] Computation of Complete enable matrix. took 59 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-27 17:27:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-030B-ReachabilityFireability-03
[2020-05-27 17:27:28] [INFO ] KInduction solution for property ShieldPPPs-PT-030B-ReachabilityFireability-03(SAT) depth K=1 took 138 ms
[2020-05-27 17:27:28] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-030B-ReachabilityFireability-04
[2020-05-27 17:27:28] [INFO ] KInduction solution for property ShieldPPPs-PT-030B-ReachabilityFireability-04(SAT) depth K=1 took 145 ms
[2020-05-27 17:27:28] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-03(UNSAT) depth K=2 took 1268 ms
[2020-05-27 17:27:29] [INFO ] Computing symmetric co enabling matrix : 801 transitions.
SDD proceeding with computation, new max is 4096
[2020-05-27 17:27:29] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-04(UNSAT) depth K=2 took 1018 ms
SDD proceeding with computation, new max is 8192
[2020-05-27 17:27:31] [INFO ] Computation of co-enabling matrix(70/801) took 2302 ms. Total solver calls (SAT/UNSAT): 675(21/654)
[2020-05-27 17:27:34] [INFO ] Computation of co-enabling matrix(110/801) took 5455 ms. Total solver calls (SAT/UNSAT): 1043(60/983)
[2020-05-27 17:27:37] [INFO ] Computation of co-enabling matrix(146/801) took 8477 ms. Total solver calls (SAT/UNSAT): 1375(96/1279)
SDD proceeding with computation, new max is 16384
[2020-05-27 17:27:40] [INFO ] Computation of co-enabling matrix(195/801) took 11510 ms. Total solver calls (SAT/UNSAT): 1829(136/1693)
SDD proceeding with computation, new max is 32768
[2020-05-27 17:27:43] [INFO ] Computation of co-enabling matrix(257/801) took 14533 ms. Total solver calls (SAT/UNSAT): 2256(188/2068)
[2020-05-27 17:27:46] [INFO ] Computation of co-enabling matrix(334/801) took 17534 ms. Total solver calls (SAT/UNSAT): 2677(243/2434)
[2020-05-27 17:27:49] [INFO ] Computation of co-enabling matrix(402/801) took 20538 ms. Total solver calls (SAT/UNSAT): 3092(288/2804)
[2020-05-27 17:27:52] [INFO ] Computation of co-enabling matrix(473/801) took 23574 ms. Total solver calls (SAT/UNSAT): 3503(336/3167)
[2020-05-27 17:27:55] [INFO ] Computation of co-enabling matrix(576/801) took 26592 ms. Total solver calls (SAT/UNSAT): 3820(372/3448)
[2020-05-27 17:27:58] [INFO ] Computation of co-enabling matrix(789/801) took 29596 ms. Total solver calls (SAT/UNSAT): 4020(377/3643)
[2020-05-27 17:27:58] [INFO ] Computation of Finished co-enabling matrix. took 29724 ms. Total solver calls (SAT/UNSAT): 4026(377/3649)
[2020-05-27 17:27:58] [INFO ] Computing Do-Not-Accords matrix : 801 transitions.
[2020-05-27 17:27:59] [INFO ] Computation of Completed DNA matrix. took 950 ms. Total solver calls (SAT/UNSAT): 124(0/124)
[2020-05-27 17:27:59] [INFO ] Built C files in 34739ms 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]
SDD proceeding with computation, new max is 65536
Compilation finished in 9474 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 69 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPsPT030BReachabilityFireability02==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPsPT030BReachabilityFireability02==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPsPT030BReachabilityFireability02==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 17:28:37] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-02(UNSAT) depth K=3 took 67748 ms
SDD proceeding with computation, new max is 131072
[2020-05-27 17:29:22] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-03(UNSAT) depth K=3 took 44765 ms
[2020-05-27 17:29:35] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-04(UNSAT) depth K=3 took 13131 ms
[2020-05-27 17:30:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-030B-ReachabilityFireability-02
[2020-05-27 17:30:12] [INFO ] KInduction solution for property ShieldPPPs-PT-030B-ReachabilityFireability-02(SAT) depth K=2 took 163917 ms
[2020-05-27 17:31:30] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-030B-ReachabilityFireability-03
[2020-05-27 17:31:30] [INFO ] KInduction solution for property ShieldPPPs-PT-030B-ReachabilityFireability-03(SAT) depth K=2 took 78232 ms
SDD proceeding with computation, new max is 262144
[2020-05-27 17:34:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPs-PT-030B-ReachabilityFireability-04
[2020-05-27 17:34:40] [INFO ] KInduction solution for property ShieldPPPs-PT-030B-ReachabilityFireability-04(SAT) depth K=2 took 189549 ms
[2020-05-27 17:36:11] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-02(UNSAT) depth K=4 took 396433 ms
SDD proceeding with computation, new max is 524288
ITS-tools command line returned an error code 137
[2020-05-27 17:41:51] [INFO ] Applying decomposition
[2020-05-27 17:41:52] [INFO ] Flatten gal took : 356 ms
[2020-05-27 17:41:52] [INFO ] Decomposing Gal with order
[2020-05-27 17:41:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 17:41:53] [INFO ] Removed a total of 661 redundant transitions.
[2020-05-27 17:41:53] [INFO ] Flatten gal took : 653 ms
[2020-05-27 17:41:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 949 labels/synchronizations in 555 ms.
[2020-05-27 17:41:55] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 252 ms
[2020-05-27 17:41:55] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness], workingDir=/home/mcc/execution]

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 : ShieldPPPs-PT-030B-ReachabilityFireability-02 with value :((((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u960.p841==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.u227.p646==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u238.p681==1))&&((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i1.u46.p61!=1)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u51.p97!=1)))
Read [reachable] property : ShieldPPPs-PT-030B-ReachabilityFireability-03 with value :(((((i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u701.p1578==1)&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u741.p983==1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i0.i1.u870.p45!=1))&&(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.u863.p1107==1))&&((i0.i1.i0.i0.i0.i0.i1.u634.p1938!=1)||(i0.i1.i0.i0.i0.i0.i1.u635.p1940!=1)))
Read [invariant] property : ShieldPPPs-PT-030B-ReachabilityFireability-04 with value :(((((((i0.i0.i0.i0.i0.i1.u555.p1698!=1)||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i1.u109.p262!=1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u114.p298!=1))||(i0.i0.i1.i0.i0.i0.i0.i1.u679.p1868!=1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.u982.p505!=1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.u749.p972==1))||(i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.u384.p1145!=1))
built 1 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 19 ordering constraints for composite.
built 26 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 16 ordering constraints for composite.
built 17 ordering constraints for composite.
built 21 ordering constraints for composite.
built 20 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 19 ordering constraints for composite.
built 26 ordering constraints for composite.
built 16 ordering constraints for composite.
built 25 ordering constraints for composite.
built 24 ordering constraints for composite.
built 27 ordering constraints for composite.
built 25 ordering constraints for composite.
built 17 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 16 ordering constraints for composite.
built 20 ordering constraints for composite.
built 12 ordering constraints for composite.
built 15 ordering constraints for composite.
built 16 ordering constraints for composite.
built 22 ordering constraints for composite.
built 21 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 14 ordering constraints for composite.
built 17 ordering constraints for composite.
built 17 ordering constraints for composite.
built 23 ordering constraints for composite.
built 22 ordering constraints for composite.
built 7 ordering constraints for composite.
built 13 ordering constraints for composite.
built 16 ordering constraints for composite.
built 16 ordering constraints for composite.
built 22 ordering constraints for composite.
built 21 ordering constraints for composite.
built 6 ordering constraints for composite.
built 15 ordering constraints for composite.
built 19 ordering constraints for composite.
built 20 ordering constraints for composite.
built 24 ordering constraints for composite.
built 29 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 29 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 22 ordering constraints for composite.
built 21 ordering constraints for composite.
built 14 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 27 ordering constraints for composite.
built 19 ordering constraints for composite.
built 11 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 8 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 15 ordering constraints for composite.
built 18 ordering constraints for composite.
built 18 ordering constraints for composite.
built 24 ordering constraints for composite.
built 23 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 17 ordering constraints for composite.
built 18 ordering constraints for composite.
built 16 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 3 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
SDD proceeding with computation, new max is 262144
[2020-05-27 17:48:07] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-03(UNSAT) depth K=4 took 715859 ms
SDD proceeding with computation, new max is 524288
[2020-05-27 17:55:15] [INFO ] BMC solution for property ShieldPPPs-PT-030B-ReachabilityFireability-04(UNSAT) depth K=4 took 428115 ms
ITS-tools command line returned an error code 137
[2020-05-27 18:00:31] [INFO ] Flatten gal took : 47 ms
[2020-05-27 18:00:32] [INFO ] Input system was already deterministic with 801 transitions.
[2020-05-27 18:00:32] [INFO ] Transformed 951 places.
[2020-05-27 18:00:32] [INFO ] Transformed 801 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-27 18:00:32] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 18 ms
[2020-05-27 18:00:32] [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, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file ReachabilityFireability.prop.
Read [reachable] property : ShieldPPPs-PT-030B-ReachabilityFireability-02 with value :((((p841==1)&&(p646==1))&&(p681==1))&&((p61!=1)||(p97!=1)))
Read [reachable] property : ShieldPPPs-PT-030B-ReachabilityFireability-03 with value :(((((p1578==1)&&(p983==1))&&(p45!=1))&&(p1107==1))&&((p1938!=1)||(p1940!=1)))
Read [invariant] property : ShieldPPPs-PT-030B-ReachabilityFireability-04 with value :(((((((p1698!=1)||(p262!=1))||(p298!=1))||(p1868!=1))||(p505!=1))||(p972==1))||(p1145!=1))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288
SDD proceeding with computation, new max is 1048576
ITS-tools command line returned an error code 137

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="ShieldPPPs-PT-030B"
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 ShieldPPPs-PT-030B, 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 r210-tajo-159033475800519"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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