MCC'2020 - Execution of r111-csrt-158961258100751

About the Execution of ITS-Tools for Peterson-PT-7

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15744.040	3600000.00	9053116.00	62151.40	FTTTTTTT????FTFT	normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r111-csrt-158961258100751.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Peterson-PT-7, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r111-csrt-158961258100751
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.0M
-rw-r--r-- 1 mcc users 115K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 313K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 107K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 339K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 136K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 403K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 81K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 272K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 134K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 354K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 98K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 322K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 45K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 93K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 2.3M Apr 27 15:14 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-00
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-01
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-02
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-03
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-04
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-05
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-06
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-07
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-08
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-09
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-10
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-11
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-12
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-13
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-14
FORMULA_NAME Peterson-PT-7-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1590029954464

[2020-05-21 02:59:16] [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-21 02:59:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 02:59:16] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2020-05-21 02:59:16] [INFO ] Transformed 1992 places.
[2020-05-21 02:59:16] [INFO ] Transformed 3096 transitions.
[2020-05-21 02:59:16] [INFO ] Parsed PT model containing 1992 places and 3096 transitions in 343 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 101 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 152 ms. (steps per millisecond=65 ) properties seen :[1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA Peterson-PT-7-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 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, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 83 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-21 02:59:17] [INFO ] Flow matrix only has 2760 transitions (discarded 336 similar events)
// Phase 1: matrix 2760 rows 1992 cols
[2020-05-21 02:59:17] [INFO ] Computed 31 place invariants in 96 ms
[2020-05-21 02:59:18] [INFO ] [Real]Absence check using 23 positive place invariants in 109 ms returned sat
[2020-05-21 02:59:18] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2020-05-21 02:59:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:22] [INFO ] [Real]Absence check using state equation in 4529 ms returned (error "Solver has unexpectedly terminated")
[2020-05-21 02:59:22] [INFO ] [Real]Absence check using 23 positive place invariants in 77 ms returned sat
[2020-05-21 02:59:22] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 10 ms returned sat
[2020-05-21 02:59:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:27] [INFO ] [Real]Absence check using state equation in 4695 ms returned (error "Solver has unexpectedly terminated")
[2020-05-21 02:59:27] [INFO ] [Real]Absence check using 23 positive place invariants in 105 ms returned sat
[2020-05-21 02:59:27] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2020-05-21 02:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:59:32] [INFO ] [Real]Absence check using state equation in 4734 ms returned (error "Failed to check-sat")
[2020-05-21 02:59:32] [INFO ] [Real]Absence check using 23 positive place invariants in 68 ms returned sat
[2020-05-21 02:59:32] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-21 02:59:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:59:37] [INFO ] [Real]Absence check using state equation in 4761 ms returned (error "Failed to check-sat")
[2020-05-21 02:59:37] [INFO ] [Real]Absence check using 23 positive place invariants in 67 ms returned sat
[2020-05-21 02:59:38] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2020-05-21 02:59:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:59:42] [INFO ] [Real]Absence check using state equation in 4724 ms returned unknown
[2020-05-21 02:59:42] [INFO ] [Real]Absence check using 23 positive place invariants in 68 ms returned sat
[2020-05-21 02:59:42] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 14 ms returned sat
[2020-05-21 02:59:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:59:47] [INFO ] [Real]Absence check using state equation in 4746 ms returned (error "Failed to check-sat")
[2020-05-21 02:59:47] [INFO ] [Real]Absence check using 23 positive place invariants in 67 ms returned sat
[2020-05-21 02:59:47] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 15 ms returned sat
[2020-05-21 02:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:52] [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 (= s1260 (- t2738 (+ t618 t1278)))") while checking expression at index 6
[2020-05-21 02:59:52] [INFO ] [Real]Absence check using 23 positive place invariants in 67 ms returned sat
[2020-05-21 02:59:52] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-21 02:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 02:59:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 02:59:57] [INFO ] [Real]Absence check using state equation in 4780 ms returned (error "Failed to check-sat")
[2020-05-21 02:59:58] [INFO ] [Real]Absence check using 23 positive place invariants in 65 ms returned sat
[2020-05-21 02:59:58] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2020-05-21 02:59:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:00:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 03:00:02] [INFO ] [Real]Absence check using state equation in 4750 ms returned (error "Failed to check-sat")
[2020-05-21 03:00:03] [INFO ] [Real]Absence check using 23 positive place invariants in 70 ms returned sat
[2020-05-21 03:00:03] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-21 03:00:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:00:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-21 03:00:07] [INFO ] [Real]Absence check using state equation in 4746 ms returned (error "Failed to check-sat")
Support contains 91 out of 1992 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Performed 863 Post agglomeration using F-continuation condition.Transition count delta: 863
Iterating post reduction 0 with 863 rules applied. Total rules applied 863 place count 1992 transition count 2233
Reduce places removed 863 places and 0 transitions.
Iterating post reduction 1 with 863 rules applied. Total rules applied 1726 place count 1129 transition count 2233
Performed 451 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 451 Pre rules applied. Total rules applied 1726 place count 1129 transition count 1782
Deduced a syphon composed of 451 places in 8 ms
Reduce places removed 451 places and 0 transitions.
Iterating global reduction 2 with 902 rules applied. Total rules applied 2628 place count 678 transition count 1782
Applied a total of 2628 rules in 587 ms. Remains 678 /1992 variables (removed 1314) and now considering 1782/3096 (removed 1314) transitions.
Finished structural reductions, in 1 iterations. Remains : 678/1992 places, 1782/3096 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 7303 ms. (steps per millisecond=136 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2147 ms. (steps per millisecond=465 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2244 ms. (steps per millisecond=445 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2106 ms. (steps per millisecond=474 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1284 ms. (steps per millisecond=778 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1148 ms. (steps per millisecond=871 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1117 ms. (steps per millisecond=895 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1129 ms. (steps per millisecond=885 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1306 ms. (steps per millisecond=765 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1142 ms. (steps per millisecond=875 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 1, 0, 0]
FORMULA Peterson-PT-7-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1506 ms. (steps per millisecond=664 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-05-21 03:00:30] [INFO ] Flow matrix only has 1446 transitions (discarded 336 similar events)
// Phase 1: matrix 1446 rows 678 cols
[2020-05-21 03:00:30] [INFO ] Computed 31 place invariants in 11 ms
[2020-05-21 03:00:30] [INFO ] [Real]Absence check using 23 positive place invariants in 27 ms returned sat
[2020-05-21 03:00:30] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 03:00:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:00:32] [INFO ] [Real]Absence check using state equation in 1606 ms returned sat
[2020-05-21 03:00:32] [INFO ] State equation strengthened by 546 read => feed constraints.
[2020-05-21 03:00:32] [INFO ] [Real]Added 546 Read/Feed constraints in 82 ms returned sat
[2020-05-21 03:00:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:00:33] [INFO ] [Nat]Absence check using 23 positive place invariants in 131 ms returned sat
[2020-05-21 03:00:33] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-21 03:00:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:00:34] [INFO ] [Nat]Absence check using state equation in 1714 ms returned sat
[2020-05-21 03:00:34] [INFO ] [Nat]Added 546 Read/Feed constraints in 130 ms returned sat
[2020-05-21 03:00:35] [INFO ] Deduced a trap composed of 52 places in 546 ms
[2020-05-21 03:00:36] [INFO ] Deduced a trap composed of 54 places in 482 ms
[2020-05-21 03:00:36] [INFO ] Deduced a trap composed of 24 places in 420 ms
[2020-05-21 03:00:37] [INFO ] Deduced a trap composed of 29 places in 423 ms
[2020-05-21 03:00:37] [INFO ] Deduced a trap composed of 22 places in 508 ms
[2020-05-21 03:00:38] [INFO ] Deduced a trap composed of 14 places in 410 ms
[2020-05-21 03:00:38] [INFO ] Deduced a trap composed of 22 places in 417 ms
[2020-05-21 03:00:39] [INFO ] Deduced a trap composed of 55 places in 465 ms
[2020-05-21 03:00:39] [INFO ] Deduced a trap composed of 12 places in 396 ms
[2020-05-21 03:00:40] [INFO ] Deduced a trap composed of 14 places in 445 ms
[2020-05-21 03:00:40] [INFO ] Deduced a trap composed of 12 places in 468 ms
[2020-05-21 03:00:41] [INFO ] Deduced a trap composed of 13 places in 521 ms
[2020-05-21 03:00:41] [INFO ] Deduced a trap composed of 22 places in 411 ms
[2020-05-21 03:00:42] [INFO ] Deduced a trap composed of 32 places in 418 ms
[2020-05-21 03:00:42] [INFO ] Deduced a trap composed of 29 places in 427 ms
[2020-05-21 03:00:43] [INFO ] Deduced a trap composed of 35 places in 397 ms
[2020-05-21 03:00:43] [INFO ] Deduced a trap composed of 64 places in 442 ms
[2020-05-21 03:00:44] [INFO ] Deduced a trap composed of 65 places in 411 ms
[2020-05-21 03:00:44] [INFO ] Deduced a trap composed of 30 places in 465 ms
[2020-05-21 03:00:45] [INFO ] Deduced a trap composed of 16 places in 481 ms
[2020-05-21 03:00:45] [INFO ] Deduced a trap composed of 35 places in 415 ms
[2020-05-21 03:00:46] [INFO ] Deduced a trap composed of 45 places in 445 ms
[2020-05-21 03:00:46] [INFO ] Deduced a trap composed of 33 places in 448 ms
[2020-05-21 03:00:47] [INFO ] Deduced a trap composed of 45 places in 440 ms
[2020-05-21 03:00:47] [INFO ] Deduced a trap composed of 84 places in 493 ms
[2020-05-21 03:00:48] [INFO ] Deduced a trap composed of 12 places in 494 ms
[2020-05-21 03:00:48] [INFO ] Deduced a trap composed of 54 places in 507 ms
[2020-05-21 03:00:49] [INFO ] Deduced a trap composed of 39 places in 529 ms
[2020-05-21 03:00:50] [INFO ] Deduced a trap composed of 42 places in 540 ms
[2020-05-21 03:00:50] [INFO ] Deduced a trap composed of 21 places in 528 ms
[2020-05-21 03:00:51] [INFO ] Deduced a trap composed of 22 places in 528 ms
[2020-05-21 03:00:51] [INFO ] Deduced a trap composed of 71 places in 486 ms
[2020-05-21 03:00:52] [INFO ] Deduced a trap composed of 33 places in 585 ms
[2020-05-21 03:00:53] [INFO ] Deduced a trap composed of 33 places in 534 ms
[2020-05-21 03:00:53] [INFO ] Deduced a trap composed of 23 places in 614 ms
[2020-05-21 03:00:54] [INFO ] Deduced a trap composed of 22 places in 525 ms
[2020-05-21 03:00:54] [INFO ] Deduced a trap composed of 22 places in 513 ms
[2020-05-21 03:00:55] [INFO ] Deduced a trap composed of 53 places in 492 ms
[2020-05-21 03:00:55] [INFO ] Deduced a trap composed of 45 places in 498 ms
[2020-05-21 03:00:56] [INFO ] Deduced a trap composed of 34 places in 489 ms
[2020-05-21 03:00:57] [INFO ] Deduced a trap composed of 70 places in 494 ms
[2020-05-21 03:00:57] [INFO ] Deduced a trap composed of 52 places in 510 ms
[2020-05-21 03:00:58] [INFO ] Deduced a trap composed of 70 places in 443 ms
[2020-05-21 03:00:58] [INFO ] Deduced a trap composed of 21 places in 447 ms
[2020-05-21 03:00:59] [INFO ] Deduced a trap composed of 19 places in 355 ms
[2020-05-21 03:00:59] [INFO ] Deduced a trap composed of 37 places in 435 ms
[2020-05-21 03:01:00] [INFO ] Deduced a trap composed of 34 places in 453 ms
[2020-05-21 03:01:00] [INFO ] Deduced a trap composed of 29 places in 383 ms
[2020-05-21 03:01:01] [INFO ] Deduced a trap composed of 42 places in 340 ms
[2020-05-21 03:01:01] [INFO ] Deduced a trap composed of 146 places in 341 ms
[2020-05-21 03:01:01] [INFO ] Deduced a trap composed of 38 places in 287 ms
[2020-05-21 03:01:02] [INFO ] Deduced a trap composed of 48 places in 320 ms
[2020-05-21 03:01:02] [INFO ] Deduced a trap composed of 134 places in 427 ms
[2020-05-21 03:01:02] [INFO ] Deduced a trap composed of 38 places in 291 ms
[2020-05-21 03:01:03] [INFO ] Deduced a trap composed of 46 places in 264 ms
[2020-05-21 03:01:03] [INFO ] Deduced a trap composed of 64 places in 334 ms
[2020-05-21 03:01:04] [INFO ] Deduced a trap composed of 38 places in 336 ms
[2020-05-21 03:01:04] [INFO ] Deduced a trap composed of 38 places in 295 ms
[2020-05-21 03:01:04] [INFO ] Deduced a trap composed of 46 places in 426 ms
[2020-05-21 03:01:05] [INFO ] Deduced a trap composed of 46 places in 421 ms
[2020-05-21 03:01:05] [INFO ] Deduced a trap composed of 22 places in 426 ms
[2020-05-21 03:01:06] [INFO ] Deduced a trap composed of 34 places in 391 ms
[2020-05-21 03:01:06] [INFO ] Deduced a trap composed of 35 places in 386 ms
[2020-05-21 03:01:07] [INFO ] Deduced a trap composed of 35 places in 440 ms
[2020-05-21 03:01:07] [INFO ] Deduced a trap composed of 42 places in 438 ms
[2020-05-21 03:01:08] [INFO ] Deduced a trap composed of 65 places in 353 ms
[2020-05-21 03:01:08] [INFO ] Deduced a trap composed of 64 places in 318 ms
[2020-05-21 03:01:08] [INFO ] Deduced a trap composed of 75 places in 316 ms
[2020-05-21 03:01:09] [INFO ] Deduced a trap composed of 74 places in 305 ms
[2020-05-21 03:01:09] [INFO ] Deduced a trap composed of 79 places in 320 ms
[2020-05-21 03:01:10] [INFO ] Deduced a trap composed of 65 places in 309 ms
[2020-05-21 03:01:10] [INFO ] Deduced a trap composed of 65 places in 327 ms
[2020-05-21 03:01:10] [INFO ] Deduced a trap composed of 65 places in 315 ms
[2020-05-21 03:01:11] [INFO ] Deduced a trap composed of 65 places in 309 ms
[2020-05-21 03:01:11] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 36354 ms
[2020-05-21 03:01:11] [INFO ] Computed and/alt/rep : 1774/14312/1438 causal constraints in 140 ms.
[2020-05-21 03:01: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: Stream closed (=> (> t266 0) (and (or (and (> t190 0) (< o190 o266)) (and (> t197 0) (< o197 o266)) (and (> t205 0) (< o205 o266)) (and (> t245 0) (< o245 o266)) (and (> t251 0) (< o251 o266)) (and (> t259 0) (< o259 o266)) (and (> t274 0) (< o274 o266))) (and (> t182 0) (< o182 o266))))") while checking expression at index 0
[2020-05-21 03:01:17] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2020-05-21 03:01:17] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-21 03:01:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:01:19] [INFO ] [Real]Absence check using state equation in 1677 ms returned sat
[2020-05-21 03:01:19] [INFO ] [Real]Added 546 Read/Feed constraints in 96 ms returned sat
[2020-05-21 03:01:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:01:19] [INFO ] [Nat]Absence check using 23 positive place invariants in 40 ms returned sat
[2020-05-21 03:01:19] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 8 ms returned sat
[2020-05-21 03:01:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:01:21] [INFO ] [Nat]Absence check using state equation in 1582 ms returned sat
[2020-05-21 03:01:21] [INFO ] [Nat]Added 546 Read/Feed constraints in 97 ms returned sat
[2020-05-21 03:01:22] [INFO ] Deduced a trap composed of 52 places in 506 ms
[2020-05-21 03:01:22] [INFO ] Deduced a trap composed of 54 places in 459 ms
[2020-05-21 03:01:23] [INFO ] Deduced a trap composed of 24 places in 416 ms
[2020-05-21 03:01:23] [INFO ] Deduced a trap composed of 29 places in 495 ms
[2020-05-21 03:01:24] [INFO ] Deduced a trap composed of 22 places in 428 ms
[2020-05-21 03:01:24] [INFO ] Deduced a trap composed of 14 places in 406 ms
[2020-05-21 03:01:25] [INFO ] Deduced a trap composed of 22 places in 405 ms
[2020-05-21 03:01:25] [INFO ] Deduced a trap composed of 55 places in 426 ms
[2020-05-21 03:01:26] [INFO ] Deduced a trap composed of 12 places in 430 ms
[2020-05-21 03:01:26] [INFO ] Deduced a trap composed of 14 places in 437 ms
[2020-05-21 03:01:27] [INFO ] Deduced a trap composed of 12 places in 468 ms
[2020-05-21 03:01:27] [INFO ] Deduced a trap composed of 13 places in 466 ms
[2020-05-21 03:01:28] [INFO ] Deduced a trap composed of 22 places in 458 ms
[2020-05-21 03:01:28] [INFO ] Deduced a trap composed of 32 places in 462 ms
[2020-05-21 03:01:29] [INFO ] Deduced a trap composed of 29 places in 427 ms
[2020-05-21 03:01:29] [INFO ] Deduced a trap composed of 35 places in 459 ms
[2020-05-21 03:01:30] [INFO ] Deduced a trap composed of 64 places in 452 ms
[2020-05-21 03:01:30] [INFO ] Deduced a trap composed of 65 places in 464 ms
[2020-05-21 03:01:31] [INFO ] Deduced a trap composed of 30 places in 469 ms
[2020-05-21 03:01:31] [INFO ] Deduced a trap composed of 16 places in 469 ms
[2020-05-21 03:01:32] [INFO ] Deduced a trap composed of 35 places in 459 ms
[2020-05-21 03:01:32] [INFO ] Deduced a trap composed of 45 places in 369 ms
[2020-05-21 03:01:33] [INFO ] Deduced a trap composed of 33 places in 474 ms
[2020-05-21 03:01:33] [INFO ] Deduced a trap composed of 45 places in 456 ms
[2020-05-21 03:01:34] [INFO ] Deduced a trap composed of 84 places in 466 ms
[2020-05-21 03:01:34] [INFO ] Deduced a trap composed of 12 places in 444 ms
[2020-05-21 03:01:35] [INFO ] Deduced a trap composed of 54 places in 507 ms
[2020-05-21 03:01:36] [INFO ] Deduced a trap composed of 39 places in 550 ms
[2020-05-21 03:01:36] [INFO ] Deduced a trap composed of 42 places in 520 ms
[2020-05-21 03:01:37] [INFO ] Deduced a trap composed of 21 places in 527 ms
[2020-05-21 03:01:37] [INFO ] Deduced a trap composed of 22 places in 542 ms
[2020-05-21 03:01:38] [INFO ] Deduced a trap composed of 71 places in 521 ms
[2020-05-21 03:01:38] [INFO ] Deduced a trap composed of 33 places in 494 ms
[2020-05-21 03:01:39] [INFO ] Deduced a trap composed of 33 places in 511 ms
[2020-05-21 03:01:40] [INFO ] Deduced a trap composed of 23 places in 514 ms
[2020-05-21 03:01:40] [INFO ] Deduced a trap composed of 22 places in 516 ms
[2020-05-21 03:01:41] [INFO ] Deduced a trap composed of 22 places in 530 ms
[2020-05-21 03:01:41] [INFO ] Deduced a trap composed of 53 places in 485 ms
[2020-05-21 03:01:42] [INFO ] Deduced a trap composed of 45 places in 488 ms
[2020-05-21 03:01:42] [INFO ] Deduced a trap composed of 34 places in 491 ms
[2020-05-21 03:01:43] [INFO ] Deduced a trap composed of 70 places in 475 ms
[2020-05-21 03:01:43] [INFO ] Deduced a trap composed of 52 places in 500 ms
[2020-05-21 03:01:44] [INFO ] Deduced a trap composed of 70 places in 534 ms
[2020-05-21 03:01:45] [INFO ] Deduced a trap composed of 21 places in 505 ms
[2020-05-21 03:01:45] [INFO ] Deduced a trap composed of 19 places in 451 ms
[2020-05-21 03:01:46] [INFO ] Deduced a trap composed of 37 places in 462 ms
[2020-05-21 03:01:46] [INFO ] Deduced a trap composed of 34 places in 523 ms
[2020-05-21 03:01:47] [INFO ] Deduced a trap composed of 29 places in 467 ms
[2020-05-21 03:01:47] [INFO ] Deduced a trap composed of 42 places in 423 ms
[2020-05-21 03:01:48] [INFO ] Deduced a trap composed of 146 places in 436 ms
[2020-05-21 03:01:48] [INFO ] Deduced a trap composed of 38 places in 336 ms
[2020-05-21 03:01:49] [INFO ] Deduced a trap composed of 48 places in 347 ms
[2020-05-21 03:01:49] [INFO ] Deduced a trap composed of 134 places in 423 ms
[2020-05-21 03:01:50] [INFO ] Deduced a trap composed of 38 places in 341 ms
[2020-05-21 03:01:50] [INFO ] Deduced a trap composed of 46 places in 347 ms
[2020-05-21 03:01:50] [INFO ] Deduced a trap composed of 64 places in 457 ms
[2020-05-21 03:01:51] [INFO ] Deduced a trap composed of 38 places in 364 ms
[2020-05-21 03:01:51] [INFO ] Deduced a trap composed of 38 places in 330 ms
[2020-05-21 03:01:52] [INFO ] Deduced a trap composed of 46 places in 436 ms
[2020-05-21 03:01:52] [INFO ] Deduced a trap composed of 46 places in 448 ms
[2020-05-21 03:01:53] [INFO ] Deduced a trap composed of 22 places in 458 ms
[2020-05-21 03:01:53] [INFO ] Deduced a trap composed of 34 places in 435 ms
[2020-05-21 03:01:54] [INFO ] Deduced a trap composed of 35 places in 451 ms
[2020-05-21 03:01:54] [INFO ] Deduced a trap composed of 35 places in 426 ms
[2020-05-21 03:01:55] [INFO ] Deduced a trap composed of 42 places in 398 ms
[2020-05-21 03:01:55] [INFO ] Deduced a trap composed of 65 places in 315 ms
[2020-05-21 03:01:56] [INFO ] Deduced a trap composed of 64 places in 315 ms
[2020-05-21 03:01:56] [INFO ] Deduced a trap composed of 75 places in 320 ms
[2020-05-21 03:01:56] [INFO ] Deduced a trap composed of 74 places in 318 ms
[2020-05-21 03:01:57] [INFO ] Deduced a trap composed of 79 places in 266 ms
[2020-05-21 03:01:57] [INFO ] Deduced a trap composed of 65 places in 334 ms
[2020-05-21 03:01:57] [INFO ] Deduced a trap composed of 65 places in 292 ms
[2020-05-21 03:01:58] [INFO ] Deduced a trap composed of 65 places in 312 ms
[2020-05-21 03:01:58] [INFO ] Deduced a trap composed of 65 places in 310 ms
[2020-05-21 03:01:58] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 37161 ms
[2020-05-21 03:01:58] [INFO ] Computed and/alt/rep : 1774/14312/1438 causal constraints in 127 ms.
[2020-05-21 03:02:04] [INFO ] Added : 205 causal constraints over 41 iterations in 6058 ms. Result :(error "Failed to check-sat")
[2020-05-21 03:02:04] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2020-05-21 03:02:04] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-21 03:02:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:02:06] [INFO ] [Real]Absence check using state equation in 1646 ms returned sat
[2020-05-21 03:02:06] [INFO ] [Real]Added 546 Read/Feed constraints in 126 ms returned sat
[2020-05-21 03:02:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:02:06] [INFO ] [Nat]Absence check using 23 positive place invariants in 36 ms returned sat
[2020-05-21 03:02:06] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 03:02:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:02:08] [INFO ] [Nat]Absence check using state equation in 1659 ms returned sat
[2020-05-21 03:02:08] [INFO ] [Nat]Added 546 Read/Feed constraints in 122 ms returned sat
[2020-05-21 03:02:09] [INFO ] Deduced a trap composed of 52 places in 374 ms
[2020-05-21 03:02:09] [INFO ] Deduced a trap composed of 54 places in 420 ms
[2020-05-21 03:02:10] [INFO ] Deduced a trap composed of 24 places in 406 ms
[2020-05-21 03:02:10] [INFO ] Deduced a trap composed of 29 places in 403 ms
[2020-05-21 03:02:11] [INFO ] Deduced a trap composed of 22 places in 393 ms
[2020-05-21 03:02:11] [INFO ] Deduced a trap composed of 14 places in 340 ms
[2020-05-21 03:02:11] [INFO ] Deduced a trap composed of 22 places in 395 ms
[2020-05-21 03:02:12] [INFO ] Deduced a trap composed of 55 places in 384 ms
[2020-05-21 03:02:12] [INFO ] Deduced a trap composed of 12 places in 408 ms
[2020-05-21 03:02:13] [INFO ] Deduced a trap composed of 14 places in 408 ms
[2020-05-21 03:02:13] [INFO ] Deduced a trap composed of 12 places in 387 ms
[2020-05-21 03:02:14] [INFO ] Deduced a trap composed of 13 places in 391 ms
[2020-05-21 03:02:14] [INFO ] Deduced a trap composed of 22 places in 416 ms
[2020-05-21 03:02:15] [INFO ] Deduced a trap composed of 32 places in 419 ms
[2020-05-21 03:02:15] [INFO ] Deduced a trap composed of 29 places in 421 ms
[2020-05-21 03:02:15] [INFO ] Deduced a trap composed of 35 places in 399 ms
[2020-05-21 03:02:16] [INFO ] Deduced a trap composed of 64 places in 368 ms
[2020-05-21 03:02:16] [INFO ] Deduced a trap composed of 65 places in 399 ms
[2020-05-21 03:02:17] [INFO ] Deduced a trap composed of 30 places in 409 ms
[2020-05-21 03:02:17] [INFO ] Deduced a trap composed of 16 places in 414 ms
[2020-05-21 03:02:18] [INFO ] Deduced a trap composed of 35 places in 444 ms
[2020-05-21 03:02:18] [INFO ] Deduced a trap composed of 45 places in 389 ms
[2020-05-21 03:02:19] [INFO ] Deduced a trap composed of 33 places in 416 ms
[2020-05-21 03:02:19] [INFO ] Deduced a trap composed of 45 places in 370 ms
[2020-05-21 03:02:20] [INFO ] Deduced a trap composed of 84 places in 416 ms
[2020-05-21 03:02:20] [INFO ] Deduced a trap composed of 12 places in 388 ms
[2020-05-21 03:02:21] [INFO ] Deduced a trap composed of 54 places in 444 ms
[2020-05-21 03:02:21] [INFO ] Deduced a trap composed of 39 places in 448 ms
[2020-05-21 03:02:22] [INFO ] Deduced a trap composed of 42 places in 466 ms
[2020-05-21 03:02:22] [INFO ] Deduced a trap composed of 21 places in 478 ms
[2020-05-21 03:02:23] [INFO ] Deduced a trap composed of 22 places in 464 ms
[2020-05-21 03:02:23] [INFO ] Deduced a trap composed of 71 places in 439 ms
[2020-05-21 03:02:24] [INFO ] Deduced a trap composed of 33 places in 473 ms
[2020-05-21 03:02:24] [INFO ] Deduced a trap composed of 33 places in 453 ms
[2020-05-21 03:02:25] [INFO ] Deduced a trap composed of 23 places in 472 ms
[2020-05-21 03:02:25] [INFO ] Deduced a trap composed of 22 places in 473 ms
[2020-05-21 03:02:26] [INFO ] Deduced a trap composed of 22 places in 477 ms
[2020-05-21 03:02:26] [INFO ] Deduced a trap composed of 53 places in 437 ms
[2020-05-21 03:02:27] [INFO ] Deduced a trap composed of 45 places in 437 ms
[2020-05-21 03:02:27] [INFO ] Deduced a trap composed of 34 places in 428 ms
[2020-05-21 03:02:28] [INFO ] Deduced a trap composed of 70 places in 415 ms
[2020-05-21 03:02:28] [INFO ] Deduced a trap composed of 52 places in 427 ms
[2020-05-21 03:02:29] [INFO ] Deduced a trap composed of 70 places in 420 ms
[2020-05-21 03:02:29] [INFO ] Deduced a trap composed of 21 places in 436 ms
[2020-05-21 03:02:30] [INFO ] Deduced a trap composed of 19 places in 395 ms
[2020-05-21 03:02:30] [INFO ] Deduced a trap composed of 37 places in 443 ms
[2020-05-21 03:02:31] [INFO ] Deduced a trap composed of 34 places in 479 ms
[2020-05-21 03:02:31] [INFO ] Deduced a trap composed of 29 places in 456 ms
[2020-05-21 03:02:32] [INFO ] Deduced a trap composed of 42 places in 403 ms
[2020-05-21 03:02:32] [INFO ] Deduced a trap composed of 146 places in 418 ms
[2020-05-21 03:02:32] [INFO ] Deduced a trap composed of 38 places in 339 ms
[2020-05-21 03:02:33] [INFO ] Deduced a trap composed of 48 places in 314 ms
[2020-05-21 03:02:33] [INFO ] Deduced a trap composed of 134 places in 425 ms
[2020-05-21 03:02:34] [INFO ] Deduced a trap composed of 38 places in 305 ms
[2020-05-21 03:02:34] [INFO ] Deduced a trap composed of 46 places in 307 ms
[2020-05-21 03:02:34] [INFO ] Deduced a trap composed of 64 places in 399 ms
[2020-05-21 03:02:35] [INFO ] Deduced a trap composed of 38 places in 319 ms
[2020-05-21 03:02:35] [INFO ] Deduced a trap composed of 38 places in 325 ms
[2020-05-21 03:02:36] [INFO ] Deduced a trap composed of 46 places in 419 ms
[2020-05-21 03:02:36] [INFO ] Deduced a trap composed of 46 places in 404 ms
[2020-05-21 03:02:37] [INFO ] Deduced a trap composed of 22 places in 424 ms
[2020-05-21 03:02:37] [INFO ] Deduced a trap composed of 34 places in 392 ms
[2020-05-21 03:02:38] [INFO ] Deduced a trap composed of 35 places in 473 ms
[2020-05-21 03:02:38] [INFO ] Deduced a trap composed of 35 places in 433 ms
[2020-05-21 03:02:38] [INFO ] Deduced a trap composed of 42 places in 337 ms
[2020-05-21 03:02:39] [INFO ] Deduced a trap composed of 65 places in 249 ms
[2020-05-21 03:02:39] [INFO ] Deduced a trap composed of 64 places in 247 ms
[2020-05-21 03:02:39] [INFO ] Deduced a trap composed of 75 places in 263 ms
[2020-05-21 03:02:40] [INFO ] Deduced a trap composed of 74 places in 247 ms
[2020-05-21 03:02:40] [INFO ] Deduced a trap composed of 79 places in 249 ms
[2020-05-21 03:02:40] [INFO ] Deduced a trap composed of 65 places in 246 ms
[2020-05-21 03:02:41] [INFO ] Deduced a trap composed of 65 places in 292 ms
[2020-05-21 03:02:41] [INFO ] Deduced a trap composed of 65 places in 264 ms
[2020-05-21 03:02:41] [INFO ] Deduced a trap composed of 65 places in 278 ms
[2020-05-21 03:02:41] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 33149 ms
[2020-05-21 03:02:41] [INFO ] Computed and/alt/rep : 1774/14312/1438 causal constraints in 97 ms.
[2020-05-21 03:02:51] [INFO ] Added : 325 causal constraints over 65 iterations in 9956 ms. Result :unknown
[2020-05-21 03:02:51] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2020-05-21 03:02:51] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 03:02:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:02:53] [INFO ] [Real]Absence check using state equation in 1598 ms returned sat
[2020-05-21 03:02:53] [INFO ] [Real]Added 546 Read/Feed constraints in 83 ms returned sat
[2020-05-21 03:02:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:02:53] [INFO ] [Nat]Absence check using 23 positive place invariants in 30 ms returned sat
[2020-05-21 03:02:53] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 03:02:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:02:55] [INFO ] [Nat]Absence check using state equation in 1583 ms returned sat
[2020-05-21 03:02:55] [INFO ] [Nat]Added 546 Read/Feed constraints in 124 ms returned sat
[2020-05-21 03:02:56] [INFO ] Deduced a trap composed of 44 places in 479 ms
[2020-05-21 03:02:56] [INFO ] Deduced a trap composed of 12 places in 459 ms
[2020-05-21 03:02:57] [INFO ] Deduced a trap composed of 11 places in 484 ms
[2020-05-21 03:02:57] [INFO ] Deduced a trap composed of 44 places in 505 ms
[2020-05-21 03:02:58] [INFO ] Deduced a trap composed of 46 places in 518 ms
[2020-05-21 03:02:58] [INFO ] Deduced a trap composed of 33 places in 541 ms
[2020-05-21 03:02:59] [INFO ] Deduced a trap composed of 22 places in 523 ms
[2020-05-21 03:03:00] [INFO ] Deduced a trap composed of 37 places in 592 ms
[2020-05-21 03:03:00] [INFO ] Deduced a trap composed of 38 places in 536 ms
[2020-05-21 03:03:01] [INFO ] Deduced a trap composed of 22 places in 656 ms
[2020-05-21 03:03:01] [INFO ] Deduced a trap composed of 11 places in 532 ms
[2020-05-21 03:03:02] [INFO ] Deduced a trap composed of 11 places in 530 ms
[2020-05-21 03:03:03] [INFO ] Deduced a trap composed of 13 places in 481 ms
[2020-05-21 03:03:03] [INFO ] Deduced a trap composed of 13 places in 465 ms
[2020-05-21 03:03:04] [INFO ] Deduced a trap composed of 65 places in 449 ms
[2020-05-21 03:03:04] [INFO ] Deduced a trap composed of 60 places in 527 ms
[2020-05-21 03:03:05] [INFO ] Deduced a trap composed of 81 places in 582 ms
[2020-05-21 03:03:05] [INFO ] Deduced a trap composed of 47 places in 512 ms
[2020-05-21 03:03:06] [INFO ] Deduced a trap composed of 22 places in 456 ms
[2020-05-21 03:03:06] [INFO ] Deduced a trap composed of 22 places in 444 ms
[2020-05-21 03:03:07] [INFO ] Deduced a trap composed of 42 places in 460 ms
[2020-05-21 03:03:07] [INFO ] Deduced a trap composed of 22 places in 437 ms
[2020-05-21 03:03:08] [INFO ] Deduced a trap composed of 60 places in 453 ms
[2020-05-21 03:03:08] [INFO ] Deduced a trap composed of 36 places in 434 ms
[2020-05-21 03:03:09] [INFO ] Deduced a trap composed of 41 places in 424 ms
[2020-05-21 03:03:09] [INFO ] Deduced a trap composed of 32 places in 428 ms
[2020-05-21 03:03:10] [INFO ] Deduced a trap composed of 32 places in 466 ms
[2020-05-21 03:03:10] [INFO ] Deduced a trap composed of 23 places in 436 ms
[2020-05-21 03:03:11] [INFO ] Deduced a trap composed of 27 places in 447 ms
[2020-05-21 03:03:11] [INFO ] Deduced a trap composed of 31 places in 414 ms
[2020-05-21 03:03:12] [INFO ] Deduced a trap composed of 35 places in 410 ms
[2020-05-21 03:03:12] [INFO ] Deduced a trap composed of 104 places in 512 ms
[2020-05-21 03:03:13] [INFO ] Deduced a trap composed of 40 places in 450 ms
[2020-05-21 03:03:13] [INFO ] Deduced a trap composed of 26 places in 470 ms
[2020-05-21 03:03:14] [INFO ] Deduced a trap composed of 28 places in 407 ms
[2020-05-21 03:03:14] [INFO ] Deduced a trap composed of 22 places in 458 ms
[2020-05-21 03:03:15] [INFO ] Deduced a trap composed of 24 places in 463 ms
[2020-05-21 03:03:15] [INFO ] Deduced a trap composed of 25 places in 407 ms
[2020-05-21 03:03:16] [INFO ] Deduced a trap composed of 61 places in 406 ms
[2020-05-21 03:03:16] [INFO ] Deduced a trap composed of 25 places in 412 ms
[2020-05-21 03:03:17] [INFO ] Deduced a trap composed of 59 places in 412 ms
[2020-05-21 03:03:17] [INFO ] Deduced a trap composed of 25 places in 418 ms
[2020-05-21 03:03:18] [INFO ] Deduced a trap composed of 27 places in 403 ms
[2020-05-21 03:03:18] [INFO ] Deduced a trap composed of 74 places in 298 ms
[2020-05-21 03:03:18] [INFO ] Deduced a trap composed of 51 places in 303 ms
[2020-05-21 03:03:19] [INFO ] Deduced a trap composed of 27 places in 386 ms
[2020-05-21 03:03:19] [INFO ] Deduced a trap composed of 53 places in 364 ms
[2020-05-21 03:03:20] [INFO ] Deduced a trap composed of 51 places in 385 ms
[2020-05-21 03:03:20] [INFO ] Deduced a trap composed of 63 places in 390 ms
[2020-05-21 03:03:21] [INFO ] Deduced a trap composed of 74 places in 421 ms
[2020-05-21 03:03:21] [INFO ] Deduced a trap composed of 86 places in 346 ms
[2020-05-21 03:03:21] [INFO ] Deduced a trap composed of 63 places in 287 ms
[2020-05-21 03:03:22] [INFO ] Deduced a trap composed of 63 places in 298 ms
[2020-05-21 03:03:22] [INFO ] Deduced a trap composed of 63 places in 229 ms
[2020-05-21 03:03:22] [INFO ] Deduced a trap composed of 76 places in 286 ms
[2020-05-21 03:03:23] [INFO ] Deduced a trap composed of 74 places in 317 ms
[2020-05-21 03:03:23] [INFO ] Deduced a trap composed of 74 places in 273 ms
[2020-05-21 03:03:23] [INFO ] Deduced a trap composed of 63 places in 210 ms
[2020-05-21 03:03:24] [INFO ] Deduced a trap composed of 65 places in 222 ms
[2020-05-21 03:03:24] [INFO ] Deduced a trap composed of 63 places in 219 ms
[2020-05-21 03:03:25] [INFO ] Deduced a trap composed of 47 places in 428 ms
[2020-05-21 03:03:25] [INFO ] Deduced a trap composed of 51 places in 425 ms
[2020-05-21 03:03:26] [INFO ] Deduced a trap composed of 64 places in 436 ms
[2020-05-21 03:03:26] [INFO ] Deduced a trap composed of 42 places in 442 ms
[2020-05-21 03:03:27] [INFO ] Deduced a trap composed of 45 places in 458 ms
[2020-05-21 03:03:27] [INFO ] Deduced a trap composed of 38 places in 484 ms
[2020-05-21 03:03:28] [INFO ] Deduced a trap composed of 30 places in 461 ms
[2020-05-21 03:03:28] [INFO ] Deduced a trap composed of 22 places in 447 ms
[2020-05-21 03:03:29] [INFO ] Deduced a trap composed of 27 places in 479 ms
[2020-05-21 03:03:29] [INFO ] Deduced a trap composed of 63 places in 450 ms
[2020-05-21 03:03:30] [INFO ] Deduced a trap composed of 13 places in 400 ms
[2020-05-21 03:03:30] [INFO ] Deduced a trap composed of 15 places in 431 ms
[2020-05-21 03:03:31] [INFO ] Deduced a trap composed of 12 places in 403 ms
[2020-05-21 03:03:31] [INFO ] Deduced a trap composed of 23 places in 403 ms
[2020-05-21 03:03:32] [INFO ] Deduced a trap composed of 29 places in 401 ms
[2020-05-21 03:03:32] [INFO ] Deduced a trap composed of 57 places in 404 ms
[2020-05-21 03:03:32] [INFO ] Deduced a trap composed of 42 places in 356 ms
[2020-05-21 03:03:33] [INFO ] Deduced a trap composed of 33 places in 368 ms
[2020-05-21 03:03:33] [INFO ] Deduced a trap composed of 33 places in 366 ms
[2020-05-21 03:03:34] [INFO ] Deduced a trap composed of 34 places in 380 ms
[2020-05-21 03:03:34] [INFO ] Deduced a trap composed of 32 places in 340 ms
[2020-05-21 03:03:35] [INFO ] Deduced a trap composed of 75 places in 445 ms
[2020-05-21 03:03:35] [INFO ] Deduced a trap composed of 30 places in 421 ms
[2020-05-21 03:03:35] [INFO ] Deduced a trap composed of 45 places in 401 ms
[2020-05-21 03:03:36] [INFO ] Deduced a trap composed of 63 places in 440 ms
[2020-05-21 03:03:36] [INFO ] Deduced a trap composed of 50 places in 397 ms
[2020-05-21 03:03:37] [INFO ] Deduced a trap composed of 31 places in 399 ms
[2020-05-21 03:03:37] [INFO ] Deduced a trap composed of 55 places in 433 ms
[2020-05-21 03:03:38] [INFO ] Deduced a trap composed of 36 places in 404 ms
[2020-05-21 03:03:38] [INFO ] Deduced a trap composed of 57 places in 445 ms
[2020-05-21 03:03:38] [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 (> (+ s46 s59 s98 s105 s137 s159 s397 s400 s405 s412 s416 s420 s424 s431 s435 s451 s454 s459 s464 s472 s482 s486 s490 s497 s502 s505 s510 s518 s522 s526 s540 s544 s548 s552 s560 s563 s568 s572 s575 s580 s588 s590 s605 s611 s612 s616 s622 s628 s631 s634 s639 s645 s646 s649 s654 s670 s674) 0)") while checking expression at index 3
[2020-05-21 03:03:38] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2020-05-21 03:03:38] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 03:03:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:03:40] [INFO ] [Real]Absence check using state equation in 1530 ms returned sat
[2020-05-21 03:03:40] [INFO ] [Real]Added 546 Read/Feed constraints in 86 ms returned sat
[2020-05-21 03:03:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:03:40] [INFO ] [Nat]Absence check using 23 positive place invariants in 26 ms returned sat
[2020-05-21 03:03:40] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 03:03:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:03:42] [INFO ] [Nat]Absence check using state equation in 1335 ms returned sat
[2020-05-21 03:03:42] [INFO ] [Nat]Added 546 Read/Feed constraints in 107 ms returned sat
[2020-05-21 03:03:42] [INFO ] Deduced a trap composed of 35 places in 456 ms
[2020-05-21 03:03:43] [INFO ] Deduced a trap composed of 11 places in 475 ms
[2020-05-21 03:03:43] [INFO ] Deduced a trap composed of 53 places in 480 ms
[2020-05-21 03:03:44] [INFO ] Deduced a trap composed of 12 places in 454 ms
[2020-05-21 03:03:44] [INFO ] Deduced a trap composed of 25 places in 482 ms
[2020-05-21 03:03:45] [INFO ] Deduced a trap composed of 11 places in 464 ms
[2020-05-21 03:03:45] [INFO ] Deduced a trap composed of 12 places in 485 ms
[2020-05-21 03:03:46] [INFO ] Deduced a trap composed of 11 places in 497 ms
[2020-05-21 03:03:46] [INFO ] Deduced a trap composed of 11 places in 527 ms
[2020-05-21 03:03:47] [INFO ] Deduced a trap composed of 11 places in 551 ms
[2020-05-21 03:03:48] [INFO ] Deduced a trap composed of 46 places in 459 ms
[2020-05-21 03:03:48] [INFO ] Deduced a trap composed of 38 places in 460 ms
[2020-05-21 03:03:49] [INFO ] Deduced a trap composed of 38 places in 496 ms
[2020-05-21 03:03:49] [INFO ] Deduced a trap composed of 40 places in 462 ms
[2020-05-21 03:03:50] [INFO ] Deduced a trap composed of 22 places in 464 ms
[2020-05-21 03:03:50] [INFO ] Deduced a trap composed of 22 places in 469 ms
[2020-05-21 03:03:51] [INFO ] Deduced a trap composed of 39 places in 500 ms
[2020-05-21 03:03:51] [INFO ] Deduced a trap composed of 30 places in 483 ms
[2020-05-21 03:03:52] [INFO ] Deduced a trap composed of 22 places in 455 ms
[2020-05-21 03:03:52] [INFO ] Deduced a trap composed of 38 places in 422 ms
[2020-05-21 03:03:53] [INFO ] Deduced a trap composed of 35 places in 451 ms
[2020-05-21 03:03:53] [INFO ] Deduced a trap composed of 38 places in 466 ms
[2020-05-21 03:03:54] [INFO ] Deduced a trap composed of 22 places in 457 ms
[2020-05-21 03:03:54] [INFO ] Deduced a trap composed of 23 places in 469 ms
[2020-05-21 03:03:55] [INFO ] Deduced a trap composed of 30 places in 476 ms
[2020-05-21 03:03:55] [INFO ] Deduced a trap composed of 45 places in 519 ms
[2020-05-21 03:03:56] [INFO ] Deduced a trap composed of 45 places in 459 ms
[2020-05-21 03:03:56] [INFO ] Deduced a trap composed of 14 places in 477 ms
[2020-05-21 03:03:57] [INFO ] Deduced a trap composed of 11 places in 463 ms
[2020-05-21 03:03:57] [INFO ] Deduced a trap composed of 16 places in 447 ms
[2020-05-21 03:03:58] [INFO ] Deduced a trap composed of 54 places in 411 ms
[2020-05-21 03:03:58] [INFO ] Deduced a trap composed of 31 places in 480 ms
[2020-05-21 03:03:59] [INFO ] Deduced a trap composed of 65 places in 376 ms
[2020-05-21 03:03:59] [INFO ] Deduced a trap composed of 25 places in 452 ms
[2020-05-21 03:04:00] [INFO ] Deduced a trap composed of 21 places in 467 ms
[2020-05-21 03:04:00] [INFO ] Deduced a trap composed of 22 places in 442 ms
[2020-05-21 03:04:01] [INFO ] Deduced a trap composed of 56 places in 445 ms
[2020-05-21 03:04:01] [INFO ] Deduced a trap composed of 53 places in 449 ms
[2020-05-21 03:04:02] [INFO ] Deduced a trap composed of 35 places in 489 ms
[2020-05-21 03:04:03] [INFO ] Deduced a trap composed of 57 places in 482 ms
[2020-05-21 03:04:03] [INFO ] Deduced a trap composed of 68 places in 447 ms
[2020-05-21 03:04:04] [INFO ] Deduced a trap composed of 34 places in 435 ms
[2020-05-21 03:04:04] [INFO ] Deduced a trap composed of 34 places in 472 ms
[2020-05-21 03:04:05] [INFO ] Deduced a trap composed of 29 places in 443 ms
[2020-05-21 03:04:05] [INFO ] Deduced a trap composed of 35 places in 393 ms
[2020-05-21 03:04:05] [INFO ] Deduced a trap composed of 55 places in 331 ms
[2020-05-21 03:04:06] [INFO ] Deduced a trap composed of 55 places in 345 ms
[2020-05-21 03:04:06] [INFO ] Deduced a trap composed of 55 places in 361 ms
[2020-05-21 03:04:07] [INFO ] Deduced a trap composed of 55 places in 354 ms
[2020-05-21 03:04:07] [INFO ] Deduced a trap composed of 52 places in 364 ms
[2020-05-21 03:04:08] [INFO ] Deduced a trap composed of 64 places in 399 ms
[2020-05-21 03:04:08] [INFO ] Deduced a trap composed of 96 places in 395 ms
[2020-05-21 03:04:08] [INFO ] Deduced a trap composed of 92 places in 395 ms
[2020-05-21 03:04:09] [INFO ] Deduced a trap composed of 76 places in 293 ms
[2020-05-21 03:04:09] [INFO ] Deduced a trap composed of 75 places in 301 ms
[2020-05-21 03:04:09] [INFO ] Deduced a trap composed of 65 places in 271 ms
[2020-05-21 03:04:10] [INFO ] Deduced a trap composed of 85 places in 335 ms
[2020-05-21 03:04:10] [INFO ] Deduced a trap composed of 97 places in 323 ms
[2020-05-21 03:04:11] [INFO ] Deduced a trap composed of 65 places in 241 ms
[2020-05-21 03:04:11] [INFO ] Deduced a trap composed of 65 places in 230 ms
[2020-05-21 03:04:11] [INFO ] Deduced a trap composed of 82 places in 244 ms
[2020-05-21 03:04:11] [INFO ] Trap strengthening (SAT) tested/added 62/61 trap constraints in 29558 ms
[2020-05-21 03:04:11] [INFO ] Computed and/alt/rep : 1774/14312/1438 causal constraints in 107 ms.
[2020-05-21 03:04:25] [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 (=> (> t505 0) (and (> t67 0) (< o67 o505)))") while checking expression at index 4
[2020-05-21 03:04:25] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2020-05-21 03:04:25] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 03:04:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:04:27] [INFO ] [Real]Absence check using state equation in 1668 ms returned sat
[2020-05-21 03:04:27] [INFO ] [Real]Added 546 Read/Feed constraints in 80 ms returned sat
[2020-05-21 03:04:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:04:27] [INFO ] [Nat]Absence check using 23 positive place invariants in 37 ms returned sat
[2020-05-21 03:04:27] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 03:04:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:04:29] [INFO ] [Nat]Absence check using state equation in 1505 ms returned sat
[2020-05-21 03:04:29] [INFO ] [Nat]Added 546 Read/Feed constraints in 88 ms returned sat
[2020-05-21 03:04:29] [INFO ] Deduced a trap composed of 26 places in 491 ms
[2020-05-21 03:04:30] [INFO ] Deduced a trap composed of 13 places in 478 ms
[2020-05-21 03:04:30] [INFO ] Deduced a trap composed of 12 places in 471 ms
[2020-05-21 03:04:31] [INFO ] Deduced a trap composed of 23 places in 433 ms
[2020-05-21 03:04:31] [INFO ] Deduced a trap composed of 26 places in 441 ms
[2020-05-21 03:04:32] [INFO ] Deduced a trap composed of 28 places in 458 ms
[2020-05-21 03:04:32] [INFO ] Deduced a trap composed of 57 places in 473 ms
[2020-05-21 03:04:33] [INFO ] Deduced a trap composed of 14 places in 508 ms
[2020-05-21 03:04:34] [INFO ] Deduced a trap composed of 13 places in 471 ms
[2020-05-21 03:04:34] [INFO ] Deduced a trap composed of 14 places in 479 ms
[2020-05-21 03:04:35] [INFO ] Deduced a trap composed of 67 places in 635 ms
[2020-05-21 03:04:35] [INFO ] Deduced a trap composed of 37 places in 452 ms
[2020-05-21 03:04:36] [INFO ] Deduced a trap composed of 38 places in 410 ms
[2020-05-21 03:04:36] [INFO ] Deduced a trap composed of 49 places in 404 ms
[2020-05-21 03:04:37] [INFO ] Deduced a trap composed of 31 places in 453 ms
[2020-05-21 03:04:37] [INFO ] Deduced a trap composed of 74 places in 454 ms
[2020-05-21 03:04:38] [INFO ] Deduced a trap composed of 27 places in 432 ms
[2020-05-21 03:04:38] [INFO ] Deduced a trap composed of 29 places in 456 ms
[2020-05-21 03:04:39] [INFO ] Deduced a trap composed of 45 places in 426 ms
[2020-05-21 03:04:39] [INFO ] Deduced a trap composed of 16 places in 439 ms
[2020-05-21 03:04:40] [INFO ] Deduced a trap composed of 14 places in 411 ms
[2020-05-21 03:04:40] [INFO ] Deduced a trap composed of 64 places in 426 ms
[2020-05-21 03:04:41] [INFO ] Deduced a trap composed of 11 places in 432 ms
[2020-05-21 03:04:41] [INFO ] Deduced a trap composed of 16 places in 416 ms
[2020-05-21 03:04:42] [INFO ] Deduced a trap composed of 53 places in 378 ms
[2020-05-21 03:04:42] [INFO ] Deduced a trap composed of 51 places in 365 ms
[2020-05-21 03:04:42] [INFO ] Deduced a trap composed of 52 places in 356 ms
[2020-05-21 03:04:43] [INFO ] Deduced a trap composed of 76 places in 340 ms
[2020-05-21 03:04:43] [INFO ] Deduced a trap composed of 83 places in 325 ms
[2020-05-21 03:04:44] [INFO ] Deduced a trap composed of 64 places in 329 ms
[2020-05-21 03:04:44] [INFO ] Deduced a trap composed of 52 places in 357 ms
[2020-05-21 03:04:44] [INFO ] Deduced a trap composed of 74 places in 321 ms
[2020-05-21 03:04:45] [INFO ] Deduced a trap composed of 52 places in 330 ms
[2020-05-21 03:04:45] [INFO ] Deduced a trap composed of 46 places in 288 ms
[2020-05-21 03:04:45] [INFO ] Deduced a trap composed of 74 places in 311 ms
[2020-05-21 03:04:46] [INFO ] Deduced a trap composed of 55 places in 317 ms
[2020-05-21 03:04:46] [INFO ] Deduced a trap composed of 42 places in 275 ms
[2020-05-21 03:04:46] [INFO ] Deduced a trap composed of 44 places in 298 ms
[2020-05-21 03:04:47] [INFO ] Deduced a trap composed of 22 places in 424 ms
[2020-05-21 03:04:47] [INFO ] Deduced a trap composed of 37 places in 409 ms
[2020-05-21 03:04:48] [INFO ] Deduced a trap composed of 57 places in 368 ms
[2020-05-21 03:04:48] [INFO ] Deduced a trap composed of 53 places in 395 ms
[2020-05-21 03:04:49] [INFO ] Deduced a trap composed of 56 places in 418 ms
[2020-05-21 03:04:49] [INFO ] Deduced a trap composed of 45 places in 382 ms
[2020-05-21 03:04:50] [INFO ] Deduced a trap composed of 51 places in 406 ms
[2020-05-21 03:04:50] [INFO ] Deduced a trap composed of 52 places in 430 ms
[2020-05-21 03:04:51] [INFO ] Deduced a trap composed of 45 places in 358 ms
[2020-05-21 03:04:51] [INFO ] Deduced a trap composed of 83 places in 475 ms
[2020-05-21 03:04:52] [INFO ] Deduced a trap composed of 30 places in 378 ms
[2020-05-21 03:04:52] [INFO ] Deduced a trap composed of 35 places in 391 ms
[2020-05-21 03:04:52] [INFO ] Deduced a trap composed of 38 places in 419 ms
[2020-05-21 03:04:53] [INFO ] Deduced a trap composed of 34 places in 415 ms
[2020-05-21 03:04:53] [INFO ] Deduced a trap composed of 35 places in 409 ms
[2020-05-21 03:04:54] [INFO ] Deduced a trap composed of 68 places in 410 ms
[2020-05-21 03:04:54] [INFO ] Deduced a trap composed of 69 places in 383 ms
[2020-05-21 03:04:55] [INFO ] Deduced a trap composed of 35 places in 349 ms
[2020-05-21 03:04:55] [INFO ] Deduced a trap composed of 75 places in 408 ms
[2020-05-21 03:04:56] [INFO ] Deduced a trap composed of 35 places in 388 ms
[2020-05-21 03:04:56] [INFO ] Deduced a trap composed of 39 places in 389 ms
[2020-05-21 03:04:57] [INFO ] Deduced a trap composed of 34 places in 428 ms
[2020-05-21 03:04:57] [INFO ] Deduced a trap composed of 22 places in 427 ms
[2020-05-21 03:04:58] [INFO ] Deduced a trap composed of 36 places in 531 ms
[2020-05-21 03:04:58] [INFO ] Deduced a trap composed of 11 places in 527 ms
[2020-05-21 03:04:59] [INFO ] Deduced a trap composed of 76 places in 454 ms
[2020-05-21 03:04:59] [INFO ] Deduced a trap composed of 79 places in 335 ms
[2020-05-21 03:05:00] [INFO ] Deduced a trap composed of 98 places in 374 ms
[2020-05-21 03:05:00] [INFO ] Deduced a trap composed of 86 places in 370 ms
[2020-05-21 03:05:01] [INFO ] Deduced a trap composed of 69 places in 377 ms
[2020-05-21 03:05:01] [INFO ] Deduced a trap composed of 64 places in 379 ms
[2020-05-21 03:05:02] [INFO ] Deduced a trap composed of 62 places in 379 ms
[2020-05-21 03:05:02] [INFO ] Deduced a trap composed of 47 places in 409 ms
[2020-05-21 03:05:03] [INFO ] Deduced a trap composed of 36 places in 392 ms
[2020-05-21 03:05:03] [INFO ] Deduced a trap composed of 12 places in 394 ms
[2020-05-21 03:05:03] [INFO ] Deduced a trap composed of 22 places in 398 ms
[2020-05-21 03:05:04] [INFO ] Deduced a trap composed of 26 places in 360 ms
[2020-05-21 03:05:04] [INFO ] Deduced a trap composed of 30 places in 341 ms
[2020-05-21 03:05:05] [INFO ] Deduced a trap composed of 61 places in 454 ms
[2020-05-21 03:05:05] [INFO ] Deduced a trap composed of 56 places in 498 ms
[2020-05-21 03:05:06] [INFO ] Deduced a trap composed of 25 places in 461 ms
[2020-05-21 03:05:06] [INFO ] Deduced a trap composed of 44 places in 345 ms
[2020-05-21 03:05:07] [INFO ] Deduced a trap composed of 34 places in 408 ms
[2020-05-21 03:05:07] [INFO ] Deduced a trap composed of 32 places in 398 ms
[2020-05-21 03:05:08] [INFO ] Deduced a trap composed of 23 places in 472 ms
[2020-05-21 03:05:08] [INFO ] Deduced a trap composed of 12 places in 437 ms
[2020-05-21 03:05:09] [INFO ] Deduced a trap composed of 24 places in 441 ms
[2020-05-21 03:05:09] [INFO ] Deduced a trap composed of 25 places in 443 ms
[2020-05-21 03:05:10] [INFO ] Deduced a trap composed of 24 places in 485 ms
[2020-05-21 03:05:11] [INFO ] Deduced a trap composed of 74 places in 432 ms
[2020-05-21 03:05:11] [INFO ] Deduced a trap composed of 21 places in 431 ms
[2020-05-21 03:05:12] [INFO ] Deduced a trap composed of 65 places in 396 ms
[2020-05-21 03:05:12] [INFO ] Deduced a trap composed of 22 places in 417 ms
[2020-05-21 03:05:13] [INFO ] Deduced a trap composed of 61 places in 447 ms
[2020-05-21 03:05:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s2 s7 s9 s15 s17 s22 s24 s28 s30 s40 s97 s104 s113 s120 s134 s396 s398 s404 s406 s413 s415 s421 s423 s428 s430 s453 s455 s475 s479 s481 s487 s489 s496 s498 s504 s506 s511 s527 s529 s530 s541 s543 s549 s551 s562 s564 s569 s571 s577 s579 s591 s612 s622 s631 s639 s645 s646 s668 s671 s673) 0)") while checking expression at index 5
[2020-05-21 03:05:13] [INFO ] [Real]Absence check using 23 positive place invariants in 25 ms returned sat
[2020-05-21 03:05:13] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 03:05:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:05:14] [INFO ] [Real]Absence check using state equation in 1419 ms returned sat
[2020-05-21 03:05:14] [INFO ] [Real]Added 546 Read/Feed constraints in 93 ms returned sat
[2020-05-21 03:05:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:05:14] [INFO ] [Nat]Absence check using 23 positive place invariants in 34 ms returned sat
[2020-05-21 03:05:14] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 03:05:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:05:16] [INFO ] [Nat]Absence check using state equation in 1563 ms returned sat
[2020-05-21 03:05:16] [INFO ] [Nat]Added 546 Read/Feed constraints in 89 ms returned sat
[2020-05-21 03:05:17] [INFO ] Deduced a trap composed of 66 places in 522 ms
[2020-05-21 03:05:17] [INFO ] Deduced a trap composed of 15 places in 555 ms
[2020-05-21 03:05:18] [INFO ] Deduced a trap composed of 59 places in 543 ms
[2020-05-21 03:05:18] [INFO ] Deduced a trap composed of 13 places in 553 ms
[2020-05-21 03:05:19] [INFO ] Deduced a trap composed of 12 places in 539 ms
[2020-05-21 03:05:20] [INFO ] Deduced a trap composed of 43 places in 527 ms
[2020-05-21 03:05:20] [INFO ] Deduced a trap composed of 52 places in 463 ms
[2020-05-21 03:05:21] [INFO ] Deduced a trap composed of 27 places in 529 ms
[2020-05-21 03:05:21] [INFO ] Deduced a trap composed of 26 places in 509 ms
[2020-05-21 03:05:22] [INFO ] Deduced a trap composed of 45 places in 522 ms
[2020-05-21 03:05:22] [INFO ] Deduced a trap composed of 50 places in 536 ms
[2020-05-21 03:05:23] [INFO ] Deduced a trap composed of 13 places in 576 ms
[2020-05-21 03:05:24] [INFO ] Deduced a trap composed of 14 places in 526 ms
[2020-05-21 03:05:24] [INFO ] Deduced a trap composed of 14 places in 572 ms
[2020-05-21 03:05:25] [INFO ] Deduced a trap composed of 14 places in 551 ms
[2020-05-21 03:05:26] [INFO ] Deduced a trap composed of 64 places in 479 ms
[2020-05-21 03:05:26] [INFO ] Deduced a trap composed of 22 places in 518 ms
[2020-05-21 03:05:27] [INFO ] Deduced a trap composed of 22 places in 435 ms
[2020-05-21 03:05:27] [INFO ] Deduced a trap composed of 22 places in 517 ms
[2020-05-21 03:05:28] [INFO ] Deduced a trap composed of 37 places in 467 ms
[2020-05-21 03:05:28] [INFO ] Deduced a trap composed of 80 places in 491 ms
[2020-05-21 03:05:29] [INFO ] Deduced a trap composed of 53 places in 460 ms
[2020-05-21 03:05:29] [INFO ] Deduced a trap composed of 48 places in 458 ms
[2020-05-21 03:05:30] [INFO ] Deduced a trap composed of 34 places in 464 ms
[2020-05-21 03:05:30] [INFO ] Deduced a trap composed of 64 places in 505 ms
[2020-05-21 03:05:31] [INFO ] Deduced a trap composed of 35 places in 483 ms
[2020-05-21 03:05:32] [INFO ] Deduced a trap composed of 34 places in 525 ms
[2020-05-21 03:05:32] [INFO ] Deduced a trap composed of 22 places in 496 ms
[2020-05-21 03:05:33] [INFO ] Deduced a trap composed of 38 places in 464 ms
[2020-05-21 03:05:33] [INFO ] Deduced a trap composed of 27 places in 492 ms
[2020-05-21 03:05:34] [INFO ] Deduced a trap composed of 19 places in 476 ms
[2020-05-21 03:05:34] [INFO ] Deduced a trap composed of 47 places in 398 ms
[2020-05-21 03:05:35] [INFO ] Deduced a trap composed of 35 places in 461 ms
[2020-05-21 03:05:35] [INFO ] Deduced a trap composed of 15 places in 514 ms
[2020-05-21 03:05:36] [INFO ] Deduced a trap composed of 13 places in 496 ms
[2020-05-21 03:05:36] [INFO ] Deduced a trap composed of 56 places in 485 ms
[2020-05-21 03:05:37] [INFO ] Deduced a trap composed of 16 places in 524 ms
[2020-05-21 03:05:37] [INFO ] Deduced a trap composed of 47 places in 497 ms
[2020-05-21 03:05:38] [INFO ] Deduced a trap composed of 28 places in 415 ms
[2020-05-21 03:05:38] [INFO ] Deduced a trap composed of 37 places in 404 ms
[2020-05-21 03:05:39] [INFO ] Deduced a trap composed of 26 places in 390 ms
[2020-05-21 03:05:39] [INFO ] Deduced a trap composed of 29 places in 470 ms
[2020-05-21 03:05:39] [INFO ] Trap strengthening (SAT) tested/added 43/42 trap constraints in 23446 ms
[2020-05-21 03:05:40] [INFO ] Computed and/alt/rep : 1774/14312/1438 causal constraints in 99 ms.
[2020-05-21 03:05:59] [INFO ] Added : 580 causal constraints over 116 iterations in 19813 ms. Result :unknown
[2020-05-21 03:05:59] [INFO ] [Real]Absence check using 23 positive place invariants in 31 ms returned sat
[2020-05-21 03:05:59] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 03:05:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:06:01] [INFO ] [Real]Absence check using state equation in 1469 ms returned sat
[2020-05-21 03:06:01] [INFO ] [Real]Added 546 Read/Feed constraints in 69 ms returned sat
[2020-05-21 03:06:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:06:01] [INFO ] [Nat]Absence check using 23 positive place invariants in 35 ms returned sat
[2020-05-21 03:06:01] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 03:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:06:03] [INFO ] [Nat]Absence check using state equation in 1488 ms returned sat
[2020-05-21 03:06:03] [INFO ] [Nat]Added 546 Read/Feed constraints in 86 ms returned sat
[2020-05-21 03:06:03] [INFO ] Deduced a trap composed of 63 places in 481 ms
[2020-05-21 03:06:04] [INFO ] Deduced a trap composed of 46 places in 470 ms
[2020-05-21 03:06:04] [INFO ] Deduced a trap composed of 47 places in 505 ms
[2020-05-21 03:06:05] [INFO ] Deduced a trap composed of 61 places in 486 ms
[2020-05-21 03:06:05] [INFO ] Deduced a trap composed of 24 places in 481 ms
[2020-05-21 03:06:06] [INFO ] Deduced a trap composed of 24 places in 519 ms
[2020-05-21 03:06:06] [INFO ] Deduced a trap composed of 42 places in 440 ms
[2020-05-21 03:06:07] [INFO ] Deduced a trap composed of 59 places in 445 ms
[2020-05-21 03:06:07] [INFO ] Deduced a trap composed of 12 places in 439 ms
[2020-05-21 03:06:08] [INFO ] Deduced a trap composed of 11 places in 497 ms
[2020-05-21 03:06:09] [INFO ] Deduced a trap composed of 57 places in 492 ms
[2020-05-21 03:06:09] [INFO ] Deduced a trap composed of 102 places in 466 ms
[2020-05-21 03:06:10] [INFO ] Deduced a trap composed of 19 places in 468 ms
[2020-05-21 03:06:10] [INFO ] Deduced a trap composed of 13 places in 448 ms
[2020-05-21 03:06:11] [INFO ] Deduced a trap composed of 11 places in 465 ms
[2020-05-21 03:06:11] [INFO ] Deduced a trap composed of 11 places in 377 ms
[2020-05-21 03:06:12] [INFO ] Deduced a trap composed of 54 places in 437 ms
[2020-05-21 03:06:12] [INFO ] Deduced a trap composed of 59 places in 463 ms
[2020-05-21 03:06:13] [INFO ] Deduced a trap composed of 32 places in 388 ms
[2020-05-21 03:06:13] [INFO ] Deduced a trap composed of 59 places in 467 ms
[2020-05-21 03:06:14] [INFO ] Deduced a trap composed of 74 places in 401 ms
[2020-05-21 03:06:14] [INFO ] Deduced a trap composed of 39 places in 390 ms
[2020-05-21 03:06:15] [INFO ] Deduced a trap composed of 50 places in 406 ms
[2020-05-21 03:06:15] [INFO ] Deduced a trap composed of 43 places in 486 ms
[2020-05-21 03:06:16] [INFO ] Deduced a trap composed of 31 places in 420 ms
[2020-05-21 03:06:16] [INFO ] Deduced a trap composed of 46 places in 476 ms
[2020-05-21 03:06:17] [INFO ] Deduced a trap composed of 38 places in 429 ms
[2020-05-21 03:06:17] [INFO ] Deduced a trap composed of 35 places in 527 ms
[2020-05-21 03:06:18] [INFO ] Deduced a trap composed of 34 places in 554 ms
[2020-05-21 03:06:18] [INFO ] Deduced a trap composed of 35 places in 541 ms
[2020-05-21 03:06:19] [INFO ] Deduced a trap composed of 49 places in 511 ms
[2020-05-21 03:06:20] [INFO ] Deduced a trap composed of 17 places in 499 ms
[2020-05-21 03:06:20] [INFO ] Deduced a trap composed of 16 places in 517 ms
[2020-05-21 03:06:21] [INFO ] Deduced a trap composed of 13 places in 546 ms
[2020-05-21 03:06:21] [INFO ] Deduced a trap composed of 40 places in 424 ms
[2020-05-21 03:06:22] [INFO ] Deduced a trap composed of 76 places in 485 ms
[2020-05-21 03:06:22] [INFO ] Deduced a trap composed of 60 places in 477 ms
[2020-05-21 03:06:23] [INFO ] Deduced a trap composed of 35 places in 458 ms
[2020-05-21 03:06:23] [INFO ] Deduced a trap composed of 53 places in 512 ms
[2020-05-21 03:06:24] [INFO ] Deduced a trap composed of 59 places in 541 ms
[2020-05-21 03:06:25] [INFO ] Deduced a trap composed of 13 places in 499 ms
[2020-05-21 03:06:25] [INFO ] Deduced a trap composed of 12 places in 509 ms
[2020-05-21 03:06:26] [INFO ] Deduced a trap composed of 45 places in 461 ms
[2020-05-21 03:06:26] [INFO ] Deduced a trap composed of 37 places in 453 ms
[2020-05-21 03:06:27] [INFO ] Deduced a trap composed of 34 places in 567 ms
[2020-05-21 03:06:27] [INFO ] Deduced a trap composed of 24 places in 485 ms
[2020-05-21 03:06:28] [INFO ] Deduced a trap composed of 22 places in 491 ms
[2020-05-21 03:06:28] [INFO ] Deduced a trap composed of 21 places in 466 ms
[2020-05-21 03:06:29] [INFO ] Deduced a trap composed of 34 places in 488 ms
[2020-05-21 03:06:30] [INFO ] Deduced a trap composed of 32 places in 496 ms
[2020-05-21 03:06:30] [INFO ] Deduced a trap composed of 121 places in 412 ms
[2020-05-21 03:06:31] [INFO ] Deduced a trap composed of 44 places in 435 ms
[2020-05-21 03:06:31] [INFO ] Deduced a trap composed of 104 places in 407 ms
[2020-05-21 03:06:32] [INFO ] Deduced a trap composed of 49 places in 422 ms
[2020-05-21 03:06:32] [INFO ] Deduced a trap composed of 112 places in 377 ms
[2020-05-21 03:06:32] [INFO ] Deduced a trap composed of 59 places in 344 ms
[2020-05-21 03:06:33] [INFO ] Deduced a trap composed of 45 places in 405 ms
[2020-05-21 03:06:33] [INFO ] Deduced a trap composed of 88 places in 390 ms
[2020-05-21 03:06:34] [INFO ] Deduced a trap composed of 44 places in 342 ms
[2020-05-21 03:06:34] [INFO ] Deduced a trap composed of 47 places in 459 ms
[2020-05-21 03:06:35] [INFO ] Deduced a trap composed of 55 places in 440 ms
[2020-05-21 03:06:35] [INFO ] Deduced a trap composed of 35 places in 418 ms
[2020-05-21 03:06:36] [INFO ] Deduced a trap composed of 65 places in 374 ms
[2020-05-21 03:06:36] [INFO ] Deduced a trap composed of 80 places in 379 ms
[2020-05-21 03:06:36] [INFO ] Deduced a trap composed of 62 places in 342 ms
[2020-05-21 03:06:37] [INFO ] Deduced a trap composed of 48 places in 327 ms
[2020-05-21 03:06:37] [INFO ] Deduced a trap composed of 56 places in 325 ms
[2020-05-21 03:06:38] [INFO ] Deduced a trap composed of 56 places in 321 ms
[2020-05-21 03:06:38] [INFO ] Deduced a trap composed of 56 places in 289 ms
[2020-05-21 03:06:38] [INFO ] Deduced a trap composed of 56 places in 323 ms
[2020-05-21 03:06:39] [INFO ] Deduced a trap composed of 56 places in 324 ms
[2020-05-21 03:06:39] [INFO ] Deduced a trap composed of 56 places in 301 ms
[2020-05-21 03:06:39] [INFO ] Deduced a trap composed of 77 places in 239 ms
[2020-05-21 03:06:40] [INFO ] Deduced a trap composed of 79 places in 253 ms
[2020-05-21 03:06:40] [INFO ] Trap strengthening (SAT) tested/added 75/74 trap constraints in 37126 ms
[2020-05-21 03:06:40] [INFO ] Computed and/alt/rep : 1774/14312/1438 causal constraints in 95 ms.
[2020-05-21 03:06:46] [INFO ] Added : 210 causal constraints over 42 iterations in 6186 ms. Result :unknown
[2020-05-21 03:06:46] [INFO ] [Real]Absence check using 23 positive place invariants in 35 ms returned sat
[2020-05-21 03:06:46] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 03:06:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:06:48] [INFO ] [Real]Absence check using state equation in 1649 ms returned sat
[2020-05-21 03:06:48] [INFO ] [Real]Added 546 Read/Feed constraints in 120 ms returned sat
[2020-05-21 03:06:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:06:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 52 ms returned sat
[2020-05-21 03:06:48] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 03:06:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:06:50] [INFO ] [Nat]Absence check using state equation in 1484 ms returned sat
[2020-05-21 03:06:50] [INFO ] [Nat]Added 546 Read/Feed constraints in 94 ms returned sat
[2020-05-21 03:06:50] [INFO ] Deduced a trap composed of 32 places in 439 ms
[2020-05-21 03:06:51] [INFO ] Deduced a trap composed of 12 places in 495 ms
[2020-05-21 03:06:51] [INFO ] Deduced a trap composed of 25 places in 374 ms
[2020-05-21 03:06:52] [INFO ] Deduced a trap composed of 32 places in 441 ms
[2020-05-21 03:06:52] [INFO ] Deduced a trap composed of 24 places in 468 ms
[2020-05-21 03:06:53] [INFO ] Deduced a trap composed of 58 places in 532 ms
[2020-05-21 03:06:53] [INFO ] Deduced a trap composed of 37 places in 486 ms
[2020-05-21 03:06:54] [INFO ] Deduced a trap composed of 37 places in 437 ms
[2020-05-21 03:06:54] [INFO ] Deduced a trap composed of 55 places in 409 ms
[2020-05-21 03:06:55] [INFO ] Deduced a trap composed of 65 places in 417 ms
[2020-05-21 03:06:55] [INFO ] Deduced a trap composed of 35 places in 426 ms
[2020-05-21 03:06:56] [INFO ] Deduced a trap composed of 55 places in 473 ms
[2020-05-21 03:06:56] [INFO ] Deduced a trap composed of 35 places in 487 ms
[2020-05-21 03:06:57] [INFO ] Deduced a trap composed of 22 places in 452 ms
[2020-05-21 03:06:57] [INFO ] Deduced a trap composed of 45 places in 488 ms
[2020-05-21 03:06:58] [INFO ] Deduced a trap composed of 44 places in 436 ms
[2020-05-21 03:06:58] [INFO ] Deduced a trap composed of 106 places in 454 ms
[2020-05-21 03:06:59] [INFO ] Deduced a trap composed of 35 places in 430 ms
[2020-05-21 03:06:59] [INFO ] Deduced a trap composed of 55 places in 426 ms
[2020-05-21 03:07:00] [INFO ] Deduced a trap composed of 35 places in 444 ms
[2020-05-21 03:07:00] [INFO ] Deduced a trap composed of 75 places in 443 ms
[2020-05-21 03:07:01] [INFO ] Deduced a trap composed of 35 places in 375 ms
[2020-05-21 03:07:01] [INFO ] Deduced a trap composed of 45 places in 358 ms
[2020-05-21 03:07:02] [INFO ] Deduced a trap composed of 45 places in 363 ms
[2020-05-21 03:07:02] [INFO ] Deduced a trap composed of 35 places in 369 ms
[2020-05-21 03:07:02] [INFO ] Deduced a trap composed of 34 places in 358 ms
[2020-05-21 03:07:03] [INFO ] Deduced a trap composed of 13 places in 394 ms
[2020-05-21 03:07:03] [INFO ] Deduced a trap composed of 56 places in 400 ms
[2020-05-21 03:07:04] [INFO ] Deduced a trap composed of 12 places in 380 ms
[2020-05-21 03:07:04] [INFO ] Deduced a trap composed of 12 places in 406 ms
[2020-05-21 03:07:05] [INFO ] Deduced a trap composed of 12 places in 382 ms
[2020-05-21 03:07:05] [INFO ] Deduced a trap composed of 45 places in 455 ms
[2020-05-21 03:07:06] [INFO ] Deduced a trap composed of 15 places in 420 ms
[2020-05-21 03:07:06] [INFO ] Deduced a trap composed of 65 places in 312 ms
[2020-05-21 03:07:06] [INFO ] Deduced a trap composed of 55 places in 320 ms
[2020-05-21 03:07:07] [INFO ] Deduced a trap composed of 55 places in 347 ms
[2020-05-21 03:07:07] [INFO ] Deduced a trap composed of 55 places in 282 ms
[2020-05-21 03:07:08] [INFO ] Deduced a trap composed of 61 places in 403 ms
[2020-05-21 03:07:08] [INFO ] Deduced a trap composed of 76 places in 396 ms
[2020-05-21 03:07:08] [INFO ] Deduced a trap composed of 47 places in 338 ms
[2020-05-21 03:07:09] [INFO ] Deduced a trap composed of 70 places in 379 ms
[2020-05-21 03:07:09] [INFO ] Deduced a trap composed of 69 places in 294 ms
[2020-05-21 03:07:10] [INFO ] Deduced a trap composed of 69 places in 329 ms
[2020-05-21 03:07:10] [INFO ] Deduced a trap composed of 69 places in 375 ms
[2020-05-21 03:07:10] [INFO ] Deduced a trap composed of 45 places in 356 ms
[2020-05-21 03:07:11] [INFO ] Deduced a trap composed of 45 places in 378 ms
[2020-05-21 03:07:11] [INFO ] Deduced a trap composed of 16 places in 468 ms
[2020-05-21 03:07:12] [INFO ] Deduced a trap composed of 61 places in 371 ms
[2020-05-21 03:07:12] [INFO ] Trap strengthening (SAT) tested/added 49/48 trap constraints in 22285 ms
[2020-05-21 03:07:12] [INFO ] Computed and/alt/rep : 1774/14312/1438 causal constraints in 78 ms.
[2020-05-21 03:07:32] [INFO ] Added : 580 causal constraints over 116 iterations in 20135 ms.(timeout) Result :sat
[2020-05-21 03:07:33] [INFO ] Deduced a trap composed of 24 places in 387 ms
[2020-05-21 03:07:33] [INFO ] Deduced a trap composed of 46 places in 350 ms
[2020-05-21 03:07:33] [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 (> (+ s2 s5 s9 s11 s17 s51 s54 s57 s61 s64 s96 s103 s107 s116 s122 s193 s200 s214 s233 s269 s276 s411 s413 s418 s421 s430 s481 s484 s489 s492 s520 s527 s541 s546 s549 s579 s582 s609 s611 s616 s619 s634 s649 s654 s661 s671) 0)") while checking expression at index 8
Incomplete Parikh walk after 366100 steps, including 1000 resets, run finished after 1186 ms. (steps per millisecond=308 ) properties seen :[1, 1, 1, 0, 0, 0, 0, 0, 1] could not realise parikh vector
FORMULA Peterson-PT-7-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Peterson-PT-7-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 326400 steps, including 1000 resets, run finished after 970 ms. (steps per millisecond=336 ) properties seen :[0, 0, 0, 0, 1] could not realise parikh vector
FORMULA Peterson-PT-7-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 353400 steps, including 1000 resets, run finished after 1013 ms. (steps per millisecond=348 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 13 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 1782/1782 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 678 transition count 1770
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 666 transition count 1770
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 24 place count 666 transition count 1761
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 42 place count 657 transition count 1761
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 154 place count 601 transition count 1705
Applied a total of 154 rules in 169 ms. Remains 601 /678 variables (removed 77) and now considering 1705/1782 (removed 77) transitions.
Finished structural reductions, in 1 iterations. Remains : 601/678 places, 1705/1782 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2589 ms. (steps per millisecond=386 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 787 ms. (steps per millisecond=1270 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 623 ms. (steps per millisecond=1605 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 590 ms. (steps per millisecond=1694 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 596 ms. (steps per millisecond=1677 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 8776845 steps, run timeout after 30001 ms. (steps per millisecond=292 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 8776845 steps, saw 975206 distinct states, run finished after 30001 ms. (steps per millisecond=292 ) properties seen :[0, 0, 0, 0]
[2020-05-21 03:08:12] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
// Phase 1: matrix 1369 rows 601 cols
[2020-05-21 03:08:12] [INFO ] Computed 31 place invariants in 11 ms
[2020-05-21 03:08:12] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2020-05-21 03:08:12] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-21 03:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:08:13] [INFO ] [Real]Absence check using state equation in 1241 ms returned sat
[2020-05-21 03:08:13] [INFO ] State equation strengthened by 546 read => feed constraints.
[2020-05-21 03:08:13] [INFO ] [Real]Added 546 Read/Feed constraints in 97 ms returned sat
[2020-05-21 03:08:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:08:13] [INFO ] [Nat]Absence check using 23 positive place invariants in 30 ms returned sat
[2020-05-21 03:08:13] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 7 ms returned sat
[2020-05-21 03:08:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:08:15] [INFO ] [Nat]Absence check using state equation in 1358 ms returned sat
[2020-05-21 03:08:15] [INFO ] [Nat]Added 546 Read/Feed constraints in 126 ms returned sat
[2020-05-21 03:08:15] [INFO ] Deduced a trap composed of 11 places in 457 ms
[2020-05-21 03:08:16] [INFO ] Deduced a trap composed of 14 places in 439 ms
[2020-05-21 03:08:16] [INFO ] Deduced a trap composed of 92 places in 443 ms
[2020-05-21 03:08:17] [INFO ] Deduced a trap composed of 48 places in 418 ms
[2020-05-21 03:08:17] [INFO ] Deduced a trap composed of 37 places in 472 ms
[2020-05-21 03:08:18] [INFO ] Deduced a trap composed of 22 places in 456 ms
[2020-05-21 03:08:18] [INFO ] Deduced a trap composed of 25 places in 472 ms
[2020-05-21 03:08:19] [INFO ] Deduced a trap composed of 22 places in 449 ms
[2020-05-21 03:08:19] [INFO ] Deduced a trap composed of 71 places in 501 ms
[2020-05-21 03:08:20] [INFO ] Deduced a trap composed of 22 places in 439 ms
[2020-05-21 03:08:20] [INFO ] Deduced a trap composed of 22 places in 453 ms
[2020-05-21 03:08:21] [INFO ] Deduced a trap composed of 22 places in 438 ms
[2020-05-21 03:08:21] [INFO ] Deduced a trap composed of 22 places in 472 ms
[2020-05-21 03:08:22] [INFO ] Deduced a trap composed of 32 places in 406 ms
[2020-05-21 03:08:22] [INFO ] Deduced a trap composed of 40 places in 433 ms
[2020-05-21 03:08:23] [INFO ] Deduced a trap composed of 31 places in 407 ms
[2020-05-21 03:08:23] [INFO ] Deduced a trap composed of 32 places in 400 ms
[2020-05-21 03:08:24] [INFO ] Deduced a trap composed of 70 places in 386 ms
[2020-05-21 03:08:24] [INFO ] Deduced a trap composed of 33 places in 422 ms
[2020-05-21 03:08:25] [INFO ] Deduced a trap composed of 52 places in 443 ms
[2020-05-21 03:08:25] [INFO ] Deduced a trap composed of 70 places in 420 ms
[2020-05-21 03:08:25] [INFO ] Deduced a trap composed of 61 places in 378 ms
[2020-05-21 03:08:26] [INFO ] Deduced a trap composed of 40 places in 374 ms
[2020-05-21 03:08:26] [INFO ] Deduced a trap composed of 66 places in 398 ms
[2020-05-21 03:08:27] [INFO ] Deduced a trap composed of 57 places in 378 ms
[2020-05-21 03:08:27] [INFO ] Deduced a trap composed of 31 places in 372 ms
[2020-05-21 03:08:28] [INFO ] Deduced a trap composed of 56 places in 408 ms
[2020-05-21 03:08:28] [INFO ] Deduced a trap composed of 33 places in 360 ms
[2020-05-21 03:08:29] [INFO ] Deduced a trap composed of 32 places in 410 ms
[2020-05-21 03:08:29] [INFO ] Deduced a trap composed of 15 places in 410 ms
[2020-05-21 03:08:30] [INFO ] Deduced a trap composed of 12 places in 420 ms
[2020-05-21 03:08:30] [INFO ] Deduced a trap composed of 12 places in 413 ms
[2020-05-21 03:08:30] [INFO ] Deduced a trap composed of 41 places in 432 ms
[2020-05-21 03:08:31] [INFO ] Deduced a trap composed of 12 places in 437 ms
[2020-05-21 03:08:31] [INFO ] Deduced a trap composed of 11 places in 443 ms
[2020-05-21 03:08:32] [INFO ] Deduced a trap composed of 52 places in 386 ms
[2020-05-21 03:08:32] [INFO ] Deduced a trap composed of 12 places in 363 ms
[2020-05-21 03:08:33] [INFO ] Deduced a trap composed of 14 places in 354 ms
[2020-05-21 03:08:33] [INFO ] Deduced a trap composed of 22 places in 404 ms
[2020-05-21 03:08:34] [INFO ] Deduced a trap composed of 11 places in 394 ms
[2020-05-21 03:08:34] [INFO ] Deduced a trap composed of 51 places in 322 ms
[2020-05-21 03:08:34] [INFO ] Deduced a trap composed of 40 places in 333 ms
[2020-05-21 03:08:35] [INFO ] Deduced a trap composed of 44 places in 336 ms
[2020-05-21 03:08:35] [INFO ] Deduced a trap composed of 67 places in 341 ms
[2020-05-21 03:08:35] [INFO ] Trap strengthening (SAT) tested/added 45/44 trap constraints in 20517 ms
[2020-05-21 03:08:35] [INFO ] Computed and/alt/rep : 1697/14249/1361 causal constraints in 101 ms.
[2020-05-21 03:08:55] [INFO ] Added : 645 causal constraints over 129 iterations in 20210 ms.(timeout) Result :sat
[2020-05-21 03:08:56] [INFO ] Deduced a trap composed of 16 places in 376 ms
[2020-05-21 03:08:56] [INFO ] Deduced a trap composed of 41 places in 368 ms
[2020-05-21 03:08:57] [INFO ] Deduced a trap composed of 41 places in 371 ms
[2020-05-21 03:08:57] [INFO ] Deduced a trap composed of 25 places in 382 ms
[2020-05-21 03:08:58] [INFO ] Deduced a trap composed of 32 places in 369 ms
[2020-05-21 03:08:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2708 ms
Attempting to minimize the solution found.
Minimization took 1 ms.
[2020-05-21 03:08:58] [INFO ] [Real]Absence check using 23 positive place invariants in 27 ms returned sat
[2020-05-21 03:08:58] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2020-05-21 03:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:09:00] [INFO ] [Real]Absence check using state equation in 1297 ms returned sat
[2020-05-21 03:09:00] [INFO ] [Real]Added 546 Read/Feed constraints in 74 ms returned sat
[2020-05-21 03:09:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:09:00] [INFO ] [Nat]Absence check using 23 positive place invariants in 31 ms returned sat
[2020-05-21 03:09:00] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-21 03:09:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:09:01] [INFO ] [Nat]Absence check using state equation in 1226 ms returned sat
[2020-05-21 03:09:01] [INFO ] [Nat]Added 546 Read/Feed constraints in 117 ms returned sat
[2020-05-21 03:09:02] [INFO ] Deduced a trap composed of 48 places in 392 ms
[2020-05-21 03:09:02] [INFO ] Deduced a trap composed of 50 places in 354 ms
[2020-05-21 03:09:02] [INFO ] Deduced a trap composed of 12 places in 377 ms
[2020-05-21 03:09:03] [INFO ] Deduced a trap composed of 43 places in 331 ms
[2020-05-21 03:09:03] [INFO ] Deduced a trap composed of 41 places in 360 ms
[2020-05-21 03:09:04] [INFO ] Deduced a trap composed of 42 places in 362 ms
[2020-05-21 03:09:04] [INFO ] Deduced a trap composed of 39 places in 349 ms
[2020-05-21 03:09:04] [INFO ] Deduced a trap composed of 39 places in 357 ms
[2020-05-21 03:09:05] [INFO ] Deduced a trap composed of 21 places in 326 ms
[2020-05-21 03:09:05] [INFO ] Deduced a trap composed of 30 places in 325 ms
[2020-05-21 03:09:06] [INFO ] Deduced a trap composed of 22 places in 311 ms
[2020-05-21 03:09:06] [INFO ] Deduced a trap composed of 33 places in 317 ms
[2020-05-21 03:09:06] [INFO ] Deduced a trap composed of 21 places in 347 ms
[2020-05-21 03:09:07] [INFO ] Deduced a trap composed of 33 places in 363 ms
[2020-05-21 03:09:07] [INFO ] Deduced a trap composed of 47 places in 363 ms
[2020-05-21 03:09:08] [INFO ] Deduced a trap composed of 47 places in 363 ms
[2020-05-21 03:09:08] [INFO ] Deduced a trap composed of 52 places in 360 ms
[2020-05-21 03:09:08] [INFO ] Deduced a trap composed of 21 places in 385 ms
[2020-05-21 03:09:09] [INFO ] Deduced a trap composed of 58 places in 336 ms
[2020-05-21 03:09:09] [INFO ] Deduced a trap composed of 50 places in 346 ms
[2020-05-21 03:09:10] [INFO ] Deduced a trap composed of 77 places in 339 ms
[2020-05-21 03:09:10] [INFO ] Deduced a trap composed of 74 places in 376 ms
[2020-05-21 03:09:10] [INFO ] Deduced a trap composed of 31 places in 350 ms
[2020-05-21 03:09:11] [INFO ] Deduced a trap composed of 74 places in 353 ms
[2020-05-21 03:09:11] [INFO ] Deduced a trap composed of 39 places in 379 ms
[2020-05-21 03:09:12] [INFO ] Deduced a trap composed of 30 places in 386 ms
[2020-05-21 03:09:12] [INFO ] Deduced a trap composed of 23 places in 376 ms
[2020-05-21 03:09:13] [INFO ] Deduced a trap composed of 23 places in 337 ms
[2020-05-21 03:09:13] [INFO ] Deduced a trap composed of 39 places in 369 ms
[2020-05-21 03:09:13] [INFO ] Deduced a trap composed of 67 places in 332 ms
[2020-05-21 03:09:14] [INFO ] Deduced a trap composed of 59 places in 371 ms
[2020-05-21 03:09:14] [INFO ] Deduced a trap composed of 74 places in 374 ms
[2020-05-21 03:09:15] [INFO ] Deduced a trap composed of 39 places in 362 ms
[2020-05-21 03:09:15] [INFO ] Deduced a trap composed of 42 places in 347 ms
[2020-05-21 03:09:15] [INFO ] Deduced a trap composed of 46 places in 405 ms
[2020-05-21 03:09:16] [INFO ] Deduced a trap composed of 19 places in 424 ms
[2020-05-21 03:09:16] [INFO ] Trap strengthening (SAT) tested/added 37/36 trap constraints in 14851 ms
[2020-05-21 03:09:16] [INFO ] Computed and/alt/rep : 1697/14249/1361 causal constraints in 79 ms.
[2020-05-21 03:09:36] [INFO ] Added : 595 causal constraints over 119 iterations in 20124 ms.(timeout) Result :sat
[2020-05-21 03:09:36] [INFO ] Deduced a trap composed of 40 places in 307 ms
[2020-05-21 03:09:37] [INFO ] Deduced a trap composed of 57 places in 321 ms
[2020-05-21 03:09:37] [INFO ] Deduced a trap composed of 63 places in 363 ms
[2020-05-21 03:09:38] [INFO ] Deduced a trap composed of 58 places in 322 ms
[2020-05-21 03:09:38] [INFO ] Deduced a trap composed of 58 places in 329 ms
[2020-05-21 03:09:39] [INFO ] Deduced a trap composed of 30 places in 352 ms
[2020-05-21 03:09:39] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3000 ms
Attempting to minimize the solution found.
Minimization took 123 ms.
[2020-05-21 03:09:39] [INFO ] [Real]Absence check using 23 positive place invariants in 28 ms returned sat
[2020-05-21 03:09:39] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 4 ms returned sat
[2020-05-21 03:09:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:09:41] [INFO ] [Real]Absence check using state equation in 1259 ms returned sat
[2020-05-21 03:09:41] [INFO ] [Real]Added 546 Read/Feed constraints in 83 ms returned sat
[2020-05-21 03:09:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:09:41] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2020-05-21 03:09:41] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 5 ms returned sat
[2020-05-21 03:09:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:09:42] [INFO ] [Nat]Absence check using state equation in 1234 ms returned sat
[2020-05-21 03:09:42] [INFO ] [Nat]Added 546 Read/Feed constraints in 113 ms returned sat
[2020-05-21 03:09:43] [INFO ] Deduced a trap composed of 30 places in 389 ms
[2020-05-21 03:09:43] [INFO ] Deduced a trap composed of 11 places in 409 ms
[2020-05-21 03:09:44] [INFO ] Deduced a trap composed of 13 places in 377 ms
[2020-05-21 03:09:44] [INFO ] Deduced a trap composed of 12 places in 377 ms
[2020-05-21 03:09:45] [INFO ] Deduced a trap composed of 21 places in 386 ms
[2020-05-21 03:09:45] [INFO ] Deduced a trap composed of 16 places in 419 ms
[2020-05-21 03:09:45] [INFO ] Deduced a trap composed of 12 places in 372 ms
[2020-05-21 03:09:46] [INFO ] Deduced a trap composed of 41 places in 363 ms
[2020-05-21 03:09:46] [INFO ] Deduced a trap composed of 41 places in 367 ms
[2020-05-21 03:09:47] [INFO ] Deduced a trap composed of 45 places in 357 ms
[2020-05-21 03:09:47] [INFO ] Deduced a trap composed of 21 places in 332 ms
[2020-05-21 03:09:47] [INFO ] Deduced a trap composed of 23 places in 362 ms
[2020-05-21 03:09:48] [INFO ] Deduced a trap composed of 30 places in 322 ms
[2020-05-21 03:09:48] [INFO ] Deduced a trap composed of 39 places in 339 ms
[2020-05-21 03:09:49] [INFO ] Deduced a trap composed of 22 places in 393 ms
[2020-05-21 03:09:49] [INFO ] Deduced a trap composed of 39 places in 319 ms
[2020-05-21 03:09:49] [INFO ] Deduced a trap composed of 39 places in 314 ms
[2020-05-21 03:09:50] [INFO ] Deduced a trap composed of 43 places in 314 ms
[2020-05-21 03:09:50] [INFO ] Deduced a trap composed of 59 places in 288 ms
[2020-05-21 03:09:50] [INFO ] Deduced a trap composed of 50 places in 307 ms
[2020-05-21 03:09:51] [INFO ] Deduced a trap composed of 60 places in 326 ms
[2020-05-21 03:09:51] [INFO ] Deduced a trap composed of 60 places in 279 ms
[2020-05-21 03:09:52] [INFO ] Deduced a trap composed of 51 places in 304 ms
[2020-05-21 03:09:52] [INFO ] Deduced a trap composed of 61 places in 301 ms
[2020-05-21 03:09:52] [INFO ] Deduced a trap composed of 59 places in 260 ms
[2020-05-21 03:09:53] [INFO ] Deduced a trap composed of 57 places in 272 ms
[2020-05-21 03:09:53] [INFO ] Deduced a trap composed of 59 places in 262 ms
[2020-05-21 03:09:53] [INFO ] Deduced a trap composed of 59 places in 316 ms
[2020-05-21 03:09:54] [INFO ] Deduced a trap composed of 59 places in 348 ms
[2020-05-21 03:09:54] [INFO ] Deduced a trap composed of 40 places in 368 ms
[2020-05-21 03:09:54] [INFO ] Deduced a trap composed of 21 places in 354 ms
[2020-05-21 03:09:55] [INFO ] Deduced a trap composed of 22 places in 363 ms
[2020-05-21 03:09:55] [INFO ] Deduced a trap composed of 50 places in 351 ms
[2020-05-21 03:09:56] [INFO ] Deduced a trap composed of 60 places in 334 ms
[2020-05-21 03:09:56] [INFO ] Deduced a trap composed of 50 places in 349 ms
[2020-05-21 03:09:56] [INFO ] Deduced a trap composed of 12 places in 370 ms
[2020-05-21 03:09:57] [INFO ] Deduced a trap composed of 56 places in 353 ms
[2020-05-21 03:09:57] [INFO ] Deduced a trap composed of 16 places in 385 ms
[2020-05-21 03:09:58] [INFO ] Deduced a trap composed of 13 places in 368 ms
[2020-05-21 03:09:58] [INFO ] Deduced a trap composed of 14 places in 390 ms
[2020-05-21 03:09:59] [INFO ] Deduced a trap composed of 66 places in 336 ms
[2020-05-21 03:09:59] [INFO ] Deduced a trap composed of 57 places in 359 ms
[2020-05-21 03:09:59] [INFO ] Deduced a trap composed of 57 places in 327 ms
[2020-05-21 03:10:00] [INFO ] Deduced a trap composed of 50 places in 345 ms
[2020-05-21 03:10:00] [INFO ] Deduced a trap composed of 21 places in 389 ms
[2020-05-21 03:10:01] [INFO ] Deduced a trap composed of 52 places in 343 ms
[2020-05-21 03:10:01] [INFO ] Deduced a trap composed of 31 places in 316 ms
[2020-05-21 03:10:01] [INFO ] Deduced a trap composed of 48 places in 326 ms
[2020-05-21 03:10:02] [INFO ] Deduced a trap composed of 30 places in 316 ms
[2020-05-21 03:10:02] [INFO ] Deduced a trap composed of 31 places in 349 ms
[2020-05-21 03:10:03] [INFO ] Deduced a trap composed of 31 places in 335 ms
[2020-05-21 03:10:03] [INFO ] Deduced a trap composed of 30 places in 349 ms
[2020-05-21 03:10:03] [INFO ] Deduced a trap composed of 19 places in 355 ms
[2020-05-21 03:10:04] [INFO ] Deduced a trap composed of 52 places in 311 ms
[2020-05-21 03:10:04] [INFO ] Deduced a trap composed of 50 places in 271 ms
[2020-05-21 03:10:05] [INFO ] Deduced a trap composed of 25 places in 329 ms
[2020-05-21 03:10:05] [INFO ] Deduced a trap composed of 23 places in 345 ms
[2020-05-21 03:10:05] [INFO ] Deduced a trap composed of 66 places in 305 ms
[2020-05-21 03:10:06] [INFO ] Deduced a trap composed of 38 places in 271 ms
[2020-05-21 03:10:06] [INFO ] Deduced a trap composed of 66 places in 198 ms
[2020-05-21 03:10:06] [INFO ] Deduced a trap composed of 67 places in 234 ms
[2020-05-21 03:10:07] [INFO ] Deduced a trap composed of 66 places in 199 ms
[2020-05-21 03:10:07] [INFO ] Deduced a trap composed of 66 places in 213 ms
[2020-05-21 03:10:07] [INFO ] Deduced a trap composed of 66 places in 215 ms
[2020-05-21 03:10:07] [INFO ] Trap strengthening (SAT) tested/added 65/64 trap constraints in 24772 ms
[2020-05-21 03:10:07] [INFO ] Computed and/alt/rep : 1697/14249/1361 causal constraints in 106 ms.
[2020-05-21 03:10:26] [INFO ] Added : 545 causal constraints over 109 iterations in 18767 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-21 03:10:26] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2020-05-21 03:10:26] [INFO ] [Real]Absence check using 23 positive and 8 generalized place invariants in 6 ms returned sat
[2020-05-21 03:10:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:10:27] [INFO ] [Real]Absence check using state equation in 1326 ms returned sat
[2020-05-21 03:10:27] [INFO ] [Real]Added 546 Read/Feed constraints in 86 ms returned sat
[2020-05-21 03:10:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:10:28] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2020-05-21 03:10:28] [INFO ] [Nat]Absence check using 23 positive and 8 generalized place invariants in 3 ms returned sat
[2020-05-21 03:10:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:10:29] [INFO ] [Nat]Absence check using state equation in 1134 ms returned sat
[2020-05-21 03:10:29] [INFO ] [Nat]Added 546 Read/Feed constraints in 73 ms returned sat
[2020-05-21 03:10:29] [INFO ] Deduced a trap composed of 26 places in 327 ms
[2020-05-21 03:10:30] [INFO ] Deduced a trap composed of 21 places in 326 ms
[2020-05-21 03:10:30] [INFO ] Deduced a trap composed of 25 places in 298 ms
[2020-05-21 03:10:30] [INFO ] Deduced a trap composed of 26 places in 346 ms
[2020-05-21 03:10:31] [INFO ] Deduced a trap composed of 55 places in 358 ms
[2020-05-21 03:10:31] [INFO ] Deduced a trap composed of 60 places in 377 ms
[2020-05-21 03:10:31] [INFO ] Deduced a trap composed of 25 places in 334 ms
[2020-05-21 03:10:32] [INFO ] Deduced a trap composed of 25 places in 327 ms
[2020-05-21 03:10:32] [INFO ] Deduced a trap composed of 15 places in 313 ms
[2020-05-21 03:10:33] [INFO ] Deduced a trap composed of 11 places in 363 ms
[2020-05-21 03:10:33] [INFO ] Deduced a trap composed of 13 places in 380 ms
[2020-05-21 03:10:33] [INFO ] Deduced a trap composed of 13 places in 363 ms
[2020-05-21 03:10:34] [INFO ] Deduced a trap composed of 13 places in 338 ms
[2020-05-21 03:10:34] [INFO ] Deduced a trap composed of 12 places in 347 ms
[2020-05-21 03:10:35] [INFO ] Deduced a trap composed of 14 places in 354 ms
[2020-05-21 03:10:35] [INFO ] Deduced a trap composed of 11 places in 369 ms
[2020-05-21 03:10:36] [INFO ] Deduced a trap composed of 101 places in 388 ms
[2020-05-21 03:10:36] [INFO ] Deduced a trap composed of 30 places in 379 ms
[2020-05-21 03:10:36] [INFO ] Deduced a trap composed of 44 places in 346 ms
[2020-05-21 03:10:37] [INFO ] Deduced a trap composed of 31 places in 352 ms
[2020-05-21 03:10:37] [INFO ] Deduced a trap composed of 78 places in 368 ms
[2020-05-21 03:10:38] [INFO ] Deduced a trap composed of 19 places in 315 ms
[2020-05-21 03:10:38] [INFO ] Deduced a trap composed of 31 places in 317 ms
[2020-05-21 03:10:38] [INFO ] Deduced a trap composed of 87 places in 349 ms
[2020-05-21 03:10:39] [INFO ] Deduced a trap composed of 35 places in 342 ms
[2020-05-21 03:10:39] [INFO ] Deduced a trap composed of 82 places in 340 ms
[2020-05-21 03:10:39] [INFO ] Deduced a trap composed of 51 places in 287 ms
[2020-05-21 03:10:40] [INFO ] Deduced a trap composed of 49 places in 368 ms
[2020-05-21 03:10:40] [INFO ] Deduced a trap composed of 59 places in 393 ms
[2020-05-21 03:10:41] [INFO ] Deduced a trap composed of 79 places in 344 ms
[2020-05-21 03:10:41] [INFO ] Deduced a trap composed of 60 places in 379 ms
[2020-05-21 03:10:42] [INFO ] Deduced a trap composed of 60 places in 388 ms
[2020-05-21 03:10:42] [INFO ] Deduced a trap composed of 50 places in 441 ms
[2020-05-21 03:10:43] [INFO ] Deduced a trap composed of 35 places in 397 ms
[2020-05-21 03:10:43] [INFO ] Deduced a trap composed of 30 places in 383 ms
[2020-05-21 03:10:43] [INFO ] Deduced a trap composed of 40 places in 375 ms
[2020-05-21 03:10:44] [INFO ] Deduced a trap composed of 79 places in 484 ms
[2020-05-21 03:10:44] [INFO ] Deduced a trap composed of 69 places in 406 ms
[2020-05-21 03:10:45] [INFO ] Deduced a trap composed of 85 places in 370 ms
[2020-05-21 03:10:45] [INFO ] Deduced a trap composed of 66 places in 382 ms
[2020-05-21 03:10:46] [INFO ] Deduced a trap composed of 40 places in 376 ms
[2020-05-21 03:10:46] [INFO ] Deduced a trap composed of 39 places in 419 ms
[2020-05-21 03:10:47] [INFO ] Deduced a trap composed of 45 places in 369 ms
[2020-05-21 03:10:47] [INFO ] Deduced a trap composed of 49 places in 353 ms
[2020-05-21 03:10:47] [INFO ] Deduced a trap composed of 12 places in 390 ms
[2020-05-21 03:10:48] [INFO ] Deduced a trap composed of 12 places in 386 ms
[2020-05-21 03:10:48] [INFO ] Deduced a trap composed of 23 places in 378 ms
[2020-05-21 03:10:49] [INFO ] Deduced a trap composed of 38 places in 384 ms
[2020-05-21 03:10:49] [INFO ] Deduced a trap composed of 29 places in 438 ms
[2020-05-21 03:10:50] [INFO ] Deduced a trap composed of 37 places in 442 ms
[2020-05-21 03:10:50] [INFO ] Deduced a trap composed of 12 places in 469 ms
[2020-05-21 03:10:51] [INFO ] Deduced a trap composed of 21 places in 359 ms
[2020-05-21 03:10:51] [INFO ] Deduced a trap composed of 36 places in 383 ms
[2020-05-21 03:10:52] [INFO ] Deduced a trap composed of 43 places in 452 ms
[2020-05-21 03:10:52] [INFO ] Deduced a trap composed of 52 places in 343 ms
[2020-05-21 03:10:53] [INFO ] Deduced a trap composed of 38 places in 424 ms
[2020-05-21 03:10:53] [INFO ] Deduced a trap composed of 80 places in 437 ms
[2020-05-21 03:10:53] [INFO ] Deduced a trap composed of 13 places in 361 ms
[2020-05-21 03:10:54] [INFO ] Deduced a trap composed of 57 places in 282 ms
[2020-05-21 03:10:54] [INFO ] Deduced a trap composed of 58 places in 240 ms
[2020-05-21 03:10:54] [INFO ] Deduced a trap composed of 49 places in 229 ms
[2020-05-21 03:10:55] [INFO ] Deduced a trap composed of 64 places in 313 ms
[2020-05-21 03:10:55] [INFO ] Deduced a trap composed of 38 places in 306 ms
[2020-05-21 03:10:55] [INFO ] Deduced a trap composed of 51 places in 248 ms
[2020-05-21 03:10:56] [INFO ] Deduced a trap composed of 11 places in 383 ms
[2020-05-21 03:10:56] [INFO ] Deduced a trap composed of 59 places in 343 ms
[2020-05-21 03:10:57] [INFO ] Deduced a trap composed of 61 places in 348 ms
[2020-05-21 03:10:57] [INFO ] Deduced a trap composed of 39 places in 380 ms
[2020-05-21 03:10:57] [INFO ] Deduced a trap composed of 48 places in 340 ms
[2020-05-21 03:10:58] [INFO ] Deduced a trap composed of 45 places in 344 ms
[2020-05-21 03:10:58] [INFO ] Deduced a trap composed of 67 places in 297 ms
[2020-05-21 03:10:59] [INFO ] Deduced a trap composed of 58 places in 219 ms
[2020-05-21 03:10:59] [INFO ] Deduced a trap composed of 59 places in 230 ms
[2020-05-21 03:10:59] [INFO ] Deduced a trap composed of 70 places in 228 ms
[2020-05-21 03:10:59] [INFO ] Deduced a trap composed of 59 places in 214 ms
[2020-05-21 03:11:00] [INFO ] Deduced a trap composed of 60 places in 232 ms
[2020-05-21 03:11:00] [INFO ] Deduced a trap composed of 59 places in 226 ms
[2020-05-21 03:11:00] [INFO ] Trap strengthening (SAT) tested/added 78/77 trap constraints in 31390 ms
[2020-05-21 03:11:00] [INFO ] Computed and/alt/rep : 1697/14249/1361 causal constraints in 109 ms.
[2020-05-21 03:11:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t473 0) (and (> t140 0) (< o140 o473)))") while checking expression at index 3
Incomplete Parikh walk after 225900 steps, including 1000 resets, run finished after 649 ms. (steps per millisecond=348 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 13 out of 601 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 601/601 places, 1705/1705 transitions.
Applied a total of 0 rules in 29 ms. Remains 601 /601 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 601/601 places, 1705/1705 transitions.
Starting structural reductions, iteration 0 : 601/601 places, 1705/1705 transitions.
Applied a total of 0 rules in 28 ms. Remains 601 /601 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
[2020-05-21 03:11:13] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
// Phase 1: matrix 1369 rows 601 cols
[2020-05-21 03:11:13] [INFO ] Computed 31 place invariants in 5 ms
[2020-05-21 03:11:14] [INFO ] Implicit Places using invariants in 1261 ms returned [585, 586, 587, 588, 589, 598, 599, 600]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1266 ms to find 8 implicit places.
[2020-05-21 03:11:15] [INFO ] Redundant transitions in 241 ms returned []
[2020-05-21 03:11:15] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
// Phase 1: matrix 1369 rows 593 cols
[2020-05-21 03:11:15] [INFO ] Computed 23 place invariants in 14 ms
[2020-05-21 03:11:18] [INFO ] Dead Transitions using invariants and state equation in 2856 ms returned []
Starting structural reductions, iteration 1 : 593/601 places, 1705/1705 transitions.
Applied a total of 0 rules in 42 ms. Remains 593 /593 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
[2020-05-21 03:11:18] [INFO ] Redundant transitions in 37 ms returned []
[2020-05-21 03:11:18] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
// Phase 1: matrix 1369 rows 593 cols
[2020-05-21 03:11:18] [INFO ] Computed 23 place invariants in 5 ms
[2020-05-21 03:11:21] [INFO ] Dead Transitions using invariants and state equation in 2803 ms returned []
Finished structural reductions, in 2 iterations. Remains : 593/601 places, 1705/1705 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2788 ms. (steps per millisecond=358 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 793 ms. (steps per millisecond=1261 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 666 ms. (steps per millisecond=1501 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 637 ms. (steps per millisecond=1569 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 8180802 steps, run timeout after 30001 ms. (steps per millisecond=272 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 8180802 steps, saw 908979 distinct states, run finished after 30001 ms. (steps per millisecond=272 ) properties seen :[0, 0, 0, 0]
[2020-05-21 03:11:56] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
// Phase 1: matrix 1369 rows 593 cols
[2020-05-21 03:11:56] [INFO ] Computed 23 place invariants in 4 ms
[2020-05-21 03:11:56] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2020-05-21 03:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:11:57] [INFO ] [Real]Absence check using state equation in 1124 ms returned sat
[2020-05-21 03:11:57] [INFO ] State equation strengthened by 546 read => feed constraints.
[2020-05-21 03:11:57] [INFO ] [Real]Added 546 Read/Feed constraints in 117 ms returned sat
[2020-05-21 03:11:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:11:58] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2020-05-21 03:11:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:11:59] [INFO ] [Nat]Absence check using state equation in 1193 ms returned sat
[2020-05-21 03:11:59] [INFO ] [Nat]Added 546 Read/Feed constraints in 91 ms returned sat
[2020-05-21 03:11:59] [INFO ] Deduced a trap composed of 13 places in 466 ms
[2020-05-21 03:12:00] [INFO ] Deduced a trap composed of 46 places in 479 ms
[2020-05-21 03:12:00] [INFO ] Deduced a trap composed of 46 places in 538 ms
[2020-05-21 03:12:01] [INFO ] Deduced a trap composed of 23 places in 497 ms
[2020-05-21 03:12:02] [INFO ] Deduced a trap composed of 35 places in 459 ms
[2020-05-21 03:12:02] [INFO ] Deduced a trap composed of 49 places in 482 ms
[2020-05-21 03:12:03] [INFO ] Deduced a trap composed of 34 places in 483 ms
[2020-05-21 03:12:03] [INFO ] Deduced a trap composed of 45 places in 452 ms
[2020-05-21 03:12:04] [INFO ] Deduced a trap composed of 80 places in 446 ms
[2020-05-21 03:12:04] [INFO ] Deduced a trap composed of 22 places in 459 ms
[2020-05-21 03:12:05] [INFO ] Deduced a trap composed of 45 places in 422 ms
[2020-05-21 03:12:05] [INFO ] Deduced a trap composed of 51 places in 449 ms
[2020-05-21 03:12:06] [INFO ] Deduced a trap composed of 16 places in 454 ms
[2020-05-21 03:12:06] [INFO ] Deduced a trap composed of 43 places in 426 ms
[2020-05-21 03:12:07] [INFO ] Deduced a trap composed of 42 places in 398 ms
[2020-05-21 03:12:07] [INFO ] Deduced a trap composed of 47 places in 395 ms
[2020-05-21 03:12:07] [INFO ] Deduced a trap composed of 39 places in 378 ms
[2020-05-21 03:12:08] [INFO ] Deduced a trap composed of 11 places in 365 ms
[2020-05-21 03:12:08] [INFO ] Deduced a trap composed of 11 places in 377 ms
[2020-05-21 03:12:09] [INFO ] Deduced a trap composed of 16 places in 394 ms
[2020-05-21 03:12:09] [INFO ] Deduced a trap composed of 13 places in 420 ms
[2020-05-21 03:12:10] [INFO ] Deduced a trap composed of 55 places in 441 ms
[2020-05-21 03:12:10] [INFO ] Deduced a trap composed of 11 places in 415 ms
[2020-05-21 03:12:11] [INFO ] Deduced a trap composed of 41 places in 436 ms
[2020-05-21 03:12:11] [INFO ] Deduced a trap composed of 33 places in 455 ms
[2020-05-21 03:12:12] [INFO ] Deduced a trap composed of 67 places in 492 ms
[2020-05-21 03:12:12] [INFO ] Deduced a trap composed of 34 places in 447 ms
[2020-05-21 03:12:13] [INFO ] Deduced a trap composed of 13 places in 406 ms
[2020-05-21 03:12:13] [INFO ] Deduced a trap composed of 31 places in 389 ms
[2020-05-21 03:12:13] [INFO ] Deduced a trap composed of 56 places in 386 ms
[2020-05-21 03:12:14] [INFO ] Deduced a trap composed of 49 places in 390 ms
[2020-05-21 03:12:14] [INFO ] Deduced a trap composed of 29 places in 406 ms
[2020-05-21 03:12:15] [INFO ] Deduced a trap composed of 33 places in 459 ms
[2020-05-21 03:12:15] [INFO ] Deduced a trap composed of 33 places in 442 ms
[2020-05-21 03:12:16] [INFO ] Deduced a trap composed of 27 places in 466 ms
[2020-05-21 03:12:16] [INFO ] Deduced a trap composed of 45 places in 441 ms
[2020-05-21 03:12:17] [INFO ] Deduced a trap composed of 21 places in 408 ms
[2020-05-21 03:12:17] [INFO ] Deduced a trap composed of 53 places in 384 ms
[2020-05-21 03:12:18] [INFO ] Deduced a trap composed of 63 places in 399 ms
[2020-05-21 03:12:18] [INFO ] Deduced a trap composed of 28 places in 468 ms
[2020-05-21 03:12:19] [INFO ] Deduced a trap composed of 24 places in 420 ms
[2020-05-21 03:12:19] [INFO ] Deduced a trap composed of 51 places in 425 ms
[2020-05-21 03:12:20] [INFO ] Deduced a trap composed of 23 places in 375 ms
[2020-05-21 03:12:20] [INFO ] Deduced a trap composed of 32 places in 415 ms
[2020-05-21 03:12:20] [INFO ] Deduced a trap composed of 20 places in 381 ms
[2020-05-21 03:12:21] [INFO ] Deduced a trap composed of 20 places in 513 ms
[2020-05-21 03:12:22] [INFO ] Deduced a trap composed of 27 places in 427 ms
[2020-05-21 03:12:22] [INFO ] Deduced a trap composed of 23 places in 414 ms
[2020-05-21 03:12:22] [INFO ] Deduced a trap composed of 53 places in 395 ms
[2020-05-21 03:12:23] [INFO ] Deduced a trap composed of 24 places in 411 ms
[2020-05-21 03:12:23] [INFO ] Deduced a trap composed of 71 places in 330 ms
[2020-05-21 03:12:24] [INFO ] Deduced a trap composed of 57 places in 303 ms
[2020-05-21 03:12:24] [INFO ] Deduced a trap composed of 66 places in 314 ms
[2020-05-21 03:12:24] [INFO ] Deduced a trap composed of 41 places in 289 ms
[2020-05-21 03:12:25] [INFO ] Deduced a trap composed of 45 places in 388 ms
[2020-05-21 03:12:25] [INFO ] Deduced a trap composed of 71 places in 338 ms
[2020-05-21 03:12:26] [INFO ] Deduced a trap composed of 39 places in 338 ms
[2020-05-21 03:12:26] [INFO ] Deduced a trap composed of 44 places in 318 ms
[2020-05-21 03:12:26] [INFO ] Deduced a trap composed of 52 places in 284 ms
[2020-05-21 03:12:27] [INFO ] Deduced a trap composed of 58 places in 163 ms
[2020-05-21 03:12:27] [INFO ] Deduced a trap composed of 49 places in 181 ms
[2020-05-21 03:12:27] [INFO ] Deduced a trap composed of 71 places in 250 ms
[2020-05-21 03:12:27] [INFO ] Trap strengthening (SAT) tested/added 63/62 trap constraints in 28286 ms
[2020-05-21 03:12:27] [INFO ] Computed and/alt/rep : 1697/14249/1361 causal constraints in 101 ms.
[2020-05-21 03:12:42] [INFO ] Added : 455 causal constraints over 91 iterations in 15329 ms. Result :(error "Failed to check-sat")
[2020-05-21 03:12:43] [INFO ] [Real]Absence check using 23 positive place invariants in 30 ms returned sat
[2020-05-21 03:12:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:12:44] [INFO ] [Real]Absence check using state equation in 1253 ms returned sat
[2020-05-21 03:12:44] [INFO ] [Real]Added 546 Read/Feed constraints in 116 ms returned sat
[2020-05-21 03:12:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:12:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 28 ms returned sat
[2020-05-21 03:12:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:12:45] [INFO ] [Nat]Absence check using state equation in 1198 ms returned sat
[2020-05-21 03:12:45] [INFO ] [Nat]Added 546 Read/Feed constraints in 91 ms returned sat
[2020-05-21 03:12:46] [INFO ] Deduced a trap composed of 16 places in 365 ms
[2020-05-21 03:12:46] [INFO ] Deduced a trap composed of 12 places in 351 ms
[2020-05-21 03:12:47] [INFO ] Deduced a trap composed of 16 places in 388 ms
[2020-05-21 03:12:47] [INFO ] Deduced a trap composed of 16 places in 365 ms
[2020-05-21 03:12:47] [INFO ] Deduced a trap composed of 16 places in 357 ms
[2020-05-21 03:12:48] [INFO ] Deduced a trap composed of 13 places in 378 ms
[2020-05-21 03:12:48] [INFO ] Deduced a trap composed of 13 places in 332 ms
[2020-05-21 03:12:49] [INFO ] Deduced a trap composed of 55 places in 353 ms
[2020-05-21 03:12:49] [INFO ] Deduced a trap composed of 58 places in 370 ms
[2020-05-21 03:12:50] [INFO ] Deduced a trap composed of 30 places in 383 ms
[2020-05-21 03:12:50] [INFO ] Deduced a trap composed of 25 places in 391 ms
[2020-05-21 03:12:50] [INFO ] Deduced a trap composed of 41 places in 365 ms
[2020-05-21 03:12:51] [INFO ] Deduced a trap composed of 22 places in 354 ms
[2020-05-21 03:12:51] [INFO ] Deduced a trap composed of 57 places in 371 ms
[2020-05-21 03:12:52] [INFO ] Deduced a trap composed of 41 places in 367 ms
[2020-05-21 03:12:52] [INFO ] Deduced a trap composed of 57 places in 371 ms
[2020-05-21 03:12:53] [INFO ] Deduced a trap composed of 57 places in 354 ms
[2020-05-21 03:12:53] [INFO ] Deduced a trap composed of 41 places in 330 ms
[2020-05-21 03:12:53] [INFO ] Deduced a trap composed of 42 places in 353 ms
[2020-05-21 03:12:54] [INFO ] Deduced a trap composed of 41 places in 348 ms
[2020-05-21 03:12:54] [INFO ] Deduced a trap composed of 25 places in 352 ms
[2020-05-21 03:12:55] [INFO ] Deduced a trap composed of 45 places in 350 ms
[2020-05-21 03:12:55] [INFO ] Deduced a trap composed of 45 places in 357 ms
[2020-05-21 03:12:55] [INFO ] Deduced a trap composed of 32 places in 335 ms
[2020-05-21 03:12:56] [INFO ] Deduced a trap composed of 21 places in 376 ms
[2020-05-21 03:12:56] [INFO ] Deduced a trap composed of 66 places in 385 ms
[2020-05-21 03:12:57] [INFO ] Deduced a trap composed of 23 places in 354 ms
[2020-05-21 03:12:57] [INFO ] Deduced a trap composed of 55 places in 292 ms
[2020-05-21 03:12:57] [INFO ] Deduced a trap composed of 23 places in 339 ms
[2020-05-21 03:12:58] [INFO ] Deduced a trap composed of 23 places in 344 ms
[2020-05-21 03:12:58] [INFO ] Deduced a trap composed of 25 places in 373 ms
[2020-05-21 03:12:59] [INFO ] Deduced a trap composed of 12 places in 331 ms
[2020-05-21 03:12:59] [INFO ] Deduced a trap composed of 27 places in 334 ms
[2020-05-21 03:12:59] [INFO ] Deduced a trap composed of 21 places in 359 ms
[2020-05-21 03:13:00] [INFO ] Deduced a trap composed of 25 places in 334 ms
[2020-05-21 03:13:00] [INFO ] Deduced a trap composed of 19 places in 396 ms
[2020-05-21 03:13:01] [INFO ] Deduced a trap composed of 32 places in 303 ms
[2020-05-21 03:13:01] [INFO ] Deduced a trap composed of 35 places in 316 ms
[2020-05-21 03:13:01] [INFO ] Deduced a trap composed of 30 places in 311 ms
[2020-05-21 03:13:02] [INFO ] Deduced a trap composed of 30 places in 303 ms
[2020-05-21 03:13:02] [INFO ] Deduced a trap composed of 35 places in 258 ms
[2020-05-21 03:13:02] [INFO ] Deduced a trap composed of 30 places in 347 ms
[2020-05-21 03:13:03] [INFO ] Deduced a trap composed of 11 places in 384 ms
[2020-05-21 03:13:03] [INFO ] Deduced a trap composed of 31 places in 277 ms
[2020-05-21 03:13:04] [INFO ] Deduced a trap composed of 32 places in 310 ms
[2020-05-21 03:13:04] [INFO ] Deduced a trap composed of 40 places in 326 ms
[2020-05-21 03:13:04] [INFO ] Deduced a trap composed of 31 places in 324 ms
[2020-05-21 03:13:05] [INFO ] Deduced a trap composed of 40 places in 280 ms
[2020-05-21 03:13:05] [INFO ] Deduced a trap composed of 45 places in 277 ms
[2020-05-21 03:13:05] [INFO ] Deduced a trap composed of 58 places in 276 ms
[2020-05-21 03:13:06] [INFO ] Deduced a trap composed of 58 places in 299 ms
[2020-05-21 03:13:06] [INFO ] Deduced a trap composed of 40 places in 262 ms
[2020-05-21 03:13:07] [INFO ] Deduced a trap composed of 11 places in 402 ms
[2020-05-21 03:13:07] [INFO ] Deduced a trap composed of 82 places in 299 ms
[2020-05-21 03:13:07] [INFO ] Deduced a trap composed of 45 places in 298 ms
[2020-05-21 03:13:08] [INFO ] Deduced a trap composed of 40 places in 276 ms
[2020-05-21 03:13:08] [INFO ] Deduced a trap composed of 58 places in 329 ms
[2020-05-21 03:13:08] [INFO ] Deduced a trap composed of 39 places in 311 ms
[2020-05-21 03:13:09] [INFO ] Deduced a trap composed of 58 places in 249 ms
[2020-05-21 03:13:09] [INFO ] Deduced a trap composed of 49 places in 271 ms
[2020-05-21 03:13:09] [INFO ] Deduced a trap composed of 49 places in 259 ms
[2020-05-21 03:13:10] [INFO ] Deduced a trap composed of 70 places in 284 ms
[2020-05-21 03:13:10] [INFO ] Deduced a trap composed of 48 places in 243 ms
[2020-05-21 03:13:10] [INFO ] Deduced a trap composed of 49 places in 245 ms
[2020-05-21 03:13:11] [INFO ] Deduced a trap composed of 49 places in 231 ms
[2020-05-21 03:13:11] [INFO ] Deduced a trap composed of 83 places in 198 ms
[2020-05-21 03:13:11] [INFO ] Deduced a trap composed of 58 places in 251 ms
[2020-05-21 03:13:11] [INFO ] Deduced a trap composed of 57 places in 255 ms
[2020-05-21 03:13:12] [INFO ] Deduced a trap composed of 49 places in 253 ms
[2020-05-21 03:13:12] [INFO ] Deduced a trap composed of 37 places in 245 ms
[2020-05-21 03:13:13] [INFO ] Deduced a trap composed of 21 places in 237 ms
[2020-05-21 03:13:13] [INFO ] Deduced a trap composed of 31 places in 180 ms
[2020-05-21 03:13:13] [INFO ] Deduced a trap composed of 37 places in 272 ms
[2020-05-21 03:13:13] [INFO ] Deduced a trap composed of 30 places in 242 ms
[2020-05-21 03:13:14] [INFO ] Deduced a trap composed of 26 places in 242 ms
[2020-05-21 03:13:14] [INFO ] Deduced a trap composed of 22 places in 241 ms
[2020-05-21 03:13:14] [INFO ] Deduced a trap composed of 22 places in 261 ms
[2020-05-21 03:13:15] [INFO ] Deduced a trap composed of 22 places in 238 ms
[2020-05-21 03:13:15] [INFO ] Deduced a trap composed of 35 places in 237 ms
[2020-05-21 03:13:15] [INFO ] Deduced a trap composed of 39 places in 208 ms
[2020-05-21 03:13:15] [INFO ] Deduced a trap composed of 40 places in 226 ms
[2020-05-21 03:13:16] [INFO ] Deduced a trap composed of 52 places in 232 ms
[2020-05-21 03:13:16] [INFO ] Deduced a trap composed of 30 places in 238 ms
[2020-05-21 03:13:16] [INFO ] Deduced a trap composed of 31 places in 233 ms
[2020-05-21 03:13:17] [INFO ] Deduced a trap composed of 31 places in 247 ms
[2020-05-21 03:13:17] [INFO ] Deduced a trap composed of 34 places in 228 ms
[2020-05-21 03:13:17] [INFO ] Deduced a trap composed of 19 places in 253 ms
[2020-05-21 03:13:18] [INFO ] Deduced a trap composed of 31 places in 203 ms
[2020-05-21 03:13:18] [INFO ] Deduced a trap composed of 51 places in 213 ms
[2020-05-21 03:13:18] [INFO ] Deduced a trap composed of 66 places in 241 ms
[2020-05-21 03:13:18] [INFO ] Deduced a trap composed of 62 places in 305 ms
[2020-05-21 03:13:19] [INFO ] Deduced a trap composed of 57 places in 211 ms
[2020-05-21 03:13:19] [INFO ] Deduced a trap composed of 39 places in 254 ms
[2020-05-21 03:13:19] [INFO ] Deduced a trap composed of 24 places in 234 ms
[2020-05-21 03:13:20] [INFO ] Deduced a trap composed of 50 places in 323 ms
[2020-05-21 03:13:20] [INFO ] Deduced a trap composed of 22 places in 333 ms
[2020-05-21 03:13:21] [INFO ] Deduced a trap composed of 30 places in 313 ms
[2020-05-21 03:13:21] [INFO ] Deduced a trap composed of 40 places in 264 ms
[2020-05-21 03:13:21] [INFO ] Trap strengthening (SAT) tested/added 99/98 trap constraints in 35649 ms
[2020-05-21 03:13:21] [INFO ] Computed and/alt/rep : 1697/14249/1361 causal constraints in 94 ms.
[2020-05-21 03:13:29] [INFO ] Added : 250 causal constraints over 50 iterations in 7963 ms. Result :unknown
[2020-05-21 03:13:29] [INFO ] [Real]Absence check using 23 positive place invariants in 29 ms returned sat
[2020-05-21 03:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:13:30] [INFO ] [Real]Absence check using state equation in 1211 ms returned sat
[2020-05-21 03:13:30] [INFO ] [Real]Added 546 Read/Feed constraints in 88 ms returned sat
[2020-05-21 03:13:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:13:31] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2020-05-21 03:13:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:13:32] [INFO ] [Nat]Absence check using state equation in 1223 ms returned sat
[2020-05-21 03:13:32] [INFO ] [Nat]Added 546 Read/Feed constraints in 116 ms returned sat
[2020-05-21 03:13:32] [INFO ] Deduced a trap composed of 29 places in 415 ms
[2020-05-21 03:13:33] [INFO ] Deduced a trap composed of 65 places in 360 ms
[2020-05-21 03:13:33] [INFO ] Deduced a trap composed of 26 places in 440 ms
[2020-05-21 03:13:34] [INFO ] Deduced a trap composed of 11 places in 425 ms
[2020-05-21 03:13:34] [INFO ] Deduced a trap composed of 23 places in 414 ms
[2020-05-21 03:13:35] [INFO ] Deduced a trap composed of 39 places in 397 ms
[2020-05-21 03:13:35] [INFO ] Deduced a trap composed of 25 places in 407 ms
[2020-05-21 03:13:36] [INFO ] Deduced a trap composed of 41 places in 383 ms
[2020-05-21 03:13:36] [INFO ] Deduced a trap composed of 45 places in 371 ms
[2020-05-21 03:13:36] [INFO ] Deduced a trap composed of 13 places in 409 ms
[2020-05-21 03:13:37] [INFO ] Deduced a trap composed of 12 places in 402 ms
[2020-05-21 03:13:37] [INFO ] Deduced a trap composed of 16 places in 378 ms
[2020-05-21 03:13:38] [INFO ] Deduced a trap composed of 14 places in 337 ms
[2020-05-21 03:13:38] [INFO ] Deduced a trap composed of 14 places in 375 ms
[2020-05-21 03:13:39] [INFO ] Deduced a trap composed of 13 places in 368 ms
[2020-05-21 03:13:39] [INFO ] Deduced a trap composed of 21 places in 364 ms
[2020-05-21 03:13:39] [INFO ] Deduced a trap composed of 67 places in 342 ms
[2020-05-21 03:13:40] [INFO ] Deduced a trap composed of 21 places in 372 ms
[2020-05-21 03:13:40] [INFO ] Deduced a trap composed of 22 places in 368 ms
[2020-05-21 03:13:41] [INFO ] Deduced a trap composed of 23 places in 375 ms
[2020-05-21 03:13:41] [INFO ] Deduced a trap composed of 39 places in 386 ms
[2020-05-21 03:13:42] [INFO ] Deduced a trap composed of 30 places in 386 ms
[2020-05-21 03:13:42] [INFO ] Deduced a trap composed of 21 places in 379 ms
[2020-05-21 03:13:43] [INFO ] Deduced a trap composed of 14 places in 372 ms
[2020-05-21 03:13:43] [INFO ] Deduced a trap composed of 12 places in 374 ms
[2020-05-21 03:13:43] [INFO ] Deduced a trap composed of 30 places in 384 ms
[2020-05-21 03:13:44] [INFO ] Deduced a trap composed of 21 places in 387 ms
[2020-05-21 03:13:44] [INFO ] Deduced a trap composed of 57 places in 432 ms
[2020-05-21 03:13:45] [INFO ] Deduced a trap composed of 32 places in 358 ms
[2020-05-21 03:13:45] [INFO ] Deduced a trap composed of 39 places in 412 ms
[2020-05-21 03:13:46] [INFO ] Deduced a trap composed of 39 places in 412 ms
[2020-05-21 03:13:46] [INFO ] Deduced a trap composed of 39 places in 394 ms
[2020-05-21 03:13:47] [INFO ] Deduced a trap composed of 39 places in 404 ms
[2020-05-21 03:13:47] [INFO ] Deduced a trap composed of 25 places in 379 ms
[2020-05-21 03:13:47] [INFO ] Deduced a trap composed of 32 places in 364 ms
[2020-05-21 03:13:48] [INFO ] Deduced a trap composed of 40 places in 316 ms
[2020-05-21 03:13:48] [INFO ] Deduced a trap composed of 19 places in 357 ms
[2020-05-21 03:13:49] [INFO ] Deduced a trap composed of 61 places in 297 ms
[2020-05-21 03:13:49] [INFO ] Deduced a trap composed of 29 places in 335 ms
[2020-05-21 03:13:49] [INFO ] Deduced a trap composed of 31 places in 340 ms
[2020-05-21 03:13:50] [INFO ] Deduced a trap composed of 22 places in 350 ms
[2020-05-21 03:13:50] [INFO ] Deduced a trap composed of 39 places in 345 ms
[2020-05-21 03:13:51] [INFO ] Deduced a trap composed of 48 places in 354 ms
[2020-05-21 03:13:51] [INFO ] Deduced a trap composed of 57 places in 371 ms
[2020-05-21 03:13:51] [INFO ] Deduced a trap composed of 23 places in 375 ms
[2020-05-21 03:13:52] [INFO ] Deduced a trap composed of 31 places in 298 ms
[2020-05-21 03:13:52] [INFO ] Deduced a trap composed of 57 places in 297 ms
[2020-05-21 03:13:52] [INFO ] Deduced a trap composed of 51 places in 284 ms
[2020-05-21 03:13:53] [INFO ] Deduced a trap composed of 57 places in 287 ms
[2020-05-21 03:13:53] [INFO ] Deduced a trap composed of 32 places in 328 ms
[2020-05-21 03:13:54] [INFO ] Deduced a trap composed of 57 places in 266 ms
[2020-05-21 03:13:54] [INFO ] Deduced a trap composed of 50 places in 294 ms
[2020-05-21 03:13:54] [INFO ] Deduced a trap composed of 40 places in 277 ms
[2020-05-21 03:13:54] [INFO ] Deduced a trap composed of 49 places in 230 ms
[2020-05-21 03:13:55] [INFO ] Deduced a trap composed of 65 places in 187 ms
[2020-05-21 03:13:55] [INFO ] Deduced a trap composed of 58 places in 171 ms
[2020-05-21 03:13:55] [INFO ] Deduced a trap composed of 64 places in 153 ms
[2020-05-21 03:13:55] [INFO ] Deduced a trap composed of 57 places in 197 ms
[2020-05-21 03:13:56] [INFO ] Deduced a trap composed of 64 places in 179 ms
[2020-05-21 03:13:56] [INFO ] Deduced a trap composed of 65 places in 172 ms
[2020-05-21 03:13:56] [INFO ] Deduced a trap composed of 58 places in 191 ms
[2020-05-21 03:13:56] [INFO ] Deduced a trap composed of 55 places in 156 ms
[2020-05-21 03:13:57] [INFO ] Deduced a trap composed of 55 places in 195 ms
[2020-05-21 03:13:57] [INFO ] Deduced a trap composed of 55 places in 197 ms
[2020-05-21 03:13:57] [INFO ] Deduced a trap composed of 55 places in 161 ms
[2020-05-21 03:13:57] [INFO ] Deduced a trap composed of 48 places in 202 ms
[2020-05-21 03:13:58] [INFO ] Deduced a trap composed of 45 places in 253 ms
[2020-05-21 03:13:58] [INFO ] Deduced a trap composed of 64 places in 251 ms
[2020-05-21 03:13:58] [INFO ] Deduced a trap composed of 40 places in 251 ms
[2020-05-21 03:13:59] [INFO ] Deduced a trap composed of 49 places in 238 ms
[2020-05-21 03:13:59] [INFO ] Deduced a trap composed of 39 places in 180 ms
[2020-05-21 03:13:59] [INFO ] Deduced a trap composed of 40 places in 187 ms
[2020-05-21 03:13:59] [INFO ] Deduced a trap composed of 42 places in 153 ms
[2020-05-21 03:14:00] [INFO ] Deduced a trap composed of 42 places in 189 ms
[2020-05-21 03:14:00] [INFO ] Deduced a trap composed of 51 places in 185 ms
[2020-05-21 03:14:00] [INFO ] Deduced a trap composed of 49 places in 166 ms
[2020-05-21 03:14:01] [INFO ] Deduced a trap composed of 60 places in 228 ms
[2020-05-21 03:14:01] [INFO ] Deduced a trap composed of 32 places in 204 ms
[2020-05-21 03:14:01] [INFO ] Deduced a trap composed of 31 places in 190 ms
[2020-05-21 03:14:01] [INFO ] Deduced a trap composed of 32 places in 212 ms
[2020-05-21 03:14:02] [INFO ] Deduced a trap composed of 31 places in 340 ms
[2020-05-21 03:14:02] [INFO ] Deduced a trap composed of 67 places in 319 ms
[2020-05-21 03:14:03] [INFO ] Deduced a trap composed of 49 places in 252 ms
[2020-05-21 03:14:03] [INFO ] Deduced a trap composed of 67 places in 282 ms
[2020-05-21 03:14:03] [INFO ] Deduced a trap composed of 48 places in 255 ms
[2020-05-21 03:14:04] [INFO ] Deduced a trap composed of 55 places in 287 ms
[2020-05-21 03:14:04] [INFO ] Deduced a trap composed of 66 places in 228 ms
[2020-05-21 03:14:04] [INFO ] Deduced a trap composed of 57 places in 179 ms
[2020-05-21 03:14:04] [INFO ] Deduced a trap composed of 60 places in 157 ms
[2020-05-21 03:14:04] [INFO ] Trap strengthening (SAT) tested/added 90/89 trap constraints in 32430 ms
[2020-05-21 03:14:04] [INFO ] Computed and/alt/rep : 1697/14249/1361 causal constraints in 100 ms.
[2020-05-21 03:14:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t390 0) (and (and (> t545 0) (< o545 o390)) (and (> t160 0) (< o160 o390))))") while checking expression at index 2
[2020-05-21 03:14:16] [INFO ] [Real]Absence check using 23 positive place invariants in 21 ms returned sat
[2020-05-21 03:14:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:14:17] [INFO ] [Real]Absence check using state equation in 1115 ms returned sat
[2020-05-21 03:14:17] [INFO ] [Real]Added 546 Read/Feed constraints in 90 ms returned sat
[2020-05-21 03:14:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:14:17] [INFO ] [Nat]Absence check using 23 positive place invariants in 33 ms returned sat
[2020-05-21 03:14:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:14:18] [INFO ] [Nat]Absence check using state equation in 1139 ms returned sat
[2020-05-21 03:14:18] [INFO ] [Nat]Added 546 Read/Feed constraints in 86 ms returned sat
[2020-05-21 03:14:19] [INFO ] Deduced a trap composed of 25 places in 471 ms
[2020-05-21 03:14:19] [INFO ] Deduced a trap composed of 11 places in 502 ms
[2020-05-21 03:14:20] [INFO ] Deduced a trap composed of 52 places in 429 ms
[2020-05-21 03:14:20] [INFO ] Deduced a trap composed of 25 places in 435 ms
[2020-05-21 03:14:21] [INFO ] Deduced a trap composed of 13 places in 412 ms
[2020-05-21 03:14:21] [INFO ] Deduced a trap composed of 30 places in 416 ms
[2020-05-21 03:14:22] [INFO ] Deduced a trap composed of 30 places in 408 ms
[2020-05-21 03:14:22] [INFO ] Deduced a trap composed of 32 places in 435 ms
[2020-05-21 03:14:23] [INFO ] Deduced a trap composed of 12 places in 403 ms
[2020-05-21 03:14:23] [INFO ] Deduced a trap composed of 12 places in 352 ms
[2020-05-21 03:14:23] [INFO ] Deduced a trap composed of 12 places in 354 ms
[2020-05-21 03:14:24] [INFO ] Deduced a trap composed of 12 places in 391 ms
[2020-05-21 03:14:24] [INFO ] Deduced a trap composed of 12 places in 395 ms
[2020-05-21 03:14:25] [INFO ] Deduced a trap composed of 11 places in 379 ms
[2020-05-21 03:14:25] [INFO ] Deduced a trap composed of 44 places in 382 ms
[2020-05-21 03:14:26] [INFO ] Deduced a trap composed of 62 places in 380 ms
[2020-05-21 03:14:26] [INFO ] Deduced a trap composed of 30 places in 362 ms
[2020-05-21 03:14:26] [INFO ] Deduced a trap composed of 46 places in 352 ms
[2020-05-21 03:14:27] [INFO ] Deduced a trap composed of 33 places in 377 ms
[2020-05-21 03:14:27] [INFO ] Deduced a trap composed of 67 places in 404 ms
[2020-05-21 03:14:28] [INFO ] Deduced a trap composed of 45 places in 280 ms
[2020-05-21 03:14:28] [INFO ] Deduced a trap composed of 61 places in 288 ms
[2020-05-21 03:14:28] [INFO ] Deduced a trap composed of 30 places in 419 ms
[2020-05-21 03:14:29] [INFO ] Deduced a trap composed of 38 places in 306 ms
[2020-05-21 03:14:29] [INFO ] Deduced a trap composed of 39 places in 342 ms
[2020-05-21 03:14:30] [INFO ] Deduced a trap composed of 44 places in 326 ms
[2020-05-21 03:14:30] [INFO ] Deduced a trap composed of 46 places in 321 ms
[2020-05-21 03:14:30] [INFO ] Deduced a trap composed of 44 places in 281 ms
[2020-05-21 03:14:31] [INFO ] Deduced a trap composed of 20 places in 350 ms
[2020-05-21 03:14:31] [INFO ] Deduced a trap composed of 23 places in 352 ms
[2020-05-21 03:14:31] [INFO ] Deduced a trap composed of 24 places in 344 ms
[2020-05-21 03:14:32] [INFO ] Deduced a trap composed of 30 places in 332 ms
[2020-05-21 03:14:32] [INFO ] Deduced a trap composed of 24 places in 318 ms
[2020-05-21 03:14:33] [INFO ] Deduced a trap composed of 56 places in 317 ms
[2020-05-21 03:14:33] [INFO ] Deduced a trap composed of 21 places in 318 ms
[2020-05-21 03:14:33] [INFO ] Deduced a trap composed of 21 places in 323 ms
[2020-05-21 03:14:34] [INFO ] Deduced a trap composed of 21 places in 297 ms
[2020-05-21 03:14:34] [INFO ] Deduced a trap composed of 22 places in 302 ms
[2020-05-21 03:14:34] [INFO ] Deduced a trap composed of 38 places in 318 ms
[2020-05-21 03:14:35] [INFO ] Deduced a trap composed of 25 places in 306 ms
[2020-05-21 03:14:35] [INFO ] Deduced a trap composed of 21 places in 288 ms
[2020-05-21 03:14:36] [INFO ] Deduced a trap composed of 49 places in 281 ms
[2020-05-21 03:14:36] [INFO ] Deduced a trap composed of 30 places in 320 ms
[2020-05-21 03:14:36] [INFO ] Deduced a trap composed of 57 places in 370 ms
[2020-05-21 03:14:37] [INFO ] Deduced a trap composed of 30 places in 316 ms
[2020-05-21 03:14:37] [INFO ] Deduced a trap composed of 35 places in 375 ms
[2020-05-21 03:14:38] [INFO ] Deduced a trap composed of 29 places in 432 ms
[2020-05-21 03:14:38] [INFO ] Deduced a trap composed of 30 places in 405 ms
[2020-05-21 03:14:39] [INFO ] Deduced a trap composed of 21 places in 417 ms
[2020-05-21 03:14:39] [INFO ] Deduced a trap composed of 30 places in 432 ms
[2020-05-21 03:14:40] [INFO ] Deduced a trap composed of 23 places in 385 ms
[2020-05-21 03:14:40] [INFO ] Deduced a trap composed of 54 places in 352 ms
[2020-05-21 03:14:40] [INFO ] Deduced a trap composed of 48 places in 373 ms
[2020-05-21 03:14:41] [INFO ] Deduced a trap composed of 39 places in 335 ms
[2020-05-21 03:14:41] [INFO ] Deduced a trap composed of 61 places in 350 ms
[2020-05-21 03:14:42] [INFO ] Deduced a trap composed of 35 places in 371 ms
[2020-05-21 03:14:42] [INFO ] Deduced a trap composed of 66 places in 342 ms
[2020-05-21 03:14:42] [INFO ] Deduced a trap composed of 22 places in 352 ms
[2020-05-21 03:14:43] [INFO ] Deduced a trap composed of 11 places in 323 ms
[2020-05-21 03:14:43] [INFO ] Deduced a trap composed of 19 places in 314 ms
[2020-05-21 03:14:44] [INFO ] Deduced a trap composed of 48 places in 371 ms
[2020-05-21 03:14:44] [INFO ] Deduced a trap composed of 23 places in 406 ms
[2020-05-21 03:14:45] [INFO ] Deduced a trap composed of 21 places in 378 ms
[2020-05-21 03:14:45] [INFO ] Deduced a trap composed of 48 places in 368 ms
[2020-05-21 03:14:45] [INFO ] Deduced a trap composed of 48 places in 374 ms
[2020-05-21 03:14:46] [INFO ] Deduced a trap composed of 23 places in 355 ms
[2020-05-21 03:14:46] [INFO ] Deduced a trap composed of 44 places in 333 ms
[2020-05-21 03:14:47] [INFO ] Deduced a trap composed of 48 places in 267 ms
[2020-05-21 03:14:47] [INFO ] Deduced a trap composed of 48 places in 290 ms
[2020-05-21 03:14:47] [INFO ] Deduced a trap composed of 66 places in 284 ms
[2020-05-21 03:14:48] [INFO ] Deduced a trap composed of 47 places in 285 ms
[2020-05-21 03:14:48] [INFO ] Trap strengthening (SAT) tested/added 72/71 trap constraints in 29529 ms
[2020-05-21 03:14:48] [INFO ] Computed and/alt/rep : 1697/14249/1361 causal constraints in 97 ms.
[2020-05-21 03:15:02] [INFO ] Added : 465 causal constraints over 93 iterations in 14181 ms. Result :(error "Failed to check-sat")
Incomplete Parikh walk after 370900 steps, including 1000 resets, run finished after 941 ms. (steps per millisecond=394 ) properties seen :[0, 0, 0, 0] could not realise parikh vector
Support contains 13 out of 593 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 593/593 places, 1705/1705 transitions.
Applied a total of 0 rules in 22 ms. Remains 593 /593 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 593/593 places, 1705/1705 transitions.
Starting structural reductions, iteration 0 : 593/593 places, 1705/1705 transitions.
Applied a total of 0 rules in 21 ms. Remains 593 /593 variables (removed 0) and now considering 1705/1705 (removed 0) transitions.
[2020-05-21 03:15:03] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
// Phase 1: matrix 1369 rows 593 cols
[2020-05-21 03:15:03] [INFO ] Computed 23 place invariants in 4 ms
[2020-05-21 03:15:04] [INFO ] Implicit Places using invariants in 1129 ms returned []
[2020-05-21 03:15:04] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
// Phase 1: matrix 1369 rows 593 cols
[2020-05-21 03:15:04] [INFO ] Computed 23 place invariants in 7 ms
[2020-05-21 03:15:05] [INFO ] State equation strengthened by 546 read => feed constraints.
[2020-05-21 03:15:16] [INFO ] Implicit Places using invariants and state equation in 11861 ms returned []
Implicit Place search using SMT with State Equation took 12992 ms to find 0 implicit places.
[2020-05-21 03:15:16] [INFO ] Redundant transitions in 142 ms returned []
[2020-05-21 03:15:16] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
// Phase 1: matrix 1369 rows 593 cols
[2020-05-21 03:15:16] [INFO ] Computed 23 place invariants in 4 ms
[2020-05-21 03:15:18] [INFO ] Dead Transitions using invariants and state equation in 2468 ms returned []
Finished structural reductions, in 1 iterations. Remains : 593/593 places, 1705/1705 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 290 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0]
[2020-05-21 03:15:19] [INFO ] Flow matrix only has 1369 transitions (discarded 336 similar events)
// Phase 1: matrix 1369 rows 593 cols
[2020-05-21 03:15:19] [INFO ] Computed 23 place invariants in 4 ms
[2020-05-21 03:15:19] [INFO ] [Real]Absence check using 23 positive place invariants in 32 ms returned sat
[2020-05-21 03:15:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:15:20] [INFO ] [Real]Absence check using state equation in 1192 ms returned sat
[2020-05-21 03:15:20] [INFO ] State equation strengthened by 546 read => feed constraints.
[2020-05-21 03:15:20] [INFO ] [Real]Added 546 Read/Feed constraints in 102 ms returned sat
[2020-05-21 03:15:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:15:20] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2020-05-21 03:15:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:15:21] [INFO ] [Nat]Absence check using state equation in 1160 ms returned sat
[2020-05-21 03:15:22] [INFO ] [Nat]Added 546 Read/Feed constraints in 93 ms returned sat
[2020-05-21 03:15:22] [INFO ] Deduced a trap composed of 13 places in 417 ms
[2020-05-21 03:15:23] [INFO ] Deduced a trap composed of 46 places in 467 ms
[2020-05-21 03:15:23] [INFO ] Deduced a trap composed of 46 places in 445 ms
[2020-05-21 03:15:24] [INFO ] Deduced a trap composed of 23 places in 415 ms
[2020-05-21 03:15:24] [INFO ] Deduced a trap composed of 35 places in 418 ms
[2020-05-21 03:15:25] [INFO ] Deduced a trap composed of 49 places in 462 ms
[2020-05-21 03:15:25] [INFO ] Deduced a trap composed of 34 places in 435 ms
[2020-05-21 03:15:26] [INFO ] Deduced a trap composed of 45 places in 426 ms
[2020-05-21 03:15:26] [INFO ] Deduced a trap composed of 80 places in 433 ms
[2020-05-21 03:15:26] [INFO ] Deduced a trap composed of 22 places in 390 ms
[2020-05-21 03:15:27] [INFO ] Deduced a trap composed of 45 places in 399 ms
[2020-05-21 03:15:27] [INFO ] Deduced a trap composed of 51 places in 407 ms
[2020-05-21 03:15:28] [INFO ] Deduced a trap composed of 16 places in 419 ms
[2020-05-21 03:15:28] [INFO ] Deduced a trap composed of 43 places in 449 ms
[2020-05-21 03:15:29] [INFO ] Deduced a trap composed of 42 places in 449 ms
[2020-05-21 03:15:29] [INFO ] Deduced a trap composed of 47 places in 442 ms
[2020-05-21 03:15:30] [INFO ] Deduced a trap composed of 39 places in 398 ms
[2020-05-21 03:15:30] [INFO ] Deduced a trap composed of 11 places in 453 ms
[2020-05-21 03:15:31] [INFO ] Deduced a trap composed of 11 places in 418 ms
[2020-05-21 03:15:31] [INFO ] Deduced a trap composed of 16 places in 405 ms
[2020-05-21 03:15:32] [INFO ] Deduced a trap composed of 13 places in 403 ms
[2020-05-21 03:15:32] [INFO ] Deduced a trap composed of 55 places in 450 ms
[2020-05-21 03:15:33] [INFO ] Deduced a trap composed of 11 places in 396 ms
[2020-05-21 03:15:33] [INFO ] Deduced a trap composed of 41 places in 388 ms
[2020-05-21 03:15:33] [INFO ] Deduced a trap composed of 33 places in 417 ms
[2020-05-21 03:15:34] [INFO ] Deduced a trap composed of 67 places in 401 ms
[2020-05-21 03:15:34] [INFO ] Deduced a trap composed of 34 places in 413 ms
[2020-05-21 03:15:35] [INFO ] Deduced a trap composed of 13 places in 440 ms
[2020-05-21 03:15:35] [INFO ] Deduced a trap composed of 31 places in 438 ms
[2020-05-21 03:15:36] [INFO ] Deduced a trap composed of 56 places in 416 ms
[2020-05-21 03:15:36] [INFO ] Deduced a trap composed of 49 places in 418 ms
[2020-05-21 03:15:37] [INFO ] Deduced a trap composed of 29 places in 423 ms
[2020-05-21 03:15:37] [INFO ] Deduced a trap composed of 33 places in 449 ms
[2020-05-21 03:15:38] [INFO ] Deduced a trap composed of 33 places in 409 ms
[2020-05-21 03:15:38] [INFO ] Deduced a trap composed of 27 places in 452 ms
[2020-05-21 03:15:39] [INFO ] Deduced a trap composed of 45 places in 359 ms
[2020-05-21 03:15:39] [INFO ] Deduced a trap composed of 21 places in 387 ms
[2020-05-21 03:15:39] [INFO ] Deduced a trap composed of 53 places in 389 ms
[2020-05-21 03:15:40] [INFO ] Deduced a trap composed of 63 places in 325 ms
[2020-05-21 03:15:40] [INFO ] Deduced a trap composed of 28 places in 393 ms
[2020-05-21 03:15:40] [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 (> (+ s2 s3 s10 s50 s51 s55 s95 s96 s102 s360 s361 s367 s368 s419 s460 s461 s470 s478 s479 s532 s543 s551 s553 s561 s568 s579 s588 s589) 0)") while checking expression at index 0
[2020-05-21 03:15:40] [INFO ] [Real]Absence check using 23 positive place invariants in 20 ms returned sat
[2020-05-21 03:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:15:42] [INFO ] [Real]Absence check using state equation in 1286 ms returned sat
[2020-05-21 03:15:42] [INFO ] [Real]Added 546 Read/Feed constraints in 77 ms returned sat
[2020-05-21 03:15:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:15:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 23 ms returned sat
[2020-05-21 03:15:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:15:43] [INFO ] [Nat]Absence check using state equation in 1177 ms returned sat
[2020-05-21 03:15:43] [INFO ] [Nat]Added 546 Read/Feed constraints in 78 ms returned sat
[2020-05-21 03:15:44] [INFO ] Deduced a trap composed of 16 places in 373 ms
[2020-05-21 03:15:44] [INFO ] Deduced a trap composed of 12 places in 362 ms
[2020-05-21 03:15:44] [INFO ] Deduced a trap composed of 16 places in 361 ms
[2020-05-21 03:15:45] [INFO ] Deduced a trap composed of 16 places in 343 ms
[2020-05-21 03:15:45] [INFO ] Deduced a trap composed of 16 places in 383 ms
[2020-05-21 03:15:46] [INFO ] Deduced a trap composed of 13 places in 345 ms
[2020-05-21 03:15:46] [INFO ] Deduced a trap composed of 13 places in 355 ms
[2020-05-21 03:15:46] [INFO ] Deduced a trap composed of 55 places in 337 ms
[2020-05-21 03:15:47] [INFO ] Deduced a trap composed of 58 places in 331 ms
[2020-05-21 03:15:47] [INFO ] Deduced a trap composed of 30 places in 284 ms
[2020-05-21 03:15:47] [INFO ] Deduced a trap composed of 25 places in 294 ms
[2020-05-21 03:15:48] [INFO ] Deduced a trap composed of 41 places in 264 ms
[2020-05-21 03:15:48] [INFO ] Deduced a trap composed of 22 places in 265 ms
[2020-05-21 03:15:48] [INFO ] Deduced a trap composed of 57 places in 276 ms
[2020-05-21 03:15:49] [INFO ] Deduced a trap composed of 41 places in 269 ms
[2020-05-21 03:15:49] [INFO ] Deduced a trap composed of 57 places in 295 ms
[2020-05-21 03:15:49] [INFO ] Deduced a trap composed of 57 places in 338 ms
[2020-05-21 03:15:50] [INFO ] Deduced a trap composed of 41 places in 288 ms
[2020-05-21 03:15:50] [INFO ] Deduced a trap composed of 42 places in 308 ms
[2020-05-21 03:15:50] [INFO ] Deduced a trap composed of 41 places in 347 ms
[2020-05-21 03:15:51] [INFO ] Deduced a trap composed of 25 places in 351 ms
[2020-05-21 03:15:51] [INFO ] Deduced a trap composed of 45 places in 354 ms
[2020-05-21 03:15:52] [INFO ] Deduced a trap composed of 45 places in 341 ms
[2020-05-21 03:15:52] [INFO ] Deduced a trap composed of 32 places in 381 ms
[2020-05-21 03:15:53] [INFO ] Deduced a trap composed of 21 places in 390 ms
[2020-05-21 03:15:53] [INFO ] Deduced a trap composed of 66 places in 392 ms
[2020-05-21 03:15:53] [INFO ] Deduced a trap composed of 23 places in 310 ms
[2020-05-21 03:15:54] [INFO ] Deduced a trap composed of 55 places in 334 ms
[2020-05-21 03:15:54] [INFO ] Deduced a trap composed of 23 places in 287 ms
[2020-05-21 03:15:54] [INFO ] Deduced a trap composed of 23 places in 277 ms
[2020-05-21 03:15:55] [INFO ] Deduced a trap composed of 25 places in 294 ms
[2020-05-21 03:15:55] [INFO ] Deduced a trap composed of 12 places in 353 ms
[2020-05-21 03:15:56] [INFO ] Deduced a trap composed of 27 places in 325 ms
[2020-05-21 03:15:56] [INFO ] Deduced a trap composed of 21 places in 318 ms
[2020-05-21 03:15:56] [INFO ] Deduced a trap composed of 25 places in 375 ms
[2020-05-21 03:15:57] [INFO ] Deduced a trap composed of 19 places in 379 ms
[2020-05-21 03:15:57] [INFO ] Deduced a trap composed of 32 places in 291 ms
[2020-05-21 03:15:58] [INFO ] Deduced a trap composed of 35 places in 321 ms
[2020-05-21 03:15:58] [INFO ] Deduced a trap composed of 30 places in 308 ms
[2020-05-21 03:15:58] [INFO ] Deduced a trap composed of 30 places in 333 ms
[2020-05-21 03:15:59] [INFO ] Deduced a trap composed of 35 places in 287 ms
[2020-05-21 03:15:59] [INFO ] Deduced a trap composed of 30 places in 316 ms
[2020-05-21 03:15:59] [INFO ] Deduced a trap composed of 11 places in 383 ms
[2020-05-21 03:16:00] [INFO ] Deduced a trap composed of 31 places in 283 ms
[2020-05-21 03:16:00] [INFO ] Deduced a trap composed of 32 places in 343 ms
[2020-05-21 03:16:01] [INFO ] Deduced a trap composed of 40 places in 323 ms
[2020-05-21 03:16:01] [INFO ] Deduced a trap composed of 31 places in 306 ms
[2020-05-21 03:16:01] [INFO ] Deduced a trap composed of 40 places in 233 ms
[2020-05-21 03:16:02] [INFO ] Deduced a trap composed of 45 places in 293 ms
[2020-05-21 03:16:02] [INFO ] Deduced a trap composed of 58 places in 286 ms
[2020-05-21 03:16:02] [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 (> (+ s1 s8 s14 s21 s31 s35 s52 s53 s60 s67 s74 s81 s142 s157 s164 s165 s172 s194 s201 s209 s216 s234 s242 s253 s260 s268 s275 s280 s287 s305 s318 s324 s339 s347 s354 s362 s366 s389 s397 s417 s425 s432 s440 s462 s472 s480 s486 s491 s500 s508 s531 s538 s548 s565 s571 s572 s586 s590) 0)") while checking expression at index 1
[2020-05-21 03:16:02] [INFO ] [Real]Absence check using 23 positive place invariants in 37 ms returned sat
[2020-05-21 03:16:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:16:03] [INFO ] [Real]Absence check using state equation in 1253 ms returned sat
[2020-05-21 03:16:03] [INFO ] [Real]Added 546 Read/Feed constraints in 61 ms returned sat
[2020-05-21 03:16:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:16:04] [INFO ] [Nat]Absence check using 23 positive place invariants in 22 ms returned sat
[2020-05-21 03:16:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:16:05] [INFO ] [Nat]Absence check using state equation in 1142 ms returned sat
[2020-05-21 03:16:05] [INFO ] [Nat]Added 546 Read/Feed constraints in 80 ms returned sat
[2020-05-21 03:16:05] [INFO ] Deduced a trap composed of 29 places in 398 ms
[2020-05-21 03:16:06] [INFO ] Deduced a trap composed of 65 places in 388 ms
[2020-05-21 03:16:06] [INFO ] Deduced a trap composed of 26 places in 433 ms
[2020-05-21 03:16:07] [INFO ] Deduced a trap composed of 11 places in 405 ms
[2020-05-21 03:16:07] [INFO ] Deduced a trap composed of 23 places in 426 ms
[2020-05-21 03:16:07] [INFO ] Deduced a trap composed of 39 places in 358 ms
[2020-05-21 03:16:08] [INFO ] Deduced a trap composed of 25 places in 407 ms
[2020-05-21 03:16:08] [INFO ] Deduced a trap composed of 41 places in 385 ms
[2020-05-21 03:16:09] [INFO ] Deduced a trap composed of 45 places in 371 ms
[2020-05-21 03:16:09] [INFO ] Deduced a trap composed of 13 places in 397 ms
[2020-05-21 03:16:10] [INFO ] Deduced a trap composed of 12 places in 388 ms
[2020-05-21 03:16:10] [INFO ] Deduced a trap composed of 16 places in 369 ms
[2020-05-21 03:16:11] [INFO ] Deduced a trap composed of 14 places in 366 ms
[2020-05-21 03:16:11] [INFO ] Deduced a trap composed of 14 places in 372 ms
[2020-05-21 03:16:11] [INFO ] Deduced a trap composed of 13 places in 380 ms
[2020-05-21 03:16:12] [INFO ] Deduced a trap composed of 21 places in 385 ms
[2020-05-21 03:16:12] [INFO ] Deduced a trap composed of 67 places in 385 ms
[2020-05-21 03:16:13] [INFO ] Deduced a trap composed of 21 places in 391 ms
[2020-05-21 03:16:13] [INFO ] Deduced a trap composed of 22 places in 438 ms
[2020-05-21 03:16:14] [INFO ] Deduced a trap composed of 23 places in 402 ms
[2020-05-21 03:16:14] [INFO ] Deduced a trap composed of 39 places in 383 ms
[2020-05-21 03:16:15] [INFO ] Deduced a trap composed of 30 places in 392 ms
[2020-05-21 03:16:15] [INFO ] Deduced a trap composed of 21 places in 378 ms
[2020-05-21 03:16:15] [INFO ] Deduced a trap composed of 14 places in 325 ms
[2020-05-21 03:16:16] [INFO ] Deduced a trap composed of 12 places in 342 ms
[2020-05-21 03:16:16] [INFO ] Deduced a trap composed of 30 places in 367 ms
[2020-05-21 03:16:17] [INFO ] Deduced a trap composed of 21 places in 298 ms
[2020-05-21 03:16:17] [INFO ] Deduced a trap composed of 57 places in 380 ms
[2020-05-21 03:16:17] [INFO ] Deduced a trap composed of 32 places in 368 ms
[2020-05-21 03:16:18] [INFO ] Deduced a trap composed of 39 places in 330 ms
[2020-05-21 03:16:18] [INFO ] Deduced a trap composed of 39 places in 341 ms
[2020-05-21 03:16:19] [INFO ] Deduced a trap composed of 39 places in 342 ms
[2020-05-21 03:16:19] [INFO ] Deduced a trap composed of 39 places in 341 ms
[2020-05-21 03:16:19] [INFO ] Deduced a trap composed of 25 places in 380 ms
[2020-05-21 03:16:20] [INFO ] Deduced a trap composed of 32 places in 352 ms
[2020-05-21 03:16:20] [INFO ] Deduced a trap composed of 40 places in 349 ms
[2020-05-21 03:16:21] [INFO ] Deduced a trap composed of 19 places in 390 ms
[2020-05-21 03:16:21] [INFO ] Deduced a trap composed of 61 places in 352 ms
[2020-05-21 03:16:21] [INFO ] Deduced a trap composed of 29 places in 335 ms
[2020-05-21 03:16:22] [INFO ] Deduced a trap composed of 31 places in 360 ms
[2020-05-21 03:16:22] [INFO ] Deduced a trap composed of 22 places in 365 ms
[2020-05-21 03:16:23] [INFO ] Deduced a trap composed of 39 places in 365 ms
[2020-05-21 03:16:23] [INFO ] Deduced a trap composed of 48 places in 318 ms
[2020-05-21 03:16:23] [INFO ] Deduced a trap composed of 57 places in 333 ms
[2020-05-21 03:16:24] [INFO ] Deduced a trap composed of 23 places in 336 ms
[2020-05-21 03:16:24] [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 (> (+ s2 s10 s51 s55 s96 s102 s200 s233 s279 s361 s367 s419 s461 s470 s479 s532 s543 s551 s553 s561 s568 s579 s589) 0)") while checking expression at index 2
[2020-05-21 03:16:24] [INFO ] [Real]Absence check using 23 positive place invariants in 22 ms returned sat
[2020-05-21 03:16:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:16:25] [INFO ] [Real]Absence check using state equation in 1176 ms returned sat
[2020-05-21 03:16:25] [INFO ] [Real]Added 546 Read/Feed constraints in 79 ms returned sat
[2020-05-21 03:16:25] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:16:25] [INFO ] [Nat]Absence check using 23 positive place invariants in 24 ms returned sat
[2020-05-21 03:16:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:16:26] [INFO ] [Nat]Absence check using state equation in 1190 ms returned sat
[2020-05-21 03:16:27] [INFO ] [Nat]Added 546 Read/Feed constraints in 84 ms returned sat
[2020-05-21 03:16:27] [INFO ] Deduced a trap composed of 25 places in 412 ms
[2020-05-21 03:16:27] [INFO ] Deduced a trap composed of 11 places in 404 ms
[2020-05-21 03:16:28] [INFO ] Deduced a trap composed of 52 places in 350 ms
[2020-05-21 03:16:28] [INFO ] Deduced a trap composed of 25 places in 334 ms
[2020-05-21 03:16:29] [INFO ] Deduced a trap composed of 13 places in 423 ms
[2020-05-21 03:16:29] [INFO ] Deduced a trap composed of 30 places in 363 ms
[2020-05-21 03:16:30] [INFO ] Deduced a trap composed of 30 places in 418 ms
[2020-05-21 03:16:30] [INFO ] Deduced a trap composed of 32 places in 390 ms
[2020-05-21 03:16:30] [INFO ] Deduced a trap composed of 12 places in 382 ms
[2020-05-21 03:16:31] [INFO ] Deduced a trap composed of 12 places in 379 ms
[2020-05-21 03:16:31] [INFO ] Deduced a trap composed of 12 places in 432 ms
[2020-05-21 03:16:32] [INFO ] Deduced a trap composed of 12 places in 414 ms
[2020-05-21 03:16:32] [INFO ] Deduced a trap composed of 12 places in 442 ms
[2020-05-21 03:16:33] [INFO ] Deduced a trap composed of 11 places in 424 ms
[2020-05-21 03:16:33] [INFO ] Deduced a trap composed of 44 places in 400 ms
[2020-05-21 03:16:34] [INFO ] Deduced a trap composed of 62 places in 363 ms
[2020-05-21 03:16:34] [INFO ] Deduced a trap composed of 30 places in 410 ms
[2020-05-21 03:16:35] [INFO ] Deduced a trap composed of 46 places in 416 ms
[2020-05-21 03:16:35] [INFO ] Deduced a trap composed of 33 places in 349 ms
[2020-05-21 03:16:35] [INFO ] Deduced a trap composed of 67 places in 410 ms
[2020-05-21 03:16:36] [INFO ] Deduced a trap composed of 45 places in 298 ms
[2020-05-21 03:16:36] [INFO ] Deduced a trap composed of 61 places in 358 ms
[2020-05-21 03:16:36] [INFO ] Deduced a trap composed of 30 places in 272 ms
[2020-05-21 03:16:37] [INFO ] Deduced a trap composed of 38 places in 297 ms
[2020-05-21 03:16:37] [INFO ] Deduced a trap composed of 39 places in 332 ms
[2020-05-21 03:16:38] [INFO ] Deduced a trap composed of 44 places in 320 ms
[2020-05-21 03:16:38] [INFO ] Deduced a trap composed of 46 places in 384 ms
[2020-05-21 03:16:38] [INFO ] Deduced a trap composed of 44 places in 356 ms
[2020-05-21 03:16:39] [INFO ] Deduced a trap composed of 20 places in 358 ms
[2020-05-21 03:16:39] [INFO ] Deduced a trap composed of 23 places in 392 ms
[2020-05-21 03:16:40] [INFO ] Deduced a trap composed of 24 places in 360 ms
[2020-05-21 03:16:40] [INFO ] Deduced a trap composed of 30 places in 369 ms
[2020-05-21 03:16:40] [INFO ] Deduced a trap composed of 24 places in 353 ms
[2020-05-21 03:16:41] [INFO ] Deduced a trap composed of 56 places in 341 ms
[2020-05-21 03:16:41] [INFO ] Deduced a trap composed of 21 places in 372 ms
[2020-05-21 03:16:42] [INFO ] Deduced a trap composed of 21 places in 339 ms
[2020-05-21 03:16:42] [INFO ] Deduced a trap composed of 21 places in 379 ms
[2020-05-21 03:16:43] [INFO ] Deduced a trap composed of 22 places in 377 ms
[2020-05-21 03:16:43] [INFO ] Deduced a trap composed of 38 places in 304 ms
[2020-05-21 03:16:43] [INFO ] Deduced a trap composed of 25 places in 362 ms
[2020-05-21 03:16:44] [INFO ] Deduced a trap composed of 21 places in 341 ms
[2020-05-21 03:16:44] [INFO ] Deduced a trap composed of 49 places in 346 ms
[2020-05-21 03:16:45] [INFO ] Deduced a trap composed of 30 places in 337 ms
[2020-05-21 03:16:45] [INFO ] Deduced a trap composed of 57 places in 329 ms
[2020-05-21 03:16:45] [INFO ] Deduced a trap composed of 30 places in 401 ms
[2020-05-21 03:16:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s7 s17 s97 s104 s143 s163 s195 s202 s235 s267 s281 s288 s355 s363 s365 s416 s426 s463 s473 s481 s509 s535 s537 s542 s545 s560 s575 s580 s591) 0)") while checking expression at index 3
Graph (trivial) has 1263 edges and 593 vertex of which 417 / 593 are part of one of the 55 SCC in 8 ms
Free SCC test removed 362 places
Drop transitions removed 724 transitions
Ensure Unique test removed 384 transitions
Reduce isomorphic transitions removed 1108 transitions.
Iterating post reduction 0 with 1108 rules applied. Total rules applied 1109 place count 231 transition count 597
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 48 Pre rules applied. Total rules applied 1109 place count 231 transition count 549
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 1 with 96 rules applied. Total rules applied 1205 place count 183 transition count 549
Performed 19 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 1 with 38 rules applied. Total rules applied 1243 place count 164 transition count 523
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 1252 place count 164 transition count 514
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -37
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 27 rules applied. Total rules applied 1279 place count 148 transition count 551
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 74 edges and 148 vertex of which 32 / 148 are part of one of the 4 SCC in 0 ms
Free SCC test removed 28 places
Iterating post reduction 2 with 7 rules applied. Total rules applied 1286 place count 120 transition count 545
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (trivial) has 138 edges and 118 vertex of which 14 / 118 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Iterating post reduction 3 with 35 rules applied. Total rules applied 1321 place count 111 transition count 513
Drop transitions removed 14 transitions
Ensure Unique test removed 90 transitions
Reduce isomorphic transitions removed 104 transitions.
Iterating post reduction 4 with 104 rules applied. Total rules applied 1425 place count 111 transition count 409
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1427 place count 110 transition count 408
Free-agglomeration rule applied 6 times.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1433 place count 110 transition count 402
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 12 rules applied. Total rules applied 1445 place count 104 transition count 396
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 6 with 6 rules applied. Total rules applied 1451 place count 104 transition count 570
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 12 transitions
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 222 transitions.
Iterating post reduction 6 with 228 rules applied. Total rules applied 1679 place count 98 transition count 348
Symmetric choice reduction at 7 with 18 rule applications. Total rules 1697 place count 98 transition count 348
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 126 transitions.
Iterating global reduction 7 with 36 rules applied. Total rules applied 1733 place count 80 transition count 222
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 1742 place count 80 transition count 222
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 1746 place count 80 transition count 222
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1747 place count 80 transition count 221
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1748 place count 80 transition count 221
Drop transitions removed 32 transitions
Redundant transition composition rules discarded 32 transitions
Iterating global reduction 8 with 32 rules applied. Total rules applied 1780 place count 80 transition count 189
Applied a total of 1780 rules in 130 ms. Remains 80 /593 variables (removed 513) and now considering 189/1705 (removed 1516) transitions.
// Phase 1: matrix 189 rows 80 cols
[2020-05-21 03:16:45] [INFO ] Computed 16 place invariants in 1 ms
[2020-05-21 03:16:46] [INFO ] [Real]Absence check using 16 positive place invariants in 76 ms returned sat
[2020-05-21 03:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:16:46] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2020-05-21 03:16:46] [INFO ] State equation strengthened by 5 read => feed constraints.
[2020-05-21 03:16:46] [INFO ] [Real]Added 5 Read/Feed constraints in 11 ms returned sat
[2020-05-21 03:16:46] [INFO ] Computed and/alt/rep : 171/875/171 causal constraints in 8 ms.
[2020-05-21 03:16:46] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:16:46] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2020-05-21 03:16:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:16:46] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2020-05-21 03:16:46] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2020-05-21 03:16:46] [INFO ] Computed and/alt/rep : 171/875/171 causal constraints in 10 ms.
[2020-05-21 03:16:46] [INFO ] Added : 154 causal constraints over 31 iterations in 493 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-05-21 03:16:46] [INFO ] [Real]Absence check using 16 positive place invariants in 9 ms returned sat
[2020-05-21 03:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:16:46] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2020-05-21 03:16:46] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2020-05-21 03:16:46] [INFO ] Computed and/alt/rep : 171/875/171 causal constraints in 14 ms.
[2020-05-21 03:16:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:16:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 18 ms returned sat
[2020-05-21 03:16:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:16:47] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2020-05-21 03:16:47] [INFO ] [Nat]Added 5 Read/Feed constraints in 3 ms returned sat
[2020-05-21 03:16:47] [INFO ] Computed and/alt/rep : 171/875/171 causal constraints in 15 ms.
[2020-05-21 03:16:47] [INFO ] Added : 126 causal constraints over 26 iterations in 461 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-05-21 03:16:47] [INFO ] [Real]Absence check using 16 positive place invariants in 10 ms returned sat
[2020-05-21 03:16:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:16:47] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2020-05-21 03:16:47] [INFO ] [Real]Added 5 Read/Feed constraints in 3 ms returned sat
[2020-05-21 03:16:47] [INFO ] Computed and/alt/rep : 171/875/171 causal constraints in 15 ms.
[2020-05-21 03:16:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:16:47] [INFO ] [Nat]Absence check using 16 positive place invariants in 10 ms returned sat
[2020-05-21 03:16:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:16:47] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2020-05-21 03:16:47] [INFO ] [Nat]Added 5 Read/Feed constraints in 2 ms returned sat
[2020-05-21 03:16:47] [INFO ] Computed and/alt/rep : 171/875/171 causal constraints in 10 ms.
[2020-05-21 03:16:48] [INFO ] Added : 152 causal constraints over 31 iterations in 417 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
[2020-05-21 03:16:48] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2020-05-21 03:16:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-21 03:16:48] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-05-21 03:16:48] [INFO ] [Real]Added 5 Read/Feed constraints in 2 ms returned sat
[2020-05-21 03:16:48] [INFO ] Computed and/alt/rep : 171/875/171 causal constraints in 9 ms.
[2020-05-21 03:16:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-21 03:16:48] [INFO ] [Nat]Absence check using 16 positive place invariants in 7 ms returned sat
[2020-05-21 03:16:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-21 03:16:48] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-05-21 03:16:48] [INFO ] [Nat]Added 5 Read/Feed constraints in 5 ms returned sat
[2020-05-21 03:16:48] [INFO ] Computed and/alt/rep : 171/875/171 causal constraints in 11 ms.
[2020-05-21 03:16:49] [INFO ] Added : 148 causal constraints over 30 iterations in 548 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-05-21 03:16:49] [INFO ] Flatten gal took : 241 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 03:16:49] [INFO ] Applying decomposition
[2020-05-21 03:16:50] [INFO ] Flatten gal took : 203 ms
[2020-05-21 03:16:50] [INFO ] Flatten gal took : 266 ms
[2020-05-21 03:16:50] [INFO ] Input system was already deterministic with 1705 transitions.
[2020-05-21 03:16:50] [INFO ] Too many transitions (1705) to apply POR reductions. Disabling POR matrices.
[2020-05-21 03:16:50] [INFO ] Input system was already deterministic with 1705 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/graph12387047081059089008.txt, -o, /tmp/graph12387047081059089008.bin, -w, /tmp/graph12387047081059089008.weights], workingDir=null]
[2020-05-21 03:16:50] [INFO ] Built C files in 654ms 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]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph12387047081059089008.bin, -l, -1, -v, -w, /tmp/graph12387047081059089008.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 03:16:50] [INFO ] Decomposing Gal with order
[2020-05-21 03:16:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 03:16:51] [INFO ] Removed a total of 2509 redundant transitions.
[2020-05-21 03:16:51] [INFO ] Ran tautology test, simplified 0 / 4 in 1374 ms.
[2020-05-21 03:16:51] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-08(UNSAT) depth K=0 took 84 ms
[2020-05-21 03:16:51] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=0 took 20 ms
[2020-05-21 03:16:51] [INFO ] Flatten gal took : 708 ms
[2020-05-21 03:16:51] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-10(UNSAT) depth K=0 took 33 ms
[2020-05-21 03:16:51] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-11(UNSAT) depth K=0 took 7 ms
[2020-05-21 03:16:51] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-08(UNSAT) depth K=1 took 14 ms
[2020-05-21 03:16:51] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=1 took 12 ms
[2020-05-21 03:16:51] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-10(UNSAT) depth K=1 took 12 ms
[2020-05-21 03:16:51] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-11(UNSAT) depth K=1 took 12 ms
[2020-05-21 03:16:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 826 labels/synchronizations in 194 ms.
[2020-05-21 03:16:52] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 47 ms
[2020-05-21 03:16:52] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 0 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 : Peterson-PT-7-ReachabilityFireability-08 with value :((((i6.u29.WantSection_4_T>=1)&&(i8.u3.TestAlone_7_6_4>=1))||((((i7.u34.WantSection_3_F>=1)&&(i14.i1.u37.TestAlone_5_6_3>=1))&&(i6.u26.TestTurn_6_4>=1))&&(i2.u57.Turn_4_7>=1)))||(((i12.u33.WantSection_5_T>=1)&&(i11.u2.TestAlone_0_0_5>=1))&&(i0.i0.u70.TestIdentity_3_3_7>=1)))
Read [invariant] property : Peterson-PT-7-ReachabilityFireability-09 with value :((i6.u29.WantSection_4_F<1)||(i13.u38.TestAlone_6_1_4<1))
Read [invariant] property : Peterson-PT-7-ReachabilityFireability-10 with value :(i0.i1.u0.IsEndLoop_3_6_1<1)
Read [reachable] property : Peterson-PT-7-ReachabilityFireability-11 with value :(i13.u1.TestIdentity_6_3_3>=1)
built 190 ordering constraints for composite.
built 59 ordering constraints for composite.
built 60 ordering constraints for composite.
built 59 ordering constraints for composite.
built 50 ordering constraints for composite.
built 41 ordering constraints for composite.
built 61 ordering constraints for composite.
built 59 ordering constraints for composite.
built 182 ordering constraints for composite.
built 54 ordering constraints for composite.
built 42 ordering constraints for composite.
built 63 ordering constraints for composite.
built 41 ordering constraints for composite.
built 61 ordering constraints for composite.
built 41 ordering constraints for composite.
built 41 ordering constraints for composite.
built 61 ordering constraints for composite.
built 50 ordering constraints for composite.
built 40 ordering constraints for composite.
built 41 ordering constraints for composite.
built 41 ordering constraints for composite.
built 41 ordering constraints for composite.
built 41 ordering constraints for composite.
built 52 ordering constraints for composite.
built 41 ordering constraints for composite.
built 40 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
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 1369 out of 1705 initially.
// Phase 1: matrix 1369 rows 593 cols
[2020-05-21 03:16:52] [INFO ] Computed 23 place invariants in 5 ms
inv : WantSection_5_F + WantSection_5_T = 1
inv : Turn_5_6 + Turn_5_5 + Turn_5_4 + Turn_5_3 + Turn_5_2 + Turn_5_0 + Turn_5_1 + Turn_5_7 = 1
inv : WantSection_7_F + WantSection_7_T = 1
inv : IsEndLoop_6_0_0 + IsEndLoop_6_1_0 + IsEndLoop_6_2_0 + IsEndLoop_6_3_0 + IsEndLoop_6_4_0 + IsEndLoop_6_5_0 + IsEndLoop_6_6_0 + IsEndLoop_6_0_1 + IsEndLoop_6_1_1 + IsEndLoop_6_2_1 + IsEndLoop_6_3_1 + IsEndLoop_6_4_1 + IsEndLoop_6_5_1 + IsEndLoop_6_6_1 + IsEndLoop_6_0_2 + IsEndLoop_6_2_2 + IsEndLoop_6_1_2 + IsEndLoop_6_4_2 + IsEndLoop_6_3_2 + IsEndLoop_6_6_2 + IsEndLoop_6_5_2 + IsEndLoop_6_1_3 + IsEndLoop_6_0_3 + IsEndLoop_6_3_3 + IsEndLoop_6_2_3 + IsEndLoop_6_5_3 + IsEndLoop_6_4_3 + IsEndLoop_6_0_4 + IsEndLoop_6_6_3 + IsEndLoop_6_2_4 + IsEndLoop_6_1_4 + IsEndLoop_6_5_4 + IsEndLoop_6_6_4 + IsEndLoop_6_3_4 + IsEndLoop_6_4_4 + IsEndLoop_6_2_5 + IsEndLoop_6_3_5 + IsEndLoop_6_0_5 + IsEndLoop_6_1_5 + IsEndLoop_6_6_5 + IsEndLoop_6_4_5 + IsEndLoop_6_5_5 + EndTurn_6_2 + EndTurn_6_1 + EndTurn_6_0 + EndTurn_6_6 + EndTurn_6_5 + EndTurn_6_4 + EndTurn_6_3 + BeginLoop_6_4_0 + BeginLoop_6_5_0 + BeginLoop_6_6_0 + BeginLoop_6_0_0 + BeginLoop_6_1_0 + BeginLoop_6_2_0 + BeginLoop_6_3_0 + WantSection_6_F + TestAlone_6_3_3 + TestAlone_6_1_4 + TestTurn_6_0 + TestTurn_6_4 + TestTurn_6_3 + TestTurn_6_2 + TestTurn_6_1 + TestTurn_6_5 + TestTurn_6_6 + TestIdentity_6_3_3 + AskForSection_6_0 = 1
inv : WantSection_2_T + WantSection_2_F = 1
inv : IsEndLoop_4_0_0 + IsEndLoop_4_1_0 + IsEndLoop_4_2_0 + IsEndLoop_4_3_0 + IsEndLoop_4_4_0 + IsEndLoop_4_5_0 + IsEndLoop_4_6_0 + IsEndLoop_4_0_1 + IsEndLoop_4_1_1 + IsEndLoop_4_2_1 + IsEndLoop_4_3_1 + IsEndLoop_4_4_1 + IsEndLoop_4_5_1 + IsEndLoop_4_6_1 + IsEndLoop_4_0_2 + IsEndLoop_4_1_2 + IsEndLoop_4_3_2 + IsEndLoop_4_2_2 + IsEndLoop_4_5_2 + IsEndLoop_4_4_2 + IsEndLoop_4_0_3 + IsEndLoop_4_6_2 + IsEndLoop_4_2_3 + IsEndLoop_4_1_3 + IsEndLoop_4_4_3 + IsEndLoop_4_3_3 + IsEndLoop_4_6_3 + IsEndLoop_4_5_3 + IsEndLoop_4_0_5 + IsEndLoop_4_3_5 + IsEndLoop_4_4_5 + IsEndLoop_4_1_5 + IsEndLoop_4_2_5 + IsEndLoop_4_0_6 + IsEndLoop_4_1_6 + IsEndLoop_4_5_5 + IsEndLoop_4_6_5 + IsEndLoop_4_4_6 + IsEndLoop_4_5_6 + IsEndLoop_4_2_6 + IsEndLoop_4_3_6 + IsEndLoop_4_6_6 + EndTurn_4_3 + EndTurn_4_2 + EndTurn_4_1 + EndTurn_4_0 + BeginLoop_4_0_0 + EndTurn_4_6 + EndTurn_4_5 + EndTurn_4_4 + BeginLoop_4_5_0 + BeginLoop_4_6_0 + BeginLoop_4_1_0 + BeginLoop_4_2_0 + BeginLoop_4_3_0 + BeginLoop_4_4_0 + WantSection_4_F + TestTurn_4_1 + TestTurn_4_0 + TestTurn_4_5 + TestTurn_4_4 + TestTurn_4_3 + TestTurn_4_2 + TestTurn_4_6 + AskForSection_4_0 = 1
inv : WantSection_0_T + WantSection_0_F = 1
inv : IsEndLoop_1_0_0 + IsEndLoop_1_1_0 + IsEndLoop_1_2_0 + IsEndLoop_1_3_0 + IsEndLoop_1_4_0 + IsEndLoop_1_5_0 + IsEndLoop_1_6_0 + IsEndLoop_1_0_2 + IsEndLoop_1_1_2 + IsEndLoop_1_3_2 + IsEndLoop_1_2_2 + IsEndLoop_1_5_2 + IsEndLoop_1_4_2 + IsEndLoop_1_0_3 + IsEndLoop_1_6_2 + IsEndLoop_1_2_3 + IsEndLoop_1_1_3 + IsEndLoop_1_4_3 + IsEndLoop_1_3_3 + IsEndLoop_1_6_3 + IsEndLoop_1_5_3 + IsEndLoop_1_1_4 + IsEndLoop_1_0_4 + IsEndLoop_1_3_4 + IsEndLoop_1_2_4 + IsEndLoop_1_6_4 + IsEndLoop_1_0_5 + IsEndLoop_1_4_4 + IsEndLoop_1_5_4 + IsEndLoop_1_3_5 + IsEndLoop_1_4_5 + IsEndLoop_1_1_5 + IsEndLoop_1_2_5 + IsEndLoop_1_0_6 + IsEndLoop_1_1_6 + IsEndLoop_1_5_5 + IsEndLoop_1_6_5 + IsEndLoop_1_4_6 + IsEndLoop_1_5_6 + IsEndLoop_1_2_6 + IsEndLoop_1_3_6 + IsEndLoop_1_6_6 + EndTurn_1_3 + EndTurn_1_2 + EndTurn_1_1 + EndTurn_1_0 + BeginLoop_1_0_0 + EndTurn_1_6 + EndTurn_1_5 + EndTurn_1_4 + BeginLoop_1_5_0 + BeginLoop_1_6_0 + BeginLoop_1_1_0 + BeginLoop_1_2_0 + BeginLoop_1_3_0 + BeginLoop_1_4_0 + WantSection_1_F + TestTurn_1_1 + TestTurn_1_0 + TestTurn_1_5 + TestTurn_1_4 + TestTurn_1_3 + TestTurn_1_2 + TestTurn_1_6 + AskForSection_1_0 = 1
inv : WantSection_6_F + WantSection_6_T = 1
inv : IsEndLoop_0_0_1 + IsEndLoop_0_1_1 + IsEndLoop_0_2_1 + IsEndLoop_0_3_1 + IsEndLoop_0_4_1 + IsEndLoop_0_5_1 + IsEndLoop_0_6_1 + IsEndLoop_0_0_2 + IsEndLoop_0_1_2 + IsEndLoop_0_3_2 + IsEndLoop_0_2_2 + IsEndLoop_0_5_2 + IsEndLoop_0_4_2 + IsEndLoop_0_0_3 + IsEndLoop_0_6_2 + IsEndLoop_0_2_3 + IsEndLoop_0_1_3 + IsEndLoop_0_4_3 + IsEndLoop_0_3_3 + IsEndLoop_0_6_3 + IsEndLoop_0_5_3 + IsEndLoop_0_1_4 + IsEndLoop_0_0_4 + IsEndLoop_0_3_4 + IsEndLoop_0_2_4 + IsEndLoop_0_6_4 + IsEndLoop_0_0_5 + IsEndLoop_0_4_4 + IsEndLoop_0_5_4 + IsEndLoop_0_3_5 + IsEndLoop_0_4_5 + IsEndLoop_0_1_5 + IsEndLoop_0_2_5 + IsEndLoop_0_0_6 + IsEndLoop_0_1_6 + IsEndLoop_0_5_5 + IsEndLoop_0_6_5 + IsEndLoop_0_4_6 + IsEndLoop_0_5_6 + IsEndLoop_0_2_6 + IsEndLoop_0_3_6 + IsEndLoop_0_6_6 + EndTurn_0_3 + EndTurn_0_2 + EndTurn_0_1 + EndTurn_0_0 + BeginLoop_0_0_0 + EndTurn_0_6 + EndTurn_0_5 + EndTurn_0_4 + BeginLoop_0_5_0 + BeginLoop_0_6_0 + BeginLoop_0_1_0 + BeginLoop_0_2_0 + BeginLoop_0_3_0 + BeginLoop_0_4_0 + WantSection_0_F + TestAlone_0_0_5 + TestTurn_0_1 + TestTurn_0_0 + TestTurn_0_5 + TestTurn_0_4 + TestTurn_0_3 + TestTurn_0_2 + TestTurn_0_6 + AskForSection_0_0 = 1
inv : Turn_1_7 + Turn_1_6 + Turn_1_4 + Turn_1_5 + Turn_1_3 + Turn_1_2 + Turn_1_1 + Turn_1_0 = 1
inv : Turn_3_6 + Turn_3_7 + Turn_3_5 + Turn_3_4 + Turn_3_3 + Turn_3_2 + Turn_3_1 + Turn_3_0 = 1
inv : Turn_2_7 + Turn_2_5 + Turn_2_6 + Turn_2_4 + Turn_2_3 + Turn_2_2 + Turn_2_1 + Turn_2_0 = 1
inv : WantSection_4_T + WantSection_4_F = 1
inv : IsEndLoop_3_0_0 + IsEndLoop_3_1_0 + IsEndLoop_3_2_0 + IsEndLoop_3_3_0 + IsEndLoop_3_4_0 + IsEndLoop_3_5_0 + IsEndLoop_3_6_0 + IsEndLoop_3_0_1 + IsEndLoop_3_1_1 + IsEndLoop_3_2_1 + IsEndLoop_3_3_1 + IsEndLoop_3_4_1 + IsEndLoop_3_5_1 + IsEndLoop_3_6_1 + IsEndLoop_3_0_2 + IsEndLoop_3_1_2 + IsEndLoop_3_3_2 + IsEndLoop_3_2_2 + IsEndLoop_3_5_2 + IsEndLoop_3_4_2 + IsEndLoop_3_6_2 + IsEndLoop_3_1_4 + IsEndLoop_3_0_4 + IsEndLoop_3_3_4 + IsEndLoop_3_2_4 + IsEndLoop_3_6_4 + IsEndLoop_3_0_5 + IsEndLoop_3_4_4 + IsEndLoop_3_5_4 + IsEndLoop_3_3_5 + IsEndLoop_3_4_5 + IsEndLoop_3_1_5 + IsEndLoop_3_2_5 + IsEndLoop_3_0_6 + IsEndLoop_3_1_6 + IsEndLoop_3_5_5 + IsEndLoop_3_6_5 + IsEndLoop_3_4_6 + IsEndLoop_3_5_6 + IsEndLoop_3_2_6 + IsEndLoop_3_3_6 + IsEndLoop_3_6_6 + EndTurn_3_3 + EndTurn_3_2 + EndTurn_3_1 + EndTurn_3_0 + BeginLoop_3_0_0 + EndTurn_3_6 + EndTurn_3_5 + EndTurn_3_4 + BeginLoop_3_5_0 + BeginLoop_3_6_0 + BeginLoop_3_1_0 + BeginLoop_3_2_0 + BeginLoop_3_3_0 + BeginLoop_3_4_0 + WantSection_3_F + TestAlone_3_6_2 + TestTurn_3_1 + TestTurn_3_0 + TestTurn_3_5 + TestTurn_3_4 + TestTurn_3_3 + TestTurn_3_2 + TestAlone_3_3_7 + TestTurn_3_6 + TestIdentity_3_3_7 + AskForSection_3_0 = 1
inv : IsEndLoop_2_0_0 + IsEndLoop_2_1_0 + IsEndLoop_2_2_0 + IsEndLoop_2_3_0 + IsEndLoop_2_4_0 + IsEndLoop_2_5_0 + IsEndLoop_2_6_0 + IsEndLoop_2_0_1 + IsEndLoop_2_1_1 + IsEndLoop_2_2_1 + IsEndLoop_2_3_1 + IsEndLoop_2_4_1 + IsEndLoop_2_5_1 + IsEndLoop_2_6_1 + IsEndLoop_2_0_3 + IsEndLoop_2_2_3 + IsEndLoop_2_1_3 + IsEndLoop_2_4_3 + IsEndLoop_2_3_3 + IsEndLoop_2_6_3 + IsEndLoop_2_5_3 + IsEndLoop_2_1_4 + IsEndLoop_2_0_4 + IsEndLoop_2_3_4 + IsEndLoop_2_2_4 + IsEndLoop_2_6_4 + IsEndLoop_2_0_5 + IsEndLoop_2_4_4 + IsEndLoop_2_5_4 + IsEndLoop_2_3_5 + IsEndLoop_2_4_5 + IsEndLoop_2_1_5 + IsEndLoop_2_2_5 + IsEndLoop_2_0_6 + IsEndLoop_2_1_6 + IsEndLoop_2_5_5 + IsEndLoop_2_6_5 + IsEndLoop_2_4_6 + IsEndLoop_2_5_6 + IsEndLoop_2_2_6 + IsEndLoop_2_3_6 + IsEndLoop_2_6_6 + EndTurn_2_3 + EndTurn_2_2 + EndTurn_2_1 + EndTurn_2_0 + BeginLoop_2_0_0 + EndTurn_2_6 + EndTurn_2_5 + EndTurn_2_4 + BeginLoop_2_5_0 + BeginLoop_2_6_0 + BeginLoop_2_1_0 + BeginLoop_2_2_0 + BeginLoop_2_3_0 + BeginLoop_2_4_0 + WantSection_2_F + TestTurn_2_1 + TestTurn_2_0 + TestTurn_2_5 + TestTurn_2_4 + TestTurn_2_3 + TestTurn_2_2 + TestTurn_2_6 + AskForSection_2_0 = 1
inv : IsEndLoop_7_0_0 + IsEndLoop_7_1_0 + IsEndLoop_7_2_0 + IsEndLoop_7_3_0 + IsEndLoop_7_4_0 + IsEndLoop_7_5_0 + IsEndLoop_7_6_0 + IsEndLoop_7_0_1 + IsEndLoop_7_1_1 + IsEndLoop_7_2_1 + IsEndLoop_7_3_1 + IsEndLoop_7_4_1 + IsEndLoop_7_5_1 + IsEndLoop_7_6_1 + IsEndLoop_7_0_2 + IsEndLoop_7_2_2 + IsEndLoop_7_1_2 + IsEndLoop_7_4_2 + IsEndLoop_7_3_2 + IsEndLoop_7_6_2 + IsEndLoop_7_5_2 + IsEndLoop_7_1_3 + IsEndLoop_7_0_3 + IsEndLoop_7_3_3 + IsEndLoop_7_2_3 + IsEndLoop_7_5_3 + IsEndLoop_7_4_3 + IsEndLoop_7_0_4 + IsEndLoop_7_6_3 + IsEndLoop_7_2_4 + IsEndLoop_7_1_4 + IsEndLoop_7_5_4 + IsEndLoop_7_6_4 + IsEndLoop_7_3_4 + IsEndLoop_7_4_4 + IsEndLoop_7_2_5 + IsEndLoop_7_3_5 + IsEndLoop_7_0_5 + IsEndLoop_7_1_5 + IsEndLoop_7_6_5 + IsEndLoop_7_4_5 + IsEndLoop_7_5_5 + EndTurn_7_2 + EndTurn_7_1 + EndTurn_7_0 + EndTurn_7_6 + EndTurn_7_5 + EndTurn_7_4 + EndTurn_7_3 + BeginLoop_7_4_0 + BeginLoop_7_5_0 + BeginLoop_7_6_0 + BeginLoop_7_0_0 + BeginLoop_7_1_0 + BeginLoop_7_2_0 + BeginLoop_7_3_0 + WantSection_7_F + TestAlone_7_6_4 + TestTurn_7_0 + TestTurn_7_4 + TestTurn_7_3 + TestTurn_7_2 + TestTurn_7_1 + TestTurn_7_5 + TestTurn_7_6 + AskForSection_7_0 = 1
inv : IsEndLoop_5_0_0 + IsEndLoop_5_1_0 + IsEndLoop_5_2_0 + IsEndLoop_5_3_0 + IsEndLoop_5_4_0 + IsEndLoop_5_5_0 + IsEndLoop_5_6_0 + IsEndLoop_5_0_1 + IsEndLoop_5_1_1 + IsEndLoop_5_2_1 + IsEndLoop_5_3_1 + IsEndLoop_5_4_1 + IsEndLoop_5_5_1 + IsEndLoop_5_6_1 + IsEndLoop_5_0_2 + IsEndLoop_5_2_2 + IsEndLoop_5_1_2 + IsEndLoop_5_4_2 + IsEndLoop_5_3_2 + IsEndLoop_5_6_2 + IsEndLoop_5_5_2 + IsEndLoop_5_1_3 + IsEndLoop_5_0_3 + IsEndLoop_5_3_3 + IsEndLoop_5_2_3 + IsEndLoop_5_5_3 + IsEndLoop_5_4_3 + IsEndLoop_5_0_4 + IsEndLoop_5_6_3 + IsEndLoop_5_2_4 + IsEndLoop_5_1_4 + IsEndLoop_5_5_4 + IsEndLoop_5_6_4 + IsEndLoop_5_3_4 + IsEndLoop_5_4_4 + IsEndLoop_5_0_6 + IsEndLoop_5_3_6 + IsEndLoop_5_4_6 + IsEndLoop_5_1_6 + IsEndLoop_5_2_6 + IsEndLoop_5_6_6 + IsEndLoop_5_5_6 + EndTurn_5_2 + EndTurn_5_1 + EndTurn_5_0 + EndTurn_5_6 + EndTurn_5_5 + EndTurn_5_4 + EndTurn_5_3 + BeginLoop_5_4_0 + BeginLoop_5_5_0 + BeginLoop_5_6_0 + BeginLoop_5_0_0 + BeginLoop_5_1_0 + BeginLoop_5_2_0 + BeginLoop_5_3_0 + WantSection_5_F + TestAlone_5_6_3 + TestTurn_5_0 + TestTurn_5_4 + TestTurn_5_3 + TestTurn_5_2 + TestTurn_5_1 + TestTurn_5_5 + TestTurn_5_6 + AskForSection_5_0 = 1
inv : WantSection_3_T + WantSection_3_F = 1
inv : Turn_6_6 + Turn_6_5 + Turn_6_4 + Turn_6_3 + Turn_6_1 + Turn_6_2 + Turn_6_0 + Turn_6_7 = 1
inv : WantSection_1_T + WantSection_1_F = 1
inv : Turn_0_7 + Turn_0_6 + Turn_0_5 + Turn_0_3 + Turn_0_4 + Turn_0_2 + Turn_0_1 + Turn_0_0 = 1
inv : Turn_4_6 + Turn_4_5 + Turn_4_4 + Turn_4_3 + Turn_4_2 + Turn_4_1 + Turn_4_0 + Turn_4_7 = 1
Total of 23 invariants.
[2020-05-21 03:16:52] [INFO ] Computed 23 place invariants in 22 ms
SDD proceeding with computation, new max is 256
[2020-05-21 03:16:53] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-08(UNSAT) depth K=2 took 1388 ms
SDD proceeding with computation, new max is 512
[2020-05-21 03:16:53] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=2 took 351 ms
[2020-05-21 03:16:54] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-10(UNSAT) depth K=2 took 462 ms
[2020-05-21 03:16:54] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-11(UNSAT) depth K=2 took 790 ms
SDD proceeding with computation, new max is 1024
[2020-05-21 03:16:56] [INFO ] Proved 593 variables to be positive in 3129 ms
[2020-05-21 03:16:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-08
[2020-05-21 03:16:56] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-08(SAT) depth K=0 took 73 ms
[2020-05-21 03:16:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-09
[2020-05-21 03:16:56] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-09(SAT) depth K=0 took 67 ms
[2020-05-21 03:16:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-10
[2020-05-21 03:16:56] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-10(SAT) depth K=0 took 62 ms
[2020-05-21 03:16:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-11
[2020-05-21 03:16:56] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-11(SAT) depth K=0 took 64 ms
[2020-05-21 03:16:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-08
[2020-05-21 03:16:56] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-08(SAT) depth K=1 took 403 ms
SDD proceeding with computation, new max is 2048
[2020-05-21 03:16:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-09
[2020-05-21 03:16:57] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-09(SAT) depth K=1 took 296 ms
[2020-05-21 03:16:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-10
[2020-05-21 03:16:57] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-10(SAT) depth K=1 took 299 ms
[2020-05-21 03:16:57] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-11
[2020-05-21 03:16:57] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-11(SAT) depth K=1 took 296 ms
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
[2020-05-21 03:17:20] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-08(UNSAT) depth K=3 took 25972 ms
SDD proceeding with computation, new max is 16384
Compilation finished in 38556 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 828 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, PetersonPT7ReachabilityFireability08==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, PetersonPT7ReachabilityFireability08==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, PetersonPT7ReachabilityFireability08==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)
SDD proceeding with computation, new max is 32768
[2020-05-21 03:18:37] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=3 took 77058 ms
SDD proceeding with computation, new max is 65536
[2020-05-21 03:19:05] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-10(UNSAT) depth K=3 took 27486 ms
[2020-05-21 03:19:34] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-11(UNSAT) depth K=3 took 28857 ms
SDD proceeding with computation, new max is 131072
[2020-05-21 03:23:56] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-08(UNSAT) depth K=4 took 262281 ms
[2020-05-21 03:25:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-08
[2020-05-21 03:25:12] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-08(SAT) depth K=2 took 494433 ms
[2020-05-21 03:26:26] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=4 took 150123 ms
[2020-05-21 03:29:36] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-10(UNSAT) depth K=4 took 189798 ms
SDD proceeding with computation, new max is 262144
[2020-05-21 03:31:33] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-11(UNSAT) depth K=4 took 117102 ms
[2020-05-21 03:41:33] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-08(UNSAT) depth K=5 took 599229 ms
Detected timeout of ITS tools.
[2020-05-21 03:42:48] [INFO ] Flatten gal took : 2353 ms
[2020-05-21 03:42:49] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityFireability.pnml.gal : 375 ms
[2020-05-21 03:42:49] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityFireability.prop : 17 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityFireability.pnml.gal, -t, CGAL, -reachable-file, ReachabilityFireability.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityFireability.pnml.gal -t CGAL -reachable-file ReachabilityFireability.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityFireability.prop.
Read [reachable] property : Peterson-PT-7-ReachabilityFireability-08 with value :((((WantSection_4_T>=1)&&(TestAlone_7_6_4>=1))||((((WantSection_3_F>=1)&&(TestAlone_5_6_3>=1))&&(TestTurn_6_4>=1))&&(Turn_4_7>=1)))||(((WantSection_5_T>=1)&&(TestAlone_0_0_5>=1))&&(TestIdentity_3_3_7>=1)))
Read [invariant] property : Peterson-PT-7-ReachabilityFireability-09 with value :((WantSection_4_F<1)||(TestAlone_6_1_4<1))
Read [invariant] property : Peterson-PT-7-ReachabilityFireability-10 with value :(IsEndLoop_3_6_1<1)
Read [reachable] property : Peterson-PT-7-ReachabilityFireability-11 with value :(TestIdentity_6_3_3>=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
[2020-05-21 03:48:37] [INFO ] BMC solution for property Peterson-PT-7-ReachabilityFireability-09(UNSAT) depth K=5 took 423983 ms
[2020-05-21 03:49:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-09
[2020-05-21 03:49:45] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-09(SAT) depth K=2 took 1473050 ms
[2020-05-21 03:51:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-10
[2020-05-21 03:51:16] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-10(SAT) depth K=2 took 91390 ms
[2020-05-21 03:52:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-11
[2020-05-21 03:52:05] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-11(SAT) depth K=2 took 49321 ms
SDD proceeding with computation, new max is 262144
[2020-05-21 03:55:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-08
[2020-05-21 03:55:16] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-08(SAT) depth K=3 took 190378 ms
SDD proceeding with computation, new max is 524288
[2020-05-21 03:59:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesPeterson-PT-7-ReachabilityFireability-09
[2020-05-21 03:59:10] [INFO ] KInduction solution for property Peterson-PT-7-ReachabilityFireability-09(SAT) depth K=3 took 233792 ms

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="Peterson-PT-7"
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 Peterson-PT-7, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r111-csrt-158961258100751"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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