fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r106-smll-152658636700124
Last Updated
June 26, 2018

About the Execution of M4M.full for HypercubeGrid-PT-C5K3P3B15

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7719.600 1067402.00 2058378.00 2201.50 TTTFTTTFFFFFFTTF normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 14M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is HypercubeGrid-PT-C5K3P3B15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-smll-152658636700124
=====================================================================


--------------------
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 HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-00
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-01
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-02
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-03
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-04
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-05
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-06
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-07
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-08
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-09
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1526767263170


BK_STOP 1526768330572

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using HypercubeGrid-PT-C5K3P3B15 as instance name.
Using HypercubeGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 296488, 'Memory': 4764.4, 'Tool': 'lola'}, {'Time': 304787, 'Memory': 4915.59, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola HypercubeGrid-PT-C5K3P3B15...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
HypercubeGrid-PT-C5K3P3B15: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
HypercubeGrid-PT-C5K3P3B15: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ HypercubeGrid-PT-C5K3P3B15 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 34263/65536 symbol table entries, 18076 collisions
lola: preprocessing...
lola: finding significant places
lola: 9153 places, 25110 transitions, 5669 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 28593 transition conflict sets
lola: TASK
lola: reading formula from HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality.task
lola: A (G (((pi_d2_n1_2_4_3_3_1 <= pil_d5_n1_1_1_2_3_2) OR (po_d4_n1_3_3_1_2_1 <= pb_d2_n2_1_3_3_1_2) OR (pol_d4_n1_2_1_2_1_1 <= 1) OR (pil_d3_n1_2_1_1_3_1 + 1 <= pol_d1_n1_4_2_3_3_3)))) : E (F ((pol_d3_n1_3_2_1_3_2 + 1 <= pi_d3_n1_1_3_3_1_3))) : E (F (((pol_d1_n1_3_2_3_1_1 <= 1) AND (pb_d3_n2_3_1_2_3_3 <= 0) AND (pil_d4_n1_2_1_2_2_2 <= pi_d2_n1_1_2_2_1_3)))) : A (G ((1 <= pb_d4_n2_2_2_1_2_2))) : E (F (((1 <= po_d1_n1_4_1_1_3_3) AND (pb_d5_n1_2_3_1_1_1 <= pb_d2_n1_1_3_2_2_1) AND (pi_d4_n1_3_3_3_4_2 + 1 <= pb_d2_n2_1_3_3_3_3) AND ((3 <= pb_d2_n2_2_2_1_2_1) OR (pi_d5_n1_3_2_3_2_2 <= pol_d2_n1_3_4_2_1_2)) AND (pol_d2_n1_2_4_2_1_3 + 1 <= pil_d4_n1_3_1_3_2_1)))) : A (G (((pol_d2_n1_2_1_3_2_1 <= 2) OR (pi_d2_n1_2_4_2_2_3 <= 1) OR (3 <= po_d1_n1_2_2_1_2_3)))) : E (F ((((pol_d5_n1_1_1_1_3_3 <= pol_d5_n1_2_1_1_3_3) AND (pb_d4_n1_2_3_1_1_2 <= pol_d2_n1_2_4_3_3_2) AND ((2 <= pol_d5_n1_2_2_1_2_3) OR (po_d2_n1_3_3_1_1_1 <= po_d1_n1_4_2_2_1_2))) OR (2 <= po_d4_n1_2_1_3_1_1)))) : A (G (((3 <= po_d1_n1_2_1_3_2_2) OR (1 <= po_d4_n1_2_1_1_1_3) OR (1 <= pb_d5_n1_3_3_1_1_2) OR (po_d1_n1_1_1_3_1_3 <= pb_d2_n2_2_3_1_1_3) OR (pil_d4_n1_3_1_3_1_2 <= pol_d2_n1_3_4_1_3_1)))) : E (F (((2 <= pb_d4_n2_1_2_1_1_2) AND (3 <= pil_d1_n1_3_2_3_2_3) AND (1 <= pi_d5_n1_2_3_2_1_4)))) : A (G (((po_d3_n1_1_2_4_3_2 <= pol_d5_n1_1_1_1_3_4) OR ((2 <= po_d4_n1_3_2_3_4_2) AND (1 <= pil_d5_n1_3_1_3_3_1)) OR (2 <= po_d1_n1_3_2_2_2_2)))) : A (G (((po_d5_n1_3_3_3_1_1 <= pil_d1_n1_2_2_3_3_3) OR (pb_d5_n2_1_3_3_1_3 <= pb_d3_n2_3_2_3_1_1) OR (3 <= pbl_3_3_2_3_1) OR ((pil_d5_n1_1_2_1_3_4 + 1 <= pi_d4_n1_1_2_3_1_2) AND ((pi_d5_n1_1_2_1_3_2 <= pi_d3_n1_1_3_4_2_3) OR (2 <= pil_d2_n1_2_4_3_3_1)))))) : A (G (((pol_d4_n1_3_3_3_2_1 <= pb_d3_n1_2_3_2_3_3) OR (pil_d2_n1_2_3_2_1_3 <= pol_d1_n1_3_3_3_3_2)))) : E (F (((3 <= pol_d3_n1_2_2_4_3_2) AND (pil_d2_n1_2_4_3_3_1 <= pb_d4_n1_1_2_3_1_1) AND (pil_d1_n1_1_3_1_2_1 + 1 <= pol_d2_n1_2_3_1_1_3) AND ((po_d2_n1_2_1_3_3_2 + 1 <= pil_d3_n1_3_3_2_1_3) OR (pb_d1_n1_3_1_1_3_3 <= 0))))) : E (F (((3 <= pi_d1_n1_2_3_2_3_2) OR (2 <= po_d4_n1_3_2_2_4_2) OR (3 <= po_d2_n1_3_2_3_2_2) OR ((pb_d2_n2_2_1_3_2_2 <= pil_d3_n1_2_1_3_2_2) AND ((1 <= pb_d1_n2_1_2_3_3_3) OR (po_d2_n1_1_3_3_2_1 <= pb_d2_n2_2_1_3_3_2)))))) : E (F ((pil_d2_n1_2_2_1_2_1 + 1 <= po_d5_n1_3_2_1_3_1))) : A (G (((pb_d5_n1_2_1_1_2_1 + 1 <= po_d1_n1_1_3_2_1_3) OR (pil_d1_n1_1_1_3_2_3 + 1 <= pil_d3_n1_2_1_4_3_1) OR (pol_d2_n1_3_1_1_3_2 <= pol_d1_n1_1_3_1_3_3) OR (po_d5_n1_1_1_2_1_2 <= pil_d2_n1_1_1_3_1_3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pi_d2_n1_2_4_3_3_1 <= pil_d5_n1_1_1_2_3_2) OR (po_d4_n1_3_3_1_2_1 <= pb_d2_n2_1_3_3_1_2) OR (pol_d4_n1_2_1_2_1_1 <= 1) OR (pil_d3_n1_2_1_1_3_1 + 1 <= pol_d1_n1_4_2_3_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 41793 markings, 42139 edges, 8359 markings/sec, 0 secs
lola: sara is running 5 secs || 70344 markings, 70724 edges, 5710 markings/sec, 5 secs
lola: sara is running 10 secs || 90336 markings, 90717 edges, 3998 markings/sec, 10 secs
lola: sara is running 15 secs || 107844 markings, 108311 edges, 3502 markings/sec, 15 secs
lola: sara is running 20 secs || 122570 markings, 123159 edges, 2945 markings/sec, 20 secs
lola: sara is running 25 secs || 136996 markings, 137592 edges, 2885 markings/sec, 25 secs
lola: sara is running 30 secs || 151386 markings, 152043 edges, 2878 markings/sec, 30 secs
lola: sara is running 35 secs || 165232 markings, 166648 edges, 2769 markings/sec, 35 secs
lola: sara is running 40 secs || 178886 markings, 180342 edges, 2731 markings/sec, 40 secs
lola: sara is running 45 secs || 192245 markings, 193762 edges, 2672 markings/sec, 45 secs
lola: sara is running 50 secs || 205374 markings, 206969 edges, 2626 markings/sec, 50 secs
lola: sara is running 55 secs || 218499 markings, 220220 edges, 2625 markings/sec, 55 secs
lola: sara is running 60 secs || 231698 markings, 233552 edges, 2640 markings/sec, 60 secs
lola: sara is running 65 secs || 245141 markings, 247124 edges, 2689 markings/sec, 65 secs
lola: sara is running 70 secs || 258464 markings, 260534 edges, 2665 markings/sec, 70 secs
lola: sara is running 75 secs || 271782 markings, 273938 edges, 2664 markings/sec, 75 secs
lola: sara is running 80 secs || 285098 markings, 287352 edges, 2663 markings/sec, 80 secs
lola: sara is running 85 secs || 298519 markings, 300958 edges, 2684 markings/sec, 85 secs
lola: sara is running 90 secs || 312245 markings, 314880 edges, 2745 markings/sec, 90 secs
lola: sara is running 95 secs || 325387 markings, 328193 edges, 2628 markings/sec, 95 secs
lola: sara is running 100 secs || 338549 markings, 341887 edges, 2632 markings/sec, 100 secs
lola: sara is running 105 secs || 351771 markings, 355219 edges, 2644 markings/sec, 105 secs
lola: sara is running 110 secs || 363472 markings, 367128 edges, 2340 markings/sec, 110 secs
lola: sara is running 115 secs || 376080 markings, 379836 edges, 2522 markings/sec, 115 secs
lola: sara is running 120 secs || 387042 markings, 391319 edges, 2192 markings/sec, 120 secs
lola: sara is running 125 secs || 397670 markings, 403133 edges, 2126 markings/sec, 125 secs
lola: sara is running 130 secs || 408694 markings, 414347 edges, 2205 markings/sec, 130 secs
lola: sara is running 135 secs || 419949 markings, 425759 edges, 2251 markings/sec, 135 secs
lola: sara is running 140 secs || 431283 markings, 437230 edges, 2267 markings/sec, 140 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 145 secs || 442529 markings, 448728 edges, 2249 markings/sec, 145 secs
lola: sara is running 150 secs || 453458 markings, 459897 edges, 2186 markings/sec, 150 secs

lola: sara is running 155 secs || 464227 markings, 470895 edges, 2154 markings/sec, 155 secs
lola: sara is running 160 secs || 474789 markings, 482021 edges, 2112 markings/sec, 160 secs
lola: sara is running 165 secs || 485692 markings, 492987 edges, 2181 markings/sec, 165 secs
lola: sara is running 170 secs || 495421 markings, 502797 edges, 1946 markings/sec, 170 secs
lola: sara is running 175 secs || 505486 markings, 512929 edges, 2013 markings/sec, 175 secs
lola: sara is running 180 secs || 514167 markings, 521828 edges, 1736 markings/sec, 180 secs
lola: sara is running 185 secs || 523066 markings, 531097 edges, 1780 markings/sec, 185 secs
lola: sara is running 190 secs || 531974 markings, 540123 edges, 1782 markings/sec, 190 secs
lola: sara is running 195 secs || 540802 markings, 549297 edges, 1766 markings/sec, 195 secs
lola: sara is running 200 secs || 549829 markings, 558374 edges, 1805 markings/sec, 200 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pol_d3_n1_3_2_1_3_2 + 1 <= pi_d3_n1_1_3_3_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pol_d1_n1_3_2_3_1_1 <= 1) AND (pb_d3_n2_3_1_2_3_3 <= 0) AND (pil_d4_n1_2_1_2_2_2 <= pi_d2_n1_1_2_2_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 3 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pb_d4_n2_2_2_1_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= po_d1_n1_4_1_1_3_3) AND (pb_d5_n1_2_3_1_1_1 <= pb_d2_n1_1_3_2_2_1) AND (pi_d4_n1_3_3_3_4_2 + 1 <= pb_d2_n2_1_3_3_3_3) AND ((3 <= pb_d2_n2_2_2_1_2_1) OR (pi_d5_n1_3_2_3_2_2 <= pol_d2_n1_3_4_2_1_2)) AND (pol_d2_n1_2_4_2_1_3 + 1 <= pil_d4_n1_3_1_3_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 5 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pol_d2_n1_2_1_3_2_1 <= 2) OR (pi_d2_n1_2_4_2_2_3 <= 1) OR (3 <= po_d1_n1_2_2_1_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 52439 markings, 53562 edges, 10488 markings/sec, 0 secs
lola: sara is running 5 secs || 81775 markings, 83078 edges, 5867 markings/sec, 5 secs
lola: sara is running 10 secs || 105659 markings, 107204 edges, 4777 markings/sec, 10 secs
lola: sara is running 15 secs || 125405 markings, 127295 edges, 3949 markings/sec, 15 secs
lola: sara is running 20 secs || 144565 markings, 146579 edges, 3832 markings/sec, 20 secs
lola: sara is running 25 secs || 162194 markings, 164499 edges, 3526 markings/sec, 25 secs
lola: sara is running 30 secs || 179681 markings, 182238 edges, 3497 markings/sec, 30 secs
lola: sara is running 35 secs || 195540 markings, 198264 edges, 3172 markings/sec, 35 secs
lola: sara is running 40 secs || 210393 markings, 214330 edges, 2971 markings/sec, 40 secs
lola: sara is running 45 secs || 225097 markings, 229730 edges, 2941 markings/sec, 45 secs
lola: sara is running 50 secs || 239818 markings, 244670 edges, 2944 markings/sec, 50 secs
lola: sara is running 55 secs || 254670 markings, 259661 edges, 2970 markings/sec, 55 secs
lola: sara is running 60 secs || 269579 markings, 274749 edges, 2982 markings/sec, 60 secs
lola: sara is running 65 secs || 284200 markings, 289451 edges, 2924 markings/sec, 65 secs
lola: sara is running 70 secs || 298496 markings, 304320 edges, 2859 markings/sec, 70 secs
lola: sara is running 75 secs || 312751 markings, 319060 edges, 2851 markings/sec, 75 secs
lola: sara is running 80 secs || 327053 markings, 334267 edges, 2860 markings/sec, 80 secs
lola: sara is running 85 secs || 341235 markings, 349177 edges, 2836 markings/sec, 85 secs
lola: sara is running 90 secs || 355671 markings, 364352 edges, 2887 markings/sec, 90 secs
lola: sara is running 95 secs || 370154 markings, 379608 edges, 2897 markings/sec, 95 secs
lola: sara is running 100 secs || 384696 markings, 394747 edges, 2908 markings/sec, 100 secs
lola: sara is running 105 secs || 399357 markings, 410057 edges, 2932 markings/sec, 105 secs
lola: sara is running 110 secs || 413604 markings, 424849 edges, 2849 markings/sec, 110 secs
lola: sara is running 115 secs || 427787 markings, 439565 edges, 2837 markings/sec, 115 secs
lola: sara is running 120 secs || 441896 markings, 454206 edges, 2822 markings/sec, 120 secs
lola: sara is running 125 secs || 455721 markings, 468556 edges, 2765 markings/sec, 125 secs
lola: sara is running 130 secs || 470579 markings, 483995 edges, 2972 markings/sec, 130 secs
lola: sara is running 135 secs || 485558 markings, 499609 edges, 2996 markings/sec, 135 secs
lola: sara is running 140 secs || 500532 markings, 515218 edges, 2995 markings/sec, 140 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 145 secs || 515447 markings, 530733 edges, 2983 markings/sec, 145 secs
lola: sara is running 150 secs || 530174 markings, 546012 edges, 2945 markings/sec, 150 secs
lola: sara is running 155 secs || 544917 markings, 561275 edges, 2949 markings/sec, 155 secs

lola: sara is running 160 secs || 559360 markings, 576222 edges, 2889 markings/sec, 160 secs
lola: sara is running 165 secs || 573813 markings, 591157 edges, 2891 markings/sec, 165 secs
lola: sara is running 170 secs || 588300 markings, 606112 edges, 2897 markings/sec, 170 secs
lola: sara is running 175 secs || 602838 markings, 621104 edges, 2908 markings/sec, 175 secs
lola: sara is running 180 secs || 617177 markings, 635882 edges, 2868 markings/sec, 180 secs
lola: sara is running 185 secs || 631692 markings, 650984 edges, 2903 markings/sec, 185 secs
lola: sara is running 190 secs || 646348 markings, 666345 edges, 2931 markings/sec, 190 secs
lola: sara is running 195 secs || 660854 markings, 681525 edges, 2901 markings/sec, 195 secs
lola: sara is running 200 secs || 675327 markings, 696655 edges, 2895 markings/sec, 200 secs
lola: sara is running 205 secs || 689889 markings, 711874 edges, 2912 markings/sec, 205 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((pol_d5_n1_1_1_1_3_3 <= pol_d5_n1_2_1_1_3_3) AND (pb_d4_n1_2_3_1_1_2 <= pol_d2_n1_2_4_3_3_2) AND ((2 <= pol_d5_n1_2_2_1_2_3) OR (po_d2_n1_3_3_1_1_1 <= po_d1_n1_4_2_2_1_2))) OR (2 <= po_d4_n1_2_1_3_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 7 will run for 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= po_d1_n1_2_1_3_2_2) OR (1 <= po_d4_n1_2_1_1_1_3) OR (1 <= pb_d5_n1_3_3_1_1_2) OR (po_d1_n1_1_1_3_1_3 <= pb_d2_n2_2_3_1_1_3) OR (pil_d4_n1_3_1_3_1_2 <= pol_d2_n1_3_4_1_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
lola: subprocess 8 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pb_d4_n2_1_2_1_1_2) AND (3 <= pil_d1_n1_3_2_3_2_3) AND (1 <= pi_d5_n1_2_3_2_1_4))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 60403 markings, 60865 edges, 12081 markings/sec, 0 secs
lola: sara is running 5 secs || 93214 markings, 94262 edges, 6562 markings/sec, 5 secs
lola: sara is running 10 secs || 119685 markings, 121021 edges, 5294 markings/sec, 10 secs
lola: sara is running 15 secs || 141661 markings, 143044 edges, 4395 markings/sec, 15 secs
lola: sara is running 20 secs || 162135 markings, 163781 edges, 4095 markings/sec, 20 secs
lola: sara is running 25 secs || 183363 markings, 185278 edges, 4246 markings/sec, 25 secs
lola: sara is running 30 secs || 204985 markings, 207172 edges, 4324 markings/sec, 30 secs
lola: sara is running 35 secs || 228097 markings, 230450 edges, 4622 markings/sec, 35 secs
lola: sara is running 40 secs || 252236 markings, 254589 edges, 4828 markings/sec, 40 secs
lola: sara is running 45 secs || 276381 markings, 278734 edges, 4829 markings/sec, 45 secs
lola: sara is running 50 secs || 300380 markings, 302733 edges, 4800 markings/sec, 50 secs
lola: sara is running 55 secs || 324666 markings, 327040 edges, 4857 markings/sec, 55 secs
lola: sara is running 60 secs || 348841 markings, 351215 edges, 4835 markings/sec, 60 secs
lola: sara is running 65 secs || 372691 markings, 375065 edges, 4770 markings/sec, 65 secs
lola: sara is running 70 secs || 396684 markings, 399097 edges, 4799 markings/sec, 70 secs
lola: sara is running 75 secs || 420529 markings, 422946 edges, 4769 markings/sec, 75 secs
lola: sara is running 80 secs || 444416 markings, 446973 edges, 4777 markings/sec, 80 secs
lola: sara is running 85 secs || 468338 markings, 473302 edges, 4784 markings/sec, 85 secs
lola: sara is running 90 secs || 492127 markings, 500826 edges, 4758 markings/sec, 90 secs
lola: sara is running 95 secs || 515836 markings, 530089 edges, 4742 markings/sec, 95 secs
lola: sara is running 100 secs || 539604 markings, 558137 edges, 4754 markings/sec, 100 secs
lola: sara is running 105 secs || 563357 markings, 587069 edges, 4751 markings/sec, 105 secs
lola: sara is running 110 secs || 587048 markings, 616266 edges, 4738 markings/sec, 110 secs
lola: sara is running 115 secs || 610713 markings, 645636 edges, 4733 markings/sec, 115 secs
lola: sara is running 120 secs || 634349 markings, 675168 edges, 4727 markings/sec, 120 secs
lola: sara is running 125 secs || 657921 markings, 705666 edges, 4714 markings/sec, 125 secs
lola: sara is running 130 secs || 681639 markings, 736057 edges, 4744 markings/sec, 130 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 135 secs || 705145 markings, 766571 edges, 4701 markings/sec, 135 secs
lola: sara is running 140 secs || 728511 markings, 799970 edges, 4673 markings/sec, 140 secs
lola: sara is running 145 secs || 751891 markings, 832658 edges, 4676 markings/sec, 145 secs

lola: sara is running 150 secs || 775531 markings, 860630 edges, 4728 markings/sec, 150 secs
lola: sara is running 155 secs || 799085 markings, 890600 edges, 4711 markings/sec, 155 secs
lola: sara is running 160 secs || 822759 markings, 918989 edges, 4735 markings/sec, 160 secs
lola: sara is running 165 secs || 846351 markings, 948939 edges, 4718 markings/sec, 165 secs
lola: sara is running 170 secs || 869678 markings, 979852 edges, 4665 markings/sec, 170 secs
lola: sara is running 175 secs || 893220 markings, 1008580 edges, 4708 markings/sec, 175 secs
lola: sara is running 180 secs || 916356 markings, 1039024 edges, 4627 markings/sec, 180 secs
lola: sara is running 185 secs || 939340 markings, 1071533 edges, 4597 markings/sec, 185 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((po_d3_n1_1_2_4_3_2 <= pol_d5_n1_1_1_1_3_4) OR ((2 <= po_d4_n1_3_2_3_4_2) AND (1 <= pil_d5_n1_3_1_3_3_1)) OR (2 <= po_d1_n1_3_2_2_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 45954 markings, 46460 edges, 9191 markings/sec, 0 secs
lola: sara is running 5 secs || 78367 markings, 79126 edges, 6483 markings/sec, 5 secs
lola: sara is running 10 secs || 109971 markings, 111123 edges, 6321 markings/sec, 10 secs
lola: sara is running 15 secs || 141162 markings, 142713 edges, 6238 markings/sec, 15 secs
lola: sara is running 20 secs || 174264 markings, 175873 edges, 6620 markings/sec, 20 secs
lola: sara is running 25 secs || 207951 markings, 209560 edges, 6737 markings/sec, 25 secs
lola: sara is running 30 secs || 241882 markings, 243492 edges, 6786 markings/sec, 30 secs
lola: sara is running 35 secs || 275593 markings, 277224 edges, 6742 markings/sec, 35 secs
lola: sara is running 40 secs || 308795 markings, 310479 edges, 6640 markings/sec, 40 secs
lola: sara is running 45 secs || 341588 markings, 343304 edges, 6559 markings/sec, 45 secs
lola: sara is running 50 secs || 373811 markings, 375556 edges, 6445 markings/sec, 50 secs
lola: sara is running 55 secs || 406208 markings, 407953 edges, 6479 markings/sec, 55 secs
lola: sara is running 60 secs || 438192 markings, 439961 edges, 6397 markings/sec, 60 secs
lola: sara is running 65 secs || 470079 markings, 471863 edges, 6377 markings/sec, 65 secs
lola: sara is running 70 secs || 501878 markings, 503684 edges, 6360 markings/sec, 70 secs
lola: sara is running 75 secs || 533598 markings, 535496 edges, 6344 markings/sec, 75 secs
lola: sara is running 80 secs || 565793 markings, 567713 edges, 6439 markings/sec, 80 secs
lola: sara is running 85 secs || 597822 markings, 599753 edges, 6406 markings/sec, 85 secs
lola: sara is running 90 secs || 629231 markings, 631292 edges, 6282 markings/sec, 90 secs
lola: sara is running 95 secs || 660524 markings, 662585 edges, 6259 markings/sec, 95 secs
lola: sara is running 100 secs || 691786 markings, 693854 edges, 6252 markings/sec, 100 secs
lola: sara is running 105 secs || 723071 markings, 725178 edges, 6257 markings/sec, 105 secs
lola: sara is running 110 secs || 754732 markings, 757038 edges, 6332 markings/sec, 110 secs
lola: sara is running 115 secs || 786741 markings, 789223 edges, 6402 markings/sec, 115 secs
lola: sara is running 120 secs || 818684 markings, 821202 edges, 6389 markings/sec, 120 secs
lola: sara is running 125 secs || 850857 markings, 853413 edges, 6435 markings/sec, 125 secs
lola: sara is running 130 secs || 882777 markings, 885368 edges, 6384 markings/sec, 130 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 135 secs || 913856 markings, 916483 edges, 6216 markings/sec, 135 secs
lola: sara is running 140 secs || 944618 markings, 947266 edges, 6152 markings/sec, 140 secs
lola: sara is running 145 secs || 975421 markings, 978069 edges, 6161 markings/sec, 145 secs
lola: sara is running 150 secs || 1006414 markings, 1009104 edges, 6199 markings/sec, 150 secs
lola: sara is running 155 secs || 1037535 markings, 1040284 edges, 6224 markings/sec, 155 secs
lola: sara is running 160 secs || 1067654 markings, 1070403 edges, 6024 markings/sec, 160 secs
lola: sara is running 165 secs || 1097638 markings, 1100387 edges, 5997 markings/sec, 165 secs
lola: sara is running 170 secs || 1127739 markings, 1130533 edges, 6020 markings/sec, 170 secs
lola: sara is running 175 secs || 1157604 markings, 1160469 edges, 5973 markings/sec, 175 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 456 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((po_d5_n1_3_3_3_1_1 <= pil_d1_n1_2_2_3_3_3) OR (pb_d5_n2_1_3_3_1_3 <= pb_d3_n2_3_2_3_1_1) OR (3 <= pbl_3_3_2_3_1) OR ((pil_d5_n1_1_2_1_3_4 + 1 <= pi_d4_n1_1_2_3_1_2) AND ((pi_d5_n1_1_2_1_3_2 <= pi_d3_n1_1_3_4_2_3) OR (2 <= pil_d2_n1_2_4_3_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 11 will run for 548 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pol_d4_n1_3_3_3_2_1 <= pb_d3_n1_2_3_2_3_3) OR (pil_d2_n1_2_3_2_1_3 <= pol_d1_n1_3_3_3_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 12 will run for 685 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pol_d3_n1_2_2_4_3_2) AND (pil_d2_n1_2_4_3_3_1 <= pb_d4_n1_1_2_3_1_1) AND (pil_d1_n1_1_3_1_2_1 + 1 <= pol_d2_n1_2_3_1_1_3) AND ((po_d2_n1_2_1_3_3_2 + 1 <= pil_d3_n1_3_3_2_1_3) OR (pb_d1_n1_3_1_1_3_3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 47017 markings, 48150 edges, 9403 markings/sec, 0 secs
lola: sara is running 5 secs || 103038 markings, 104900 edges, 11204 markings/sec, 5 secs
lola: sara is running 10 secs || 138895 markings, 141790 edges, 7171 markings/sec, 10 secs
lola: sara is running 15 secs || 170707 markings, 173899 edges, 6362 markings/sec, 15 secs
lola: sara is running 20 secs || 191471 markings, 194844 edges, 4153 markings/sec, 20 secs
lola: sara is running 25 secs || 211027 markings, 214495 edges, 3911 markings/sec, 25 secs
lola: sara is running 30 secs || 230718 markings, 235039 edges, 3938 markings/sec, 30 secs
lola: sara is running 35 secs || 250287 markings, 255110 edges, 3914 markings/sec, 35 secs
lola: sara is running 40 secs || 267602 markings, 272463 edges, 3463 markings/sec, 40 secs
lola: sara is running 45 secs || 282612 markings, 287880 edges, 3002 markings/sec, 45 secs
lola: sara is running 50 secs || 296014 markings, 301323 edges, 2680 markings/sec, 50 secs
lola: sara is running 55 secs || 307776 markings, 313138 edges, 2352 markings/sec, 55 secs
lola: sara is running 60 secs || 319386 markings, 325061 edges, 2322 markings/sec, 60 secs
lola: sara is running 65 secs || 329974 markings, 335693 edges, 2118 markings/sec, 65 secs
lola: sara is running 70 secs || 340404 markings, 346188 edges, 2086 markings/sec, 70 secs
lola: sara is running 75 secs || 350340 markings, 356481 edges, 1987 markings/sec, 75 secs
lola: sara is running 80 secs || 359891 markings, 366213 edges, 1910 markings/sec, 80 secs
lola: sara is running 85 secs || 370125 markings, 376671 edges, 2047 markings/sec, 85 secs
lola: sara is running 90 secs || 379984 markings, 387157 edges, 1972 markings/sec, 90 secs
lola: sara is running 95 secs || 389691 markings, 397485 edges, 1941 markings/sec, 95 secs
lola: sara is running 100 secs || 399491 markings, 407551 edges, 1960 markings/sec, 100 secs
lola: sara is running 105 secs || 409331 markings, 417478 edges, 1968 markings/sec, 105 secs
lola: sara is running 110 secs || 419237 markings, 427490 edges, 1981 markings/sec, 110 secs
lola: sara is running 115 secs || 429271 markings, 437695 edges, 2007 markings/sec, 115 secs
lola: sara is running 120 secs || 439378 markings, 448016 edges, 2021 markings/sec, 120 secs
lola: sara is running 125 secs || 448988 markings, 457861 edges, 1922 markings/sec, 125 secs
lola: sara is running 130 secs || 458551 markings, 467547 edges, 1913 markings/sec, 130 secs
lola: sara is running 135 secs || 468297 markings, 477305 edges, 1949 markings/sec, 135 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 140 secs || 477965 markings, 487019 edges, 1934 markings/sec, 140 secs
lola: sara is running 145 secs || 486552 markings, 495694 edges, 1717 markings/sec, 145 secs
lola: sara is running 150 secs || 494888 markings, 504144 edges, 1667 markings/sec, 150 secs
lola: sara is running 155 secs || 503997 markings, 513377 edges, 1822 markings/sec, 155 secs
lola: sara is running 160 secs || 513019 markings, 522514 edges, 1804 markings/sec, 160 secs

lola: sara is running 165 secs || 521960 markings, 531581 edges, 1788 markings/sec, 165 secs
lola: sara is running 170 secs || 531033 markings, 540847 edges, 1815 markings/sec, 170 secs
lola: sara is running 175 secs || 540088 markings, 550131 edges, 1811 markings/sec, 175 secs
lola: sara is running 180 secs || 548771 markings, 559041 edges, 1737 markings/sec, 180 secs
lola: sara is running 185 secs || 557617 markings, 568106 edges, 1769 markings/sec, 185 secs
lola: sara is running 190 secs || 565937 markings, 576502 edges, 1664 markings/sec, 190 secs
lola: sara is running 195 secs || 574062 markings, 584651 edges, 1625 markings/sec, 195 secs
lola: sara is running 200 secs || 582343 markings, 592932 edges, 1656 markings/sec, 200 secs
lola: sara is running 205 secs || 590309 markings, 600927 edges, 1593 markings/sec, 205 secs
lola: sara is running 210 secs || 598214 markings, 608938 edges, 1581 markings/sec, 210 secs
lola: sara is running 215 secs || 606245 markings, 617167 edges, 1606 markings/sec, 215 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 839 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pi_d1_n1_2_3_2_3_2) OR (2 <= po_d4_n1_3_2_2_4_2) OR (3 <= po_d2_n1_3_2_3_2_2) OR ((pb_d2_n2_2_1_3_2_2 <= pil_d3_n1_2_1_3_2_2) AND ((1 <= pb_d1_n2_1_2_3_3_3) OR (po_d2_n1_1_3_3_2_1 <= pb_d2_n2_2_1_3_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 7 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================
lola: subprocess 14 will run for 1258 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pil_d2_n1_2_2_1_2_1 + 1 <= po_d5_n1_3_2_1_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 15 will run for 2517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pb_d5_n1_2_1_1_2_1 + 1 <= po_d1_n1_1_3_2_1_3) OR (pil_d1_n1_1_1_3_2_3 + 1 <= pil_d3_n1_2_1_4_3_1) OR (pol_d2_n1_3_1_1_3_2 <= pol_d1_n1_1_3_1_3_3) OR (po_d5_n1_1_1_2_1_2 <= pil_d2_n1_1_1_3_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 22676 bytes per marking, with 0 unused bits
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: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes yes no no no no no no yes yes no
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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="HypercubeGrid-PT-C5K3P3B15"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-full"
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

tar xzf /home/mcc/BenchKit/INPUTS/HypercubeGrid-PT-C5K3P3B15.tgz
mv HypercubeGrid-PT-C5K3P3B15 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is HypercubeGrid-PT-C5K3P3B15, 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 r106-smll-152658636700124"
echo "====================================================================="
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
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 ;