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.r211-tajo-159033477900742.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 itslola
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 r211-tajo-159033477900742
=====================================================================

--------------------
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 1591325207912

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 02:46:49] [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, -timeout, 3600, -rebuildPNML]
[2020-06-05 02:46:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 02:46:49] [INFO ] Load time of PNML (sax parser for PT used): 310 ms
[2020-06-05 02:46:50] [INFO ] Transformed 7803 places.
[2020-06-05 02:46:50] [INFO ] Transformed 7103 transitions.
[2020-06-05 02:46:50] [INFO ] Found NUPN structural information;
[2020-06-05 02:46:50] [INFO ] Parsed PT model containing 7803 places and 7103 transitions in 717 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 271 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 270 ms. (steps per millisecond=37 ) 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 44 ms. (steps per millisecond=227 ) 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 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 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 51 ms. (steps per millisecond=196 ) 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 26 ms. (steps per millisecond=384 ) 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 24 ms. (steps per millisecond=416 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 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 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 7103 rows 7803 cols
[2020-06-05 02:46:51] [INFO ] Computed 1101 place invariants in 222 ms
[2020-06-05 02:46:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:46:56] [INFO ] [Real]Absence check using 1101 positive place invariants in 4117 ms returned (error "Failed to check-sat")
[2020-06-05 02:46:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:46:56] [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-06-05 02:47:01] [INFO ] [Real]Absence check using 1101 positive place invariants in 3568 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 02:47:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:01] [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 1
[2020-06-05 02:47:06] [INFO ] [Real]Absence check using 1101 positive place invariants in 3766 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 02:47:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:06] [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-06-05 02:47:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:47:11] [INFO ] [Real]Absence check using 1101 positive place invariants in 3876 ms returned (error "Failed to check-sat")
[2020-06-05 02:47:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:11] [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: Broken pipe") while checking expression at index 3
[2020-06-05 02:47:16] [INFO ] [Real]Absence check using 1101 positive place invariants in 3895 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 02:47:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:16] [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-06-05 02:47:21] [INFO ] [Real]Absence check using 1101 positive place invariants in 3959 ms returned (error "Failed to check-sat")
[2020-06-05 02:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:21] [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-06-05 02:47:26] [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 (= 1 (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s2490 s2491 s2492 s2493 s2494 s2495 s2496 s2508 s2509 s2510 s2513 s2514))") while checking expression at index 6
[2020-06-05 02:47:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:47:31] [INFO ] [Real]Absence check using 1101 positive place invariants in 4144 ms returned (error "Failed to check-sat")
[2020-06-05 02:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:31] [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-06-05 02:47:36] [INFO ] [Real]Absence check using 1101 positive place invariants in 3278 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 02:47:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:36] [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: Broken pipe") while checking expression at index 8
[2020-06-05 02:47:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 02:47:41] [INFO ] [Real]Absence check using 1101 positive place invariants in 3985 ms returned (error "Failed to check-sat")
[2020-06-05 02:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:47:41] [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 93 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 115 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 36 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 11 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 10 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 10 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 6 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 6 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 5391 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 11793 ms. (steps per millisecond=84 ) 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 559005 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 Best-First random walk after 601382 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 576886 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 557567 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 Best-First random walk after 553459 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 584076 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 578587 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 586101 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 577978 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=115 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2126 rows 2536 cols
[2020-06-05 02:48:44] [INFO ] Computed 1100 place invariants in 27 ms
[2020-06-05 02:48:45] [INFO ] [Real]Absence check using 1100 positive place invariants in 1252 ms returned sat
[2020-06-05 02:48:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:49:06] [INFO ] [Real]Absence check using state equation in 20545 ms returned sat
[2020-06-05 02:49:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:49:10] [INFO ] [Nat]Absence check using 1100 positive place invariants in 3620 ms returned sat
[2020-06-05 02:49:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:49:29] [INFO ] [Nat]Absence check using state equation in 19146 ms returned sat
[2020-06-05 02:49:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2020-06-05 02:49:29] [INFO ] [Nat]Added 13 Read/Feed constraints in 66 ms returned sat
[2020-06-05 02:49:30] [INFO ] Deduced a trap composed of 7 places in 612 ms
[2020-06-05 02:49:31] [INFO ] Deduced a trap composed of 6 places in 709 ms
[2020-06-05 02:49:32] [INFO ] Deduced a trap composed of 7 places in 760 ms
[2020-06-05 02:49:32] [INFO ] Deduced a trap composed of 5 places in 534 ms
[2020-06-05 02:49:33] [INFO ] Deduced a trap composed of 6 places in 704 ms
[2020-06-05 02:49:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4097 ms
[2020-06-05 02:49:34] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 234 ms.
[2020-06-05 02:49:51] [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 (=> (> t607 0) (or (and (> t1701 0) (< o1701 o607)) (and (> t1703 0) (< o1703 o607))))") while checking expression at index 0
[2020-06-05 02:49:53] [INFO ] [Real]Absence check using 1100 positive place invariants in 1421 ms returned sat
[2020-06-05 02:49:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:50:06] [INFO ] [Real]Absence check using state equation in 12934 ms returned sat
[2020-06-05 02:50:06] [INFO ] [Real]Added 13 Read/Feed constraints in 34 ms returned sat
[2020-06-05 02:50:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:50:09] [INFO ] [Nat]Absence check using 1100 positive place invariants in 2123 ms returned sat
[2020-06-05 02:50:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:50:21] [INFO ] [Nat]Absence check using state equation in 12099 ms returned sat
[2020-06-05 02:50:21] [INFO ] [Nat]Added 13 Read/Feed constraints in 45 ms returned sat
[2020-06-05 02:50:22] [INFO ] Deduced a trap composed of 5 places in 951 ms
[2020-06-05 02:50:23] [INFO ] Deduced a trap composed of 6 places in 913 ms
[2020-06-05 02:50:24] [INFO ] Deduced a trap composed of 5 places in 688 ms
[2020-06-05 02:50:25] [INFO ] Deduced a trap composed of 5 places in 681 ms
[2020-06-05 02:50:25] [INFO ] Deduced a trap composed of 7 places in 532 ms
[2020-06-05 02:50:26] [INFO ] Deduced a trap composed of 5 places in 574 ms
[2020-06-05 02:50:27] [INFO ] Deduced a trap composed of 6 places in 635 ms
[2020-06-05 02:50:27] [INFO ] Deduced a trap composed of 7 places in 669 ms
[2020-06-05 02:50:28] [INFO ] Deduced a trap composed of 5 places in 954 ms
[2020-06-05 02:50:29] [INFO ] Deduced a trap composed of 5 places in 519 ms
[2020-06-05 02:50:30] [INFO ] Deduced a trap composed of 8 places in 533 ms
[2020-06-05 02:50:30] [INFO ] Deduced a trap composed of 6 places in 531 ms
[2020-06-05 02:50:31] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 9602 ms
[2020-06-05 02:50:31] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 173 ms.
[2020-06-05 02:50:51] [INFO ] Added : 580 causal constraints over 116 iterations in 20170 ms.(timeout) Result :sat
[2020-06-05 02:50:51] [INFO ] Deduced a trap composed of 5 places in 391 ms
[2020-06-05 02:50:51] [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 (> (+ s1081 s1082 s1084 s1085 s1095) 0)") while checking expression at index 1
[2020-06-05 02:50:53] [INFO ] [Real]Absence check using 1100 positive place invariants in 1187 ms returned sat
[2020-06-05 02:50:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:51:08] [INFO ] [Real]Absence check using state equation in 15008 ms returned sat
[2020-06-05 02:51:08] [INFO ] [Real]Added 13 Read/Feed constraints in 53 ms returned sat
[2020-06-05 02:51:14] [INFO ] Deduced a trap composed of 5 places in 6438 ms
[2020-06-05 02:51:18] [INFO ] Deduced a trap composed of 5 places in 3578 ms
[2020-06-05 02:51:34] [INFO ] Deduced a trap composed of 6 places in 15984 ms
[2020-06-05 02:51:35] [INFO ] Deduced a trap composed of 3 places in 820 ms
[2020-06-05 02:51:36] [INFO ] Deduced a trap composed of 5 places in 707 ms
[2020-06-05 02:51:37] [INFO ] Deduced a trap composed of 3 places in 765 ms
[2020-06-05 02:51:37] [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 (> (+ s1741 s1776 s1777) 0)") while checking expression at index 2
[2020-06-05 02:51:41] [INFO ] [Real]Absence check using 1100 positive place invariants in 3121 ms returned sat
[2020-06-05 02:51:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:51:53] [INFO ] [Real]Absence check using state equation in 12807 ms returned sat
[2020-06-05 02:51:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:51:56] [INFO ] [Nat]Absence check using 1100 positive place invariants in 2133 ms returned sat
[2020-06-05 02:51:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:52:09] [INFO ] [Nat]Absence check using state equation in 13285 ms returned sat
[2020-06-05 02:52:09] [INFO ] [Nat]Added 13 Read/Feed constraints in 27 ms returned sat
[2020-06-05 02:52:14] [INFO ] Deduced a trap composed of 5 places in 4508 ms
[2020-06-05 02:52:15] [INFO ] Deduced a trap composed of 6 places in 529 ms
[2020-06-05 02:52:17] [INFO ] Deduced a trap composed of 6 places in 2103 ms
[2020-06-05 02:52:21] [INFO ] Deduced a trap composed of 5 places in 4213 ms
[2020-06-05 02:52:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 11811 ms
[2020-06-05 02:52:21] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 147 ms.
[2020-06-05 02:52:38] [INFO ] Added : 445 causal constraints over 89 iterations in 17153 ms. Result :unknown
[2020-06-05 02:52:40] [INFO ] [Real]Absence check using 1100 positive place invariants in 1181 ms returned sat
[2020-06-05 02:52:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:52:57] [INFO ] [Real]Absence check using state equation in 16857 ms returned sat
[2020-06-05 02:52:57] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:52:59] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1261 ms returned sat
[2020-06-05 02:52:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:53:13] [INFO ] [Nat]Absence check using state equation in 14127 ms returned sat
[2020-06-05 02:53:13] [INFO ] [Nat]Added 13 Read/Feed constraints in 89 ms returned sat
[2020-06-05 02:53:13] [INFO ] Deduced a trap composed of 4 places in 492 ms
[2020-06-05 02:53:14] [INFO ] Deduced a trap composed of 6 places in 568 ms
[2020-06-05 02:53:15] [INFO ] Deduced a trap composed of 6 places in 577 ms
[2020-06-05 02:53:15] [INFO ] Deduced a trap composed of 6 places in 529 ms
[2020-06-05 02:53:16] [INFO ] Deduced a trap composed of 6 places in 547 ms
[2020-06-05 02:53:17] [INFO ] Deduced a trap composed of 6 places in 552 ms
[2020-06-05 02:53:17] [INFO ] Deduced a trap composed of 5 places in 451 ms
[2020-06-05 02:53:18] [INFO ] Deduced a trap composed of 5 places in 466 ms
[2020-06-05 02:53:18] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5108 ms
[2020-06-05 02:53:18] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 152 ms.
[2020-06-05 02:53:38] [INFO ] Added : 575 causal constraints over 115 iterations in 20069 ms.(timeout) Result :sat
[2020-06-05 02:53:38] [INFO ] Deduced a trap composed of 5 places in 402 ms
[2020-06-05 02:53:39] [INFO ] Deduced a trap composed of 5 places in 398 ms
[2020-06-05 02:53:40] [INFO ] Deduced a trap composed of 5 places in 393 ms
[2020-06-05 02:53:40] [INFO ] Deduced a trap composed of 6 places in 389 ms
[2020-06-05 02:53:41] [INFO ] Deduced a trap composed of 6 places in 380 ms
[2020-06-05 02:53:41] [INFO ] Deduced a trap composed of 5 places in 332 ms
[2020-06-05 02:53:42] [INFO ] Deduced a trap composed of 7 places in 371 ms
[2020-06-05 02:53:43] [INFO ] Deduced a trap composed of 7 places in 669 ms
[2020-06-05 02:53:43] [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 (> (+ s2243 s2244 s2245 s2247 s2248 s2257 s2271) 0)") while checking expression at index 4
[2020-06-05 02:53:44] [INFO ] [Real]Absence check using 1100 positive place invariants in 1144 ms returned sat
[2020-06-05 02:53:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:54:04] [INFO ] [Real]Absence check using state equation in 19952 ms returned sat
[2020-06-05 02:54:04] [INFO ] [Real]Added 13 Read/Feed constraints in 53 ms returned sat
[2020-06-05 02:54:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:54:06] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1595 ms returned sat
[2020-06-05 02:54:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:54:30] [INFO ] [Nat]Absence check using state equation in 23836 ms returned sat
[2020-06-05 02:54:30] [INFO ] [Nat]Added 13 Read/Feed constraints in 38 ms returned sat
[2020-06-05 02:54:31] [INFO ] Deduced a trap composed of 6 places in 788 ms
[2020-06-05 02:54:32] [INFO ] Deduced a trap composed of 6 places in 780 ms
[2020-06-05 02:54:33] [INFO ] Deduced a trap composed of 7 places in 570 ms
[2020-06-05 02:54:33] [INFO ] Deduced a trap composed of 5 places in 573 ms
[2020-06-05 02:54:34] [INFO ] Deduced a trap composed of 5 places in 571 ms
[2020-06-05 02:54:35] [INFO ] Deduced a trap composed of 5 places in 565 ms
[2020-06-05 02:54:35] [INFO ] Deduced a trap composed of 7 places in 546 ms
[2020-06-05 02:54:36] [INFO ] Deduced a trap composed of 6 places in 654 ms
[2020-06-05 02:54:40] [INFO ] Deduced a trap composed of 6 places in 4007 ms
[2020-06-05 02:54:41] [INFO ] Deduced a trap composed of 6 places in 469 ms
[2020-06-05 02:54:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 10659 ms
[2020-06-05 02:54:41] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 134 ms.
[2020-06-05 02:54:49] [INFO ] Added : 220 causal constraints over 44 iterations in 8381 ms. Result :unknown
[2020-06-05 02:54:53] [INFO ] [Real]Absence check using 1100 positive place invariants in 3432 ms returned sat
[2020-06-05 02:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:55:05] [INFO ] [Real]Absence check using state equation in 12080 ms returned sat
[2020-06-05 02:55:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:55:08] [INFO ] [Nat]Absence check using 1100 positive place invariants in 2003 ms returned sat
[2020-06-05 02:55:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:55:24] [INFO ] [Nat]Absence check using state equation in 15802 ms returned sat
[2020-06-05 02:55:24] [INFO ] [Nat]Added 13 Read/Feed constraints in 23 ms returned sat
[2020-06-05 02:55:26] [INFO ] Deduced a trap composed of 3 places in 2721 ms
[2020-06-05 02:55:27] [INFO ] Deduced a trap composed of 5 places in 632 ms
[2020-06-05 02:55:28] [INFO ] Deduced a trap composed of 7 places in 598 ms
[2020-06-05 02:55:28] [INFO ] Deduced a trap composed of 5 places in 590 ms
[2020-06-05 02:55:29] [INFO ] Deduced a trap composed of 5 places in 568 ms
[2020-06-05 02:55:30] [INFO ] Deduced a trap composed of 5 places in 616 ms
[2020-06-05 02:55:31] [INFO ] Deduced a trap composed of 8 places in 579 ms
[2020-06-05 02:55:31] [INFO ] Deduced a trap composed of 6 places in 529 ms
[2020-06-05 02:55:32] [INFO ] Deduced a trap composed of 3 places in 527 ms
[2020-06-05 02:55:33] [INFO ] Deduced a trap composed of 5 places in 521 ms
[2020-06-05 02:55:41] [INFO ] Deduced a trap composed of 6 places in 8119 ms
[2020-06-05 02:55:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 17283 ms
[2020-06-05 02:55:41] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 168 ms.
[2020-06-05 02:55:50] [INFO ] Added : 275 causal constraints over 55 iterations in 9495 ms. Result :unknown
[2020-06-05 02:55:53] [INFO ] [Real]Absence check using 1100 positive place invariants in 2156 ms returned sat
[2020-06-05 02:55:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:56:05] [INFO ] [Real]Absence check using state equation in 12251 ms returned sat
[2020-06-05 02:56:05] [INFO ] [Real]Added 13 Read/Feed constraints in 50 ms returned sat
[2020-06-05 02:56:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:56:07] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1284 ms returned sat
[2020-06-05 02:56:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:56:21] [INFO ] [Nat]Absence check using state equation in 13501 ms returned sat
[2020-06-05 02:56:21] [INFO ] [Nat]Added 13 Read/Feed constraints in 51 ms returned sat
[2020-06-05 02:56:21] [INFO ] Deduced a trap composed of 5 places in 649 ms
[2020-06-05 02:56:22] [INFO ] Deduced a trap composed of 7 places in 604 ms
[2020-06-05 02:56:23] [INFO ] Deduced a trap composed of 6 places in 857 ms
[2020-06-05 02:56:24] [INFO ] Deduced a trap composed of 5 places in 527 ms
[2020-06-05 02:56:25] [INFO ] Deduced a trap composed of 6 places in 725 ms
[2020-06-05 02:56:26] [INFO ] Deduced a trap composed of 7 places in 1756 ms
[2020-06-05 02:56:27] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5952 ms
[2020-06-05 02:56:27] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 155 ms.
[2020-06-05 02:56:47] [INFO ] Added : 575 causal constraints over 115 iterations in 20234 ms.(timeout) Result :sat
[2020-06-05 02:56:47] [INFO ] Deduced a trap composed of 6 places in 612 ms
[2020-06-05 02:56:48] [INFO ] Deduced a trap composed of 7 places in 594 ms
[2020-06-05 02:56:49] [INFO ] Deduced a trap composed of 6 places in 583 ms
[2020-06-05 02:56:49] [INFO ] Deduced a trap composed of 6 places in 362 ms
[2020-06-05 02:56:50] [INFO ] Deduced a trap composed of 5 places in 463 ms
[2020-06-05 02:56:51] [INFO ] Deduced a trap composed of 5 places in 463 ms
[2020-06-05 02:56:51] [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 (> (+ s774 s775 s779 s780 s789) 0)") while checking expression at index 7
[2020-06-05 02:56:52] [INFO ] [Real]Absence check using 1100 positive place invariants in 1317 ms returned sat
[2020-06-05 02:56:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:57:12] [INFO ] [Real]Absence check using state equation in 19504 ms returned sat
[2020-06-05 02:57:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:57:15] [INFO ] [Nat]Absence check using 1100 positive place invariants in 2288 ms returned sat
[2020-06-05 02:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 02:57:30] [INFO ] [Nat]Absence check using state equation in 15547 ms returned sat
[2020-06-05 02:57:30] [INFO ] [Nat]Added 13 Read/Feed constraints in 78 ms returned sat
[2020-06-05 02:57:31] [INFO ] Deduced a trap composed of 5 places in 618 ms
[2020-06-05 02:57:33] [INFO ] Deduced a trap composed of 6 places in 1469 ms
[2020-06-05 02:57:33] [INFO ] Deduced a trap composed of 5 places in 559 ms
[2020-06-05 02:57:35] [INFO ] Deduced a trap composed of 5 places in 1460 ms
[2020-06-05 02:57:36] [INFO ] Deduced a trap composed of 7 places in 1019 ms
[2020-06-05 02:57:37] [INFO ] Deduced a trap composed of 5 places in 504 ms
[2020-06-05 02:57:37] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 6434 ms
[2020-06-05 02:57:37] [INFO ] Computed and/alt/rep : 2115/4982/2115 causal constraints in 136 ms.
[2020-06-05 02:57:57] [INFO ] Added : 515 causal constraints over 103 iterations in 20103 ms.(timeout) Result :sat
[2020-06-05 02:58:03] [INFO ] Deduced a trap composed of 2 places in 6166 ms
[2020-06-05 02:58:03] [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 8
Incomplete Parikh walk after 130800 steps, including 1002 resets, run finished after 2290 ms. (steps per millisecond=57 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 131200 steps, including 1002 resets, run finished after 2197 ms. (steps per millisecond=59 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 147100 steps, including 1002 resets, run finished after 2558 ms. (steps per millisecond=57 ) 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 7 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 506 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 13555 ms. (steps per millisecond=73 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 540151 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=108 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 590051 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 556497 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 Best-First random walk after 567472 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 574941 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 585441 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 561501 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 585317 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 547937 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 probabilistic random walk after 786592 steps, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 786592 steps, saw 132881 distinct states, run finished after 30001 ms. (steps per millisecond=26 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2122 rows 2532 cols
[2020-06-05 02:59:39] [INFO ] Computed 1100 place invariants in 7 ms
[2020-06-05 02:59:41] [INFO ] [Real]Absence check using 1100 positive place invariants in 1400 ms returned sat
[2020-06-05 02:59:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 02:59:55] [INFO ] [Real]Absence check using state equation in 14125 ms returned sat
[2020-06-05 02:59:55] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 02:59:59] [INFO ] [Nat]Absence check using 1100 positive place invariants in 3072 ms returned sat
[2020-06-05 02:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:00:13] [INFO ] [Nat]Absence check using state equation in 14205 ms returned sat
[2020-06-05 03:00:13] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-06-05 03:00:13] [INFO ] [Nat]Added 11 Read/Feed constraints in 33 ms returned sat
[2020-06-05 03:00:14] [INFO ] Deduced a trap composed of 6 places in 546 ms
[2020-06-05 03:00:15] [INFO ] Deduced a trap composed of 6 places in 550 ms
[2020-06-05 03:00:15] [INFO ] Deduced a trap composed of 5 places in 526 ms
[2020-06-05 03:00:16] [INFO ] Deduced a trap composed of 5 places in 498 ms
[2020-06-05 03:00:16] [INFO ] Deduced a trap composed of 5 places in 508 ms
[2020-06-05 03:00:17] [INFO ] Deduced a trap composed of 6 places in 710 ms
[2020-06-05 03:00:18] [INFO ] Deduced a trap composed of 6 places in 672 ms
[2020-06-05 03:00:19] [INFO ] Deduced a trap composed of 5 places in 711 ms
[2020-06-05 03:00:20] [INFO ] Deduced a trap composed of 5 places in 660 ms
[2020-06-05 03:00:20] [INFO ] Deduced a trap composed of 5 places in 684 ms
[2020-06-05 03:00:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 7045 ms
[2020-06-05 03:00:21] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 112 ms.
[2020-06-05 03:00:41] [INFO ] Added : 485 causal constraints over 97 iterations in 20130 ms. Result :(error "Failed to check-sat")
[2020-06-05 03:00:44] [INFO ] [Real]Absence check using 1100 positive place invariants in 3100 ms returned sat
[2020-06-05 03:00:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:01:06] [INFO ] [Real]Absence check using state equation in 21535 ms returned sat
[2020-06-05 03:01:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:01:09] [INFO ] [Nat]Absence check using 1100 positive place invariants in 2715 ms returned sat
[2020-06-05 03:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:01:29] [INFO ] [Nat]Absence check using state equation in 20004 ms returned sat
[2020-06-05 03:01:29] [INFO ] [Nat]Added 11 Read/Feed constraints in 32 ms returned sat
[2020-06-05 03:01:30] [INFO ] Deduced a trap composed of 6 places in 658 ms
[2020-06-05 03:01:30] [INFO ] Deduced a trap composed of 6 places in 666 ms
[2020-06-05 03:01:31] [INFO ] Deduced a trap composed of 6 places in 613 ms
[2020-06-05 03:01:32] [INFO ] Deduced a trap composed of 7 places in 533 ms
[2020-06-05 03:01:32] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2948 ms
[2020-06-05 03:01:32] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 158 ms.
[2020-06-05 03:01:51] [INFO ] Added : 565 causal constraints over 113 iterations in 18851 ms. Result :unknown
[2020-06-05 03:01:54] [INFO ] [Real]Absence check using 1100 positive place invariants in 2630 ms returned sat
[2020-06-05 03:01:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:02:13] [INFO ] [Real]Absence check using state equation in 18675 ms returned sat
[2020-06-05 03:02:13] [INFO ] [Real]Added 11 Read/Feed constraints in 69 ms returned sat
[2020-06-05 03:02:25] [INFO ] Deduced a trap composed of 5 places in 12589 ms
[2020-06-05 03:02:27] [INFO ] Deduced a trap composed of 3 places in 1006 ms
[2020-06-05 03:02:28] [INFO ] Deduced a trap composed of 7 places in 997 ms
[2020-06-05 03:02:29] [INFO ] Deduced a trap composed of 6 places in 850 ms
[2020-06-05 03:02:32] [INFO ] Deduced a trap composed of 3 places in 3727 ms
[2020-06-05 03:02:35] [INFO ] Deduced a trap composed of 5 places in 2880 ms
[2020-06-05 03:02:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 22716 ms
[2020-06-05 03:02:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:02:37] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1194 ms returned sat
[2020-06-05 03:02:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:02:48] [INFO ] [Nat]Absence check using state equation in 10813 ms returned sat
[2020-06-05 03:02:48] [INFO ] [Nat]Added 11 Read/Feed constraints in 56 ms returned sat
[2020-06-05 03:02:49] [INFO ] Deduced a trap composed of 6 places in 640 ms
[2020-06-05 03:02:49] [INFO ] Deduced a trap composed of 5 places in 531 ms
[2020-06-05 03:02:50] [INFO ] Deduced a trap composed of 5 places in 564 ms
[2020-06-05 03:02:51] [INFO ] Deduced a trap composed of 7 places in 571 ms
[2020-06-05 03:02:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2766 ms
[2020-06-05 03:02:51] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 110 ms.
[2020-06-05 03:03:11] [INFO ] Added : 510 causal constraints over 102 iterations in 20263 ms.(timeout) Result :sat
[2020-06-05 03:03:13] [INFO ] Deduced a trap composed of 6 places in 1396 ms
[2020-06-05 03:03:14] [INFO ] Deduced a trap composed of 6 places in 1400 ms
[2020-06-05 03:03:16] [INFO ] Deduced a trap composed of 5 places in 1837 ms
[2020-06-05 03:03:19] [INFO ] Deduced a trap composed of 5 places in 3033 ms
[2020-06-05 03:03:20] [INFO ] Deduced a trap composed of 6 places in 735 ms
[2020-06-05 03:03:23] [INFO ] Deduced a trap composed of 6 places in 2760 ms
[2020-06-05 03:03: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 (> (+ s2347 s2348 s2351 s2352 s2353 s2361) 0)") while checking expression at index 2
[2020-06-05 03:03:25] [INFO ] [Real]Absence check using 1100 positive place invariants in 1244 ms returned sat
[2020-06-05 03:03:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:03:38] [INFO ] [Real]Absence check using state equation in 12840 ms returned sat
[2020-06-05 03:03:38] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:03:39] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1177 ms returned sat
[2020-06-05 03:03:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:03:50] [INFO ] [Nat]Absence check using state equation in 11067 ms returned sat
[2020-06-05 03:03:50] [INFO ] [Nat]Added 11 Read/Feed constraints in 19 ms returned sat
[2020-06-05 03:03:51] [INFO ] Deduced a trap composed of 6 places in 809 ms
[2020-06-05 03:03:54] [INFO ] Deduced a trap composed of 5 places in 2603 ms
[2020-06-05 03:03:54] [INFO ] Deduced a trap composed of 6 places in 464 ms
[2020-06-05 03:03:55] [INFO ] Deduced a trap composed of 5 places in 511 ms
[2020-06-05 03:03:56] [INFO ] Deduced a trap composed of 5 places in 482 ms
[2020-06-05 03:03:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5469 ms
[2020-06-05 03:03:56] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 159 ms.
[2020-06-05 03:04:16] [INFO ] Added : 510 causal constraints over 102 iterations in 20245 ms.(timeout) Result :sat
[2020-06-05 03:04:17] [INFO ] Deduced a trap composed of 6 places in 388 ms
[2020-06-05 03:04:17] [INFO ] Deduced a trap composed of 5 places in 386 ms
[2020-06-05 03:04:18] [INFO ] Deduced a trap composed of 5 places in 363 ms
[2020-06-05 03:04:18] [INFO ] Deduced a trap composed of 6 places in 367 ms
[2020-06-05 03:04:24] [INFO ] Deduced a trap composed of 6 places in 5267 ms
[2020-06-05 03:04: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 (> (+ s297 s298 s301 s302 s303 s311) 0)") while checking expression at index 3
[2020-06-05 03:04:28] [INFO ] [Real]Absence check using 1100 positive place invariants in 3466 ms returned sat
[2020-06-05 03:04:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:04:45] [INFO ] [Real]Absence check using state equation in 17008 ms returned sat
[2020-06-05 03:04:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:04:48] [INFO ] [Nat]Absence check using 1100 positive place invariants in 2509 ms returned sat
[2020-06-05 03:04:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:05:01] [INFO ] [Nat]Absence check using state equation in 13391 ms returned sat
[2020-06-05 03:05:01] [INFO ] [Nat]Added 11 Read/Feed constraints in 35 ms returned sat
[2020-06-05 03:05:03] [INFO ] Deduced a trap composed of 6 places in 2307 ms
[2020-06-05 03:05:10] [INFO ] Deduced a trap composed of 6 places in 6363 ms
[2020-06-05 03:05:12] [INFO ] Deduced a trap composed of 5 places in 1620 ms
[2020-06-05 03:05:12] [INFO ] Deduced a trap composed of 8 places in 534 ms
[2020-06-05 03:05:13] [INFO ] Deduced a trap composed of 6 places in 535 ms
[2020-06-05 03:05:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 12001 ms
[2020-06-05 03:05:13] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 147 ms.
[2020-06-05 03:05:30] [INFO ] Added : 525 causal constraints over 105 iterations in 16544 ms. Result :sat
[2020-06-05 03:05:36] [INFO ] Deduced a trap composed of 2 places in 5855 ms
[2020-06-05 03:05:36] [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 4
[2020-06-05 03:05:39] [INFO ] [Real]Absence check using 1100 positive place invariants in 2920 ms returned sat
[2020-06-05 03:05:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:05:58] [INFO ] [Real]Absence check using state equation in 18753 ms returned sat
[2020-06-05 03:05:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:05:59] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1212 ms returned sat
[2020-06-05 03:05:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:06:10] [INFO ] [Nat]Absence check using state equation in 10855 ms returned sat
[2020-06-05 03:06:10] [INFO ] [Nat]Added 11 Read/Feed constraints in 37 ms returned sat
[2020-06-05 03:06:12] [INFO ] Deduced a trap composed of 5 places in 1618 ms
[2020-06-05 03:06:14] [INFO ] Deduced a trap composed of 6 places in 2430 ms
[2020-06-05 03:06:15] [INFO ] Deduced a trap composed of 6 places in 507 ms
[2020-06-05 03:06:24] [INFO ] Deduced a trap composed of 6 places in 8738 ms
[2020-06-05 03:06:25] [INFO ] Deduced a trap composed of 6 places in 741 ms
[2020-06-05 03:06:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 14658 ms
[2020-06-05 03:06:25] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 113 ms.
[2020-06-05 03:06:43] [INFO ] Added : 490 causal constraints over 98 iterations in 17880 ms. Result :unknown
[2020-06-05 03:06:44] [INFO ] [Real]Absence check using 1100 positive place invariants in 1260 ms returned sat
[2020-06-05 03:06:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:06:58] [INFO ] [Real]Absence check using state equation in 13726 ms returned sat
[2020-06-05 03:06:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:07:02] [INFO ] [Nat]Absence check using 1100 positive place invariants in 3148 ms returned sat
[2020-06-05 03:07:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:07:26] [INFO ] [Nat]Absence check using state equation in 24595 ms returned sat
[2020-06-05 03:07:26] [INFO ] [Nat]Added 11 Read/Feed constraints in 61 ms returned sat
[2020-06-05 03:07:27] [INFO ] Deduced a trap composed of 6 places in 755 ms
[2020-06-05 03:07:28] [INFO ] Deduced a trap composed of 4 places in 796 ms
[2020-06-05 03:07:29] [INFO ] Deduced a trap composed of 3 places in 810 ms
[2020-06-05 03:07:30] [INFO ] Deduced a trap composed of 6 places in 840 ms
[2020-06-05 03:07:33] [INFO ] Deduced a trap composed of 6 places in 2624 ms
[2020-06-05 03:07:33] [INFO ] Deduced a trap composed of 5 places in 430 ms
[2020-06-05 03:07:34] [INFO ] Deduced a trap composed of 6 places in 457 ms
[2020-06-05 03:07:34] [INFO ] Deduced a trap composed of 6 places in 509 ms
[2020-06-05 03:07:35] [INFO ] Deduced a trap composed of 5 places in 569 ms
[2020-06-05 03:07:36] [INFO ] Deduced a trap composed of 6 places in 466 ms
[2020-06-05 03:07:36] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 9397 ms
[2020-06-05 03:07:36] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 139 ms.
[2020-06-05 03:07:43] [INFO ] Added : 200 causal constraints over 40 iterations in 7441 ms. Result :(error "Failed to check-sat")
[2020-06-05 03:07:49] [INFO ] [Real]Absence check using 1100 positive place invariants in 5195 ms returned sat
[2020-06-05 03:07:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:08:10] [INFO ] [Real]Absence check using state equation in 21352 ms returned sat
[2020-06-05 03:08:10] [INFO ] [Real]Added 11 Read/Feed constraints in 54 ms returned sat
[2020-06-05 03:08:14] [INFO ] Deduced a trap composed of 6 places in 3103 ms
[2020-06-05 03:08:21] [INFO ] Deduced a trap composed of 5 places in 7354 ms
[2020-06-05 03:08:22] [INFO ] Deduced a trap composed of 5 places in 555 ms
[2020-06-05 03:08:23] [INFO ] Deduced a trap composed of 6 places in 708 ms
[2020-06-05 03:08:23] [INFO ] Deduced a trap composed of 5 places in 681 ms
[2020-06-05 03:08:24] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 13098 ms
[2020-06-05 03:08:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:08:29] [INFO ] [Nat]Absence check using 1100 positive place invariants in 4670 ms returned sat
[2020-06-05 03:08:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:08:45] [INFO ] [Nat]Absence check using state equation in 15944 ms returned sat
[2020-06-05 03:08:45] [INFO ] [Nat]Added 11 Read/Feed constraints in 74 ms returned sat
[2020-06-05 03:08:45] [INFO ] Deduced a trap composed of 6 places in 475 ms
[2020-06-05 03:08:48] [INFO ] Deduced a trap composed of 6 places in 2597 ms
[2020-06-05 03:08:49] [INFO ] Deduced a trap composed of 5 places in 513 ms
[2020-06-05 03:08:49] [INFO ] Deduced a trap composed of 6 places in 484 ms
[2020-06-05 03:08:50] [INFO ] Deduced a trap composed of 6 places in 454 ms
[2020-06-05 03:08:50] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5214 ms
[2020-06-05 03:08:50] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 145 ms.
[2020-06-05 03:09:09] [INFO ] Added : 540 causal constraints over 108 iterations in 18829 ms. Result :(error "Failed to check-sat")
[2020-06-05 03:09:10] [INFO ] [Real]Absence check using 1100 positive place invariants in 1253 ms returned sat
[2020-06-05 03:09:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:09:23] [INFO ] [Real]Absence check using state equation in 12836 ms returned sat
[2020-06-05 03:09:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:09:27] [INFO ] [Nat]Absence check using 1100 positive place invariants in 3208 ms returned sat
[2020-06-05 03:09:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:09:42] [INFO ] [Nat]Absence check using state equation in 15150 ms returned sat
[2020-06-05 03:09:42] [INFO ] [Nat]Added 11 Read/Feed constraints in 28 ms returned sat
[2020-06-05 03:09:43] [INFO ] Deduced a trap composed of 7 places in 863 ms
[2020-06-05 03:09:44] [INFO ] Deduced a trap composed of 5 places in 527 ms
[2020-06-05 03:09:46] [INFO ] Deduced a trap composed of 5 places in 2464 ms
[2020-06-05 03:09:47] [INFO ] Deduced a trap composed of 6 places in 488 ms
[2020-06-05 03:09:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 4939 ms
[2020-06-05 03:09:47] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 153 ms.
[2020-06-05 03:10:07] [INFO ] Added : 530 causal constraints over 106 iterations in 20080 ms.(timeout) Result :sat
[2020-06-05 03:10:08] [INFO ] Deduced a trap composed of 5 places in 377 ms
[2020-06-05 03:10:08] [INFO ] Deduced a trap composed of 6 places in 457 ms
[2020-06-05 03:10:08] [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 (> (+ s441 s442 s447 s448 s449 s456) 0)") while checking expression at index 8
Incomplete Parikh walk after 145100 steps, including 1001 resets, run finished after 2398 ms. (steps per millisecond=60 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 154400 steps, including 1001 resets, run finished after 2343 ms. (steps per millisecond=65 ) 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 83 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 80 ms. Remains 2532 /2532 variables (removed 0) and now considering 2122/2122 (removed 0) transitions.
// Phase 1: matrix 2122 rows 2532 cols
[2020-06-05 03:10:13] [INFO ] Computed 1100 place invariants in 7 ms
[2020-06-05 03:10:30] [INFO ] Implicit Places using invariants in 17095 ms returned []
// Phase 1: matrix 2122 rows 2532 cols
[2020-06-05 03:10:30] [INFO ] Computed 1100 place invariants in 16 ms
[2020-06-05 03:10:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 03:10:45] [INFO ] Implicit Places using invariants and state equation in 14252 ms returned []
Implicit Place search using SMT with State Equation took 31377 ms to find 0 implicit places.
[2020-06-05 03:10:45] [INFO ] Redundant transitions in 136 ms returned []
// Phase 1: matrix 2122 rows 2532 cols
[2020-06-05 03:10:45] [INFO ] Computed 1100 place invariants in 12 ms
[2020-06-05 03:11:20] [INFO ] Performed 1766/2122 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2020-06-05 03:11:26] [INFO ] Dead Transitions using invariants and state equation in 40918 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2532/2532 places, 2122/2122 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 1512 ms. (steps per millisecond=66 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2122 rows 2532 cols
[2020-06-05 03:11:27] [INFO ] Computed 1100 place invariants in 19 ms
[2020-06-05 03:11:30] [INFO ] [Real]Absence check using 1100 positive place invariants in 2599 ms returned sat
[2020-06-05 03:11:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:11:45] [INFO ] [Real]Absence check using state equation in 14737 ms returned sat
[2020-06-05 03:11:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:11:50] [INFO ] [Nat]Absence check using 1100 positive place invariants in 4547 ms returned sat
[2020-06-05 03:11:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:12:05] [INFO ] [Nat]Absence check using state equation in 14648 ms returned sat
[2020-06-05 03:12:05] [INFO ] State equation strengthened by 11 read => feed constraints.
[2020-06-05 03:12:05] [INFO ] [Nat]Added 11 Read/Feed constraints in 60 ms returned sat
[2020-06-05 03:12:06] [INFO ] Deduced a trap composed of 6 places in 1582 ms
[2020-06-05 03:12:06] [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 (> (+ s627 s628 s630 s632 s633 s643) 0)") while checking expression at index 0
[2020-06-05 03:12:11] [INFO ] [Real]Absence check using 1100 positive place invariants in 3915 ms returned sat
[2020-06-05 03:12:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:12:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 03:12:26] [INFO ] [Real]Absence check using state equation in 15802 ms returned (error "Failed to check-sat")
[2020-06-05 03:12:33] [INFO ] [Real]Absence check using 1100 positive place invariants in 6030 ms returned sat
[2020-06-05 03:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:12:46] [INFO ] [Real]Absence check using state equation in 13574 ms returned sat
[2020-06-05 03:12: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 (=> (> t1476 0) (or (> t2 0) (> t485 0) (> t1947 0)))") while checking expression at index 2
[2020-06-05 03:12:49] [INFO ] [Real]Absence check using 1100 positive place invariants in 1936 ms returned sat
[2020-06-05 03:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:13:06] [INFO ] [Real]Absence check using state equation in 16794 ms returned sat
[2020-06-05 03:13:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:13:07] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1146 ms returned sat
[2020-06-05 03:13:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:13:23] [INFO ] [Nat]Absence check using state equation in 15498 ms returned sat
[2020-06-05 03:13:23] [INFO ] [Nat]Added 11 Read/Feed constraints in 20 ms returned sat
[2020-06-05 03:13:26] [INFO ] Deduced a trap composed of 6 places in 3484 ms
[2020-06-05 03:13:26] [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 (> (+ s1129 s1130 s1132 s1134 s1135 s1145) 0)") while checking expression at index 3
[2020-06-05 03:13:29] [INFO ] [Real]Absence check using 1100 positive place invariants in 2375 ms returned sat
[2020-06-05 03:13:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:13:43] [INFO ] [Real]Absence check using state equation in 14027 ms returned sat
[2020-06-05 03:13:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:13:45] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1223 ms returned sat
[2020-06-05 03:13:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:13:57] [INFO ] [Nat]Absence check using state equation in 11604 ms returned sat
[2020-06-05 03:13:57] [INFO ] [Nat]Added 11 Read/Feed constraints in 71 ms returned sat
[2020-06-05 03:13:59] [INFO ] Deduced a trap composed of 6 places in 1824 ms
[2020-06-05 03:13:59] [INFO ] Deduced a trap composed of 6 places in 780 ms
[2020-06-05 03:14:00] [INFO ] Deduced a trap composed of 5 places in 800 ms
[2020-06-05 03:14:01] [INFO ] Deduced a trap composed of 8 places in 767 ms
[2020-06-05 03:14:02] [INFO ] Deduced a trap composed of 6 places in 715 ms
[2020-06-05 03:14:02] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 5547 ms
[2020-06-05 03:14:02] [INFO ] Computed and/alt/rep : 2112/4973/2112 causal constraints in 120 ms.
[2020-06-05 03:14:03] [INFO ] Added : 30 causal constraints over 6 iterations in 1157 ms. Result :(error "Failed to check-sat")
[2020-06-05 03:14:05] [INFO ] [Real]Absence check using 1100 positive place invariants in 1172 ms returned sat
[2020-06-05 03:14:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:14:19] [INFO ] [Real]Absence check using state equation in 14483 ms returned sat
[2020-06-05 03:14:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:14:21] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1245 ms returned sat
[2020-06-05 03:14:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:14:38] [INFO ] [Nat]Absence check using state equation in 16653 ms returned sat
[2020-06-05 03:14:38] [INFO ] [Nat]Added 11 Read/Feed constraints in 22 ms returned sat
[2020-06-05 03:14:38] [INFO ] Deduced a trap composed of 5 places in 459 ms
[2020-06-05 03:14:40] [INFO ] Deduced a trap composed of 6 places in 1199 ms
[2020-06-05 03:14:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s729 s730 s733 s734 s735 s745) 0)") while checking expression at index 5
[2020-06-05 03:14:43] [INFO ] [Real]Absence check using 1100 positive place invariants in 2937 ms returned sat
[2020-06-05 03:14:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:15:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 03:15:00] [INFO ] [Real]Absence check using state equation in 16565 ms returned (error "Failed to check-sat")
[2020-06-05 03:15:01] [INFO ] [Real]Absence check using 1100 positive place invariants in 1092 ms returned sat
[2020-06-05 03:15:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:15:13] [INFO ] [Real]Absence check using state equation in 11911 ms returned sat
[2020-06-05 03:15:13] [INFO ] [Real]Added 11 Read/Feed constraints in 53 ms returned sat
[2020-06-05 03:15:14] [INFO ] Deduced a trap composed of 6 places in 662 ms
[2020-06-05 03:15:15] [INFO ] Deduced a trap composed of 5 places in 542 ms
[2020-06-05 03:15:15] [INFO ] Deduced a trap composed of 5 places in 533 ms
[2020-06-05 03:15:16] [INFO ] Deduced a trap composed of 6 places in 470 ms
[2020-06-05 03:15:16] [INFO ] Deduced a trap composed of 5 places in 477 ms
[2020-06-05 03:15:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3296 ms
[2020-06-05 03:15:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:15:18] [INFO ] [Nat]Absence check using 1100 positive place invariants in 1235 ms returned sat
[2020-06-05 03:15:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:15:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 03:15:37] [INFO ] [Nat]Absence check using state equation in 18336 ms returned (error "Failed to check-sat")
[2020-06-05 03:15:40] [INFO ] [Real]Absence check using 1100 positive place invariants in 2804 ms returned sat
[2020-06-05 03:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:15:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 03:15:57] [INFO ] [Real]Absence check using state equation in 16681 ms returned (error "Failed to check-sat")
Discarding 2 places :
Also discarding 0 output transitions
Graph (complete) has 6503 edges and 2532 vertex of which 2530 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 2530 transition count 2122
Deduced a syphon composed of 2 places in 8 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 7 place count 2528 transition count 2120
Partial Free-agglomeration rule applied 565 times.
Drop transitions removed 565 transitions
Iterating global reduction 0 with 565 rules applied. Total rules applied 572 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 668 place count 2528 transition count 2120
Applied a total of 668 rules in 467 ms. Remains 2528 /2532 variables (removed 4) and now considering 2120/2122 (removed 2) transitions.
// Phase 1: matrix 2120 rows 2528 cols
[2020-06-05 03:15:57] [INFO ] Computed 1098 place invariants in 10 ms
[2020-06-05 03:16:00] [INFO ] [Real]Absence check using 1098 positive place invariants in 1896 ms returned sat
[2020-06-05 03:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:16:17] [INFO ] [Real]Absence check using state equation in 17522 ms returned sat
[2020-06-05 03:16:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:16:21] [INFO ] [Nat]Absence check using 1098 positive place invariants in 3178 ms returned sat
[2020-06-05 03:16:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:16:52] [INFO ] [Nat]Absence check using state equation in 31245 ms returned sat
[2020-06-05 03:16:53] [INFO ] State equation strengthened by 549 read => feed constraints.
[2020-06-05 03:16:53] [INFO ] [Nat]Added 549 Read/Feed constraints in 152 ms returned sat
[2020-06-05 03:16:53] [INFO ] Deduced a trap composed of 14 places in 69 ms
[2020-06-05 03:16:53] [INFO ] Deduced a trap composed of 3 places in 37 ms
[2020-06-05 03:16:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2020-06-05 03:16:53] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 170 ms.
[2020-06-05 03:17:02] [INFO ] Added : 245 causal constraints over 49 iterations in 9258 ms. Result :unknown
[2020-06-05 03:17:07] [INFO ] [Real]Absence check using 1098 positive place invariants in 3937 ms returned sat
[2020-06-05 03:17:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:17:34] [INFO ] [Real]Absence check using state equation in 26867 ms returned sat
[2020-06-05 03:17:34] [INFO ] [Real]Added 549 Read/Feed constraints in 195 ms returned sat
[2020-06-05 03:17:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:17:40] [INFO ] [Nat]Absence check using 1098 positive place invariants in 5155 ms returned sat
[2020-06-05 03:17:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:17:56] [INFO ] [Nat]Absence check using state equation in 16125 ms returned sat
[2020-06-05 03:17:56] [INFO ] [Nat]Added 549 Read/Feed constraints in 186 ms returned sat
[2020-06-05 03:17:56] [INFO ] Deduced a trap composed of 12 places in 43 ms
[2020-06-05 03:17:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 300 ms
[2020-06-05 03:17:57] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 179 ms.
[2020-06-05 03:18:17] [INFO ] Added : 485 causal constraints over 97 iterations in 20095 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 69 ms.
[2020-06-05 03:18:20] [INFO ] [Real]Absence check using 1098 positive place invariants in 2048 ms returned sat
[2020-06-05 03:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:18:34] [INFO ] [Real]Absence check using state equation in 14543 ms returned sat
[2020-06-05 03:18:34] [INFO ] [Real]Added 549 Read/Feed constraints in 160 ms returned sat
[2020-06-05 03:18:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:18:36] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1247 ms returned sat
[2020-06-05 03:18:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:18:46] [INFO ] [Nat]Absence check using state equation in 10150 ms returned sat
[2020-06-05 03:18:46] [INFO ] [Nat]Added 549 Read/Feed constraints in 113 ms returned sat
[2020-06-05 03:18:47] [INFO ] Deduced a trap composed of 3 places in 62 ms
[2020-06-05 03:18:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 269 ms
[2020-06-05 03:18:47] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 155 ms.
[2020-06-05 03:19:07] [INFO ] Added : 555 causal constraints over 111 iterations in 20212 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 85 ms.
[2020-06-05 03:19:10] [INFO ] [Real]Absence check using 1098 positive place invariants in 2427 ms returned sat
[2020-06-05 03:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:19:28] [INFO ] [Real]Absence check using state equation in 17509 ms returned sat
[2020-06-05 03:19:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:19:30] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1818 ms returned sat
[2020-06-05 03:19:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:19:50] [INFO ] [Nat]Absence check using state equation in 20408 ms returned sat
[2020-06-05 03:19:51] [INFO ] [Nat]Added 549 Read/Feed constraints in 117 ms returned sat
[2020-06-05 03:19:51] [INFO ] Deduced a trap composed of 12 places in 26 ms
[2020-06-05 03:19:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2020-06-05 03:19:51] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 186 ms.
[2020-06-05 03:20:11] [INFO ] Added : 610 causal constraints over 122 iterations in 20233 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 110 ms.
[2020-06-05 03:20:18] [INFO ] [Real]Absence check using 1098 positive place invariants in 6636 ms returned sat
[2020-06-05 03:20:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:20:35] [INFO ] [Real]Absence check using state equation in 16965 ms returned sat
[2020-06-05 03:20:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:20:39] [INFO ] [Nat]Absence check using 1098 positive place invariants in 2733 ms returned sat
[2020-06-05 03:20:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:20:58] [INFO ] [Nat]Absence check using state equation in 19455 ms returned sat
[2020-06-05 03:20:58] [INFO ] [Nat]Added 549 Read/Feed constraints in 185 ms returned sat
[2020-06-05 03:20:58] [INFO ] Deduced a trap composed of 3 places in 65 ms
[2020-06-05 03:20:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 341 ms
[2020-06-05 03:20:59] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 156 ms.
[2020-06-05 03:21:19] [INFO ] Added : 500 causal constraints over 100 iterations in 20237 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 98 ms.
[2020-06-05 03:21:26] [INFO ] [Real]Absence check using 1098 positive place invariants in 6085 ms returned sat
[2020-06-05 03:21:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:21:42] [INFO ] [Real]Absence check using state equation in 16472 ms returned sat
[2020-06-05 03:21:43] [INFO ] [Real]Added 549 Read/Feed constraints in 165 ms returned sat
[2020-06-05 03:21:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:21:45] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1831 ms returned sat
[2020-06-05 03:21:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:22:02] [INFO ] [Nat]Absence check using state equation in 17395 ms returned sat
[2020-06-05 03:22:03] [INFO ] [Nat]Added 549 Read/Feed constraints in 182 ms returned sat
[2020-06-05 03:22:03] [INFO ] Deduced a trap composed of 3 places in 55 ms
[2020-06-05 03:22:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 317 ms
[2020-06-05 03:22:03] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 128 ms.
[2020-06-05 03:22:23] [INFO ] Added : 590 causal constraints over 118 iterations in 20124 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 118 ms.
[2020-06-05 03:22:25] [INFO ] [Real]Absence check using 1098 positive place invariants in 1162 ms returned sat
[2020-06-05 03:22:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:22:36] [INFO ] [Real]Absence check using state equation in 11110 ms returned sat
[2020-06-05 03:22:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:22:38] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1717 ms returned sat
[2020-06-05 03:22:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:22:53] [INFO ] [Nat]Absence check using state equation in 15217 ms returned sat
[2020-06-05 03:22:53] [INFO ] [Nat]Added 549 Read/Feed constraints in 124 ms returned sat
[2020-06-05 03:22:54] [INFO ] Deduced a trap composed of 7 places in 98 ms
[2020-06-05 03:22:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2020-06-05 03:22:54] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 176 ms.
[2020-06-05 03:23:14] [INFO ] Added : 555 causal constraints over 111 iterations in 20215 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 83 ms.
[2020-06-05 03:23:17] [INFO ] [Real]Absence check using 1098 positive place invariants in 1868 ms returned sat
[2020-06-05 03:23:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:23:28] [INFO ] [Real]Absence check using state equation in 11775 ms returned sat
[2020-06-05 03:23:29] [INFO ] [Real]Added 549 Read/Feed constraints in 163 ms returned sat
[2020-06-05 03:23:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:23:30] [INFO ] [Nat]Absence check using 1098 positive place invariants in 1157 ms returned sat
[2020-06-05 03:23:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:23:42] [INFO ] [Nat]Absence check using state equation in 11571 ms returned sat
[2020-06-05 03:23:42] [INFO ] [Nat]Added 549 Read/Feed constraints in 93 ms returned sat
[2020-06-05 03:23:42] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-06-05 03:23:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2020-06-05 03:23:42] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 160 ms.
[2020-06-05 03:24:02] [INFO ] Added : 655 causal constraints over 131 iterations in 20176 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 141 ms.
[2020-06-05 03:24:05] [INFO ] [Real]Absence check using 1098 positive place invariants in 2070 ms returned sat
[2020-06-05 03:24:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 03:24:19] [INFO ] [Real]Absence check using state equation in 13471 ms returned sat
[2020-06-05 03:24:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 03:24:25] [INFO ] [Nat]Absence check using 1098 positive place invariants in 5246 ms returned sat
[2020-06-05 03:24:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 03:24:38] [INFO ] [Nat]Absence check using state equation in 13358 ms returned sat
[2020-06-05 03:24:38] [INFO ] [Nat]Added 549 Read/Feed constraints in 169 ms returned sat
[2020-06-05 03:24:38] [INFO ] Deduced a trap composed of 6 places in 44 ms
[2020-06-05 03:24:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 335 ms
[2020-06-05 03:24:39] [INFO ] Computed and/alt/rep : 2112/7045/2112 causal constraints in 156 ms.
[2020-06-05 03:24:59] [INFO ] Added : 485 causal constraints over 97 iterations in 20073 ms.(timeout) Result :sat
[2020-06-05 03:24:59] [INFO ] Deduced a trap composed of 3 places in 35 ms
[2020-06-05 03:24:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
Attempting to minimize the solution found.
Minimization took 81 ms.
[2020-06-05 03:24:59] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2020-06-05 03:24:59] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
[2020-06-05 03:25:00] [INFO ] Flatten gal took : 483 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ ShieldPPPt-PT-100B @ 3570 seconds

FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPt-PT-100B-ReachabilityCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3542
rslt: Output for ReachabilityCardinality @ ShieldPPPt-PT-100B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 03:25:00 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 393
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p708))))",
"processed_size": 21,
"rewrites": 1
},
"result":
{
"edges": 160,
"markings": 161,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 442
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p592))))",
"processed_size": 21,
"rewrites": 1
},
"result":
{
"edges": 171,
"markings": 172,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 506
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G (((p501 <= 0))))",
"processed_size": 21,
"rewrites": 2
},
"result":
{
"edges": 175,
"markings": 176,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 590
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((((p518 <= 0)) OR ((1 <= p742)))))",
"processed_size": 41,
"rewrites": 2
},
"result":
{
"edges": 180,
"markings": 181,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 2,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 708
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 3,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p6)) OR (((1 <= p1673)) AND ((p331 <= 0))))))",
"processed_size": 60,
"rewrites": 1
},
"result":
{
"edges": 201,
"markings": 202,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 885
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G ((((p540 <= 0)) OR ((1 <= p1776)) OR (p477 <= 0))))",
"processed_size": 58,
"rewrites": 2
},
"result":
{
"edges": 181,
"markings": 182,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 3,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1180
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 3,
"adisj": 7,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "E (F ((((1 <= p2186)) AND ((p1848 <= 0)) AND ((((1 <= p20)) AND ((p1347 <= 0))) OR (((1 <= p106)) AND ((p70 <= 0)))))))",
"processed_size": 120,
"rewrites": 1
},
"result":
{
"edges": 361,
"markings": 145,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 8,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1771
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 5,
"adisj": 3,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G ((((p2074 <= 0)) OR ((1 <= p235)) OR ((p810 <= 0)) OR ((1 <= p2081)) OR (((1 <= p190)) AND ((p620 <= 0))))))",
"processed_size": 117,
"rewrites": 2
},
"result":
{
"edges": 309,
"markings": 306,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 10,
"problems": 2
},
"type": "invariance",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3542
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 10,
"adisj": 4,
"aneg": 0,
"comp": 9,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A (G ((((p397 <= 0)) OR ((1 <= p1926)) OR ((((p1448 <= 0)) OR ((1 <= p1818))) AND (((p30 <= 0)) OR ((1 <= p2139)))) OR ((1 <= p695) AND (((p230 <= 0)) OR ((1 <= p133)))))))",
"processed_size": 178,
"rewrites": 2
},
"result":
{
"edges": 195,
"markings": 196,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 22,
"problems": 4
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 52312,
"runtime": 28.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**)) : E(F(**)) : E(F(**)) : A(G(**)) : A(G(**))"
},
"net":
{
"arcs": 9273,
"conflict_clusters": 844,
"places": 2532,
"places_significant": 1432,
"singleton_clusters": 0,
"transitions": 2122
},
"result":
{
"preliminary_value": "no yes yes no no yes no no no ",
"value": "no yes yes no no yes no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 4654/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 81024
lola: finding significant places
lola: 2532 places, 2122 transitions, 1432 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p1926 <= 1)
lola: LP says that atomic proposition is always true: (p1818 <= 1)
lola: LP says that atomic proposition is always true: (p2139 <= 1)
lola: LP says that atomic proposition is always true: (p695 <= 1)
lola: LP says that atomic proposition is always true: (p133 <= 1)
lola: LP says that atomic proposition is always true: (p6 <= 1)
lola: LP says that atomic proposition is always true: (p331 <= 1)
lola: LP says that atomic proposition is always true: (p708 <= 1)
lola: LP says that atomic proposition is always true: (p742 <= 1)
lola: LP says that atomic proposition is always true: (p1776 <= 1)
lola: LP says that atomic proposition is always true: (p477 <= 1)
lola: LP says that atomic proposition is always true: (p592 <= 1)
lola: LP says that atomic proposition is always true: (p1848 <= 1)
lola: LP says that atomic proposition is always true: (p1347 <= 1)
lola: LP says that atomic proposition is always true: (p70 <= 1)
lola: LP says that atomic proposition is always true: (p501 <= 1)
lola: LP says that atomic proposition is always true: (p235 <= 1)
lola: LP says that atomic proposition is always true: (p2081 <= 1)
lola: LP says that atomic proposition is always true: (p620 <= 1)
lola: A (G ((((p397 <= 0)) OR ((1 <= p1926)) OR ((((p1448 <= 0)) OR ((1 <= p1818))) AND (((p30 <= 0)) OR ((1 <= p2139)))) OR ((1 <= p695) AND (((p230 <= 0)) OR ((1 <= p133))))))) : E (F ((((1 <= p6)) OR (((1 <= p1673)) AND ((p331 <= 0)))))) : E (F (((1 <= p708)))) : A (G ((((p518 <= 0)) OR ((1 <= p742))))) : A (G ((((p540 <= 0)) OR ((1 <= p1776)) OR (p477 <= 0)))) : E (F (((1 <= p592)))) : E (F ((((1 <= p2186)) AND ((p1848 <= 0)) AND ((((1 <= p20)) AND ((p1347 <= 0))) OR (((1 <= p106)) AND ((p70 <= 0))))))) : A (G (((p501 <= 0)))) : A (G ((((p2074 <= 0)) OR ((1 <= p235)) OR ((p810 <= 0)) OR ((1 <= p2081)) OR (((1 <= p190)) AND ((p620 <= 0))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p708))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p708))))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p708))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 161 markings, 160 edges
lola: subprocess 1 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p592))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p592))))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p592))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 172 markings, 171 edges
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 506 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p501 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p501 <= 0))))
lola: processed formula length: 21
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p501))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 176 markings, 175 edges
lola: ========================================
lola: subprocess 3 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p518 <= 0)) OR ((1 <= p742)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p518 <= 0)) OR ((1 <= p742)))))
lola: processed formula length: 41
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p518)) AND ((p742 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 181 markings, 180 edges
lola: ========================================
lola: subprocess 4 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p6)) OR (((1 <= p1673)) AND ((p331 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p6)) OR (((1 <= p1673)) AND ((p331 <= 0))))))
lola: processed formula length: 60
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p6)) OR (((1 <= p1673)) AND ((p331 <= 0))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 202 markings, 201 edges
lola: ========================================
lola: subprocess 5 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p540 <= 0)) OR ((1 <= p1776)) OR (p477 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p540 <= 0)) OR ((1 <= p1776)) OR (p477 <= 0))))
lola: processed formula length: 58
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p540)) AND ((p1776 <= 0)) AND (1 <= p477))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 182 markings, 181 edges
lola: ========================================
lola: subprocess 6 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p2186)) AND ((p1848 <= 0)) AND ((((1 <= p20)) AND ((p1347 <= 0))) OR (((1 <= p106)) AND ((p70 <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F ((((1 <= p2186)) AND ((p1848 <= 0)) AND ((((1 <= p20)) AND ((p1347 <= 0))) OR (((1 <= p106)) AND ((p70 <= 0)))))))
lola: processed formula length: 120
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p2186)) AND ((p1848 <= 0)) AND ((((1 <= p20)) AND ((p1347 <= 0))) OR (((1 <= p106)) AND ((p70 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 145 markings, 361 edges
lola: ========================================
lola: subprocess 7 will run for 1771 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p2074 <= 0)) OR ((1 <= p235)) OR ((p810 <= 0)) OR ((1 <= p2081)) OR (((1 <= p190)) AND ((p620 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p2074 <= 0)) OR ((1 <= p235)) OR ((p810 <= 0)) OR ((1 <= p2081)) OR (((1 <= p190)) AND ((p620 <= 0))))))
lola: processed formula length: 117
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p2074)) AND ((p235 <= 0)) AND ((1 <= p810)) AND ((p2081 <= 0)) AND (((p190 <= 0)) OR ((1 <= p620))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 306 markings, 309 edges
lola: subprocess 8 will run for 3542 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p397 <= 0)) OR ((1 <= p1926)) OR ((((p1448 <= 0)) OR ((1 <= p1818))) AND (((p30 <= 0)) OR ((1 <= p2139)))) OR ((1 <= p695) AND (((p230 <= 0)) OR ((1 <= p133)))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((((p397 <= 0)) OR ((1 <= p1926)) OR ((((p1448 <= 0)) OR ((1 <= p1818))) AND (((p30 <= 0)) OR ((1 <= p2139)))) OR ((1 <= p695) AND (((p230 <= 0)) OR ((1 <= p133)))))))
lola: processed formula length: 178
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: ========================================
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p397)) AND ((p1926 <= 0)) AND ((((1 <= p1448)) AND ((p1818 <= 0))) OR (((1 <= p30)) AND ((p2139 <= 0)))) AND ((p695 <= 0) OR (((1 <= p230)) AND ((p133 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 22 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 196 markings, 195 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no no no
lola:
preliminary result: no yes yes no no yes no no no
lola: memory consumption: 52312 KB
lola: time consumption: 28 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

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="itslola"
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 itslola"
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 r211-tajo-159033477900742"
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 ;