Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 4.0K May 14 02:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 14 02:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 13 19:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 13 19:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 14 10:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 14 10:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 14 10:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.3K May 13 14:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 13 14:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 13 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 13 09:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 1.9M May 12 20:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1590617809534

[2020-05-27 22:16:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-27 22:16:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-27 22:16:51] [INFO ] Load time of PNML (sax parser for PT used): 269 ms
[2020-05-27 22:16:51] [INFO ] Transformed 7803 places.
[2020-05-27 22:16:51] [INFO ] Transformed 7103 transitions.
[2020-05-27 22:16:51] [INFO ] Found NUPN structural information;
[2020-05-27 22:16:51] [INFO ] Parsed PT model containing 7803 places and 7103 transitions in 584 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 203 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 196 ms. (steps per millisecond=51 ) properties seen :[1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0]
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 21 ms. (steps per millisecond=476 ) 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 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) 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 18 ms. (steps per millisecond=555 ) 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 20 ms. (steps per millisecond=500 ) 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 23 ms. (steps per millisecond=434 ) 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 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 7103 rows 7803 cols
[2020-05-27 22:16:52] [INFO ] Computed 1101 place invariants in 198 ms
[2020-05-27 22:16:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:16:57] [INFO ] [Real]Absence check using 1101 positive place invariants in 3794 ms returned (error "Failed to check-sat")
[2020-05-27 22:16:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:16:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2020-05-27 22:17:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:17:02] [INFO ] [Real]Absence check using 1101 positive place invariants in 3891 ms returned unknown
[2020-05-27 22:17:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:17:07] [INFO ] [Real]Absence check using 1101 positive place invariants in 3855 ms returned (error "Failed to check-sat")
[2020-05-27 22:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:17:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 2
[2020-05-27 22:17:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:17:12] [INFO ] [Real]Absence check using 1101 positive place invariants in 3834 ms returned (error "Failed to check-sat")
[2020-05-27 22:17:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:17:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 3
[2020-05-27 22:17:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:17:17] [INFO ] [Real]Absence check using 1101 positive place invariants in 3682 ms returned (error "Failed to check-sat")
[2020-05-27 22:17:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:17:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 4
[2020-05-27 22:17:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:17:22] [INFO ] [Real]Absence check using 1101 positive place invariants in 3863 ms returned (error "Failed to check-sat")
[2020-05-27 22:17:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:17:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 5
[2020-05-27 22:17:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:17:27] [INFO ] [Real]Absence check using 1101 positive place invariants in 4171 ms returned (error "Failed to check-sat")
[2020-05-27 22:17:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:17:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 6
[2020-05-27 22:17:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:17:32] [INFO ] [Real]Absence check using 1101 positive place invariants in 4036 ms returned (error "Failed to check-sat")
[2020-05-27 22:17:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:17:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 7
[2020-05-27 22:17:37] [INFO ] [Real]Absence check using 1101 positive place invariants in 3801 ms returned (error "Failed to check-sat")
[2020-05-27 22:17:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:17:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 8
[2020-05-27 22:17:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:17:42] [INFO ] [Real]Absence check using 1101 positive place invariants in 3848 ms returned (error "Failed to check-sat")
[2020-05-27 22:17:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:17:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 9
Support contains 36 out of 7803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 7803/7803 places, 7103/7103 transitions.
Performed 1891 Post agglomeration using F-continuation condition.Transition count delta: 1891
Iterating post reduction 0 with 1891 rules applied. Total rules applied 1891 place count 7803 transition count 5212
Reduce places removed 1891 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 1893 rules applied. Total rules applied 3784 place count 5912 transition count 5210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 3785 place count 5911 transition count 5210
Performed 401 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 401 Pre rules applied. Total rules applied 3785 place count 5911 transition count 4809
Deduced a syphon composed of 401 places in 28 ms
Reduce places removed 401 places and 0 transitions.
Iterating global reduction 3 with 802 rules applied. Total rules applied 4587 place count 5510 transition count 4809
Symmetric choice reduction at 3 with 697 rule applications. Total rules 5284 place count 5510 transition count 4809
Deduced a syphon composed of 697 places in 58 ms
Reduce places removed 697 places and 697 transitions.
Iterating global reduction 3 with 1394 rules applied. Total rules applied 6678 place count 4813 transition count 4112
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 292 Pre rules applied. Total rules applied 6678 place count 4813 transition count 3820
Deduced a syphon composed of 292 places in 18 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 7262 place count 4521 transition count 3820
Performed 1691 Post agglomeration using F-continuation condition.Transition count delta: 1691
Deduced a syphon composed of 1691 places in 10 ms
Reduce places removed 1691 places and 0 transitions.
Iterating global reduction 3 with 3382 rules applied. Total rules applied 10644 place count 2830 transition count 2129
Renaming transitions due to excessive name length > 1024 char.
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 11 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 10846 place count 2729 transition count 2129
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 7 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 11048 place count 2628 transition count 2129
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 9 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 11224 place count 2540 transition count 2129
Partial Free-agglomeration rule applied 290 times.
Drop transitions removed 290 transitions
Iterating global reduction 3 with 290 rules applied. Total rules applied 11514 place count 2540 transition count 2129
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 11515 place count 2539 transition count 2128
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11516 place count 2538 transition count 2128
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 11516 place count 2538 transition count 2126
Deduced a syphon composed of 2 places in 11 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 11520 place count 2536 transition count 2126
Applied a total of 11520 rules in 3855 ms. Remains 2536 /7803 variables (removed 5267) and now considering 2126/7103 (removed 4977) transitions.
Finished structural reductions, in 1 iterations. Remains : 2536/7803 places, 2126/7103 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 12641 ms. (steps per millisecond=79 ) properties seen :[0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 551707 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 605490 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 617751 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=123 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 621638 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=124 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 613150 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=122 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 600789 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 524863 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 552983 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 603049 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2126 rows 2536 cols
[2020-05-27 22:18:44] [INFO ] Computed 1100 place invariants in 8 ms
[2020-05-27 22:18:45] [INFO ] [Real]Absence check using 1100 positive place invariants in 1256 ms returned sat
[2020-05-27 22:18:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:18:58] [INFO ] [Real]Absence check using state equation in 12471 ms returned sat
[2020-05-27 22:18:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:19:00] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1229 ms returned sat
[2020-05-27 22:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:19:13] [INFO ] [Nat]Absence check using state equation in 13316 ms returned sat
[2020-05-27 22:19:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-05-27 22:19:13] [INFO ] [Nat]Added 13 Read/Feed constraints in 63 ms returned sat
[2020-05-27 22:19:14] [INFO ] Deduced a trap composed of 7 places in 486 ms
[2020-05-27 22:19:14] [INFO ] Deduced a trap composed of 6 places in 449 ms
[2020-05-27 22:19:15] [INFO ] Deduced a trap composed of 7 places in 448 ms
[2020-05-27 22:19:15] [INFO ] Deduced a trap composed of 5 places in 517 ms
[2020-05-27 22:19:16] [INFO ] Deduced a trap composed of 6 places in 452 ms
[2020-05-27 22:19:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3082 ms
[2020-05-27 22:19:16] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 149 ms.
[2020-05-27 22:19:36] [INFO ] Added : 530 causal constraints over 106 iterations in 20230 ms.(timeout) Result :sat
[2020-05-27 22:19:37] [INFO ] Deduced a trap composed of 5 places in 410 ms
[2020-05-27 22:19:37] [INFO ] Deduced a trap composed of 6 places in 421 ms
[2020-05-27 22:19:38] [INFO ] Deduced a trap composed of 5 places in 552 ms
[2020-05-27 22:19:39] [INFO ] Deduced a trap composed of 6 places in 416 ms
[2020-05-27 22:19:39] [INFO ] Deduced a trap composed of 6 places in 389 ms
[2020-05-27 22:19:40] [INFO ] Deduced a trap composed of 5 places in 319 ms
[2020-05-27 22:19:40] [INFO ] Deduced a trap composed of 5 places in 387 ms
[2020-05-27 22:19:41] [INFO ] Deduced a trap composed of 6 places in 374 ms
[2020-05-27 22:19:41] [INFO ] Deduced a trap composed of 5 places in 362 ms
[2020-05-27 22:19:42] [INFO ] Deduced a trap composed of 6 places in 361 ms
[2020-05-27 22:19:42] [INFO ] Deduced a trap composed of 5 places in 315 ms
[2020-05-27 22:19:43] [INFO ] Deduced a trap composed of 5 places in 307 ms
[2020-05-27 22:19:43] [INFO ] Deduced a trap composed of 6 places in 362 ms
[2020-05-27 22:19:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:19:46] [INFO ] Deduced a trap composed of 2 places in 2767 ms
[2020-05-27 22:19:46] [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 (> (+ s2356 s2357) 0)") while checking expression at index 0
[2020-05-27 22:19:48] [INFO ] [Real]Absence check using 1100 positive place invariants in 1392 ms returned sat
[2020-05-27 22:19:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:20:02] [INFO ] [Real]Absence check using state equation in 14847 ms returned sat
[2020-05-27 22:20:03] [INFO ] [Real]Added 13 Read/Feed constraints in 34 ms returned sat
[2020-05-27 22:20:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:20:04] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1292 ms returned sat
[2020-05-27 22:20:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:20:18] [INFO ] [Nat]Absence check using state equation in 13959 ms returned sat
[2020-05-27 22:20:18] [INFO ] [Nat]Added 13 Read/Feed constraints in 22 ms returned sat
[2020-05-27 22:20:19] [INFO ] Deduced a trap composed of 5 places in 468 ms
[2020-05-27 22:20:20] [INFO ] Deduced a trap composed of 6 places in 1134 ms
[2020-05-27 22:20:23] [INFO ] Deduced a trap composed of 5 places in 2848 ms
[2020-05-27 22:20:25] [INFO ] Deduced a trap composed of 5 places in 1488 ms
[2020-05-27 22:20:25] [INFO ] Deduced a trap composed of 7 places in 537 ms
[2020-05-27 22:20:26] [INFO ] Deduced a trap composed of 5 places in 498 ms
[2020-05-27 22:20:27] [INFO ] Deduced a trap composed of 6 places in 524 ms
[2020-05-27 22:20:27] [INFO ] Deduced a trap composed of 7 places in 497 ms
[2020-05-27 22:20:28] [INFO ] Deduced a trap composed of 5 places in 556 ms
[2020-05-27 22:20:29] [INFO ] Deduced a trap composed of 5 places in 660 ms
[2020-05-27 22:20:29] [INFO ] Deduced a trap composed of 8 places in 501 ms
[2020-05-27 22:20:30] [INFO ] Deduced a trap composed of 6 places in 594 ms
[2020-05-27 22:20:30] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 11862 ms
[2020-05-27 22:20:30] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 168 ms.
[2020-05-27 22:20:48] [INFO ] Added : 420 causal constraints over 84 iterations in 17443 ms. Result :unknown
[2020-05-27 22:20:52] [INFO ] [Real]Absence check using 1100 positive place invariants in 3461 ms returned sat
[2020-05-27 22:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:21:02] [INFO ] [Real]Absence check using state equation in 10487 ms returned sat
[2020-05-27 22:21:02] [INFO ] [Real]Added 13 Read/Feed constraints in 43 ms returned sat
[2020-05-27 22:21:04] [INFO ] Deduced a trap composed of 5 places in 2006 ms
[2020-05-27 22:21:05] [INFO ] Deduced a trap composed of 5 places in 581 ms
[2020-05-27 22:21:06] [INFO ] Deduced a trap composed of 6 places in 563 ms
[2020-05-27 22:21:06] [INFO ] Deduced a trap composed of 3 places in 532 ms
[2020-05-27 22:21:07] [INFO ] Deduced a trap composed of 5 places in 463 ms
[2020-05-27 22:21:07] [INFO ] Deduced a trap composed of 3 places in 585 ms
[2020-05-27 22:21:08] [INFO ] Deduced a trap composed of 5 places in 565 ms
[2020-05-27 22:21:09] [INFO ] Deduced a trap composed of 5 places in 445 ms
[2020-05-27 22:21:09] [INFO ] Deduced a trap composed of 5 places in 728 ms
[2020-05-27 22:21:10] [INFO ] Deduced a trap composed of 6 places in 530 ms
[2020-05-27 22:21:11] [INFO ] Deduced a trap composed of 5 places in 544 ms
[2020-05-27 22:21:11] [INFO ] Deduced a trap composed of 4 places in 509 ms
[2020-05-27 22:21:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 9110 ms
[2020-05-27 22:21:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:21:13] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1142 ms returned sat
[2020-05-27 22:21:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:21:25] [INFO ] [Nat]Absence check using state equation in 12084 ms returned sat
[2020-05-27 22:21:25] [INFO ] [Nat]Added 13 Read/Feed constraints in 27 ms returned sat
[2020-05-27 22:21:25] [INFO ] Deduced a trap composed of 5 places in 527 ms
[2020-05-27 22:21:26] [INFO ] Deduced a trap composed of 6 places in 542 ms
[2020-05-27 22:21:27] [INFO ] Deduced a trap composed of 5 places in 654 ms
[2020-05-27 22:21:28] [INFO ] Deduced a trap composed of 5 places in 544 ms
[2020-05-27 22:21:28] [INFO ] Deduced a trap composed of 6 places in 418 ms
[2020-05-27 22:21:29] [INFO ] Deduced a trap composed of 6 places in 441 ms
[2020-05-27 22:21:29] [INFO ] Deduced a trap composed of 4 places in 507 ms
[2020-05-27 22:21:30] [INFO ] Deduced a trap composed of 5 places in 503 ms
[2020-05-27 22:21:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4872 ms
[2020-05-27 22:21:30] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 113 ms.
[2020-05-27 22:21:50] [INFO ] Added : 625 causal constraints over 125 iterations in 20079 ms.(timeout) Result :sat
[2020-05-27 22:21:50] [INFO ] Deduced a trap composed of 5 places in 301 ms
[2020-05-27 22:21:51] [INFO ] Deduced a trap composed of 6 places in 308 ms
[2020-05-27 22:21:51] [INFO ] Deduced a trap composed of 5 places in 335 ms
[2020-05-27 22:21:52] [INFO ] Deduced a trap composed of 6 places in 328 ms
[2020-05-27 22:21:52] [INFO ] Deduced a trap composed of 5 places in 272 ms
[2020-05-27 22:21:52] [INFO ] Deduced a trap composed of 5 places in 190 ms
[2020-05-27 22:21:53] [INFO ] Deduced a trap composed of 5 places in 334 ms
[2020-05-27 22:21:53] [INFO ] Deduced a trap composed of 5 places in 293 ms
[2020-05-27 22:21:54] [INFO ] Deduced a trap composed of 6 places in 276 ms
[2020-05-27 22:21:54] [INFO ] Deduced a trap composed of 7 places in 351 ms
[2020-05-27 22:21:54] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4451 ms
Attempting to minimize the solution found.
Minimization took 85 ms.
[2020-05-27 22:21:57] [INFO ] [Real]Absence check using 1100 positive place invariants in 1363 ms returned sat
[2020-05-27 22:21:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:22:10] [INFO ] [Real]Absence check using state equation in 13158 ms returned sat
[2020-05-27 22:22:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:22:11] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1347 ms returned sat
[2020-05-27 22:22:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:22:23] [INFO ] [Nat]Absence check using state equation in 11696 ms returned sat
[2020-05-27 22:22:23] [INFO ] [Nat]Added 13 Read/Feed constraints in 54 ms returned sat
[2020-05-27 22:22:24] [INFO ] Deduced a trap composed of 5 places in 514 ms
[2020-05-27 22:22:24] [INFO ] Deduced a trap composed of 6 places in 459 ms
[2020-05-27 22:22:25] [INFO ] Deduced a trap composed of 6 places in 326 ms
[2020-05-27 22:22:25] [INFO ] Deduced a trap composed of 5 places in 498 ms
[2020-05-27 22:22:25] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2127 ms
[2020-05-27 22:22:25] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 92 ms.
[2020-05-27 22:22:45] [INFO ] Added : 565 causal constraints over 113 iterations in 20088 ms.(timeout) Result :sat
[2020-05-27 22:22:46] [INFO ] Deduced a trap composed of 7 places in 392 ms
[2020-05-27 22:22:46] [INFO ] Deduced a trap composed of 5 places in 339 ms
[2020-05-27 22:22:47] [INFO ] Deduced a trap composed of 5 places in 377 ms
[2020-05-27 22:22:47] [INFO ] Deduced a trap composed of 6 places in 362 ms
[2020-05-27 22:22:48] [INFO ] Deduced a trap composed of 6 places in 357 ms
[2020-05-27 22:22:48] [INFO ] Deduced a trap composed of 6 places in 356 ms
[2020-05-27 22:22:49] [INFO ] Deduced a trap composed of 5 places in 320 ms
[2020-05-27 22:22:49] [INFO ] Deduced a trap composed of 5 places in 313 ms
[2020-05-27 22:22:50] [INFO ] Deduced a trap composed of 6 places in 342 ms
[2020-05-27 22:22:50] [INFO ] Deduced a trap composed of 6 places in 345 ms
[2020-05-27 22:22:51] [INFO ] Deduced a trap composed of 6 places in 326 ms
[2020-05-27 22:22:51] [INFO ] Deduced a trap composed of 6 places in 324 ms
[2020-05-27 22:22:52] [INFO ] Deduced a trap composed of 5 places in 332 ms
[2020-05-27 22:22:52] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-05-27 22:22:52] [INFO ] Deduced a trap composed of 7 places in 275 ms
[2020-05-27 22:22:53] [INFO ] Deduced a trap composed of 6 places in 323 ms
[2020-05-27 22:22:53] [INFO ] Deduced a trap composed of 6 places in 336 ms
[2020-05-27 22:22:54] [INFO ] Deduced a trap composed of 5 places in 347 ms
[2020-05-27 22:22:54] [INFO ] Deduced a trap composed of 5 places in 302 ms
[2020-05-27 22:22:55] [INFO ] Deduced a trap composed of 5 places in 289 ms
[2020-05-27 22:22:57] [INFO ] Deduced a trap composed of 2 places in 2649 ms
[2020-05-27 22:22:57] [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 (> (+ s2356 s2357) 0)") while checking expression at index 3
[2020-05-27 22:22:59] [INFO ] [Real]Absence check using 1100 positive place invariants in 1260 ms returned sat
[2020-05-27 22:22:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:23:11] [INFO ] [Real]Absence check using state equation in 11574 ms returned sat
[2020-05-27 22:23:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:23:12] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1111 ms returned sat
[2020-05-27 22:23:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:23:24] [INFO ] [Nat]Absence check using state equation in 12355 ms returned sat
[2020-05-27 22:23:24] [INFO ] [Nat]Added 13 Read/Feed constraints in 35 ms returned sat
[2020-05-27 22:23:25] [INFO ] Deduced a trap composed of 4 places in 556 ms
[2020-05-27 22:23:26] [INFO ] Deduced a trap composed of 6 places in 455 ms
[2020-05-27 22:23:26] [INFO ] Deduced a trap composed of 6 places in 550 ms
[2020-05-27 22:23:27] [INFO ] Deduced a trap composed of 6 places in 533 ms
[2020-05-27 22:23:28] [INFO ] Deduced a trap composed of 6 places in 530 ms
[2020-05-27 22:23:28] [INFO ] Deduced a trap composed of 6 places in 530 ms
[2020-05-27 22:23:29] [INFO ] Deduced a trap composed of 5 places in 537 ms
[2020-05-27 22:23:30] [INFO ] Deduced a trap composed of 5 places in 548 ms
[2020-05-27 22:23:30] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5351 ms
[2020-05-27 22:23:30] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 171 ms.
[2020-05-27 22:23:50] [INFO ] Added : 670 causal constraints over 134 iterations in 20136 ms.(timeout) Result :sat
[2020-05-27 22:23:50] [INFO ] Deduced a trap composed of 5 places in 363 ms
[2020-05-27 22:23:51] [INFO ] Deduced a trap composed of 5 places in 354 ms
[2020-05-27 22:23:51] [INFO ] Deduced a trap composed of 6 places in 353 ms
[2020-05-27 22:23:52] [INFO ] Deduced a trap composed of 6 places in 347 ms
[2020-05-27 22:23:52] [INFO ] Deduced a trap composed of 5 places in 347 ms
[2020-05-27 22:23:53] [INFO ] Deduced a trap composed of 7 places in 343 ms
[2020-05-27 22:23:53] [INFO ] Deduced a trap composed of 6 places in 252 ms
[2020-05-27 22:23:54] [INFO ] Deduced a trap composed of 5 places in 336 ms
[2020-05-27 22:23:54] [INFO ] Deduced a trap composed of 5 places in 326 ms
[2020-05-27 22:23:55] [INFO ] Deduced a trap composed of 5 places in 329 ms
[2020-05-27 22:23:55] [INFO ] Deduced a trap composed of 5 places in 317 ms
[2020-05-27 22:23:56] [INFO ] Deduced a trap composed of 6 places in 326 ms
[2020-05-27 22:23:56] [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 (> (+ s925 s926 s927 s929 s930 s939) 0)") while checking expression at index 4
[2020-05-27 22:23:57] [INFO ] [Real]Absence check using 1100 positive place invariants in 1161 ms returned sat
[2020-05-27 22:23:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:24:09] [INFO ] [Real]Absence check using state equation in 11725 ms returned sat
[2020-05-27 22:24:09] [INFO ] [Real]Added 13 Read/Feed constraints in 58 ms returned sat
[2020-05-27 22:24:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:24:11] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1300 ms returned sat
[2020-05-27 22:24:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:24:24] [INFO ] [Nat]Absence check using state equation in 12870 ms returned sat
[2020-05-27 22:24:24] [INFO ] [Nat]Added 13 Read/Feed constraints in 54 ms returned sat
[2020-05-27 22:24:24] [INFO ] Deduced a trap composed of 6 places in 630 ms
[2020-05-27 22:24:25] [INFO ] Deduced a trap composed of 6 places in 616 ms
[2020-05-27 22:24:26] [INFO ] Deduced a trap composed of 7 places in 571 ms
[2020-05-27 22:24:27] [INFO ] Deduced a trap composed of 5 places in 564 ms
[2020-05-27 22:24:27] [INFO ] Deduced a trap composed of 5 places in 526 ms
[2020-05-27 22:24:28] [INFO ] Deduced a trap composed of 5 places in 483 ms
[2020-05-27 22:24:28] [INFO ] Deduced a trap composed of 7 places in 400 ms
[2020-05-27 22:24:29] [INFO ] Deduced a trap composed of 6 places in 469 ms
[2020-05-27 22:24:29] [INFO ] Deduced a trap composed of 6 places in 373 ms
[2020-05-27 22:24:30] [INFO ] Deduced a trap composed of 6 places in 381 ms
[2020-05-27 22:24:30] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6056 ms
[2020-05-27 22:24:30] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 105 ms.
[2020-05-27 22:24:50] [INFO ] Added : 725 causal constraints over 145 iterations in 20145 ms.(timeout) Result :sat
[2020-05-27 22:24:50] [INFO ] Deduced a trap composed of 5 places in 327 ms
[2020-05-27 22:24:51] [INFO ] Deduced a trap composed of 6 places in 257 ms
[2020-05-27 22:24:51] [INFO ] Deduced a trap composed of 5 places in 224 ms
[2020-05-27 22:24:52] [INFO ] Deduced a trap composed of 5 places in 231 ms
[2020-05-27 22:24:52] [INFO ] Deduced a trap composed of 6 places in 277 ms
[2020-05-27 22:24:52] [INFO ] Deduced a trap composed of 6 places in 293 ms
[2020-05-27 22:24:53] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-05-27 22:24:53] [INFO ] Deduced a trap composed of 7 places in 309 ms
[2020-05-27 22:24:54] [INFO ] Deduced a trap composed of 6 places in 274 ms
[2020-05-27 22:24:54] [INFO ] Deduced a trap composed of 6 places in 300 ms
[2020-05-27 22:24:54] [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 (> (+ s2424 s2425 s2428 s2429 s2430 s2440) 0)") while checking expression at index 5
[2020-05-27 22:24:56] [INFO ] [Real]Absence check using 1100 positive place invariants in 1384 ms returned sat
[2020-05-27 22:24:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:25:08] [INFO ] [Real]Absence check using state equation in 12394 ms returned sat
[2020-05-27 22:25:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:25:10] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1266 ms returned sat
[2020-05-27 22:25:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:25:22] [INFO ] [Nat]Absence check using state equation in 12183 ms returned sat
[2020-05-27 22:25:22] [INFO ] [Nat]Added 13 Read/Feed constraints in 24 ms returned sat
[2020-05-27 22:25:23] [INFO ] Deduced a trap composed of 3 places in 546 ms
[2020-05-27 22:25:24] [INFO ] Deduced a trap composed of 5 places in 589 ms
[2020-05-27 22:25:24] [INFO ] Deduced a trap composed of 7 places in 559 ms
[2020-05-27 22:25:25] [INFO ] Deduced a trap composed of 5 places in 456 ms
[2020-05-27 22:25:25] [INFO ] Deduced a trap composed of 5 places in 497 ms
[2020-05-27 22:25:26] [INFO ] Deduced a trap composed of 5 places in 455 ms
[2020-05-27 22:25:26] [INFO ] Deduced a trap composed of 8 places in 417 ms
[2020-05-27 22:25:27] [INFO ] Deduced a trap composed of 6 places in 464 ms
[2020-05-27 22:25:28] [INFO ] Deduced a trap composed of 3 places in 550 ms
[2020-05-27 22:25:28] [INFO ] Deduced a trap composed of 5 places in 554 ms
[2020-05-27 22:25:29] [INFO ] Deduced a trap composed of 6 places in 477 ms
[2020-05-27 22:25:29] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 6565 ms
[2020-05-27 22:25:29] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 122 ms.
[2020-05-27 22:25:49] [INFO ] Added : 590 causal constraints over 118 iterations in 20172 ms.(timeout) Result :sat
[2020-05-27 22:25:50] [INFO ] Deduced a trap composed of 5 places in 376 ms
[2020-05-27 22:25:50] [INFO ] Deduced a trap composed of 5 places in 333 ms
[2020-05-27 22:25:51] [INFO ] Deduced a trap composed of 5 places in 305 ms
[2020-05-27 22:25:51] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-05-27 22:25:51] [INFO ] Deduced a trap composed of 7 places in 303 ms
[2020-05-27 22:25:52] [INFO ] Deduced a trap composed of 5 places in 245 ms
[2020-05-27 22:25:52] [INFO ] Deduced a trap composed of 5 places in 254 ms
[2020-05-27 22:25:52] [INFO ] Deduced a trap composed of 6 places in 268 ms
[2020-05-27 22:25:53] [INFO ] Deduced a trap composed of 6 places in 244 ms
[2020-05-27 22:25:53] [INFO ] Deduced a trap composed of 7 places in 290 ms
[2020-05-27 22:25:54] [INFO ] Deduced a trap composed of 5 places in 191 ms
[2020-05-27 22:25:54] [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 (> (+ s2090 s2091 s2095 s2096 s2105) 0)") while checking expression at index 6
[2020-05-27 22:25:55] [INFO ] [Real]Absence check using 1100 positive place invariants in 1326 ms returned sat
[2020-05-27 22:25:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:26:07] [INFO ] [Real]Absence check using state equation in 12364 ms returned sat
[2020-05-27 22:26:08] [INFO ] [Real]Added 13 Read/Feed constraints in 37 ms returned sat
[2020-05-27 22:26:08] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:26:09] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1029 ms returned sat
[2020-05-27 22:26:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:26:21] [INFO ] [Nat]Absence check using state equation in 12078 ms returned sat
[2020-05-27 22:26:21] [INFO ] [Nat]Added 13 Read/Feed constraints in 40 ms returned sat
[2020-05-27 22:26:22] [INFO ] Deduced a trap composed of 5 places in 516 ms
[2020-05-27 22:26:22] [INFO ] Deduced a trap composed of 7 places in 594 ms
[2020-05-27 22:26:23] [INFO ] Deduced a trap composed of 6 places in 526 ms
[2020-05-27 22:26:24] [INFO ] Deduced a trap composed of 5 places in 537 ms
[2020-05-27 22:26:24] [INFO ] Deduced a trap composed of 6 places in 514 ms
[2020-05-27 22:26:25] [INFO ] Deduced a trap composed of 7 places in 479 ms
[2020-05-27 22:26:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3765 ms
[2020-05-27 22:26:25] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 95 ms.
[2020-05-27 22:26:45] [INFO ] Added : 575 causal constraints over 115 iterations in 20220 ms.(timeout) Result :sat
[2020-05-27 22:26:45] [INFO ] Deduced a trap composed of 6 places in 375 ms
[2020-05-27 22:26:46] [INFO ] Deduced a trap composed of 7 places in 340 ms
[2020-05-27 22:26:46] [INFO ] Deduced a trap composed of 6 places in 341 ms
[2020-05-27 22:26:47] [INFO ] Deduced a trap composed of 6 places in 345 ms
[2020-05-27 22:26:47] [INFO ] Deduced a trap composed of 5 places in 341 ms
[2020-05-27 22:26:48] [INFO ] Deduced a trap composed of 5 places in 308 ms
[2020-05-27 22:26:48] [INFO ] Deduced a trap composed of 5 places in 276 ms
[2020-05-27 22:26:49] [INFO ] Deduced a trap composed of 6 places in 253 ms
[2020-05-27 22:26:49] [INFO ] Deduced a trap composed of 5 places in 354 ms
[2020-05-27 22:26:50] [INFO ] Deduced a trap composed of 6 places in 317 ms
[2020-05-27 22:26:50] [INFO ] Deduced a trap composed of 5 places in 318 ms
[2020-05-27 22:26:50] [INFO ] Deduced a trap composed of 5 places in 302 ms
[2020-05-27 22:26:51] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2020-05-27 22:26:51] [INFO ] Deduced a trap composed of 6 places in 299 ms
[2020-05-27 22:26:52] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6514 ms
Attempting to minimize the solution found.
Minimization took 65 ms.
[2020-05-27 22:26:54] [INFO ] [Real]Absence check using 1100 positive place invariants in 1534 ms returned sat
[2020-05-27 22:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:27:06] [INFO ] [Real]Absence check using state equation in 12861 ms returned sat
[2020-05-27 22:27:07] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:27:08] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1355 ms returned sat
[2020-05-27 22:27:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:27:21] [INFO ] [Nat]Absence check using state equation in 12475 ms returned sat
[2020-05-27 22:27:21] [INFO ] [Nat]Added 13 Read/Feed constraints in 53 ms returned sat
[2020-05-27 22:27:21] [INFO ] Deduced a trap composed of 5 places in 475 ms
[2020-05-27 22:27:22] [INFO ] Deduced a trap composed of 6 places in 391 ms
[2020-05-27 22:27:22] [INFO ] Deduced a trap composed of 5 places in 468 ms
[2020-05-27 22:27:23] [INFO ] Deduced a trap composed of 5 places in 478 ms
[2020-05-27 22:27:24] [INFO ] Deduced a trap composed of 7 places in 492 ms
[2020-05-27 22:27:24] [INFO ] Deduced a trap composed of 5 places in 457 ms
[2020-05-27 22:27:24] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3441 ms
[2020-05-27 22:27:24] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 153 ms.
[2020-05-27 22:27:44] [INFO ] Added : 565 causal constraints over 113 iterations in 20114 ms.(timeout) Result :sat
[2020-05-27 22:27:45] [INFO ] Deduced a trap composed of 5 places in 315 ms
[2020-05-27 22:27:45] [INFO ] Deduced a trap composed of 5 places in 305 ms
[2020-05-27 22:27:46] [INFO ] Deduced a trap composed of 6 places in 308 ms
[2020-05-27 22:27:46] [INFO ] Deduced a trap composed of 6 places in 300 ms
[2020-05-27 22:27:46] [INFO ] Deduced a trap composed of 5 places in 306 ms
[2020-05-27 22:27:47] [INFO ] Deduced a trap composed of 5 places in 289 ms
[2020-05-27 22:27:47] [INFO ] Deduced a trap composed of 6 places in 411 ms
[2020-05-27 22:27:48] [INFO ] Deduced a trap composed of 6 places in 390 ms
[2020-05-27 22:27:48] [INFO ] Deduced a trap composed of 5 places in 318 ms
[2020-05-27 22:27:49] [INFO ] Deduced a trap composed of 6 places in 278 ms
[2020-05-27 22:27:49] [INFO ] Deduced a trap composed of 5 places in 259 ms
[2020-05-27 22:27:50] [INFO ] Deduced a trap composed of 7 places in 351 ms
[2020-05-27 22:27:50] [INFO ] Deduced a trap composed of 6 places in 284 ms
[2020-05-27 22:27:51] [INFO ] Deduced a trap composed of 5 places in 297 ms
[2020-05-27 22:27:51] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 6462 ms
Attempting to minimize the solution found.
Minimization took 68 ms.
Incomplete Parikh walk after 149500 steps, including 1002 resets, run finished after 2542 ms. (steps per millisecond=58 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 163300 steps, including 1002 resets, run finished after 1992 ms. (steps per millisecond=81 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 155400 steps, including 1002 resets, run finished after 1881 ms. (steps per millisecond=82 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 143200 steps, including 1002 resets, run finished after 1713 ms. (steps per millisecond=83 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 32 out of 2536 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2536/2536 places, 2126/2126 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2536 transition count 2125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2535 transition count 2125
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 2533 transition count 2123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 2532 transition count 2122
Applied a total of 7 rules in 280 ms. Remains 2532 /2536 variables (removed 4) and now considering 2122/2126 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 2532/2536 places, 2122/2126 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 11238 ms. (steps per millisecond=88 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 519921 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=103 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 616420 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=123 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 591820 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 587099 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=117 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 563659 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=112 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 570146 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 547041 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 569365 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=113 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 556706 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=111 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 913400 steps, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 913400 steps, saw 147798 distinct states, run finished after 30001 ms. (steps per millisecond=30 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2122 rows 2532 cols
[2020-05-27 22:29:26] [INFO ] Computed 1100 place invariants in 9 ms
[2020-05-27 22:29:27] [INFO ] [Real]Absence check using 1100 positive place invariants in 1376 ms returned sat
[2020-05-27 22:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:29:42] [INFO ] [Real]Absence check using state equation in 14270 ms returned sat
[2020-05-27 22:29:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:29:43] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1211 ms returned sat
[2020-05-27 22:29:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:29:57] [INFO ] [Nat]Absence check using state equation in 13279 ms returned sat
[2020-05-27 22:29:57] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-05-27 22:29:57] [INFO ] [Nat]Added 11 Read/Feed constraints in 70 ms returned sat
[2020-05-27 22:29:57] [INFO ] Deduced a trap composed of 6 places in 557 ms
[2020-05-27 22:29:58] [INFO ] Deduced a trap composed of 6 places in 500 ms
[2020-05-27 22:29:59] [INFO ] Deduced a trap composed of 5 places in 534 ms
[2020-05-27 22:29:59] [INFO ] Deduced a trap composed of 5 places in 491 ms
[2020-05-27 22:30:00] [INFO ] Deduced a trap composed of 5 places in 440 ms
[2020-05-27 22:30:00] [INFO ] Deduced a trap composed of 6 places in 543 ms
[2020-05-27 22:30:01] [INFO ] Deduced a trap composed of 6 places in 513 ms
[2020-05-27 22:30:02] [INFO ] Deduced a trap composed of 5 places in 516 ms
[2020-05-27 22:30:02] [INFO ] Deduced a trap composed of 5 places in 517 ms
[2020-05-27 22:30:03] [INFO ] Deduced a trap composed of 5 places in 480 ms
[2020-05-27 22:30:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 6282 ms
[2020-05-27 22:30:03] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 136 ms.
[2020-05-27 22:30:23] [INFO ] Added : 505 causal constraints over 101 iterations in 20133 ms.(timeout) Result :sat
[2020-05-27 22:30:24] [INFO ] Deduced a trap composed of 6 places in 367 ms
[2020-05-27 22:30:24] [INFO ] Deduced a trap composed of 5 places in 359 ms
[2020-05-27 22:30:25] [INFO ] Deduced a trap composed of 5 places in 400 ms
[2020-05-27 22:30:25] [INFO ] Deduced a trap composed of 5 places in 374 ms
[2020-05-27 22:30:26] [INFO ] Deduced a trap composed of 6 places in 371 ms
[2020-05-27 22:30:26] [INFO ] Deduced a trap composed of 6 places in 369 ms
[2020-05-27 22:30:27] [INFO ] Deduced a trap composed of 7 places in 283 ms
[2020-05-27 22:30:27] [INFO ] Deduced a trap composed of 5 places in 351 ms
[2020-05-27 22:30:27] [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 (> (+ s622 s623 s627 s628 s637) 0)") while checking expression at index 0
[2020-05-27 22:30:29] [INFO ] [Real]Absence check using 1100 positive place invariants in 1214 ms returned sat
[2020-05-27 22:30:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:30:42] [INFO ] [Real]Absence check using state equation in 13424 ms returned sat
[2020-05-27 22:30:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:30:44] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1235 ms returned sat
[2020-05-27 22:30:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:30:57] [INFO ] [Nat]Absence check using state equation in 12989 ms returned sat
[2020-05-27 22:30:57] [INFO ] [Nat]Added 11 Read/Feed constraints in 51 ms returned sat
[2020-05-27 22:30:57] [INFO ] Deduced a trap composed of 6 places in 486 ms
[2020-05-27 22:30:58] [INFO ] Deduced a trap composed of 6 places in 442 ms
[2020-05-27 22:30:58] [INFO ] Deduced a trap composed of 6 places in 436 ms
[2020-05-27 22:30:59] [INFO ] Deduced a trap composed of 7 places in 404 ms
[2020-05-27 22:30:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2189 ms
[2020-05-27 22:30:59] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 132 ms.
[2020-05-27 22:31:19] [INFO ] Added : 545 causal constraints over 109 iterations in 20232 ms.(timeout) Result :sat
[2020-05-27 22:31:20] [INFO ] Deduced a trap composed of 5 places in 359 ms
[2020-05-27 22:31:20] [INFO ] Deduced a trap composed of 6 places in 346 ms
[2020-05-27 22:31:21] [INFO ] Deduced a trap composed of 8 places in 356 ms
[2020-05-27 22:31:21] [INFO ] Deduced a trap composed of 6 places in 256 ms
[2020-05-27 22:31:22] [INFO ] Deduced a trap composed of 7 places in 338 ms
[2020-05-27 22:31:22] [INFO ] Deduced a trap composed of 5 places in 335 ms
[2020-05-27 22:31:23] [INFO ] Deduced a trap composed of 6 places in 316 ms
[2020-05-27 22:31:23] [INFO ] Deduced a trap composed of 7 places in 330 ms
[2020-05-27 22:31:24] [INFO ] Deduced a trap composed of 5 places in 306 ms
[2020-05-27 22:31:24] [INFO ] Deduced a trap composed of 6 places in 303 ms
[2020-05-27 22:31:24] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4974 ms
Attempting to minimize the solution found.
Minimization took 95 ms.
[2020-05-27 22:31:26] [INFO ] [Real]Absence check using 1100 positive place invariants in 1324 ms returned sat
[2020-05-27 22:31:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:31:38] [INFO ] [Real]Absence check using state equation in 11663 ms returned sat
[2020-05-27 22:31:38] [INFO ] [Real]Added 11 Read/Feed constraints in 32 ms returned sat
[2020-05-27 22:31:38] [INFO ] Deduced a trap composed of 5 places in 478 ms
[2020-05-27 22:31:39] [INFO ] Deduced a trap composed of 3 places in 614 ms
[2020-05-27 22:31:40] [INFO ] Deduced a trap composed of 7 places in 590 ms
[2020-05-27 22:31:41] [INFO ] Deduced a trap composed of 6 places in 594 ms
[2020-05-27 22:31:41] [INFO ] Deduced a trap composed of 3 places in 591 ms
[2020-05-27 22:31:42] [INFO ] Deduced a trap composed of 5 places in 588 ms
[2020-05-27 22:31:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4076 ms
[2020-05-27 22:31:42] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:31:44] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1212 ms returned sat
[2020-05-27 22:31:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:31:58] [INFO ] [Nat]Absence check using state equation in 14233 ms returned sat
[2020-05-27 22:31:58] [INFO ] [Nat]Added 11 Read/Feed constraints in 49 ms returned sat
[2020-05-27 22:31:59] [INFO ] Deduced a trap composed of 6 places in 479 ms
[2020-05-27 22:31:59] [INFO ] Deduced a trap composed of 5 places in 461 ms
[2020-05-27 22:32:00] [INFO ] Deduced a trap composed of 5 places in 449 ms
[2020-05-27 22:32:00] [INFO ] Deduced a trap composed of 7 places in 408 ms
[2020-05-27 22:32:00] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2211 ms
[2020-05-27 22:32:00] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 125 ms.
[2020-05-27 22:32:20] [INFO ] Added : 565 causal constraints over 113 iterations in 20205 ms.(timeout) Result :sat
[2020-05-27 22:32:21] [INFO ] Deduced a trap composed of 5 places in 403 ms
[2020-05-27 22:32:21] [INFO ] Deduced a trap composed of 6 places in 399 ms
[2020-05-27 22:32:22] [INFO ] Deduced a trap composed of 6 places in 347 ms
[2020-05-27 22:32:22] [INFO ] Deduced a trap composed of 6 places in 289 ms
[2020-05-27 22:32:23] [INFO ] Deduced a trap composed of 6 places in 266 ms
[2020-05-27 22:32:23] [INFO ] Deduced a trap composed of 6 places in 266 ms
[2020-05-27 22:32:24] [INFO ] Deduced a trap composed of 6 places in 302 ms
[2020-05-27 22:32:24] [INFO ] Deduced a trap composed of 6 places in 248 ms
[2020-05-27 22:32:24] [INFO ] Deduced a trap composed of 5 places in 242 ms
[2020-05-27 22:32:25] [INFO ] Deduced a trap composed of 8 places in 233 ms
[2020-05-27 22:32:25] [INFO ] Deduced a trap composed of 5 places in 217 ms
[2020-05-27 22:32:26] [INFO ] Deduced a trap composed of 5 places in 246 ms
[2020-05-27 22:32:26] [INFO ] Deduced a trap composed of 6 places in 206 ms
[2020-05-27 22:32:26] [INFO ] Deduced a trap composed of 7 places in 235 ms
[2020-05-27 22:32:27] [INFO ] Deduced a trap composed of 6 places in 314 ms
[2020-05-27 22:32:27] [INFO ] Deduced a trap composed of 5 places in 213 ms
[2020-05-27 22:32:30] [INFO ] Deduced a trap composed of 2 places in 2739 ms
[2020-05-27 22:32:30] [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 (> (+ s2354 s2355) 0)") while checking expression at index 2
[2020-05-27 22:32:31] [INFO ] [Real]Absence check using 1100 positive place invariants in 1087 ms returned sat
[2020-05-27 22:32:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:32:45] [INFO ] [Real]Absence check using state equation in 13561 ms returned sat
[2020-05-27 22:32:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:32:46] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1110 ms returned sat
[2020-05-27 22:32:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:32:59] [INFO ] [Nat]Absence check using state equation in 12673 ms returned sat
[2020-05-27 22:32:59] [INFO ] [Nat]Added 11 Read/Feed constraints in 29 ms returned sat
[2020-05-27 22:32:59] [INFO ] Deduced a trap composed of 6 places in 335 ms
[2020-05-27 22:33:00] [INFO ] Deduced a trap composed of 5 places in 322 ms
[2020-05-27 22:33:00] [INFO ] Deduced a trap composed of 6 places in 297 ms
[2020-05-27 22:33:00] [INFO ] Deduced a trap composed of 5 places in 306 ms
[2020-05-27 22:33:01] [INFO ] Deduced a trap composed of 5 places in 356 ms
[2020-05-27 22:33:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2013 ms
[2020-05-27 22:33:01] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 95 ms.
[2020-05-27 22:33:21] [INFO ] Added : 605 causal constraints over 121 iterations in 20118 ms.(timeout) Result :sat
[2020-05-27 22:33:21] [INFO ] Deduced a trap composed of 6 places in 295 ms
[2020-05-27 22:33:22] [INFO ] Deduced a trap composed of 5 places in 321 ms
[2020-05-27 22:33:22] [INFO ] Deduced a trap composed of 5 places in 303 ms
[2020-05-27 22:33:23] [INFO ] Deduced a trap composed of 5 places in 307 ms
[2020-05-27 22:33:23] [INFO ] Deduced a trap composed of 5 places in 238 ms
[2020-05-27 22:33:24] [INFO ] Deduced a trap composed of 6 places in 215 ms
[2020-05-27 22:33:24] [INFO ] Deduced a trap composed of 7 places in 245 ms
[2020-05-27 22:33:24] [INFO ] Deduced a trap composed of 6 places in 245 ms
[2020-05-27 22:33:25] [INFO ] Deduced a trap composed of 5 places in 216 ms
[2020-05-27 22:33:25] [INFO ] Deduced a trap composed of 6 places in 225 ms
[2020-05-27 22:33:25] [INFO ] Deduced a trap composed of 5 places in 217 ms
[2020-05-27 22:33:26] [INFO ] Deduced a trap composed of 5 places in 201 ms
[2020-05-27 22:33:26] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4739 ms
Attempting to minimize the solution found.
Minimization took 64 ms.
[2020-05-27 22:33:27] [INFO ] [Real]Absence check using 1100 positive place invariants in 1160 ms returned sat
[2020-05-27 22:33:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:33:39] [INFO ] [Real]Absence check using state equation in 11841 ms returned sat
[2020-05-27 22:33:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:33:41] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1091 ms returned sat
[2020-05-27 22:33:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:33:52] [INFO ] [Nat]Absence check using state equation in 10958 ms returned sat
[2020-05-27 22:33:52] [INFO ] [Nat]Added 11 Read/Feed constraints in 34 ms returned sat
[2020-05-27 22:33:52] [INFO ] Deduced a trap composed of 6 places in 461 ms
[2020-05-27 22:33:53] [INFO ] Deduced a trap composed of 6 places in 407 ms
[2020-05-27 22:33:53] [INFO ] Deduced a trap composed of 5 places in 359 ms
[2020-05-27 22:33:54] [INFO ] Deduced a trap composed of 8 places in 448 ms
[2020-05-27 22:33:54] [INFO ] Deduced a trap composed of 6 places in 384 ms
[2020-05-27 22:33:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2457 ms
[2020-05-27 22:33:54] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 150 ms.
[2020-05-27 22:34:14] [INFO ] Added : 780 causal constraints over 156 iterations in 20080 ms.(timeout) Result :sat
[2020-05-27 22:34:15] [INFO ] Deduced a trap composed of 5 places in 282 ms
[2020-05-27 22:34:15] [INFO ] Deduced a trap composed of 5 places in 261 ms
[2020-05-27 22:34:15] [INFO ] Deduced a trap composed of 6 places in 285 ms
[2020-05-27 22:34:16] [INFO ] Deduced a trap composed of 7 places in 280 ms
[2020-05-27 22:34:16] [INFO ] Deduced a trap composed of 6 places in 280 ms
[2020-05-27 22:34:17] [INFO ] Deduced a trap composed of 5 places in 281 ms
[2020-05-27 22:34:17] [INFO ] Deduced a trap composed of 6 places in 225 ms
[2020-05-27 22:34:17] [INFO ] Deduced a trap composed of 6 places in 236 ms
[2020-05-27 22:34:18] [INFO ] Deduced a trap composed of 5 places in 263 ms
[2020-05-27 22:34:18] [INFO ] Deduced a trap composed of 5 places in 249 ms
[2020-05-27 22:34:19] [INFO ] Deduced a trap composed of 6 places in 239 ms
[2020-05-27 22:34:19] [INFO ] Deduced a trap composed of 5 places in 235 ms
[2020-05-27 22:34:19] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-05-27 22:34:20] [INFO ] Deduced a trap composed of 6 places in 255 ms
[2020-05-27 22:34:20] [INFO ] Deduced a trap composed of 5 places in 239 ms
[2020-05-27 22:34:21] [INFO ] Deduced a trap composed of 6 places in 218 ms
[2020-05-27 22:34:21] [INFO ] Deduced a trap composed of 5 places in 221 ms
[2020-05-27 22:34:21] [INFO ] Deduced a trap composed of 7 places in 192 ms
[2020-05-27 22:34:22] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 7536 ms
Attempting to minimize the solution found.
Minimization took 90 ms.
[2020-05-27 22:34:24] [INFO ] [Real]Absence check using 1100 positive place invariants in 1395 ms returned sat
[2020-05-27 22:34:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:34:36] [INFO ] [Real]Absence check using state equation in 12156 ms returned sat
[2020-05-27 22:34:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:34:38] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1383 ms returned sat
[2020-05-27 22:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:34:49] [INFO ] [Nat]Absence check using state equation in 11590 ms returned sat
[2020-05-27 22:34:49] [INFO ] [Nat]Added 11 Read/Feed constraints in 23 ms returned sat
[2020-05-27 22:34:50] [INFO ] Deduced a trap composed of 5 places in 413 ms
[2020-05-27 22:34:50] [INFO ] Deduced a trap composed of 6 places in 386 ms
[2020-05-27 22:34:51] [INFO ] Deduced a trap composed of 6 places in 379 ms
[2020-05-27 22:34:51] [INFO ] Deduced a trap composed of 6 places in 409 ms
[2020-05-27 22:34:52] [INFO ] Deduced a trap composed of 6 places in 387 ms
[2020-05-27 22:34:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2377 ms
[2020-05-27 22:34:52] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 104 ms.
[2020-05-27 22:35:12] [INFO ] Added : 585 causal constraints over 117 iterations in 20159 ms.(timeout) Result :sat
[2020-05-27 22:35:12] [INFO ] Deduced a trap composed of 6 places in 345 ms
[2020-05-27 22:35:13] [INFO ] Deduced a trap composed of 6 places in 332 ms
[2020-05-27 22:35:13] [INFO ] Deduced a trap composed of 7 places in 346 ms
[2020-05-27 22:35:14] [INFO ] Deduced a trap composed of 6 places in 317 ms
[2020-05-27 22:35:14] [INFO ] Deduced a trap composed of 6 places in 267 ms
[2020-05-27 22:35:14] [INFO ] Deduced a trap composed of 7 places in 288 ms
[2020-05-27 22:35:15] [INFO ] Deduced a trap composed of 6 places in 318 ms
[2020-05-27 22:35:15] [INFO ] Deduced a trap composed of 7 places in 239 ms
[2020-05-27 22:35:16] [INFO ] Deduced a trap composed of 5 places in 265 ms
[2020-05-27 22:35:16] [INFO ] Deduced a trap composed of 5 places in 280 ms
[2020-05-27 22:35:16] [INFO ] Deduced a trap composed of 5 places in 271 ms
[2020-05-27 22:35:17] [INFO ] Deduced a trap composed of 5 places in 244 ms
[2020-05-27 22:35:17] [INFO ] Deduced a trap composed of 6 places in 205 ms
[2020-05-27 22:35:17] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5483 ms
Attempting to minimize the solution found.
Minimization took 69 ms.
[2020-05-27 22:35:19] [INFO ] [Real]Absence check using 1100 positive place invariants in 1233 ms returned sat
[2020-05-27 22:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:35:32] [INFO ] [Real]Absence check using state equation in 13032 ms returned sat
[2020-05-27 22:35:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:35:34] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1171 ms returned sat
[2020-05-27 22:35:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:35:46] [INFO ] [Nat]Absence check using state equation in 12864 ms returned sat
[2020-05-27 22:35:46] [INFO ] [Nat]Added 11 Read/Feed constraints in 26 ms returned sat
[2020-05-27 22:35:47] [INFO ] Deduced a trap composed of 6 places in 515 ms
[2020-05-27 22:35:48] [INFO ] Deduced a trap composed of 4 places in 463 ms
[2020-05-27 22:35:48] [INFO ] Deduced a trap composed of 3 places in 399 ms
[2020-05-27 22:35:48] [INFO ] Deduced a trap composed of 6 places in 360 ms
[2020-05-27 22:35:49] [INFO ] Deduced a trap composed of 6 places in 363 ms
[2020-05-27 22:35:49] [INFO ] Deduced a trap composed of 5 places in 342 ms
[2020-05-27 22:35:50] [INFO ] Deduced a trap composed of 6 places in 356 ms
[2020-05-27 22:35:50] [INFO ] Deduced a trap composed of 6 places in 374 ms
[2020-05-27 22:35:51] [INFO ] Deduced a trap composed of 5 places in 382 ms
[2020-05-27 22:35:51] [INFO ] Deduced a trap composed of 6 places in 384 ms
[2020-05-27 22:35:51] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 4698 ms
[2020-05-27 22:35:51] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 97 ms.
[2020-05-27 22:36:11] [INFO ] Added : 590 causal constraints over 118 iterations in 20137 ms.(timeout) Result :sat
[2020-05-27 22:36:12] [INFO ] Deduced a trap composed of 6 places in 360 ms
[2020-05-27 22:36:12] [INFO ] Deduced a trap composed of 6 places in 323 ms
[2020-05-27 22:36:13] [INFO ] Deduced a trap composed of 6 places in 345 ms
[2020-05-27 22:36:13] [INFO ] Deduced a trap composed of 5 places in 335 ms
[2020-05-27 22:36:14] [INFO ] Deduced a trap composed of 5 places in 315 ms
[2020-05-27 22:36:14] [INFO ] Deduced a trap composed of 6 places in 344 ms
[2020-05-27 22:36:15] [INFO ] Deduced a trap composed of 7 places in 274 ms
[2020-05-27 22:36:15] [INFO ] Deduced a trap composed of 5 places in 279 ms
[2020-05-27 22:36:15] [INFO ] Deduced a trap composed of 5 places in 281 ms
[2020-05-27 22:36:16] [INFO ] Deduced a trap composed of 7 places in 315 ms
[2020-05-27 22:36:16] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-05-27 22:36:17] [INFO ] Deduced a trap composed of 6 places in 260 ms
[2020-05-27 22:36:17] [INFO ] Deduced a trap composed of 5 places in 292 ms
[2020-05-27 22:36:20] [INFO ] Deduced a trap composed of 2 places in 2609 ms
[2020-05-27 22:36:20] [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 (> (+ s2354 s2355) 0)") while checking expression at index 6
[2020-05-27 22:36:21] [INFO ] [Real]Absence check using 1100 positive place invariants in 1042 ms returned sat
[2020-05-27 22:36:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:36:32] [INFO ] [Real]Absence check using state equation in 11315 ms returned sat
[2020-05-27 22:36:32] [INFO ] [Real]Added 11 Read/Feed constraints in 44 ms returned sat
[2020-05-27 22:36:33] [INFO ] Deduced a trap composed of 6 places in 582 ms
[2020-05-27 22:36:34] [INFO ] Deduced a trap composed of 5 places in 494 ms
[2020-05-27 22:36:34] [INFO ] Deduced a trap composed of 5 places in 387 ms
[2020-05-27 22:36:35] [INFO ] Deduced a trap composed of 6 places in 449 ms
[2020-05-27 22:36:35] [INFO ] Deduced a trap composed of 5 places in 429 ms
[2020-05-27 22:36:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2770 ms
[2020-05-27 22:36:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:36:37] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1110 ms returned sat
[2020-05-27 22:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:36:48] [INFO ] [Nat]Absence check using state equation in 11675 ms returned sat
[2020-05-27 22:36:48] [INFO ] [Nat]Added 11 Read/Feed constraints in 20 ms returned sat
[2020-05-27 22:36:49] [INFO ] Deduced a trap composed of 6 places in 370 ms
[2020-05-27 22:36:49] [INFO ] Deduced a trap composed of 6 places in 321 ms
[2020-05-27 22:36:49] [INFO ] Deduced a trap composed of 5 places in 346 ms
[2020-05-27 22:36:50] [INFO ] Deduced a trap composed of 6 places in 336 ms
[2020-05-27 22:36:50] [INFO ] Deduced a trap composed of 6 places in 355 ms
[2020-05-27 22:36:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2117 ms
[2020-05-27 22:36:50] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 87 ms.
[2020-05-27 22:37:10] [INFO ] Added : 790 causal constraints over 158 iterations in 20075 ms.(timeout) Result :sat
[2020-05-27 22:37:11] [INFO ] Deduced a trap composed of 5 places in 274 ms
[2020-05-27 22:37:11] [INFO ] Deduced a trap composed of 6 places in 235 ms
[2020-05-27 22:37:12] [INFO ] Deduced a trap composed of 6 places in 254 ms
[2020-05-27 22:37:12] [INFO ] Deduced a trap composed of 5 places in 244 ms
[2020-05-27 22:37:12] [INFO ] Deduced a trap composed of 7 places in 207 ms
[2020-05-27 22:37:13] [INFO ] Deduced a trap composed of 6 places in 211 ms
[2020-05-27 22:37:13] [INFO ] Deduced a trap composed of 5 places in 229 ms
[2020-05-27 22:37:13] [INFO ] Deduced a trap composed of 6 places in 213 ms
[2020-05-27 22:37:14] [INFO ] Deduced a trap composed of 6 places in 198 ms
[2020-05-27 22:37:14] [INFO ] Deduced a trap composed of 5 places in 163 ms
[2020-05-27 22:37:14] [INFO ] Deduced a trap composed of 6 places in 209 ms
[2020-05-27 22:37:15] [INFO ] Deduced a trap composed of 6 places in 165 ms
[2020-05-27 22:37:15] [INFO ] Deduced a trap composed of 6 places in 202 ms
[2020-05-27 22:37:15] [INFO ] Deduced a trap composed of 7 places in 240 ms
[2020-05-27 22:37:16] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5095 ms
Attempting to minimize the solution found.
Minimization took 70 ms.
[2020-05-27 22:37:17] [INFO ] [Real]Absence check using 1100 positive place invariants in 1215 ms returned sat
[2020-05-27 22:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:37:29] [INFO ] [Real]Absence check using state equation in 11952 ms returned sat
[2020-05-27 22:37:29] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:37:31] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1063 ms returned sat
[2020-05-27 22:37:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:37:42] [INFO ] [Nat]Absence check using state equation in 11117 ms returned sat
[2020-05-27 22:37:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 23 ms returned sat
[2020-05-27 22:37:42] [INFO ] Deduced a trap composed of 7 places in 365 ms
[2020-05-27 22:37:43] [INFO ] Deduced a trap composed of 5 places in 387 ms
[2020-05-27 22:37:43] [INFO ] Deduced a trap composed of 5 places in 421 ms
[2020-05-27 22:37:44] [INFO ] Deduced a trap composed of 6 places in 373 ms
[2020-05-27 22:37:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1889 ms
[2020-05-27 22:37:44] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 84 ms.
[2020-05-27 22:38:04] [INFO ] Added : 705 causal constraints over 141 iterations in 20056 ms.(timeout) Result :sat
[2020-05-27 22:38:04] [INFO ] Deduced a trap composed of 6 places in 243 ms
[2020-05-27 22:38:05] [INFO ] Deduced a trap composed of 5 places in 240 ms
[2020-05-27 22:38:05] [INFO ] Deduced a trap composed of 5 places in 231 ms
[2020-05-27 22:38:05] [INFO ] Deduced a trap composed of 6 places in 270 ms
[2020-05-27 22:38:06] [INFO ] Deduced a trap composed of 5 places in 259 ms
[2020-05-27 22:38:06] [INFO ] Deduced a trap composed of 6 places in 273 ms
[2020-05-27 22:38:06] [INFO ] Deduced a trap composed of 6 places in 235 ms
[2020-05-27 22:38:07] [INFO ] Deduced a trap composed of 5 places in 238 ms
[2020-05-27 22:38:07] [INFO ] Deduced a trap composed of 5 places in 192 ms
[2020-05-27 22:38:07] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3532 ms
Attempting to minimize the solution found.
Minimization took 88 ms.
Incomplete Parikh walk after 159600 steps, including 1001 resets, run finished after 2446 ms. (steps per millisecond=65 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 170300 steps, including 1001 resets, run finished after 2013 ms. (steps per millisecond=84 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 155300 steps, including 1001 resets, run finished after 1850 ms. (steps per millisecond=83 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 176100 steps, including 1001 resets, run finished after 2066 ms. (steps per millisecond=85 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 156100 steps, including 1001 resets, run finished after 1848 ms. (steps per millisecond=84 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 154100 steps, including 1001 resets, run finished after 1881 ms. (steps per millisecond=81 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 32 out of 2532 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2532/2532 places, 2122/2122 transitions.
Applied a total of 0 rules in 147 ms. Remains 2532 /2532 variables (removed 0) and now considering 2122/2122 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2532/2532 places, 2122/2122 transitions.
Starting structural reductions, iteration 0 : 2532/2532 places, 2122/2122 transitions.
Applied a total of 0 rules in 170 ms. Remains 2532 /2532 variables (removed 0) and now considering 2122/2122 (removed 0) transitions.
// Phase 1: matrix 2122 rows 2532 cols
[2020-05-27 22:38:20] [INFO ] Computed 1100 place invariants in 8 ms
[2020-05-27 22:38:33] [INFO ] Implicit Places using invariants in 13041 ms returned [2515, 2519]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 13047 ms to find 2 implicit places.
[2020-05-27 22:38:33] [INFO ] Redundant transitions in 99 ms returned []
// Phase 1: matrix 2122 rows 2530 cols
[2020-05-27 22:38:33] [INFO ] Computed 1098 place invariants in 6 ms
[2020-05-27 22:38:44] [INFO ] Dead Transitions using invariants and state equation in 10889 ms returned []
Starting structural reductions, iteration 1 : 2530/2532 places, 2122/2122 transitions.
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2530 transition count 2122
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 2528 transition count 2120
Applied a total of 6 rules in 142 ms. Remains 2528 /2530 variables (removed 2) and now considering 2120/2122 (removed 2) transitions.
// Phase 1: matrix 2120 rows 2528 cols
[2020-05-27 22:38:44] [INFO ] Computed 1098 place invariants in 6 ms
[2020-05-27 22:38:58] [INFO ] Implicit Places using invariants in 14309 ms returned []
// Phase 1: matrix 2120 rows 2528 cols
[2020-05-27 22:38:58] [INFO ] Computed 1098 place invariants in 7 ms
[2020-05-27 22:39:11] [INFO ] State equation strengthened by 9 read => feed constraints.
[2020-05-27 22:39:41] [INFO ] Performed 1383/2528 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-05-27 22:40:08] [INFO ] Implicit Places using invariants and state equation in 69863 ms returned []
Implicit Place search using SMT with State Equation took 84183 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2528/2532 places, 2120/2122 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 10921 ms. (steps per millisecond=91 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 510480 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 531731 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 583029 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=116 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 573893 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 530607 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=106 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 581872 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=116 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 581365 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=116 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 576966 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=115 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 552816 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=110 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 958422 steps, run timeout after 30001 ms. (steps per millisecond=31 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 958422 steps, saw 152650 distinct states, run finished after 30001 ms. (steps per millisecond=31 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2120 rows 2528 cols
[2020-05-27 22:41:34] [INFO ] Computed 1098 place invariants in 14 ms
[2020-05-27 22:41:36] [INFO ] [Real]Absence check using 1098 positive place invariants in 1241 ms returned sat
[2020-05-27 22:41:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:41:47] [INFO ] [Real]Absence check using state equation in 11499 ms returned sat
[2020-05-27 22:41:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:41:49] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1414 ms returned sat
[2020-05-27 22:41:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:42:01] [INFO ] [Nat]Absence check using state equation in 11990 ms returned sat
[2020-05-27 22:42:01] [INFO ] State equation strengthened by 9 read => feed constraints.
[2020-05-27 22:42:01] [INFO ] [Nat]Added 9 Read/Feed constraints in 29 ms returned sat
[2020-05-27 22:42:02] [INFO ] Deduced a trap composed of 5 places in 402 ms
[2020-05-27 22:42:02] [INFO ] Deduced a trap composed of 6 places in 466 ms
[2020-05-27 22:42:03] [INFO ] Deduced a trap composed of 5 places in 417 ms
[2020-05-27 22:42:03] [INFO ] Deduced a trap composed of 6 places in 373 ms
[2020-05-27 22:42:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1999 ms
[2020-05-27 22:42:03] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 89 ms.
[2020-05-27 22:42:23] [INFO ] Added : 650 causal constraints over 130 iterations in 20120 ms.(timeout) Result :sat
[2020-05-27 22:42:24] [INFO ] Deduced a trap composed of 7 places in 355 ms
[2020-05-27 22:42:24] [INFO ] Deduced a trap composed of 5 places in 298 ms
[2020-05-27 22:42:25] [INFO ] Deduced a trap composed of 5 places in 352 ms
[2020-05-27 22:42:25] [INFO ] Deduced a trap composed of 5 places in 329 ms
[2020-05-27 22:42:26] [INFO ] Deduced a trap composed of 6 places in 330 ms
[2020-05-27 22:42:26] [INFO ] Deduced a trap composed of 6 places in 288 ms
[2020-05-27 22:42:27] [INFO ] Deduced a trap composed of 5 places in 317 ms
[2020-05-27 22:42:27] [INFO ] Deduced a trap composed of 5 places in 243 ms
[2020-05-27 22:42:27] [INFO ] Deduced a trap composed of 6 places in 245 ms
[2020-05-27 22:42:28] [INFO ] Deduced a trap composed of 6 places in 319 ms
[2020-05-27 22:42:28] [INFO ] Deduced a trap composed of 6 places in 294 ms
[2020-05-27 22:42:29] [INFO ] Deduced a trap composed of 6 places in 300 ms
[2020-05-27 22:42:29] [INFO ] Deduced a trap composed of 7 places in 293 ms
[2020-05-27 22:42:30] [INFO ] Deduced a trap composed of 6 places in 279 ms
[2020-05-27 22:42:30] [INFO ] Deduced a trap composed of 5 places in 297 ms
[2020-05-27 22:42:31] [INFO ] Deduced a trap composed of 5 places in 285 ms
[2020-05-27 22:42:31] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-05-27 22:42:31] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7790 ms
Attempting to minimize the solution found.
Minimization took 47 ms.
[2020-05-27 22:42:33] [INFO ] [Real]Absence check using 1098 positive place invariants in 1309 ms returned sat
[2020-05-27 22:42:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:42:46] [INFO ] [Real]Absence check using state equation in 13424 ms returned sat
[2020-05-27 22:42:47] [INFO ] [Real]Added 9 Read/Feed constraints in 27 ms returned sat
[2020-05-27 22:42:47] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:42:48] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1251 ms returned sat
[2020-05-27 22:42:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:43:00] [INFO ] [Nat]Absence check using state equation in 12277 ms returned sat
[2020-05-27 22:43:00] [INFO ] [Nat]Added 9 Read/Feed constraints in 26 ms returned sat
[2020-05-27 22:43:01] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 146 ms.
[2020-05-27 22:43:21] [INFO ] Added : 530 causal constraints over 106 iterations in 20170 ms.(timeout) Result :sat
[2020-05-27 22:43:21] [INFO ] Deduced a trap composed of 6 places in 426 ms
[2020-05-27 22:43:22] [INFO ] Deduced a trap composed of 5 places in 448 ms
[2020-05-27 22:43:22] [INFO ] Deduced a trap composed of 5 places in 423 ms
[2020-05-27 22:43:23] [INFO ] Deduced a trap composed of 6 places in 448 ms
[2020-05-27 22:43:24] [INFO ] Deduced a trap composed of 7 places in 431 ms
[2020-05-27 22:43:24] [INFO ] Deduced a trap composed of 5 places in 302 ms
[2020-05-27 22:43:24] [INFO ] Deduced a trap composed of 6 places in 329 ms
[2020-05-27 22:43:25] [INFO ] Deduced a trap composed of 6 places in 290 ms
[2020-05-27 22:43:25] [INFO ] Deduced a trap composed of 6 places in 283 ms
[2020-05-27 22:43:26] [INFO ] Deduced a trap composed of 5 places in 305 ms
[2020-05-27 22:43:26] [INFO ] Deduced a trap composed of 5 places in 264 ms
[2020-05-27 22:43:26] [INFO ] Deduced a trap composed of 7 places in 274 ms
[2020-05-27 22:43:27] [INFO ] Deduced a trap composed of 5 places in 276 ms
[2020-05-27 22:43:27] [INFO ] Deduced a trap composed of 6 places in 392 ms
[2020-05-27 22:43:28] [INFO ] Deduced a trap composed of 6 places in 323 ms
[2020-05-27 22:43:28] [INFO ] Deduced a trap composed of 5 places in 317 ms
[2020-05-27 22:43:29] [INFO ] Deduced a trap composed of 6 places in 255 ms
[2020-05-27 22:43:29] [INFO ] Deduced a trap composed of 6 places in 253 ms
[2020-05-27 22:43:29] [INFO ] Deduced a trap composed of 6 places in 240 ms
[2020-05-27 22:43:30] [INFO ] Deduced a trap composed of 7 places in 335 ms
[2020-05-27 22:43:30] [INFO ] Deduced a trap composed of 5 places in 299 ms
[2020-05-27 22:43:31] [INFO ] Deduced a trap composed of 6 places in 217 ms
[2020-05-27 22:43:31] [INFO ] Deduced a trap composed of 5 places in 232 ms
[2020-05-27 22:43:31] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 10293 ms
Attempting to minimize the solution found.
Minimization took 48 ms.
[2020-05-27 22:43:32] [INFO ] [Real]Absence check using 1098 positive place invariants in 1036 ms returned sat
[2020-05-27 22:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:43:44] [INFO ] [Real]Absence check using state equation in 11285 ms returned sat
[2020-05-27 22:43:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:43:45] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1154 ms returned sat
[2020-05-27 22:43:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:43:57] [INFO ] [Nat]Absence check using state equation in 11581 ms returned sat
[2020-05-27 22:43:57] [INFO ] [Nat]Added 9 Read/Feed constraints in 23 ms returned sat
[2020-05-27 22:43:57] [INFO ] Deduced a trap composed of 6 places in 560 ms
[2020-05-27 22:43:58] [INFO ] Deduced a trap composed of 6 places in 543 ms
[2020-05-27 22:43:59] [INFO ] Deduced a trap composed of 7 places in 444 ms
[2020-05-27 22:43:59] [INFO ] Deduced a trap composed of 5 places in 372 ms
[2020-05-27 22:43:59] [INFO ] Deduced a trap composed of 5 places in 367 ms
[2020-05-27 22:44:00] [INFO ] Deduced a trap composed of 5 places in 377 ms
[2020-05-27 22:44:01] [INFO ] Deduced a trap composed of 7 places in 521 ms
[2020-05-27 22:44:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3769 ms
[2020-05-27 22:44:01] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 105 ms.
[2020-05-27 22:44:21] [INFO ] Added : 535 causal constraints over 107 iterations in 20231 ms.(timeout) Result :sat
[2020-05-27 22:44:21] [INFO ] Deduced a trap composed of 5 places in 420 ms
[2020-05-27 22:44:22] [INFO ] Deduced a trap composed of 6 places in 469 ms
[2020-05-27 22:44:22] [INFO ] Deduced a trap composed of 5 places in 333 ms
[2020-05-27 22:44:23] [INFO ] Deduced a trap composed of 6 places in 316 ms
[2020-05-27 22:44:23] [INFO ] Deduced a trap composed of 6 places in 340 ms
[2020-05-27 22:44:24] [INFO ] Deduced a trap composed of 6 places in 334 ms
[2020-05-27 22:44:24] [INFO ] Deduced a trap composed of 6 places in 326 ms
[2020-05-27 22:44:25] [INFO ] Deduced a trap composed of 5 places in 319 ms
[2020-05-27 22:44:25] [INFO ] Deduced a trap composed of 7 places in 260 ms
[2020-05-27 22:44:26] [INFO ] Deduced a trap composed of 5 places in 238 ms
[2020-05-27 22:44:26] [INFO ] Deduced a trap composed of 6 places in 292 ms
[2020-05-27 22:44:27] [INFO ] Deduced a trap composed of 5 places in 305 ms
[2020-05-27 22:44:27] [INFO ] Deduced a trap composed of 7 places in 322 ms
[2020-05-27 22:44:28] [INFO ] Deduced a trap composed of 5 places in 292 ms
[2020-05-27 22:44:28] [INFO ] Deduced a trap composed of 5 places in 292 ms
[2020-05-27 22:44:29] [INFO ] Deduced a trap composed of 5 places in 307 ms
[2020-05-27 22:44:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:44:32] [INFO ] Deduced a trap composed of 2 places in 2908 ms
[2020-05-27 22:44:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s2354 s2355) 0)") while checking expression at index 2
[2020-05-27 22:44:33] [INFO ] [Real]Absence check using 1098 positive place invariants in 1149 ms returned sat
[2020-05-27 22:44:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:44:45] [INFO ] [Real]Absence check using state equation in 12048 ms returned sat
[2020-05-27 22:44:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:44:47] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1041 ms returned sat
[2020-05-27 22:44:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:44:58] [INFO ] [Nat]Absence check using state equation in 11542 ms returned sat
[2020-05-27 22:44:58] [INFO ] [Nat]Added 9 Read/Feed constraints in 22 ms returned sat
[2020-05-27 22:44:59] [INFO ] Deduced a trap composed of 6 places in 378 ms
[2020-05-27 22:44:59] [INFO ] Deduced a trap composed of 5 places in 376 ms
[2020-05-27 22:44:59] [INFO ] Deduced a trap composed of 6 places in 399 ms
[2020-05-27 22:45:00] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1415 ms
[2020-05-27 22:45:00] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 102 ms.
[2020-05-27 22:45:20] [INFO ] Added : 750 causal constraints over 150 iterations in 20103 ms.(timeout) Result :sat
[2020-05-27 22:45:20] [INFO ] Deduced a trap composed of 6 places in 247 ms
[2020-05-27 22:45:20] [INFO ] Deduced a trap composed of 5 places in 247 ms
[2020-05-27 22:45:21] [INFO ] Deduced a trap composed of 5 places in 232 ms
[2020-05-27 22:45:21] [INFO ] Deduced a trap composed of 6 places in 224 ms
[2020-05-27 22:45:22] [INFO ] Deduced a trap composed of 5 places in 260 ms
[2020-05-27 22:45:22] [INFO ] Deduced a trap composed of 6 places in 238 ms
[2020-05-27 22:45:22] [INFO ] Deduced a trap composed of 6 places in 230 ms
[2020-05-27 22:45:23] [INFO ] Deduced a trap composed of 6 places in 229 ms
[2020-05-27 22:45:23] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-05-27 22:45:24] [INFO ] Deduced a trap composed of 5 places in 195 ms
[2020-05-27 22:45:24] [INFO ] Deduced a trap composed of 6 places in 220 ms
[2020-05-27 22:45:24] [INFO ] Deduced a trap composed of 6 places in 211 ms
[2020-05-27 22:45:25] [INFO ] Deduced a trap composed of 5 places in 231 ms
[2020-05-27 22:45:25] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5250 ms
Attempting to minimize the solution found.
Minimization took 90 ms.
[2020-05-27 22:45:27] [INFO ] [Real]Absence check using 1098 positive place invariants in 1429 ms returned sat
[2020-05-27 22:45:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:45:39] [INFO ] [Real]Absence check using state equation in 12150 ms returned sat
[2020-05-27 22:45:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:45:41] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1367 ms returned sat
[2020-05-27 22:45:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:45:54] [INFO ] [Nat]Absence check using state equation in 13079 ms returned sat
[2020-05-27 22:45:54] [INFO ] [Nat]Added 9 Read/Feed constraints in 20 ms returned sat
[2020-05-27 22:45:54] [INFO ] Deduced a trap composed of 6 places in 502 ms
[2020-05-27 22:45:55] [INFO ] Deduced a trap composed of 7 places in 505 ms
[2020-05-27 22:45:55] [INFO ] Deduced a trap composed of 5 places in 415 ms
[2020-05-27 22:45:56] [INFO ] Deduced a trap composed of 6 places in 457 ms
[2020-05-27 22:45:56] [INFO ] Deduced a trap composed of 6 places in 384 ms
[2020-05-27 22:45:57] [INFO ] Deduced a trap composed of 5 places in 351 ms
[2020-05-27 22:45:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3106 ms
[2020-05-27 22:45:57] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 93 ms.
[2020-05-27 22:46:17] [INFO ] Added : 600 causal constraints over 120 iterations in 20055 ms.(timeout) Result :sat
[2020-05-27 22:46:17] [INFO ] Deduced a trap composed of 5 places in 336 ms
[2020-05-27 22:46:18] [INFO ] Deduced a trap composed of 6 places in 417 ms
[2020-05-27 22:46:18] [INFO ] Deduced a trap composed of 5 places in 305 ms
[2020-05-27 22:46:19] [INFO ] Deduced a trap composed of 5 places in 333 ms
[2020-05-27 22:46:19] [INFO ] Deduced a trap composed of 6 places in 317 ms
[2020-05-27 22:46:20] [INFO ] Deduced a trap composed of 6 places in 288 ms
[2020-05-27 22:46:20] [INFO ] Deduced a trap composed of 6 places in 272 ms
[2020-05-27 22:46:21] [INFO ] Deduced a trap composed of 5 places in 307 ms
[2020-05-27 22:46:21] [INFO ] Deduced a trap composed of 6 places in 328 ms
[2020-05-27 22:46:22] [INFO ] Deduced a trap composed of 5 places in 278 ms
[2020-05-27 22:46:22] [INFO ] Deduced a trap composed of 5 places in 210 ms
[2020-05-27 22:46:22] [INFO ] Deduced a trap composed of 6 places in 224 ms
[2020-05-27 22:46:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5307 ms
Attempting to minimize the solution found.
Minimization took 42 ms.
[2020-05-27 22:46:24] [INFO ] [Real]Absence check using 1098 positive place invariants in 1037 ms returned sat
[2020-05-27 22:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:46:36] [INFO ] [Real]Absence check using state equation in 12238 ms returned sat
[2020-05-27 22:46:36] [INFO ] [Real]Added 9 Read/Feed constraints in 44 ms returned sat
[2020-05-27 22:46:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:46:38] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1222 ms returned sat
[2020-05-27 22:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:46:49] [INFO ] [Nat]Absence check using state equation in 11709 ms returned sat
[2020-05-27 22:46:49] [INFO ] [Nat]Added 9 Read/Feed constraints in 20 ms returned sat
[2020-05-27 22:46:50] [INFO ] Deduced a trap composed of 5 places in 468 ms
[2020-05-27 22:46:51] [INFO ] Deduced a trap composed of 7 places in 515 ms
[2020-05-27 22:46:51] [INFO ] Deduced a trap composed of 5 places in 493 ms
[2020-05-27 22:46:52] [INFO ] Deduced a trap composed of 6 places in 457 ms
[2020-05-27 22:46:52] [INFO ] Deduced a trap composed of 6 places in 557 ms
[2020-05-27 22:46:53] [INFO ] Deduced a trap composed of 5 places in 579 ms
[2020-05-27 22:46:54] [INFO ] Deduced a trap composed of 5 places in 608 ms
[2020-05-27 22:46:55] [INFO ] Deduced a trap composed of 5 places in 601 ms
[2020-05-27 22:46:55] [INFO ] Deduced a trap composed of 7 places in 536 ms
[2020-05-27 22:46:56] [INFO ] Deduced a trap composed of 6 places in 516 ms
[2020-05-27 22:46:56] [INFO ] Deduced a trap composed of 7 places in 471 ms
[2020-05-27 22:46:57] [INFO ] Deduced a trap composed of 5 places in 422 ms
[2020-05-27 22:46:58] [INFO ] Deduced a trap composed of 6 places in 442 ms
[2020-05-27 22:46:58] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 8118 ms
[2020-05-27 22:46:58] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 95 ms.
[2020-05-27 22:47:18] [INFO ] Added : 590 causal constraints over 118 iterations in 20086 ms.(timeout) Result :sat
[2020-05-27 22:47:18] [INFO ] Deduced a trap composed of 6 places in 406 ms
[2020-05-27 22:47:19] [INFO ] Deduced a trap composed of 6 places in 346 ms
[2020-05-27 22:47:19] [INFO ] Deduced a trap composed of 6 places in 368 ms
[2020-05-27 22:47:20] [INFO ] Deduced a trap composed of 5 places in 286 ms
[2020-05-27 22:47:20] [INFO ] Deduced a trap composed of 7 places in 286 ms
[2020-05-27 22:47:20] [INFO ] Deduced a trap composed of 7 places in 265 ms
[2020-05-27 22:47:21] [INFO ] Deduced a trap composed of 5 places in 316 ms
[2020-05-27 22:47:21] [INFO ] Deduced a trap composed of 6 places in 227 ms
[2020-05-27 22:47:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:47:24] [INFO ] Deduced a trap composed of 2 places in 2396 ms
[2020-05-27 22:47: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 (> (+ s2354 s2355) 0)") while checking expression at index 5
[2020-05-27 22:47:25] [INFO ] [Real]Absence check using 1098 positive place invariants in 1307 ms returned sat
[2020-05-27 22:47:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:47:38] [INFO ] [Real]Absence check using state equation in 13019 ms returned sat
[2020-05-27 22:47:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:47:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1444 ms returned sat
[2020-05-27 22:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:47:54] [INFO ] [Nat]Absence check using state equation in 14235 ms returned sat
[2020-05-27 22:47:54] [INFO ] [Nat]Added 9 Read/Feed constraints in 22 ms returned sat
[2020-05-27 22:47:55] [INFO ] Deduced a trap composed of 5 places in 599 ms
[2020-05-27 22:47:56] [INFO ] Deduced a trap composed of 5 places in 540 ms
[2020-05-27 22:47:56] [INFO ] Deduced a trap composed of 5 places in 487 ms
[2020-05-27 22:47:57] [INFO ] Deduced a trap composed of 5 places in 525 ms
[2020-05-27 22:47:57] [INFO ] Deduced a trap composed of 3 places in 472 ms
[2020-05-27 22:47:58] [INFO ] Deduced a trap composed of 5 places in 473 ms
[2020-05-27 22:47:58] [INFO ] Deduced a trap composed of 5 places in 462 ms
[2020-05-27 22:47:59] [INFO ] Deduced a trap composed of 6 places in 441 ms
[2020-05-27 22:47:59] [INFO ] Deduced a trap composed of 5 places in 474 ms
[2020-05-27 22:48:00] [INFO ] Deduced a trap composed of 8 places in 427 ms
[2020-05-27 22:48:00] [INFO ] Deduced a trap composed of 6 places in 473 ms
[2020-05-27 22:48:01] [INFO ] Deduced a trap composed of 7 places in 453 ms
[2020-05-27 22:48:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 6796 ms
[2020-05-27 22:48:01] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 92 ms.
[2020-05-27 22:48:21] [INFO ] Added : 750 causal constraints over 150 iterations in 20150 ms.(timeout) Result :sat
[2020-05-27 22:48:22] [INFO ] Deduced a trap composed of 6 places in 273 ms
[2020-05-27 22:48:22] [INFO ] Deduced a trap composed of 6 places in 330 ms
[2020-05-27 22:48:23] [INFO ] Deduced a trap composed of 6 places in 334 ms
[2020-05-27 22:48:23] [INFO ] Deduced a trap composed of 6 places in 235 ms
[2020-05-27 22:48:23] [INFO ] Deduced a trap composed of 6 places in 307 ms
[2020-05-27 22:48:23] [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 (> (+ s1460 s1461 s1464 s1465 s1466 s1474) 0)") while checking expression at index 6
[2020-05-27 22:48:25] [INFO ] [Real]Absence check using 1098 positive place invariants in 1059 ms returned sat
[2020-05-27 22:48:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:48:37] [INFO ] [Real]Absence check using state equation in 12202 ms returned sat
[2020-05-27 22:48:37] [INFO ] [Real]Added 9 Read/Feed constraints in 46 ms returned sat
[2020-05-27 22:48:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:48:39] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1223 ms returned sat
[2020-05-27 22:48:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:48:51] [INFO ] [Nat]Absence check using state equation in 12159 ms returned sat
[2020-05-27 22:48:51] [INFO ] [Nat]Added 9 Read/Feed constraints in 49 ms returned sat
[2020-05-27 22:48:52] [INFO ] Deduced a trap composed of 6 places in 514 ms
[2020-05-27 22:48:52] [INFO ] Deduced a trap composed of 6 places in 506 ms
[2020-05-27 22:48:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1257 ms
[2020-05-27 22:48:52] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 102 ms.
[2020-05-27 22:49:12] [INFO ] Added : 570 causal constraints over 114 iterations in 20123 ms.(timeout) Result :sat
[2020-05-27 22:49:13] [INFO ] Deduced a trap composed of 6 places in 391 ms
[2020-05-27 22:49:13] [INFO ] Deduced a trap composed of 6 places in 371 ms
[2020-05-27 22:49:14] [INFO ] Deduced a trap composed of 7 places in 351 ms
[2020-05-27 22:49:14] [INFO ] Deduced a trap composed of 6 places in 283 ms
[2020-05-27 22:49:15] [INFO ] Deduced a trap composed of 5 places in 290 ms
[2020-05-27 22:49:15] [INFO ] Deduced a trap composed of 7 places in 300 ms
[2020-05-27 22:49:15] [INFO ] Deduced a trap composed of 5 places in 329 ms
[2020-05-27 22:49:16] [INFO ] Deduced a trap composed of 5 places in 336 ms
[2020-05-27 22:49:16] [INFO ] Deduced a trap composed of 6 places in 349 ms
[2020-05-27 22:49:17] [INFO ] Deduced a trap composed of 7 places in 282 ms
[2020-05-27 22:49:17] [INFO ] Deduced a trap composed of 6 places in 252 ms
[2020-05-27 22:49:18] [INFO ] Deduced a trap composed of 6 places in 293 ms
[2020-05-27 22:49:18] [INFO ] Deduced a trap composed of 5 places in 253 ms
[2020-05-27 22:49:18] [INFO ] Deduced a trap composed of 5 places in 244 ms
[2020-05-27 22:49:19] [INFO ] Deduced a trap composed of 6 places in 275 ms
[2020-05-27 22:49:19] [INFO ] Deduced a trap composed of 7 places in 242 ms
[2020-05-27 22:49:19] [INFO ] Deduced a trap composed of 6 places in 251 ms
[2020-05-27 22:49:20] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 7242 ms
Attempting to minimize the solution found.
Minimization took 53 ms.
[2020-05-27 22:49:21] [INFO ] [Real]Absence check using 1098 positive place invariants in 1354 ms returned sat
[2020-05-27 22:49:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:49:36] [INFO ] [Real]Absence check using state equation in 14893 ms returned sat
[2020-05-27 22:49:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:49:38] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1540 ms returned sat
[2020-05-27 22:49:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:49:53] [INFO ] [Nat]Absence check using state equation in 14640 ms returned sat
[2020-05-27 22:49:53] [INFO ] [Nat]Added 9 Read/Feed constraints in 25 ms returned sat
[2020-05-27 22:49:53] [INFO ] Deduced a trap composed of 5 places in 452 ms
[2020-05-27 22:49:54] [INFO ] Deduced a trap composed of 6 places in 447 ms
[2020-05-27 22:49:55] [INFO ] Deduced a trap composed of 6 places in 567 ms
[2020-05-27 22:49:55] [INFO ] Deduced a trap composed of 8 places in 584 ms
[2020-05-27 22:49:56] [INFO ] Deduced a trap composed of 5 places in 562 ms
[2020-05-27 22:49:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3055 ms
[2020-05-27 22:49:56] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 110 ms.
[2020-05-27 22:50:16] [INFO ] Added : 715 causal constraints over 143 iterations in 20335 ms.(timeout) Result :sat
[2020-05-27 22:50:17] [INFO ] Deduced a trap composed of 6 places in 342 ms
[2020-05-27 22:50:17] [INFO ] Deduced a trap composed of 5 places in 357 ms
[2020-05-27 22:50:18] [INFO ] Deduced a trap composed of 7 places in 368 ms
[2020-05-27 22:50:18] [INFO ] Deduced a trap composed of 5 places in 379 ms
[2020-05-27 22:50:19] [INFO ] Deduced a trap composed of 7 places in 309 ms
[2020-05-27 22:50:19] [INFO ] Deduced a trap composed of 6 places in 347 ms
[2020-05-27 22:50:20] [INFO ] Deduced a trap composed of 6 places in 303 ms
[2020-05-27 22:50:20] [INFO ] Deduced a trap composed of 5 places in 305 ms
[2020-05-27 22:50:21] [INFO ] Deduced a trap composed of 5 places in 304 ms
[2020-05-27 22:50:21] [INFO ] Deduced a trap composed of 5 places in 319 ms
[2020-05-27 22:50:22] [INFO ] Deduced a trap composed of 6 places in 287 ms
[2020-05-27 22:50:22] [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 (> (+ s2390 s2391 s2393 s2402 s2403 s2409) 0)") while checking expression at index 8
Incomplete Parikh walk after 157400 steps, including 1001 resets, run finished after 2005 ms. (steps per millisecond=78 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 153800 steps, including 1001 resets, run finished after 1829 ms. (steps per millisecond=84 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 166700 steps, including 1001 resets, run finished after 1954 ms. (steps per millisecond=85 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 142000 steps, including 1001 resets, run finished after 1706 ms. (steps per millisecond=83 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 164300 steps, including 1001 resets, run finished after 2439 ms. (steps per millisecond=67 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 32 out of 2528 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2528/2528 places, 2120/2120 transitions.
Applied a total of 0 rules in 82 ms. Remains 2528 /2528 variables (removed 0) and now considering 2120/2120 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2528/2528 places, 2120/2120 transitions.
Starting structural reductions, iteration 0 : 2528/2528 places, 2120/2120 transitions.
Applied a total of 0 rules in 79 ms. Remains 2528 /2528 variables (removed 0) and now considering 2120/2120 (removed 0) transitions.
// Phase 1: matrix 2120 rows 2528 cols
[2020-05-27 22:50:32] [INFO ] Computed 1098 place invariants in 7 ms
[2020-05-27 22:50:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:50:40] [INFO ] Implicit Places using invariants in 8574 ms returned []
// Phase 1: matrix 2120 rows 2528 cols
[2020-05-27 22:50:40] [INFO ] Computed 1098 place invariants in 16 ms
[2020-05-27 22:50:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2020-05-27 22:51:24] [INFO ] Performed 1477/2528 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-05-27 22:51:47] [INFO ] Implicit Places using invariants and state equation in 66989 ms returned []
Implicit Place search using SMT with State Equation took 75572 ms to find 0 implicit places.
[2020-05-27 22:51:48] [INFO ] Redundant transitions in 156 ms returned []
// Phase 1: matrix 2120 rows 2528 cols
[2020-05-27 22:51:48] [INFO ] Computed 1098 place invariants in 8 ms
[2020-05-27 22:51:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-27 22:51:54] [INFO ] Dead Transitions using invariants and state equation in 6499 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2528/2528 places, 2120/2120 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1064 ms. (steps per millisecond=93 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2120 rows 2528 cols
[2020-05-27 22:51:55] [INFO ] Computed 1098 place invariants in 6 ms
[2020-05-27 22:51:57] [INFO ] [Real]Absence check using 1098 positive place invariants in 1311 ms returned sat
[2020-05-27 22:51:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:52:12] [INFO ] [Real]Absence check using state equation in 15173 ms returned sat
[2020-05-27 22:52:12] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:52:14] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1480 ms returned sat
[2020-05-27 22:52:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:52:28] [INFO ] [Nat]Absence check using state equation in 13798 ms returned sat
[2020-05-27 22:52:28] [INFO ] State equation strengthened by 9 read => feed constraints.
[2020-05-27 22:52:28] [INFO ] [Nat]Added 9 Read/Feed constraints in 22 ms returned sat
[2020-05-27 22:52:28] [INFO ] Deduced a trap composed of 5 places in 512 ms
[2020-05-27 22:52:29] [INFO ] Deduced a trap composed of 6 places in 443 ms
[2020-05-27 22:52:29] [INFO ] Deduced a trap composed of 5 places in 377 ms
[2020-05-27 22:52:30] [INFO ] Deduced a trap composed of 6 places in 373 ms
[2020-05-27 22:52:30] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2033 ms
[2020-05-27 22:52:30] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 83 ms.
[2020-05-27 22:52:32] [INFO ] Added : 85 causal constraints over 17 iterations in 2343 ms. Result :(error "Failed to check-sat")
[2020-05-27 22:52:34] [INFO ] [Real]Absence check using 1098 positive place invariants in 1284 ms returned sat
[2020-05-27 22:52:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:52:45] [INFO ] [Real]Absence check using state equation in 11374 ms returned sat
[2020-05-27 22:52:45] [INFO ] [Real]Added 9 Read/Feed constraints in 49 ms returned sat
[2020-05-27 22:52:45] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:52:47] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1234 ms returned sat
[2020-05-27 22:52:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:52:59] [INFO ] [Nat]Absence check using state equation in 12212 ms returned sat
[2020-05-27 22:52:59] [INFO ] [Nat]Added 9 Read/Feed constraints in 21 ms returned sat
[2020-05-27 22:52:59] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 106 ms.
[2020-05-27 22:53:05] [INFO ] Added : 240 causal constraints over 48 iterations in 6160 ms. Result :unknown
[2020-05-27 22:53:07] [INFO ] [Real]Absence check using 1098 positive place invariants in 1174 ms returned sat
[2020-05-27 22:53:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:53:18] [INFO ] [Real]Absence check using state equation in 11314 ms returned sat
[2020-05-27 22:53:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:53:19] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1082 ms returned sat
[2020-05-27 22:53:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:53:31] [INFO ] [Nat]Absence check using state equation in 11849 ms returned sat
[2020-05-27 22:53:31] [INFO ] [Nat]Added 9 Read/Feed constraints in 21 ms returned sat
[2020-05-27 22:53:32] [INFO ] Deduced a trap composed of 6 places in 448 ms
[2020-05-27 22:53:32] [INFO ] Deduced a trap composed of 6 places in 446 ms
[2020-05-27 22:53:33] [INFO ] Deduced a trap composed of 7 places in 443 ms
[2020-05-27 22:53:33] [INFO ] Deduced a trap composed of 5 places in 447 ms
[2020-05-27 22:53:34] [INFO ] Deduced a trap composed of 5 places in 446 ms
[2020-05-27 22:53:34] [INFO ] Deduced a trap composed of 5 places in 394 ms
[2020-05-27 22:53:35] [INFO ] Deduced a trap composed of 7 places in 393 ms
[2020-05-27 22:53:35] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3628 ms
[2020-05-27 22:53:35] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 150 ms.
[2020-05-27 22:53: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: Broken pipe (=> (> t132 0) (or (and (> t791 0) (< o791 o132)) (and (> t793 0) (< o793 o132))))") while checking expression at index 2
[2020-05-27 22:53:40] [INFO ] [Real]Absence check using 1098 positive place invariants in 1396 ms returned sat
[2020-05-27 22:53:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:53:52] [INFO ] [Real]Absence check using state equation in 12101 ms returned sat
[2020-05-27 22:53:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:53:54] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1195 ms returned sat
[2020-05-27 22:53:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:54:05] [INFO ] [Nat]Absence check using state equation in 11668 ms returned sat
[2020-05-27 22:54:05] [INFO ] [Nat]Added 9 Read/Feed constraints in 19 ms returned sat
[2020-05-27 22:54:06] [INFO ] Deduced a trap composed of 6 places in 448 ms
[2020-05-27 22:54:06] [INFO ] Deduced a trap composed of 5 places in 426 ms
[2020-05-27 22:54:07] [INFO ] Deduced a trap composed of 6 places in 386 ms
[2020-05-27 22:54:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1538 ms
[2020-05-27 22:54:07] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 97 ms.
[2020-05-27 22:54:12] [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 (=> (> t202 0) (and (> t204 0) (< o204 o202)))") while checking expression at index 3
[2020-05-27 22:54:14] [INFO ] [Real]Absence check using 1098 positive place invariants in 1597 ms returned sat
[2020-05-27 22:54:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:54:26] [INFO ] [Real]Absence check using state equation in 11461 ms returned sat
[2020-05-27 22:54:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:54:27] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1114 ms returned sat
[2020-05-27 22:54:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:54:39] [INFO ] [Nat]Absence check using state equation in 11955 ms returned sat
[2020-05-27 22:54:39] [INFO ] [Nat]Added 9 Read/Feed constraints in 33 ms returned sat
[2020-05-27 22:54:40] [INFO ] Deduced a trap composed of 6 places in 584 ms
[2020-05-27 22:54:40] [INFO ] Deduced a trap composed of 7 places in 399 ms
[2020-05-27 22:54:41] [INFO ] Deduced a trap composed of 5 places in 456 ms
[2020-05-27 22:54:41] [INFO ] Deduced a trap composed of 6 places in 352 ms
[2020-05-27 22:54:41] [INFO ] Deduced a trap composed of 6 places in 354 ms
[2020-05-27 22:54:42] [INFO ] Deduced a trap composed of 5 places in 344 ms
[2020-05-27 22:54:42] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2951 ms
[2020-05-27 22:54:42] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 93 ms.
[2020-05-27 22:54:46] [INFO ] Added : 95 causal constraints over 19 iterations in 3650 ms. Result :(error "Failed to check-sat")
[2020-05-27 22:54:47] [INFO ] [Real]Absence check using 1098 positive place invariants in 1408 ms returned sat
[2020-05-27 22:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:55:01] [INFO ] [Real]Absence check using state equation in 13650 ms returned sat
[2020-05-27 22:55:01] [INFO ] [Real]Added 9 Read/Feed constraints in 27 ms returned sat
[2020-05-27 22:55:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:55:03] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1079 ms returned sat
[2020-05-27 22:55:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:55:14] [INFO ] [Nat]Absence check using state equation in 11301 ms returned sat
[2020-05-27 22:55:14] [INFO ] [Nat]Added 9 Read/Feed constraints in 21 ms returned sat
[2020-05-27 22:55:14] [INFO ] Deduced a trap composed of 5 places in 552 ms
[2020-05-27 22:55:15] [INFO ] Deduced a trap composed of 7 places in 480 ms
[2020-05-27 22:55:16] [INFO ] Deduced a trap composed of 5 places in 476 ms
[2020-05-27 22:55:16] [INFO ] Deduced a trap composed of 6 places in 435 ms
[2020-05-27 22:55:17] [INFO ] Deduced a trap composed of 6 places in 412 ms
[2020-05-27 22:55:17] [INFO ] Deduced a trap composed of 5 places in 429 ms
[2020-05-27 22:55:18] [INFO ] Deduced a trap composed of 5 places in 428 ms
[2020-05-27 22:55:18] [INFO ] Deduced a trap composed of 5 places in 421 ms
[2020-05-27 22:55:19] [INFO ] Deduced a trap composed of 7 places in 431 ms
[2020-05-27 22:55:19] [INFO ] Deduced a trap composed of 6 places in 401 ms
[2020-05-27 22:55:20] [INFO ] Deduced a trap composed of 7 places in 384 ms
[2020-05-27 22:55:20] [INFO ] Deduced a trap composed of 5 places in 403 ms
[2020-05-27 22:55:20] [INFO ] Deduced a trap composed of 6 places in 362 ms
[2020-05-27 22:55:21] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6688 ms
[2020-05-27 22:55:21] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 107 ms.
[2020-05-27 22:55:21] [INFO ] Added : 20 causal constraints over 4 iterations in 646 ms. Result :unknown
[2020-05-27 22:55:23] [INFO ] [Real]Absence check using 1098 positive place invariants in 1160 ms returned sat
[2020-05-27 22:55:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:55:38] [INFO ] [Real]Absence check using state equation in 15667 ms returned sat
[2020-05-27 22:55:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:55:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1181 ms returned sat
[2020-05-27 22:55:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:55:54] [INFO ] [Nat]Absence check using state equation in 14268 ms returned sat
[2020-05-27 22:55:54] [INFO ] [Nat]Added 9 Read/Feed constraints in 21 ms returned sat
[2020-05-27 22:55:55] [INFO ] Deduced a trap composed of 5 places in 560 ms
[2020-05-27 22:55:55] [INFO ] Deduced a trap composed of 5 places in 535 ms
[2020-05-27 22:55:56] [INFO ] Deduced a trap composed of 5 places in 516 ms
[2020-05-27 22:55:56] [INFO ] Deduced a trap composed of 5 places in 444 ms
[2020-05-27 22:55:57] [INFO ] Deduced a trap composed of 3 places in 461 ms
[2020-05-27 22:55:58] [INFO ] Deduced a trap composed of 5 places in 521 ms
[2020-05-27 22:55:58] [INFO ] Deduced a trap composed of 5 places in 435 ms
[2020-05-27 22:55:59] [INFO ] Deduced a trap composed of 6 places in 439 ms
[2020-05-27 22:55:59] [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 (> (+ s2370 s2371 s2373 s2375 s2376 s2386) 0)") while checking expression at index 6
[2020-05-27 22:56:00] [INFO ] [Real]Absence check using 1098 positive place invariants in 1356 ms returned sat
[2020-05-27 22:56:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:56:14] [INFO ] [Real]Absence check using state equation in 14196 ms returned sat
[2020-05-27 22:56:15] [INFO ] [Real]Added 9 Read/Feed constraints in 51 ms returned sat
[2020-05-27 22:56:15] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:56:17] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1581 ms returned sat
[2020-05-27 22:56:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:56:30] [INFO ] [Nat]Absence check using state equation in 13703 ms returned sat
[2020-05-27 22:56:30] [INFO ] [Nat]Added 9 Read/Feed constraints in 24 ms returned sat
[2020-05-27 22:56:31] [INFO ] Deduced a trap composed of 6 places in 489 ms
[2020-05-27 22:56:31] [INFO ] Deduced a trap composed of 6 places in 508 ms
[2020-05-27 22:56:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1247 ms
[2020-05-27 22:56:32] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 115 ms.
[2020-05-27 22:56:35] [INFO ] Added : 90 causal constraints over 18 iterations in 3073 ms. Result :(error "Solver has unexpectedly terminated")
[2020-05-27 22:56:36] [INFO ] [Real]Absence check using 1098 positive place invariants in 1367 ms returned sat
[2020-05-27 22:56:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:56:50] [INFO ] [Real]Absence check using state equation in 13285 ms returned sat
[2020-05-27 22:56:50] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:56:52] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1495 ms returned sat
[2020-05-27 22:56:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:57:05] [INFO ] [Nat]Absence check using state equation in 13940 ms returned sat
[2020-05-27 22:57:05] [INFO ] [Nat]Added 9 Read/Feed constraints in 22 ms returned sat
[2020-05-27 22:57:06] [INFO ] Deduced a trap composed of 5 places in 617 ms
[2020-05-27 22:57:07] [INFO ] Deduced a trap composed of 6 places in 576 ms
[2020-05-27 22:57:07] [INFO ] Deduced a trap composed of 6 places in 460 ms
[2020-05-27 22:57:08] [INFO ] Deduced a trap composed of 8 places in 381 ms
[2020-05-27 22:57:08] [INFO ] Deduced a trap composed of 5 places in 415 ms
[2020-05-27 22:57:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2906 ms
[2020-05-27 22:57:08] [INFO ] Computed and/alt/rep : 2110/4960/2110 causal constraints in 109 ms.
[2020-05-27 22:57:10] [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 (=> (> t23 0) (or (and (> t236 0) (< o236 o23)) (and (> t1948 0) (< o1948 o23))))") while checking expression at index 8
Partial Free-agglomeration rule applied 565 times.
Drop transitions removed 565 transitions
Iterating global reduction 0 with 565 rules applied. Total rules applied 565 place count 2528 transition count 2120
Partial Post-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 661 place count 2528 transition count 2120
Applied a total of 661 rules in 298 ms. Remains 2528 /2528 variables (removed 0) and now considering 2120/2120 (removed 0) transitions.
// Phase 1: matrix 2120 rows 2528 cols
[2020-05-27 22:57:10] [INFO ] Computed 1098 place invariants in 9 ms
[2020-05-27 22:57:12] [INFO ] [Real]Absence check using 1098 positive place invariants in 1393 ms returned sat
[2020-05-27 22:57:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:57:24] [INFO ] [Real]Absence check using state equation in 12190 ms returned sat
[2020-05-27 22:57:24] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:57:26] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1209 ms returned sat
[2020-05-27 22:57:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:57:38] [INFO ] [Nat]Absence check using state equation in 12838 ms returned sat
[2020-05-27 22:57:38] [INFO ] State equation strengthened by 549 read => feed constraints.
[2020-05-27 22:57:39] [INFO ] [Nat]Added 549 Read/Feed constraints in 86 ms returned sat
[2020-05-27 22:57:39] [INFO ] Deduced a trap composed of 14 places in 43 ms
[2020-05-27 22:57:39] [INFO ] Deduced a trap composed of 3 places in 31 ms
[2020-05-27 22:57:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 369 ms
[2020-05-27 22:57:39] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 143 ms.
[2020-05-27 22:57:59] [INFO ] Added : 525 causal constraints over 105 iterations in 20143 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 78 ms.
[2020-05-27 22:58:01] [INFO ] [Real]Absence check using 1098 positive place invariants in 1578 ms returned sat
[2020-05-27 22:58:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:58:16] [INFO ] [Real]Absence check using state equation in 14803 ms returned sat
[2020-05-27 22:58:16] [INFO ] [Real]Added 549 Read/Feed constraints in 155 ms returned sat
[2020-05-27 22:58:16] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:58:18] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1435 ms returned sat
[2020-05-27 22:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:58:33] [INFO ] [Nat]Absence check using state equation in 14335 ms returned sat
[2020-05-27 22:58:33] [INFO ] [Nat]Added 549 Read/Feed constraints in 118 ms returned sat
[2020-05-27 22:58:33] [INFO ] Deduced a trap composed of 12 places in 50 ms
[2020-05-27 22:58:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2020-05-27 22:58:33] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 127 ms.
[2020-05-27 22:58:53] [INFO ] Added : 540 causal constraints over 108 iterations in 20208 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 83 ms.
[2020-05-27 22:58:56] [INFO ] [Real]Absence check using 1098 positive place invariants in 1600 ms returned sat
[2020-05-27 22:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 22:59:09] [INFO ] [Real]Absence check using state equation in 13078 ms returned sat
[2020-05-27 22:59:09] [INFO ] [Real]Added 549 Read/Feed constraints in 129 ms returned sat
[2020-05-27 22:59:09] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 22:59:11] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1546 ms returned sat
[2020-05-27 22:59:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 22:59:24] [INFO ] [Nat]Absence check using state equation in 13173 ms returned sat
[2020-05-27 22:59:24] [INFO ] [Nat]Added 549 Read/Feed constraints in 84 ms returned sat
[2020-05-27 22:59:24] [INFO ] Deduced a trap composed of 3 places in 38 ms
[2020-05-27 22:59:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2020-05-27 22:59:24] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 109 ms.
[2020-05-27 22:59:44] [INFO ] Added : 530 causal constraints over 106 iterations in 20128 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
[2020-05-27 22:59:47] [INFO ] [Real]Absence check using 1098 positive place invariants in 1576 ms returned sat
[2020-05-27 22:59:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:00:00] [INFO ] [Real]Absence check using state equation in 12988 ms returned sat
[2020-05-27 23:00:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:00:01] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1321 ms returned sat
[2020-05-27 23:00:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:00:14] [INFO ] [Nat]Absence check using state equation in 12427 ms returned sat
[2020-05-27 23:00:14] [INFO ] [Nat]Added 549 Read/Feed constraints in 83 ms returned sat
[2020-05-27 23:00:14] [INFO ] Deduced a trap composed of 12 places in 43 ms
[2020-05-27 23:00:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 211 ms
[2020-05-27 23:00:14] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 118 ms.
[2020-05-27 23:00:34] [INFO ] Added : 635 causal constraints over 127 iterations in 20223 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 83 ms.
[2020-05-27 23:00:37] [INFO ] [Real]Absence check using 1098 positive place invariants in 1604 ms returned sat
[2020-05-27 23:00:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:00:49] [INFO ] [Real]Absence check using state equation in 11985 ms returned sat
[2020-05-27 23:00:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:00:50] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1328 ms returned sat
[2020-05-27 23:00:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:01:02] [INFO ] [Nat]Absence check using state equation in 11397 ms returned sat
[2020-05-27 23:01:02] [INFO ] [Nat]Added 549 Read/Feed constraints in 141 ms returned sat
[2020-05-27 23:01:02] [INFO ] Deduced a trap composed of 3 places in 22 ms
[2020-05-27 23:01:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 206 ms
[2020-05-27 23:01:02] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 143 ms.
[2020-05-27 23:01:22] [INFO ] Added : 575 causal constraints over 115 iterations in 20130 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 79 ms.
[2020-05-27 23:01:24] [INFO ] [Real]Absence check using 1098 positive place invariants in 1306 ms returned sat
[2020-05-27 23:01:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:01:36] [INFO ] [Real]Absence check using state equation in 11457 ms returned sat
[2020-05-27 23:01:36] [INFO ] [Real]Added 549 Read/Feed constraints in 122 ms returned sat
[2020-05-27 23:01:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:01:37] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1212 ms returned sat
[2020-05-27 23:01:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:01:50] [INFO ] [Nat]Absence check using state equation in 12721 ms returned sat
[2020-05-27 23:01:50] [INFO ] [Nat]Added 549 Read/Feed constraints in 159 ms returned sat
[2020-05-27 23:01:51] [INFO ] Deduced a trap composed of 3 places in 45 ms
[2020-05-27 23:01:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 243 ms
[2020-05-27 23:01:51] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 145 ms.
[2020-05-27 23:02:11] [INFO ] Added : 535 causal constraints over 107 iterations in 20202 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 80 ms.
[2020-05-27 23:02:13] [INFO ] [Real]Absence check using 1098 positive place invariants in 1642 ms returned sat
[2020-05-27 23:02:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:02:28] [INFO ] [Real]Absence check using state equation in 14687 ms returned sat
[2020-05-27 23:02:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:02:30] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1445 ms returned sat
[2020-05-27 23:02:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:02:43] [INFO ] [Nat]Absence check using state equation in 13327 ms returned sat
[2020-05-27 23:02:43] [INFO ] [Nat]Added 549 Read/Feed constraints in 94 ms returned sat
[2020-05-27 23:02:43] [INFO ] Deduced a trap composed of 7 places in 58 ms
[2020-05-27 23:02:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 241 ms
[2020-05-27 23:02:43] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 127 ms.
[2020-05-27 23:03:04] [INFO ] Added : 525 causal constraints over 105 iterations in 20248 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 79 ms.
[2020-05-27 23:03:06] [INFO ] [Real]Absence check using 1098 positive place invariants in 1259 ms returned sat
[2020-05-27 23:03:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:03:18] [INFO ] [Real]Absence check using state equation in 12556 ms returned sat
[2020-05-27 23:03:18] [INFO ] [Real]Added 549 Read/Feed constraints in 160 ms returned sat
[2020-05-27 23:03:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:03:20] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1141 ms returned sat
[2020-05-27 23:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:03:34] [INFO ] [Nat]Absence check using state equation in 14332 ms returned sat
[2020-05-27 23:03:34] [INFO ] [Nat]Added 549 Read/Feed constraints in 89 ms returned sat
[2020-05-27 23:03:34] [INFO ] Deduced a trap composed of 4 places in 81 ms
[2020-05-27 23:03:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 225 ms
[2020-05-27 23:03:35] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 115 ms.
[2020-05-27 23:03:55] [INFO ] Added : 515 causal constraints over 103 iterations in 20204 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 61 ms.
[2020-05-27 23:03:57] [INFO ] [Real]Absence check using 1098 positive place invariants in 1631 ms returned sat
[2020-05-27 23:03:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-27 23:04:11] [INFO ] [Real]Absence check using state equation in 14340 ms returned sat
[2020-05-27 23:04:11] [INFO ] Solution in real domain found non-integer solution.
[2020-05-27 23:04:13] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1236 ms returned sat
[2020-05-27 23:04:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-27 23:04:27] [INFO ] [Nat]Absence check using state equation in 13835 ms returned sat
[2020-05-27 23:04:27] [INFO ] [Nat]Added 549 Read/Feed constraints in 84 ms returned sat
[2020-05-27 23:04:27] [INFO ] Deduced a trap composed of 6 places in 45 ms
[2020-05-27 23:04:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2020-05-27 23:04:27] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 129 ms.
[2020-05-27 23:04:47] [INFO ] Added : 535 causal constraints over 107 iterations in 20080 ms.(timeout) Result :sat
[2020-05-27 23:04:47] [INFO ] Deduced a trap composed of 3 places in 50 ms
[2020-05-27 23:04:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
Attempting to minimize the solution found.
Minimization took 66 ms.
[2020-05-27 23:04:48] [INFO ] Flatten gal took : 384 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-27 23:04:49] [INFO ] Applying decomposition
[2020-05-27 23:04:49] [INFO ] Input system was already deterministic with 2120 transitions.
[2020-05-27 23:04:49] [INFO ] Too many transitions (2120) to apply POR reductions. Disabling POR matrices.
[2020-05-27 23:04:49] [INFO ] Flatten gal took : 210 ms
[2020-05-27 23:04:49] [INFO ] Flatten gal took : 487 ms
[2020-05-27 23:04:49] [INFO ] Built C files in 550ms 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]
[2020-05-27 23:04:49] [INFO ] Input system was already deterministic with 2120 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/graph15472646555758381616.txt, -o, /tmp/graph15472646555758381616.bin, -w, /tmp/graph15472646555758381616.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph15472646555758381616.bin, -l, -1, -v, -w, /tmp/graph15472646555758381616.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-27 23:04:50] [INFO ] Decomposing Gal with order
[2020-05-27 23:04:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-27 23:04:50] [INFO ] Ran tautology test, simplified 0 / 9 in 1276 ms.
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-01(UNSAT) depth K=0 took 72 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-02(UNSAT) depth K=0 took 32 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(UNSAT) depth K=0 took 28 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(UNSAT) depth K=0 took 20 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-05(UNSAT) depth K=0 took 12 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-06(UNSAT) depth K=0 took 14 ms
[2020-05-27 23:04:50] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-10(UNSAT) depth K=0 took 20 ms
[2020-05-27 23:04:51] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-12(UNSAT) depth K=0 took 31 ms
[2020-05-27 23:04:51] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-14(UNSAT) depth K=0 took 11 ms
[2020-05-27 23:04:51] [INFO ] Removed a total of 1432 redundant transitions.
[2020-05-27 23:04:51] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-01(UNSAT) depth K=1 took 28 ms
[2020-05-27 23:04:51] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-02(UNSAT) depth K=1 took 37 ms
[2020-05-27 23:04:51] [INFO ] Flatten gal took : 520 ms
[2020-05-27 23:04:51] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(UNSAT) depth K=1 took 129 ms
[2020-05-27 23:04:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 582 labels/synchronizations in 67 ms.
[2020-05-27 23:04:51] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(UNSAT) depth K=1 took 128 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 2120 rows 2528 cols
[2020-05-27 23:04:51] [INFO ] Computed 1098 place invariants in 7 ms
inv : p2218 + p2223 = 1
inv : p2900 + p2903 + p2904 = 1
inv : p3362 + p3367 + p3368 = 1
inv : p2809 + p2814 + p2815 = 1
inv : p2347 + p2350 + p2351 = 1
inv : p3835 + p3840 = 1
inv : p1976 + p1981 + p1982 = 1
inv : p5196 + p5201 + p5202 = 1
inv : p7597 + p7600 + p7601 = 1
inv : p1661 + p1664 + p1665 = 1
inv : p1910 + p1915 = 1
inv : p7044 + p7047 + p7048 = 1
inv : p2421 + p2423 = 1
inv : p5287 + p5290 + p5291 = 1
inv : p7734 + p7736 = 1
inv : p5628 + p5633 = 1
inv : p3527 + p3532 = 1
inv : p1423 + p1426 + p1427 = 1
inv : p6673 + p6678 + p6679 = 1
inv : p5119 + p5122 + p5123 = 1
inv : p6365 + p6370 + p6371 = 1
inv : p5735 + p5738 + p5739 = 1
inv : p4639 + p4644 = 1
inv : p5332 + p5337 = 1
inv : p6725 + p6726 + p6736 + p6741 + p6742 = 1
inv : p6974 + p6977 + p6978 = 1
inv : p1808 + p1813 + p1814 = 1
inv : p5049 + p5052 + p5053 = 1
inv : p5357 + p5360 + p5361 = 1
inv : p6179 + p6184 = 1
inv : p4048 + p4051 + p4052 = 1
inv : p3037 + p3039 = 1
inv : p3219 + p3224 = 1
inv : p5595 + p5598 + p5599 = 1
inv : p128 + p133 + p134 = 1
inv : p7426 + p7428 = 1
inv : p4286 + p4289 + p4290 = 1
inv : p7506 + p7511 + p7512 = 1
inv : p4143 + p4148 = 1
inv : p3887 + p3892 + p3893 = 1
inv : p3345 + p3347 = 1
inv : p1547 + p1552 = 1
inv : p2911 + p2916 = 1
inv : p6271 + p6273 = 1
inv : p1353 + p1356 + p1357 = 1
inv : p5504 + p5509 + p5510 = 1
inv : p2603 + p2608 = 1
inv : p2970 + p2973 + p2974 = 1
inv : p2039 + p2042 + p2043 = 1
inv : p2046 + p2051 + p2052 = 1
inv : p5163 + p5166 + p5169 + p5171 = 1
inv : p6810 + p6812 = 1
inv : p2207 + p2210 + p2211 = 1
inv : p986 + p991 = 1
inv : p4731 + p4733 = 1
inv : p3978 + p3981 + p3982 = 1
inv : p5742 + p5747 + p5748 = 1
inv : p1239 + p1244 = 1
inv : p4979 + p4982 + p4983 = 1
inv : p1360 + p1365 + p1366 = 1
inv : p7118 + p7120 = 1
inv : p6904 + p6907 + p6908 = 1
inv : p7436 + p7441 + p7442 = 1
inv : p6425 + p6427 = 1
inv : p4346 + p4348 = 1
inv : p3653 + p3655 = 1
inv : p5837 + p5842 = 1
inv : p4503 + p4508 + p4509 = 1
inv : p5039 + p5041 = 1
inv : p5705 + p5710 = 1
inv : p5427 + p5430 + p5431 = 1
inv : p2637 + p2642 = 1
inv : p4664 + p4667 + p4668 = 1
inv : p5812 + p5817 + p5818 = 1
inv : p6288 + p6291 + p6292 = 1
inv : p6666 + p6669 + p6670 = 1
inv : p5665 + p5668 + p5669 = 1
inv : p4254 + p4259 = 1
inv : p6043 + p6046 + p6047 = 1
inv : p6641 + p6646 = 1
inv : p3817 + p3822 + p3823 = 1
inv : p6992 + p6997 = 1
inv : p7051 + p7056 + p7057 = 1
inv : p5424 + p5426 = 1
inv : p4482 + p4485 + p4486 + p4490 = 1
inv : p5126 + p5131 + p5132 = 1
inv : p1430 + p1435 + p1436 = 1
inv : p315 + p320 = 1
inv : p524 + p529 = 1
inv : p2999 + p3003 = 1
inv : p2116 + p2121 + p2122 = 1
inv : p4605 + p4610 = 1
inv : p3923 + p3927 = 1
inv : p4055 + p4060 + p4061 = 1
inv : p2306 + p2310 = 1
inv : p854 + p859 = 1
inv : p1151 + p1155 = 1
inv : p1833 + p1838 = 1
inv : p1899 + p1902 + p1903 = 1
inv : p2277 + p2280 + p2281 = 1
inv : p4858 + p4863 = 1
inv : p5540 + p5544 = 1
inv : p7608 + p7613 = 1
inv : p744 + p749 + p750 = 1
inv : p7674 + p7679 + p7680 = 1
inv : p7667 + p7670 + p7671 = 1
inv : p3040 + p3043 + p3044 = 1
inv : p2669 + p2674 + p2675 = 1
inv : p612 + p616 = 1
inv : p2383 + p2387 = 1
inv : p4356 + p4359 + p4360 = 1
inv : p6145 + p6150 = 1
inv : p3561 + p3566 = 1
inv : p6127 + p6132 + p6133 = 1
inv : p3432 + p3437 + p3438 = 1
inv : p4734 + p4737 + p4738 = 1
inv : p3425 + p3428 + p3429 = 1
inv : p4363 + p4368 + p4369 = 1
inv : p6725 + p6726 + p6795 + p6800 = 1
inv : p499 + p504 + p505 = 1
inv : p2424 + p2429 + p2430 = 1
inv : p4947 + p4952 = 1
inv : p477 + p481 + p486 = 1
inv : p7212 + p7215 + p7216 = 1
inv : p660 + p663 + p664 = 1
inv : p4748 + p4753 + p4754 = 1
inv : p7696 + p7700 = 1
inv : p1738 + p1743 + p1744 = 1
inv : p2036 + p2038 = 1
inv : p2585 + p2588 + p2589 = 1
inv : p2729 + p2731 = 1
inv : p7334 + p7339 = 1
inv : p429 + p434 + p435 = 1
inv : p422 + p425 + p426 = 1
inv : p3593 + p3596 + p3597 = 1
inv : p7754 + p7755 = 1
inv : p898 + p901 + p902 = 1
inv : p227 + p231 = 1
inv : p5501 + p5503 = 1
inv : p1731 + p1734 + p1735 = 1
inv : p4811 + p4814 + p4815 = 1
inv : p6050 + p6055 + p6056 = 1
inv : p1371 + p1376 = 1
inv : p4671 + p4676 + p4677 = 1
inv : p1038 + p1041 + p1042 = 1
inv : p2284 + p2289 + p2290 = 1
inv : p1020 + p1025 = 1
inv : p6475 + p6480 = 1
inv : p4693 + p4697 = 1
inv : p352 + p355 + p356 = 1
inv : p3164 + p3169 = 1
inv : p3670 + p3675 + p3676 = 1
inv : p2662 + p2665 + p2666 = 1
inv : p7352 + p7355 + p7356 = 1
inv : p3047 + p3052 + p3053 = 1
inv : p4396 + p4401 = 1
inv : p6428 + p6433 + p6434 = 1
inv : p7388 + p7392 = 1
inv : p7157 + p7161 = 1
inv : p975 + p978 + p979 = 1
inv : p2501 + p2506 + p2507 = 1
inv : p3208 + p3211 + p3212 = 1
inv : p4741 + p4746 + p4747 = 1
inv : p2175 + p2180 = 1
inv : p6310 + p6314 = 1
inv : p4177 + p4182 = 1
inv : p7128 + p7133 + p7134 = 1
inv : p7289 + p7292 + p7293 = 1
inv : p370 + p375 = 1
inv : p1944 + p1949 = 1
inv : p5871 + p5876 = 1
inv : p7476 + p7481 = 1
inv : p7245 + p7250 = 1
inv : p2431 + p2436 + p2437 = 1
inv : p7796 + p7801 = 1
inv : p3484 + p3489 = 1
inv : p2086 + p2091 = 1
inv : p1636 + p1641 = 1
inv : p2252 + p2257 = 1
inv : p3117 + p3120 + p3121 = 1
inv : p3285 + p3288 + p3289 = 1
inv : p2193 + p2198 + p2199 = 1
inv : p4088 + p4093 = 1
inv : p7553 + p7558 = 1
inv : p150 + p154 = 1
inv : p700 + p705 = 1
inv : p5463 + p5467 = 1
inv : p3124 + p3129 + p3130 = 1
inv : p2471 + p2476 = 1
inv : p185 + p186 + p191 + p196 + p197 = 1
inv : p6505 + p6510 + p6511 = 1
inv : p1112 + p1114 = 1
inv : p4433 + p4438 + p4439 = 1
inv : p2977 + p2982 + p2983 = 1
inv : p1507 + p1512 + p1513 = 1
inv : p3076 + p3080 = 1
inv : p7429 + p7432 + p7433 = 1
inv : p4473 + p4478 = 1
inv : p2592 + p2595 + p2596 = 1
inv : p730 + p733 + p734 = 1
inv : p7058 + p7063 + p7064 = 1
inv : p4818 + p4823 + p4824 = 1
inv : p6120 + p6125 + p6126 = 1
inv : p4308 + p4312 = 1
inv : p268 + p273 + p274 = 1
inv : p6281 + p6284 + p6285 = 1
inv : p5434 + p5439 + p5440 = 1
inv : p7069 + p7074 = 1
inv : p2560 + p2565 = 1
inv : p4550 + p4555 = 1
inv : p737 + p742 + p743 = 1
inv : p1192 + p1197 + p1198 = 1
inv : p7300 + p7305 = 1
inv : p1276 + p1279 + p1280 = 1
inv : p558 + p563 = 1
inv : p1668 + p1673 + p1674 = 1
inv : p4426 + p4429 + p4430 = 1
inv : p3307 + p3311 = 1
inv : p359 + p364 + p365 = 1
inv : p6897 + p6900 + p6901 = 1
inv : p3502 + p3507 + p3508 = 1
inv : p6197 + p6202 + p6203 = 1
inv : p3663 + p3666 + p3667 = 1
inv : p1778 + p1783 = 1
inv : p5470 + p5474 + p5479 + p5480 = 1
inv : p5963 + p5965 = 1
inv : p5980 + p5983 + p5984 = 1
inv : p5782 + p5787 = 1
inv : p6564 + p6569 = 1
inv : p1045 + p1050 + p1051 = 1
inv : p6981 + p6986 + p6987 = 1
inv : p2329 + p2334 = 1
inv : p1679 + p1684 = 1
inv : p6589 + p6592 + p6593 = 1
inv : p121 + p124 + p125 = 1
inv : p1962 + p1965 + p1966 = 1
inv : p6813 + p6818 + p6819 = 1
inv : p7359 + p7364 + p7365 = 1
inv : p7642 + p7647 = 1
inv : p2354 + p2359 + p2360 = 1
inv : p2515 + p2518 + p2519 = 1
inv : p3253 + p3258 = 1
inv : p2732 + p2737 + p2738 = 1
inv : p1115 + p1120 + p1121 = 1
inv : p114 + p116 + p119 + p120 = 1
inv : p6222 + p6227 = 1
inv : p4220 + p4225 = 1
inv : p6358 + p6361 + p6362 = 1
inv : p5749 + p5754 + p5755 = 1
inv : p3740 + p3743 + p3744 = 1
inv : p5375 + p5380 = 1
inv : p1459 + p1463 = 1
inv : p4125 + p4130 + p4131 = 1
inv : p4118 + p4121 + p4122 = 1
inv : p185 + p205 + p208 + p209 = 1
inv : p1998 + p2002 = 1
inv : p3395 + p3400 = 1
inv : p650 + p652 = 1
inv : p3579 + p3584 + p3585 = 1
inv : p4781 + p4786 = 1
inv : p3747 + p3752 + p3753 = 1
inv : p931 + p936 = 1
inv : p4000 + p4004 = 1
inv : p5203 + p5208 + p5209 = 1
inv : p7657 + p7659 = 1
inv : p3502 + p3505 + p3506 = 1
inv : p7503 + p7505 = 1
inv : p5848 + p5852 = 1
inv : p1430 + p1433 + p1434 = 1
inv : p2344 + p2346 = 1
inv : p6666 + p6671 + p6672 = 1
inv : p4279 + p4282 + p4283 = 1
inv : p4066 + p4071 = 1
inv : p2116 + p2119 + p2120 = 1
inv : p5694 + p5698 = 1
inv : p1745 + p1750 + p1751 = 1
inv : p6725 + p6726 + p6743 + p6748 + p6749 = 1
inv : p1987 + p1992 = 1
inv : p7195 + p7197 = 1
inv : p4423 + p4425 = 1
inv : p5350 + p5353 + p5354 = 1
inv : p6256 + p6261 = 1
inv : p3912 + p3917 = 1
inv : p4041 + p4044 + p4045 = 1
inv : p4979 + p4984 + p4985 = 1
inv : p1602 + p1607 = 1
inv : p7041 + p7043 = 1
inv : p1815 + p1820 + p1821 = 1
inv : p3425 + p3430 + p3431 = 1
inv : p1353 + p1358 + p1359 = 1
inv : p2806 + p2808 = 1
inv : p4503 + p4506 + p4507 = 1
inv : p3604 + p3609 = 1
inv : p2816 + p2821 + p2822 = 1
inv : p4269 + p4271 = 1
inv : p6358 + p6363 + p6364 = 1
inv : p7520 + p7523 + p7524 = 1
inv : p573 + p575 = 1
inv : p1470 + p1475 = 1
inv : p7443 + p7448 + p7449 = 1
inv : p2893 + p2896 + p2897 = 1
inv : p4962 + p4964 = 1
inv : p5049 + p5054 + p5055 = 1
inv : p5735 + p5740 + p5741 = 1
inv : p2046 + p2049 + p2050 = 1
inv : p2823 + p2826 + p2827 = 1
inv : p4363 + p4366 + p4367 = 1
inv : p4808 + p4810 = 1
inv : p1864 + p1867 + p1869 + p1872 = 1
inv : p6656 + p6658 = 1
inv : p1822 + p1825 + p1826 = 1
inv : p4870 + p4875 = 1
inv : p3142 + p3147 = 1
inv : p3432 + p3435 + p3436 = 1
inv : p4190 + p4191 + p4195 + p4200 + p4201 = 1
inv : p2680 + p2685 = 1
inv : p821 + p824 + p825 = 1
inv : p5320 + p5325 = 1
inv : p6949 + p6954 = 1
inv : p7411 + p7416 = 1
inv : p5280 + p5283 + p5284 = 1
inv : p5255 + p5260 = 1
inv : p3271 + p3276 + p3277 = 1
inv : p4154 + p4158 = 1
inv : p6288 + p6293 + p6294 = 1
inv : p3450 + p3455 = 1
inv : p2746 + p2751 + p2752 = 1
inv : p5617 + p5621 = 1
inv : p5364 + p5367 + p5368 = 1
inv : p6102 + p6107 = 1
inv : p6967 + p6970 + p6971 = 1
inv : p1423 + p1428 + p1429 = 1
inv : p6204 + p6209 + p6210 = 1
inv : p6365 + p6368 + p6369 = 1
inv : p4500 + p4502 = 1
inv : p1584 + p1587 + p1588 = 1
inv : p881 + p883 = 1
inv : p891 + p894 + p895 = 1
inv : p4825 + p4830 + p4831 = 1
inv : p6167 + p6172 = 1
inv : p3348 + p3351 + p3352 = 1
inv : p3692 + p3696 = 1
inv : p3047 + p3050 + p3051 = 1
inv : p2714 + p2719 = 1
inv : p7377 + p7382 = 1
inv : p7597 + p7602 + p7603 = 1
inv : p5486 + p5491 = 1
inv : p4657 + p4660 + p4661 = 1
inv : p5760 + p5765 = 1
inv : p6013 + p6018 = 1
inv : p4627 + p4632 = 1
inv : p814 + p819 + p820 = 1
inv : p4356 + p4361 + p4362 = 1
inv : p6725 + p6726 + p6750 + p6753 + p6754 = 1
inv : p5089 + p5094 = 1
inv : p2075 + p2079 = 1
inv : p5210 + p5213 + p5214 = 1
inv : p7756 + p7757 = 1
inv : p755 + p760 = 1
inv : p2614 + p2618 = 1
inv : p5896 + p5899 + p5900 = 1
inv : p7103 + p7108 = 1
inv : p1514 + p1517 + p1518 = 1
inv : p2768 + p2772 = 1
inv : p3586 + p3589 + p3590 = 1
inv : p5819 + p5824 + p5825 = 1
inv : p6410 + p6415 = 1
inv : p7121 + p7124 + p7125 = 1
inv : p111 + p113 = 1
inv : p4272 + p4277 + p4278 = 1
inv : p4433 + p4436 + p4437 = 1
inv : p7322 + p7327 = 1
inv : p429 + p432 + p433 = 1
inv : p6348 + p6350 = 1
inv : p5529 + p5534 = 1
inv : p5427 + p5432 + p5433 = 1
inv : p4190 + p4191 + p4192 + p4194 = 1
inv : p2988 + p2993 = 1
inv : p1269 + p1274 + p1275 = 1
inv : p1654 + p1656 + p1657 + p1658 = 1
inv : p3131 + p3134 + p3135 = 1
inv : p2886 + p2891 + p2892 = 1
inv : p185 + p186 + p191 + p194 + p195 = 1
inv : p345 + p350 + p351 = 1
inv : p2163 + p2168 = 1
inv : p7674 + p7677 + p7678 = 1
inv : p447 + p452 = 1
inv : p2592 + p2597 + p2598 = 1
inv : p6211 + p6214 + p6215 = 1
inv : p744 + p747 + p748 = 1
inv : p6134 + p6139 + p6140 = 1
inv : p774 + p777 + p782 = 1
inv : p2669 + p2672 + p2673 = 1
inv : p6502 + p6504 = 1
inv : p7513 + p7518 + p7519 = 1
inv : p5595 + p5600 + p5601 = 1
inv : p2039 + p2044 + p2045 = 1
inv : p6860 + p6865 = 1
inv : p7565 + p7570 = 1
inv : p3978 + p3983 + p3984 = 1
inv : p5504 + p5507 + p5508 = 1
inv : p2970 + p2975 + p2976 = 1
inv : p3887 + p3890 + p3891 = 1
inv : p2267 + p2269 = 1
inv : p2625 + p2630 = 1
inv : p6582 + p6587 + p6588 = 1
inv : p2526 + p2531 = 1
inv : p3230 + p3234 = 1
inv : p2200 + p2203 + p2204 = 1
inv : p4716 + p4721 = 1
inv : p5409 + p5414 = 1
inv : p7465 + p7469 = 1
inv : p583 + p588 + p589 = 1
inv : p1294 + p1299 = 1
inv : p1045 + p1048 + p1049 = 1
inv : p3201 + p3204 + p3205 = 1
inv : p6552 + p6557 = 1
inv : p359 + p362 + p363 = 1
inv : p2856 + p2861 = 1
inv : p3318 + p3323 = 1
inv : p3087 + p3092 = 1
inv : p1525 + p1530 = 1
inv : p2515 + p2520 + p2521 = 1
inv : p5221 + p5226 = 1
inv : p6519 + p6522 + p6523 = 1
inv : p275 + p280 + p281 = 1
inv : p1129 + p1132 + p1133 = 1
inv : p3810 + p3813 + p3814 = 1
inv : p4770 + p4774 = 1
inv : p6156 + p6160 = 1
inv : p4319 + p4324 = 1
inv : p737 + p740 + p741 = 1
inv : p5452 + p5457 = 1
inv : p5578 + p5580 = 1
inv : p5886 + p5888 = 1
inv : p961 + p966 + p967 = 1
inv : p576 + p581 + p582 = 1
inv : p6442 + p6445 + p6446 = 1
inv : p7003 + p7007 = 1
inv : p3733 + p3736 + p3737 = 1
inv : p2438 + p2443 + p2444 = 1
inv : p7212 + p7217 + p7218 = 1
inv : p4539 + p4543 = 1
inv : p282 + p285 + p286 = 1
inv : p968 + p971 + p972 = 1
inv : p1892 + p1895 + p1896 = 1
inv : p1206 + p1209 + p1210 = 1
inv : p653 + p658 + p659 = 1
inv : p506 + p511 + p512 = 1
inv : p3040 + p3045 + p3046 = 1
inv : p3407 + p3412 = 1
inv : p4011 + p4016 = 1
inv : p4132 + p4137 + p4138 = 1
inv : p5889 + p5894 + p5895 = 1
inv : p6299 + p6304 = 1
inv : p1382 + p1386 = 1
inv : p7289 + p7294 + p7295 = 1
inv : p128 + p131 + p132 = 1
inv : p3176 + p3181 = 1
inv : p7667 + p7672 + p7673 = 1
inv : p3780 + p3785 = 1
inv : p3549 + p3554 = 1
inv : p114 + p116 + p117 + p118 = 1
inv : p2945 + p2950 = 1
inv : p5672 + p5677 + p5678 = 1
inv : p667 + p670 + p671 = 1
inv : p5133 + p5138 + p5139 = 1
inv : p6057 + p6062 + p6063 = 1
inv : p5001 + p5005 = 1
inv : p352 + p357 + p358 = 1
inv : p6068 + p6073 = 1
inv : p6725 + p6726 + p6761 + p6766 = 1
inv : p2361 + p2366 + p2367 = 1
inv : p1283 + p1286 + p1287 = 1
inv : p2662 + p2667 + p2668 = 1
inv : p6890 + p6893 + p6894 = 1
inv : p3656 + p3659 + p3660 = 1
inv : p1969 + p1972 + p1973 = 1
inv : p807 + p812 + p813 = 1
inv : p6915 + p6920 = 1
inv : p4349 + p4354 + p4355 = 1
inv : p1420 + p1422 = 1
inv : p5434 + p5437 + p5438 = 1
inv : p730 + p735 + p736 = 1
inv : p1199 + p1204 + p1205 = 1
inv : p5903 + p5906 + p5907 = 1
inv : p2270 + p2273 + p2274 = 1
inv : p4913 + p4918 = 1
inv : p1189 + p1191 = 1
inv : p6673 + p6676 + p6677 = 1
inv : p590 + p593 + p594 = 1
inv : p6695 + p6699 = 1
inv : p1500 + p1505 + p1506 = 1
inv : p6464 + p6468 = 1
inv : p6512 + p6517 + p6518 = 1
inv : p5056 + p5061 + p5062 = 1
inv : p1885 + p1890 + p1891 = 1
inv : p1122 + p1127 + p1128 = 1
inv : p3194 + p3199 + p3200 = 1
inv : p3355 + p3358 + p3359 = 1
inv : p3961 + p3963 = 1
inv : p5144 + p5149 = 1
inv : p7737 + p7742 = 1
inv : p2977 + p2980 + p2981 = 1
inv : p4209 + p4212 + p4213 = 1
inv : p4231 + p4235 = 1
inv : p2314 + p2317 + p2318 + p2322 = 1
inv : p3268 + p3270 = 1
inv : p3869 + p3874 = 1
inv : p5826 + p5829 + p5830 = 1
inv : p3638 + p3643 = 1
inv : p5273 + p5278 + p5279 = 1
inv : p121 + p126 + p127 = 1
inv : p5794 + p5799 = 1
inv : p6387 + p6391 = 1
inv : p3278 + p3281 + p3282 = 1
inv : p6607 + p6612 = 1
inv : p5980 + p5985 + p5986 = 1
inv : p4462 + p4466 = 1
inv : p2739 + p2744 + p2745 = 1
inv : p3730 + p3732 = 1
inv : p1577 + p1582 + p1583 = 1
inv : p1690 + p1694 = 1
inv : p6281 + p6286 + p6287 = 1
inv : p1360 + p1363 + p1364 = 1
inv : p1097 + p1102 = 1
inv : p6813 + p6816 + p6817 = 1
inv : p513 + p516 + p517 = 1
inv : p4190 + p4202 + p4205 + p4206 = 1
inv : p1559 + p1564 = 1
inv : p7366 + p7371 + p7372 = 1
inv : p832 + p837 = 1
inv : p4426 + p4431 + p4432 = 1
inv : p3117 + p3122 + p3123 = 1
inv : p6435 + p6440 + p6441 = 1
inv : p6596 + p6599 + p6600 = 1
inv : p1328 + p1333 = 1
inv : p4100 + p4105 = 1
inv : p3499 + p3501 = 1
inv : p265 + p267 = 1
inv : p884 + p889 + p890 = 1
inv : p4682 + p4687 = 1
inv : p1710 + p1713 + p1715 + p1718 = 1
inv : p5771 + p5775 = 1
inv : p7580 + p7582 = 1
inv : p4510 + p4513 + p4514 = 1
inv : p6897 + p6902 + p6903 = 1
inv : p4972 + p4977 + p4978 = 1
inv : p6351 + p6356 + p6357 = 1
inv : p3989 + p3994 = 1
inv : p250 + p255 = 1
inv : p2064 + p2069 = 1
inv : p5749 + p5752 + p5753 = 1
inv : p1437 + p1440 + p1441 = 1
inv : p496 + p498 = 1
inv : p6725 + p6726 + p6750 + p6755 + p6756 = 1
inv : p7272 + p7274 = 1
inv : p5210 + p5215 + p5216 = 1
inv : p4272 + p4275 + p4276 = 1
inv : p2123 + p2126 + p2127 = 1
inv : p7773 + p7777 = 1
inv : p6725 + p6726 + p6733 + p6735 = 1
inv : p1346 + p1351 + p1352 = 1
inv : p3373 + p3378 = 1
inv : p3439 + p3442 + p3443 = 1
inv : p1085 + p1090 = 1
inv : p4793 + p4798 = 1
inv : p5273 + p5276 + p5277 = 1
inv : p7583 + p7586 + p7587 = 1
inv : p6025 + p6030 = 1
inv : p3971 + p3976 + p3977 = 1
inv : p5133 + p5136 + p5137 = 1
inv : p1767 + p1771 = 1
inv : p7058 + p7061 + p7062 = 1
inv : p6659 + p6664 + p6665 = 1
inv : p5511 + p5514 + p5515 = 1
inv : p4209 + p4214 + p4215 = 1
inv : p2193 + p2196 + p2197 = 1
inv : p6453 + p6458 = 1
inv : p5101 + p5106 = 1
inv : p4132 + p4135 + p4136 = 1
inv : p6872 + p6877 = 1
inv : p4902 + p4907 + p4908 = 1
inv : p920 + p924 = 1
inv : p6827 + p6832 + p6833 = 1
inv : p7513 + p7516 + p7517 = 1
inv : p1174 + p1179 = 1
inv : p1651 + p1653 = 1
inv : p5819 + p5822 + p5823 = 1
inv : p7520 + p7525 + p7526 = 1
inv : p6589 + p6594 + p6595 = 1
inv : p5397 + p5402 = 1
inv : p185 + p205 + p210 + p211 = 1
inv : p2893 + p2898 + p2899 = 1
inv : p2883 + p2885 = 1
inv : p1482 + p1487 = 1
inv : p3579 + p3582 + p3583 = 1
inv : p3901 + p3906 + p3907 = 1
inv : p1962 + p1967 + p1968 = 1
inv : p2886 + p2889 + p2890 = 1
inv : p1654 + p1656 + p1659 + p1660 = 1
inv : p6333 + p6338 = 1
inv : p2152 + p2156 = 1
inv : p1276 + p1281 + p1282 = 1
inv : p5581 + p5584 + p5585 = 1
inv : p1882 + p1884 = 1
inv : p2361 + p2364 + p2365 = 1
inv : p2575 + p2577 = 1
inv : p7180 + p7185 = 1
inv : p3681 + p3686 = 1
inv : p4374 + p4379 = 1
inv : p4580 + p4583 + p4584 = 1
inv : p6725 + p6726 + p6743 + p6746 + p6747 = 1
inv : p5350 + p5355 + p5356 = 1
inv : p4408 + p4413 = 1
inv : p6244 + p6249 = 1
inv : p5270 + p5272 = 1
inv : p3054 + p3057 + p3058 = 1
inv : p7146 + p7151 = 1
inv : p958 + p960 = 1
inv : p2483 + p2488 = 1
inv : p1855 + p1860 = 1
inv : p7352 + p7357 + p7358 = 1
inv : p3516 + p3521 + p3522 = 1
inv : p3461 + p3465 = 1
inv : p5588 + p5593 + p5594 = 1
inv : p138 + p139 + p144 = 1
inv : p4704 + p4709 = 1
inv : p4440 + p4443 + p4444 = 1
inv : p7454 + p7459 = 1
inv : p2501 + p2504 + p2505 = 1
inv : p3894 + p3897 + p3898 = 1
inv : p576 + p579 + p580 = 1
inv : p7128 + p7131 + p7132 = 1
inv : p2130 + p2135 + p2136 = 1
inv : p5859 + p5864 = 1
inv : p4759 + p4764 = 1
inv : p1038 + p1043 + p1044 = 1
inv : p3964 + p3967 + p3968 = 1
inv : p4077 + p4081 = 1
inv : p5203 + p5206 + p5207 = 1
inv : p3807 + p3809 = 1
inv : p3099 + p3104 = 1
inv : p1008 + p1013 = 1
inv : p342 + p344 = 1
inv : p1305 + p1309 = 1
inv : p6211 + p6216 + p6217 = 1
inv : p458 + p462 = 1
inv : p5518 + p5523 + p5524 = 1
inv : p7590 + p7595 + p7596 = 1
inv : p2963 + p2968 + p2969 = 1
inv : p2585 + p2590 + p2591 = 1
inv : p2746 + p2749 + p2750 = 1
inv : p3124 + p3127 + p3128 = 1
inv : p1815 + p1818 + p1819 = 1
inv : p660 + p665 + p666 = 1
inv : p814 + p817 + p818 = 1
inv : p1393 + p1398 = 1
inv : p4577 + p4579 = 1
inv : p3191 + p3193 = 1
inv : p2757 + p2762 = 1
inv : p4165 + p4170 = 1
inv : p6373 + p6376 + p6381 = 1
inv : p1805 + p1807 = 1
inv : p1514 + p1519 + p1520 = 1
inv : p7091 + p7096 = 1
inv : p6967 + p6972 + p6973 = 1
inv : p5966 + p5971 + p5972 = 1
inv : p185 + p186 + p198 + p201 + p202 = 1
inv : p7135 + p7140 + p7141 = 1
inv : p6117 + p6119 = 1
inv : p5178 + p5183 = 1
inv : p5042 + p5047 + p5048 = 1
inv : p1507 + p1510 + p1511 = 1
inv : p7234 + p7238 = 1
inv : p3348 + p3353 + p3354 = 1
inv : p6541 + p6545 = 1
inv : p4279 + p4284 + p4285 = 1
inv : p6964 + p6966 = 1
inv : p866 + p871 = 1
inv : p5889 + p5892 + p5893 = 1
inv : p5896 + p5901 + p5902 = 1
inv : p1932 + p1937 = 1
inv : p3509 + p3512 + p3513 = 1
inv : p4190 + p4191 + p4195 + p4198 + p4199 = 1
inv : p1266 + p1268 = 1
inv : p4616 + p4620 = 1
inv : p419 + p421 = 1
inv : p5309 + p5313 = 1
inv : p821 + p826 + p827 = 1
inv : p712 + p717 = 1
inv : p1822 + p1827 + p1828 = 1
inv : p401 + p404 + p406 + p409 = 1
inv : p6706 + p6711 = 1
inv : p2508 + p2513 + p2514 = 1
inv : p4924 + p4928 = 1
inv : p6512 + p6515 + p6516 = 1
inv : p590 + p595 + p596 = 1
inv : p6043 + p6048 + p6049 = 1
inv : p6926 + p6930 = 1
inv : p5155 + p5159 = 1
inv : p7205 + p7210 + p7211 = 1
inv : p3194 + p3197 + p3198 = 1
inv : p2702 + p2707 = 1
inv : p1140 + p1145 = 1
inv : p1052 + p1055 + p1056 = 1
inv : p3626 + p3631 = 1
inv : p6079 + p6083 = 1
inv : p6725 + p6726 + p6772 + p6776 = 1
inv : p891 + p896 + p897 = 1
inv : p3817 + p3820 + p3821 = 1
inv : p1584 + p1589 + p1590 = 1
inv : p5903 + p5908 + p5909 = 1
inv : p2394 + p2399 = 1
inv : p623 + p628 = 1
inv : p282 + p287 + p288 = 1
inv : p6204 + p6207 + p6208 = 1
inv : p1199 + p1202 + p1203 = 1
inv : p7707 + p7712 = 1
inv : p5665 + p5670 + p5671 = 1
inv : p3656 + p3661 + p3662 = 1
inv : p3593 + p3598 + p3599 = 1
inv : p653 + p656 + p657 = 1
inv : p5732 + p5734 = 1
inv : p2933 + p2938 = 1
inv : p513 + p518 + p519 = 1
inv : p3271 + p3274 + p3275 = 1
inv : p3857 + p3862 = 1
inv : p6435 + p6438 + p6439 = 1
inv : p7744 + p7749 = 1
inv : p100 + p102 = 1
inv : p304 + p308 = 1
inv : p2537 + p2541 = 1
inv : p7619 + p7623 = 1
inv : p422 + p427 + p428 = 1
inv : p766 + p770 = 1
inv : p2578 + p2583 + p2584 = 1
inv : p535 + p539 = 1
inv : p2021 + p2026 = 1
inv : p7366 + p7369 + p7370 = 1
inv : p4023 + p4028 = 1
inv : p5655 + p5657 = 1
inv : p1591 + p1593 + p1596 + p1597 = 1
inv : p216 + p221 = 1
inv : p4528 + p4533 = 1
inv : p6442 + p6447 + p6448 = 1
inv : p3946 + p3951 = 1
inv : p5826 + p5831 + p5832 = 1
inv : p3733 + p3738 + p3739 = 1
inv : p4836 + p4841 = 1
inv : p6618 + p6622 = 1
inv : p583 + p586 + p587 = 1
inv : p1122 + p1125 + p1126 = 1
inv : p2845 + p2849 = 1
inv : p2739 + p2742 + p2743 = 1
inv : p1129 + p1134 + p1135 = 1
inv : p7014 + p7019 = 1
inv : p4242 + p4247 = 1
inv : p7198 + p7201 + p7202 = 1
inv : p5067 + p5072 = 1
inv : p5809 + p5811 = 1
inv : p6820 + p6823 + p6824 = 1
inv : p1728 + p1730 = 1
inv : p5973 + p5978 + p5979 = 1
inv : p6134 + p6137 + p6138 = 1
inv : p3715 + p3720 = 1
inv : p5347 + p5349 = 1
inv : p6725 + p6726 + p6736 + p6739 + p6740 = 1
inv : p436 + p439 + p440 = 1
inv : p3538 + p3542 = 1
inv : p7443 + p7446 + p7447 = 1
inv : p4965 + p4968 + p4969 = 1
inv : p1745 + p1748 + p1749 = 1
inv : p5441 + p5444 + p5445 = 1
inv : p2655 + p2660 + p2661 = 1
inv : p4331 + p4336 = 1
inv : p1613 + p1617 = 1
inv : p6519 + p6524 + p6525 = 1
inv : p5563 + p5568 = 1
inv : p5936 + p5941 = 1
inv : p884 + p887 + p888 = 1
inv : p4115 + p4117 = 1
inv : p1976 + p1979 + p1980 = 1
inv : p4517 + p4522 + p4523 = 1
inv : p5357 + p5362 + p5363 = 1
inv : p3022 + p3027 = 1
inv : p1343 + p1345 = 1
inv : p3769 + p3773 = 1
inv : p5658 + p5661 + p5662 = 1
inv : p1206 + p1211 + p1212 = 1
inv : p2113 + p2115 = 1
inv : p5012 + p5017 = 1
inv : p6057 + p6060 + p6061 = 1
inv : p3824 + p3829 + p3830 = 1
inv : p6838 + p6843 = 1
inv : p275 + p278 + p279 = 1
inv : p5232 + p5236 = 1
inv : p506 + p509 + p510 = 1
inv : p1577 + p1580 + p1581 = 1
inv : p3278 + p3283 + p3284 = 1
inv : p1574 + p1576 = 1
inv : p2449 + p2454 = 1
inv : p4451 + p4456 = 1
inv : p2900 + p2905 + p2906 = 1
inv : p4587 + p4590 + p4591 = 1
inv : p5991 + p5996 = 1
inv : p6274 + p6279 + p6280 = 1
inv : p5280 + p5285 + p5286 = 1
inv : p4594 + p4599 + p4600 = 1
inv : p6194 + p6196 = 1
inv : p2816 + p2819 + p2820 = 1
inv : p7282 + p7287 + p7288 = 1
inv : p4888 + p4891 + p4892 = 1
inv : p4895 + p4900 + p4901 = 1
inv : p7275 + p7278 + p7279 = 1
inv : p2823 + p2828 + p2829 = 1
inv : p2438 + p2441 + p2442 = 1
inv : p2229 + p2233 = 1
inv : p1892 + p1897 + p1898 = 1
inv : p7531 + p7536 = 1
inv : p173 + p178 = 1
inv : p7660 + p7665 + p7666 = 1
inv : p2053 + p2056 + p2057 = 1
inv : p392 + p397 = 1
inv : p3362 + p3365 + p3366 = 1
inv : p678 + p683 = 1
inv : p3201 + p3206 + p3207 = 1
inv : p1885 + p1888 + p1889 = 1
inv : p2270 + p2275 + p2276 = 1
inv : p961 + p964 + p965 = 1
inv : p5742 + p5745 + p5746 = 1
inv : p1228 + p1232 = 1
inv : p968 + p973 + p974 = 1
inv : p2791 + p2796 = 1
inv : p4190 + p4202 + p4207 + p4208 = 1
inv : p7590 + p7593 + p7594 = 1
inv : p4055 + p4058 + p4059 = 1
inv : p2295 + p2300 = 1
inv : p469 + p474 = 1
inv : p7349 + p7351 = 1
inv : p5948 + p5953 = 1
inv : p2354 + p2357 + p2358 = 1
inv : p1844 + p1848 = 1
inv : p2498 + p2500 = 1
inv : p3355 + p3360 + p3361 = 1
inv : p5518 + p5521 + p5522 = 1
inv : p5551 + p5556 = 1
inv : p5056 + p5059 + p5060 = 1
inv : p6981 + p6984 + p6985 = 1
inv : p6904 + p6909 + p6910 = 1
inv : p1283 + p1288 + p1289 = 1
inv : p3964 + p3969 + p3970 = 1
inv : p5680 + p5683 + p5684 + p5688 = 1
inv : p5812 + p5815 + p5816 = 1
inv : p909 + p914 = 1
inv : p2130 + p2133 + p2134 = 1
inv : p1969 + p1974 + p1975 = 1
inv : p6887 + p6889 = 1
inv : p5116 + p5118 = 1
inv : p1405 + p1410 = 1
inv : p727 + p729 = 1
inv : p807 + p810 + p811 = 1
inv : p1668 + p1671 + p1672 = 1
inv : p3758 + p3763 = 1
inv : p1251 + p1256 = 1
inv : p2652 + p2654 = 1
inv : p4349 + p4352 + p4353 = 1
inv : p2141 + p2146 = 1
inv : p6596 + p6601 + p6602 = 1
inv : p3439 + p3444 + p3445 = 1
inv : p5925 + p5928 + p5929 = 1
inv : p499 + p502 + p503 = 1
inv : p2053 + p2058 + p2059 = 1
inv : p3422 + p3424 = 1
inv : p1316 + p1321 = 1
inv : p7660 + p7663 + p7664 = 1
inv : p1756 + p1761 = 1
inv : p6974 + p6979 + p6980 = 1
inv : p2424 + p2427 + p2428 = 1
inv : p1899 + p1904 + p1905 = 1
inv : p6684 + p6689 = 1
inv : p1808 + p1811 + p1812 = 1
inv : p1731 + p1736 + p1737 = 1
inv : p601 + p606 = 1
inv : p4048 + p4053 + p4054 = 1
inv : p843 + p847 = 1
inv : p4125 + p4128 + p4129 = 1
inv : p3884 + p3886 = 1
inv : p4562 + p4567 = 1
inv : p5126 + p5129 + p5130 = 1
inv : p7051 + p7054 + p7055 = 1
inv : p6395 + p6398 + p6400 + p6403 = 1
inv : p3516 + p3519 + p3520 = 1
inv : p2372 + p2377 = 1
inv : p1661 + p1666 + p1667 = 1
inv : p7685 + p7690 = 1
inv : p6040 + p6042 = 1
inv : p2347 + p2352 + p2353 = 1
inv : p7583 + p7588 + p7589 = 1
inv : p4286 + p4291 + p4292 = 1
inv : p7719 + p7724 = 1
inv : p1500 + p1503 + p1504 = 1
inv : p6890 + p6895 + p6896 = 1
inv : p4965 + p4970 + p4971 = 1
inv : p5042 + p5045 + p5046 = 1
inv : p5196 + p5199 + p5200 = 1
inv : p5966 + p5969 + p5970 = 1
inv : p1701 + p1706 = 1
inv : p4517 + p4520 + p4521 = 1
inv : p5287 + p5292 + p5293 = 1
inv : p2406 + p2411 = 1
inv : p3114 + p3116 = 1
inv : p185 + p186 + p188 + p190 = 1
inv : p1738 + p1741 + p1742 = 1
inv : p5672 + p5675 + p5676 = 1
inv : p3810 + p3815 + p3816 = 1
inv : p3509 + p3514 + p3515 = 1
inv : p1074 + p1078 = 1
inv : p7135 + p7138 + p7139 = 1
inv : p6659 + p6662 + p6663 = 1
inv : p4990 + p4995 = 1
inv : p3846 + p3850 = 1
inv : p4580 + p4585 + p4586 = 1
inv : p4902 + p4905 + p4906 = 1
inv : p6827 + p6830 + p6831 = 1
inv : p238 + p243 = 1
inv : p1346 + p1349 + p1350 = 1
inv : p1536 + p1540 = 1
inv : p4297 + p4302 = 1
inv : p5640 + p5645 = 1
inv : p1437 + p1442 + p1443 = 1
inv : p3576 + p3578 = 1
inv : p2868 + p2873 = 1
inv : p1921 + p1925 = 1
inv : p5119 + p5124 + p5125 = 1
inv : p3670 + p3673 + p3674 = 1
inv : p7044 + p7049 + p7050 = 1
inv : p7205 + p7208 + p7209 = 1
inv : p7223 + p7228 = 1
inv : p3792 + p3797 = 1
inv : p997 + p1001 = 1
inv : p6530 + p6535 = 1
inv : p2207 + p2212 + p2213 = 1
inv : p4385 + p4389 = 1
inv : p667 + p672 + p673 = 1
inv : p6120 + p6123 + p6124 = 1
inv : p5717 + p5722 = 1
inv : p7506 + p7509 + p7510 = 1
inv : p5511 + p5516 + p5517 = 1
inv : p1162 + p1167 = 1
inv : p2960 + p2962 = 1
inv : p5588 + p5591 + p5592 = 1
inv : p7429 + p7434 + p7435 = 1
inv : p4741 + p4744 + p4745 = 1
inv : p2284 + p2287 + p2288 = 1
inv : p3330 + p3335 = 1
inv : p2963 + p2966 + p2967 = 1
inv : p3054 + p3059 + p3060 = 1
inv : p3934 + p3939 = 1
inv : p2123 + p2128 + p2129 = 1
inv : p1497 + p1499 = 1
inv : p3971 + p3974 + p3975 = 1
inv : p3894 + p3899 + p3900 = 1
inv : p4038 + p4040 = 1
inv : p327 + p332 = 1
inv : p3663 + p3668 + p3669 = 1
inv : p7198 + p7203 + p7204 = 1
inv : p4847 + p4851 = 1
inv : p3010 + p3015 = 1
inv : p1448 + p1453 = 1
inv : p4818 + p4821 + p4822 = 1
inv : p5078 + p5082 = 1
inv : p898 + p903 + p904 = 1
inv : p1217 + p1222 = 1
inv : p2779 + p2784 = 1
inv : p3241 + p3246 = 1
inv : p2277 + p2282 + p2283 = 1
inv : p4664 + p4669 + p4670 = 1
inv : p6849 + p6853 = 1
inv : p4825 + p4828 + p4829 = 1
inv : p943 + p948 = 1
inv : p3747 + p3750 + p3751 = 1
inv : p3703 + p3708 = 1
inv : p5441 + p5446 + p5447 = 1
inv : p1115 + p1118 + p1119 = 1
inv : p6127 + p6130 + p6131 = 1
inv : p5298 + p5303 = 1
inv : p4657 + p4662 + p4663 = 1
inv : p1059 + p1063 + p1068 = 1
inv : p3131 + p3136 + p3137 = 1
inv : p2578 + p2581 + p2582 = 1
inv : p3472 + p3477 = 1
inv : p185 + p186 + p198 + p203 + p204 = 1
inv : p7542 + p7546 = 1
inv : p436 + p441 + p442 = 1
inv : p2240 + p2245 = 1
inv : p6505 + p6508 + p6509 = 1
inv : p2548 + p2553 = 1
inv : p4440 + p4445 + p4446 = 1
inv : p6629 + p6634 = 1
inv : p6582 + p6585 + p6586 = 1
inv : p161 + p166 = 1
inv : p689 + p693 = 1
inv : p3740 + p3745 + p3746 = 1
inv : p5386 + p5390 = 1
inv : p2200 + p2205 + p2206 = 1
inv : p7121 + p7126 + p7127 = 1
inv : p2009 + p2014 = 1
inv : p381 + p385 = 1
inv : p975 + p980 + p981 = 1
inv : p3586 + p3591 + p3592 = 1
inv : p6718 + p6723 = 1
inv : p7311 + p7315 = 1
inv : p4587 + p4592 + p4593 = 1
inv : p1790 + p1795 = 1
inv : p4734 + p4739 + p4740 = 1
inv : p2508 + p2511 + p2512 = 1
inv : p6002 + p6006 = 1
inv : p6233 + p6237 = 1
inv : p2655 + p2658 + p2659 = 1
inv : p1269 + p1272 + p1273 = 1
inv : p4935 + p4940 = 1
inv : p7282 + p7285 + p7286 = 1
inv : p6487 + p6492 = 1
inv : p6197 + p6200 + p6201 = 1
inv : p4895 + p4898 + p4899 = 1
inv : p345 + p348 + p349 = 1
inv : p7080 + p7084 = 1
inv : p4748 + p4751 + p4752 = 1
inv : p5193 + p5195 = 1
inv : p6050 + p6053 + p6054 = 1
inv : p6725 + p6726 + p6783 + p6788 = 1
inv : p786 + p789 + p792 + p794 = 1
inv : p5581 + p5586 + p5587 = 1
inv : p3615 + p3619 = 1
inv : p6090 + p6095 = 1
inv : p635 + p640 = 1
inv : p4118 + p4123 + p4124 = 1
inv : p6321 + p6326 = 1
inv : p3208 + p3213 + p3214 = 1
inv : p3384 + p3388 = 1
inv : p4972 + p4975 + p4976 = 1
inv : p4811 + p4816 + p4817 = 1
inv : p2190 + p2192 = 1
inv : p804 + p806 = 1
inv : p7488 + p7493 = 1
inv : p5364 + p5369 + p5370 = 1
inv : p4888 + p4893 + p4894 = 1
inv : p5973 + p5976 + p5977 = 1
inv : p4671 + p4674 + p4675 = 1
inv : p4510 + p4515 + p4516 = 1
inv : p6351 + p6354 + p6355 = 1
inv : p5914 + p5919 = 1
inv : p7257 + p7262 = 1
inv : p2431 + p2434 + p2435 = 1
inv : p3901 + p3904 + p3905 = 1
inv : p6937 + p6942 = 1
inv : p1959 + p1961 = 1
inv : p3153 + p3157 = 1
inv : p7436 + p7439 + p7440 = 1
inv : p7275 + p7280 + p7281 = 1
inv : p2809 + p2812 + p2813 = 1
inv : p4654 + p4656 = 1
inv : p2834 + p2839 = 1
inv : p7399 + p7404 = 1
inv : p5606 + p5611 = 1
inv : p3285 + p3290 + p3291 = 1
inv : p5243 + p5248 = 1
inv : p7026 + p7031 = 1
inv : p6428 + p6431 + p6432 = 1
inv : p5024 + p5029 = 1
inv : p7630 + p7635 = 1
inv : p7359 + p7362 + p7363 = 1
inv : p6579 + p6581 = 1
inv : p4594 + p4597 + p4598 = 1
inv : p7168 + p7173 = 1
inv : p6274 + p6277 + p6278 = 1
inv : p6820 + p6825 + p6826 = 1
inv : p5658 + p5663 + p5664 = 1
inv : p2460 + p2464 = 1
inv : p268 + p271 + p272 = 1
inv : p2922 + p2926 = 1
inv : p3065 + p3070 = 1
inv : p1192 + p1195 + p1196 = 1
inv : p7784 + p7789 = 1
inv : p2732 + p2735 + p2736 = 1
inv : p546 + p551 = 1
inv : p293 + p298 = 1
inv : p3824 + p3827 + p3828 = 1
inv : p4885 + p4887 = 1
inv : p1624 + p1629 = 1
inv : p2098 + p2103 = 1
inv : p4041 + p4046 + p4047 = 1
inv : p3296 + p3301 = 1
inv : p1052 + p1057 + p1058 = 1
inv : p1591 + p1593 + p1594 + p1595 = 1
inv : p1035 + p1037 = 1
inv : p2691 + p2695 = 1
Total of 1098 invariants.
[2020-05-27 23:04:51] [INFO ] Computed 1098 place invariants in 20 ms
[2020-05-27 23:04:51] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 64 ms
[2020-05-27 23:04:51] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.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/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness], workingDir=/home/mcc/execution]
[2020-05-27 23:04:51] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-05(UNSAT) depth K=1 took 100 ms
[2020-05-27 23:04:51] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-06(UNSAT) depth K=1 took 18 ms
[2020-05-27 23:04:51] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-10(UNSAT) depth K=1 took 5 ms
[2020-05-27 23:04:51] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-12(UNSAT) depth K=1 took 2 ms
[2020-05-27 23:04:51] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-14(UNSAT) depth K=1 took 2 ms

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : ShieldPPPt-PT-100B-ReachabilityCardinality-01 with value :((((i5.i0.i0.i1.u154.p1280==0)||(i24.i1.i1.i0.u762.p5928==1))||(((i18.u572.p4486==0)||(i23.u719.p5599==1))&&((i0.u11.p186==0)||(i27.u845.p6586==1))))||((i8.u271.p2192==1)&&((i2.u90.p774==0)||(i1.i0.i0.i2.u51.p486==1))))
Read [reachable] property : ShieldPPPt-PT-100B-ReachabilityCardinality-02 with value :((i0.u2.p117==1)||((i21.u662.p5169!=0)&&(i4.u129.p1068!=1)))
Read [reachable] property : ShieldPPPt-PT-100B-ReachabilityCardinality-03 with value :(i8.u276.p2211==1)
Read [invariant] property : ShieldPPPt-PT-100B-ReachabilityCardinality-04 with value :((i6.u201.p1657==0)||(i9.u290.p2318==1))
Read [invariant] property : ShieldPPPt-PT-100B-ReachabilityCardinality-05 with value :(((i6.u210.p1715==0)||(i22.u702.p5480==1))||(i5.i1.i1.i0.u186.p1518!=1))
Read [reachable] property : ShieldPPPt-PT-100B-ReachabilityCardinality-06 with value :(i7.u230.p1869==1)
Read [reachable] property : ShieldPPPt-PT-100B-ReachabilityCardinality-10 with value :(((i28.i0.i0.i0.u864.p6726!=0)&&(i24.i0.i1.i0.u732.p5684!=1))&&(((i0.u8.p138!=0)&&(i17.u532.p4191!=1))||((i1.i0.i1.i1.u41.p406!=0)&&(i0.u28.p286!=1))))
Read [invariant] property : ShieldPPPt-PT-100B-ReachabilityCardinality-12 with value :(i6.u196.p1593!=1)
Read [invariant] property : ShieldPPPt-PT-100B-ReachabilityCardinality-14 with value :(((((i26.u821.p6373==0)||(i2.u91.p792==1))||(i9.u317.p2519==0))||(i26.u822.p6400==1))||((i2.u74.p659!=0)&&(i7.u241.p1961!=1)))
built 31 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 39 ordering constraints for composite.
built 30 ordering constraints for composite.
built 44 ordering constraints for composite.
built 39 ordering constraints for composite.
built 37 ordering constraints for composite.
built 39 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 38 ordering constraints for composite.
built 37 ordering constraints for composite.
built 45 ordering constraints for composite.
built 49 ordering constraints for composite.
built 38 ordering constraints for composite.
built 9 ordering constraints for composite.
built 11 ordering constraints for composite.
built 7 ordering constraints for composite.
built 36 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 13 ordering constraints for composite.
built 14 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 4 ordering constraints for composite.
built 42 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 37 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 28 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 28 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 28 ordering constraints for composite.
built 38 ordering constraints for composite.
built 28 ordering constraints for composite.
built 38 ordering constraints for composite.
built 38 ordering constraints for composite.
built 38 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 8 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 6 ordering constraints for composite.
built 7 ordering constraints for composite.
built 9 ordering constraints for composite.
built 9 ordering constraints for composite.
built 8 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 38 ordering constraints for composite.
built 11 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 11 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 12 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 7 ordering constraints for composite.
built 32 ordering constraints for composite.
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
[2020-05-27 23:04:59] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-01(UNSAT) depth K=2 took 7885 ms
[2020-05-27 23:05:00] [INFO ] Proved 2528 variables to be positive in 8974 ms
[2020-05-27 23:05:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-01
[2020-05-27 23:05:00] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-01(SAT) depth K=0 took 365 ms
[2020-05-27 23:05:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-02
[2020-05-27 23:05:01] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-02(SAT) depth K=0 took 279 ms
[2020-05-27 23:05:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-03
[2020-05-27 23:05:01] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(SAT) depth K=0 took 240 ms
[2020-05-27 23:05:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-04
[2020-05-27 23:05:01] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(SAT) depth K=0 took 290 ms
[2020-05-27 23:05:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-05
[2020-05-27 23:05:01] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-05(SAT) depth K=0 took 279 ms
[2020-05-27 23:05:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-06
[2020-05-27 23:05:02] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-06(SAT) depth K=0 took 239 ms
[2020-05-27 23:05:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-10
[2020-05-27 23:05:02] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-10(SAT) depth K=0 took 291 ms
[2020-05-27 23:05:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-12
[2020-05-27 23:05:02] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-12(SAT) depth K=0 took 238 ms
[2020-05-27 23:05:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-14
[2020-05-27 23:05:02] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-14(SAT) depth K=0 took 234 ms
[2020-05-27 23:05:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-01
[2020-05-27 23:05:04] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-01(SAT) depth K=1 took 989 ms
[2020-05-27 23:05:04] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-02
[2020-05-27 23:05:04] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-02(SAT) depth K=1 took 781 ms
[2020-05-27 23:05:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-03
[2020-05-27 23:05:05] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(SAT) depth K=1 took 896 ms
[2020-05-27 23:05:06] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-04
[2020-05-27 23:05:06] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(SAT) depth K=1 took 904 ms
[2020-05-27 23:05:06] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-02(UNSAT) depth K=2 took 7363 ms
[2020-05-27 23:05:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-05
[2020-05-27 23:05:07] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-05(SAT) depth K=1 took 779 ms
[2020-05-27 23:05:08] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-06
[2020-05-27 23:05:08] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-06(SAT) depth K=1 took 906 ms
[2020-05-27 23:05:09] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(UNSAT) depth K=2 took 2114 ms
[2020-05-27 23:05:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-10
[2020-05-27 23:05:09] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-10(SAT) depth K=1 took 869 ms
[2020-05-27 23:05:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-12
[2020-05-27 23:05:10] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-12(SAT) depth K=1 took 863 ms
[2020-05-27 23:05:10] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesShieldPPPt-PT-100B-ReachabilityCardinality-14
[2020-05-27 23:05:10] [INFO ] KInduction solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-14(SAT) depth K=1 took 771 ms
SDD proceeding with computation, new max is 65536
[2020-05-27 23:05:11] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(UNSAT) depth K=2 took 2754 ms
[2020-05-27 23:05:14] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-05(UNSAT) depth K=2 took 3004 ms
Compilation finished in 25449 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 61 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, ShieldPPPtPT100BReachabilityCardinality01==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, ShieldPPPtPT100BReachabilityCardinality01==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, ShieldPPPtPT100BReachabilityCardinality01==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-27 23:05:17] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-06(UNSAT) depth K=2 took 2906 ms
[2020-05-27 23:05:21] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-10(UNSAT) depth K=2 took 3317 ms
[2020-05-27 23:05:23] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-12(UNSAT) depth K=2 took 2122 ms
[2020-05-27 23:05:25] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-14(UNSAT) depth K=2 took 2777 ms
SDD proceeding with computation, new max is 131072
[2020-05-27 23:07:08] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-01(UNSAT) depth K=3 took 102705 ms
Reachability property ShieldPPPt-PT-100B-ReachabilityCardinality-02 is true.
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 262144
[2020-05-27 23:08:37] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-02(UNSAT) depth K=3 took 88354 ms
[2020-05-27 23:09:11] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-03(UNSAT) depth K=3 took 34041 ms
Invariant property ShieldPPPt-PT-100B-ReachabilityCardinality-14 does not hold.
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-100B-ReachabilityCardinality-06 is true.
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldPPPt-PT-100B-ReachabilityCardinality-03 is true.
FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 524288
[2020-05-27 23:12:25] [INFO ] BMC solution for property ShieldPPPt-PT-100B-ReachabilityCardinality-04(UNSAT) depth K=3 took 194786 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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ShieldPPPt-PT-100B"
export BK_EXAMINATION="ReachabilityCardinality"
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 ShieldPPPt-PT-100B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r210-tajo-159033476200742"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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