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 5.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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 3.0K 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.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 356 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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 irma4mcc-full
Input is HypertorusGrid-PT-d5k3p2b10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-152658633000166
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526720732543


BK_STOP 1526721739829

--------------------
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 HypertorusGrid-PT-d5k3p2b10 as instance name.
Using HypertorusGrid 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': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 249083, 'Memory': 11640.8, 'Tool': 'lola'}, {'Time': 251039, 'Memory': 11615.18, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola HypertorusGrid-PT-d5k3p2b10...

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


checking for too many tokens
===========================================================================================
HypertorusGrid-PT-d5k3p2b10: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ HypertorusGrid-PT-d5k3p2b10 @ 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: 31833/65536 symbol table entries, 17230 collisions
lola: preprocessing...
lola: finding significant places
lola: 7533 places, 24300 transitions, 4859 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 26973 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: E (F (((pb_d2_n2_2_3_2_1_1 <= 1) OR (pb_d5_n2_1_3_1_1_1 + 1 <= pol_d2_n1_3_3_3_3_3) OR (3 <= pb_d2_n1_1_1_2_1_1)))) : A (G (((pil_d2_n1_3_2_2_3_1 + 1 <= pb_d5_n1_3_1_3_1_2) OR (pb_d4_n1_1_2_1_1_1 <= pbl_3_3_3_1_2)))) : E (F (((pil_d2_n1_2_3_1_1_2 <= pil_d1_n1_3_1_3_3_3) AND ((pbl_1_2_3_1_2 + 1 <= pb_d2_n2_3_3_1_3_2) OR (pb_d2_n1_3_2_2_3_1 + 1 <= pol_d4_n1_2_2_3_1_2))))) : E (F ((((pol_d2_n1_2_1_1_2_2 <= pol_d2_n1_2_2_2_3_1) AND (pb_d4_n1_1_3_1_1_3 <= pi_d2_n1_3_1_2_3_3) AND ((pb_d1_n2_3_1_3_2_1 <= pb_d1_n1_3_2_3_2_3) OR (pol_d4_n1_2_1_3_3_1 <= pbl_2_3_3_2_1))) OR (((pol_d2_n1_3_3_1_3_1 <= po_d3_n1_2_2_2_3_3) OR (2 <= pb_d1_n2_2_1_1_3_3)) AND (pbl_1_2_2_2_2 <= 1))))) : A (G (((pi_d3_n1_2_3_1_1_2 <= pb_d1_n1_3_3_1_3_1) OR (2 <= po_d1_n1_1_1_3_2_3) OR ((1 <= pol_d3_n1_1_1_3_1_1) AND (1 <= po_d4_n1_1_2_2_3_1) AND (pb_d4_n1_1_1_1_2_3 <= 0))))) : E (F (((1 <= pi_d4_n1_2_1_3_2_3) AND (3 <= po_d1_n1_2_3_1_1_3)))) : E (F ((2 <= pol_d1_n1_3_3_1_1_1))) : A (G ((((pi_d4_n1_3_3_3_1_2 <= pb_d1_n2_2_2_1_2_2) OR (2 <= po_d4_n1_3_3_2_1_3) OR ((pol_d1_n1_1_1_1_1_1 <= pb_d4_n2_1_1_1_3_1) AND (pi_d1_n1_3_3_2_1_1 <= pil_d2_n1_1_3_1_2_3))) AND ((3 <= pol_d1_n1_2_3_1_3_3) OR (po_d1_n1_3_2_3_3_1 <= pb_d4_n2_3_1_3_2_3) OR ((pb_d5_n2_2_2_2_3_1 <= pil_d3_n1_2_3_3_2_3) AND (pb_d1_n2_2_1_1_1_3 <= pb_d2_n2_3_2_1_2_1)))))) : A (G (((pil_d4_n1_3_3_2_3_1 <= 1) OR ((pb_d2_n1_2_1_2_2_3 + 1 <= pil_d3_n1_1_2_3_3_3) AND (po_d1_n1_3_1_1_1_2 <= 2))))) : A (G ((((3 <= pb_d2_n2_3_1_1_2_1) AND (pi_d5_n1_2_2_3_3_1 <= po_d5_n1_3_3_1_2_3)) OR ((3 <= pil_d1_n1_1_3_3_3_1) AND (pol_d3_n1_2_3_3_1_3 <= pi_d3_n1_3_1_2_3_1)) OR (pil_d5_n1_1_1_3_2_2 <= pb_d2_n2_1_3_1_3_1)))) : A (G ((((pol_d3_n1_3_1_1_1_3 <= pi_d2_n1_3_2_3_2_2) AND (3 <= pil_d5_n1_1_3_3_1_2)) OR (pi_d2_n1_3_3_1_2_3 <= po_d5_n1_1_3_2_3_3) OR (((2 <= pil_d1_n1_2_2_3_3_2) OR (pol_d3_n1_1_1_3_2_2 <= pb_d2_n2_3_2_1_2_2)) AND (pb_d1_n1_1_3_2_1_1 + 1 <= pb_d2_n2_1_2_2_1_3))))) : A (G (((((2 <= pb_d1_n1_2_1_1_1_3) OR (1 <= pil_d1_n1_3_3_1_2_1)) AND (pbl_3_1_3_2_1 <= 0)) OR (((2 <= pb_d5_n2_1_3_2_2_1) OR (1 <= po_d5_n1_1_2_2_2_1)) AND ((pil_d5_n1_2_3_2_2_1 <= pol_d3_n1_3_2_2_2_2) OR (pb_d3_n2_2_2_3_3_2 <= pb_d4_n2_3_2_2_2_1)))))) : E (F (((po_d1_n1_1_3_1_3_3 <= 1) AND (pb_d3_n1_1_1_2_1_1 + 1 <= pb_d2_n2_1_1_3_3_1) AND ((3 <= pol_d3_n1_3_1_1_2_1) OR (pb_d1_n1_1_1_3_2_2 <= pol_d4_n1_3_1_1_1_2))))) : E (F (((3 <= pb_d5_n1_1_3_3_2_2) AND (po_d3_n1_2_1_3_1_3 <= pi_d5_n1_1_1_1_2_3) AND (pil_d3_n1_3_2_1_1_2 <= 0) AND (pol_d3_n1_1_3_2_1_2 <= pb_d4_n2_2_3_2_1_1) AND (po_d5_n1_2_1_1_3_1 <= 1)))) : E (F (((po_d3_n1_3_2_3_1_3 <= pb_d2_n1_2_2_2_2_2) AND (1 <= po_d5_n1_3_3_3_2_2) AND (1 <= pol_d2_n1_2_1_1_1_3) AND (2 <= pil_d3_n1_1_2_3_3_2) AND ((3 <= pbl_2_1_1_3_1) OR (3 <= pol_d2_n1_1_3_2_3_1))))) : A (G (((pb_d5_n1_3_1_2_3_1 <= po_d1_n1_3_3_3_1_3) OR (pol_d2_n1_3_2_3_3_3 <= po_d4_n1_1_2_2_2_3) OR (pi_d2_n1_2_2_2_2_2 <= 2) OR (pil_d3_n1_1_2_1_1_3 <= pol_d1_n1_3_1_2_3_2) OR (po_d3_n1_1_3_1_3_1 <= pi_d4_n1_2_1_2_3_1) OR ((2 <= pi_d4_n1_3_3_1_1_2) AND (3 <= pb_d3_n1_2_3_3_2_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: E (F (((pb_d2_n2_2_3_2_1_1 <= 1) OR (pb_d5_n2_1_3_1_1_1 + 1 <= pol_d2_n1_3_3_3_3_3) OR (3 <= pb_d2_n1_1_1_2_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 19436 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 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pil_d2_n1_3_2_2_3_1 + 1 <= pb_d5_n1_3_1_3_1_2) OR (pb_d4_n1_1_2_1_1_1 <= pbl_3_3_3_1_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 19436 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pil_d2_n1_2_3_1_1_2 <= pil_d1_n1_3_1_3_3_3) AND ((pbl_1_2_3_1_2 + 1 <= pb_d2_n2_3_3_1_3_2) OR (pb_d2_n1_3_2_2_3_1 + 1 <= pol_d4_n1_2_2_3_1_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 19436 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 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((pol_d2_n1_2_1_1_2_2 <= pol_d2_n1_2_2_2_3_1) AND (pb_d4_n1_1_3_1_1_3 <= pi_d2_n1_3_1_2_3_3) AND ((pb_d1_n2_3_1_3_2_1 <= pb_d1_n1_3_2_3_2_3) OR (pol_d4_n1_2_1_3_3_1 <= pbl_2_3_3_2_1))) OR (((pol_d2_n1_3_3_1_3_1 <= po_d3_n1_2_2_2_3_3) OR (2 <= pb_d1_n2_2_1_1_3_3)) AND (pbl_1_2_2_2_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 19436 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 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pi_d3_n1_2_3_1_1_2 <= pb_d1_n1_3_3_1_3_1) OR (2 <= po_d1_n1_1_1_3_2_3) OR ((1 <= pol_d3_n1_1_1_3_1_1) AND (1 <= po_d4_n1_1_2_2_3_1) AND (pb_d4_n1_1_1_1_2_3 <= 0)))))
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 19436 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 3 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= pi_d4_n1_2_1_3_2_3) AND (3 <= po_d1_n1_2_3_1_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 19436 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 35386 markings, 35710 edges, 7077 markings/sec, 0 secs
lola: sara is running 5 secs || 56967 markings, 57440 edges, 4316 markings/sec, 5 secs
lola: sara is running 10 secs || 77022 markings, 77791 edges, 4011 markings/sec, 10 secs
lola: sara is running 15 secs || 94464 markings, 95313 edges, 3488 markings/sec, 15 secs
lola: sara is running 20 secs || 110510 markings, 111847 edges, 3209 markings/sec, 20 secs
lola: sara is running 25 secs || 124715 markings, 126200 edges, 2841 markings/sec, 25 secs
lola: sara is running 30 secs || 139179 markings, 140980 edges, 2893 markings/sec, 30 secs
lola: sara is running 35 secs || 151728 markings, 153552 edges, 2510 markings/sec, 35 secs
lola: sara is running 40 secs || 163055 markings, 164909 edges, 2265 markings/sec, 40 secs
lola: sara is running 45 secs || 174235 markings, 176107 edges, 2236 markings/sec, 45 secs
lola: sara is running 50 secs || 184397 markings, 186624 edges, 2032 markings/sec, 50 secs
lola: sara is running 55 secs || 194488 markings, 197219 edges, 2018 markings/sec, 55 secs
lola: sara is running 60 secs || 204100 markings, 206913 edges, 1922 markings/sec, 60 secs
lola: sara is running 65 secs || 213502 markings, 216864 edges, 1880 markings/sec, 65 secs
lola: sara is running 70 secs || 222840 markings, 227279 edges, 1868 markings/sec, 70 secs
lola: sara is running 75 secs || 232050 markings, 237077 edges, 1842 markings/sec, 75 secs
lola: sara is running 80 secs || 241241 markings, 246393 edges, 1838 markings/sec, 80 secs
lola: sara is running 85 secs || 249691 markings, 254843 edges, 1690 markings/sec, 85 secs
lola: sara is running 90 secs || 257902 markings, 263124 edges, 1642 markings/sec, 90 secs
lola: sara is running 95 secs || 265944 markings, 271211 edges, 1608 markings/sec, 95 secs
lola: sara is running 100 secs || 273802 markings, 279071 edges, 1572 markings/sec, 100 secs
lola: sara is running 105 secs || 281107 markings, 286460 edges, 1461 markings/sec, 105 secs
lola: sara is running 110 secs || 288428 markings, 293799 edges, 1464 markings/sec, 110 secs
lola: sara is running 115 secs || 295893 markings, 301306 edges, 1493 markings/sec, 115 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 120 secs || 302993 markings, 308442 edges, 1420 markings/sec, 120 secs
lola: sara is running 125 secs || 309904 markings, 315379 edges, 1382 markings/sec, 125 secs

lola: sara is running 130 secs || 316761 markings, 322261 edges, 1371 markings/sec, 130 secs
lola: sara is running 135 secs || 323635 markings, 329135 edges, 1375 markings/sec, 135 secs
lola: sara is running 140 secs || 330305 markings, 336093 edges, 1334 markings/sec, 140 secs
lola: sara is running 145 secs || 337052 markings, 342879 edges, 1349 markings/sec, 145 secs
lola: sara is running 150 secs || 343713 markings, 349587 edges, 1332 markings/sec, 150 secs
lola: sara is running 155 secs || 350321 markings, 356217 edges, 1322 markings/sec, 155 secs
lola: sara is running 160 secs || 356719 markings, 362672 edges, 1280 markings/sec, 160 secs
lola: sara is running 165 secs || 363174 markings, 369252 edges, 1291 markings/sec, 165 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= pol_d1_n1_3_3_1_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 19436 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 23989 markings, 25852 edges, 4798 markings/sec, 0 secs
lola: sara is running 5 secs || 43966 markings, 47297 edges, 3995 markings/sec, 5 secs
lola: sara is running 10 secs || 62958 markings, 67684 edges, 3798 markings/sec, 10 secs
lola: sara is running 15 secs || 81463 markings, 87544 edges, 3701 markings/sec, 15 secs
lola: sara is running 20 secs || 99083 markings, 106446 edges, 3524 markings/sec, 20 secs
lola: sara is running 25 secs || 116652 markings, 125265 edges, 3514 markings/sec, 25 secs
lola: sara is running 30 secs || 133522 markings, 143339 edges, 3374 markings/sec, 30 secs
lola: sara is running 35 secs || 158876 markings, 169243 edges, 5071 markings/sec, 35 secs
lola: sara is running 40 secs || 183354 markings, 194073 edges, 4896 markings/sec, 40 secs
lola: sara is running 45 secs || 201642 markings, 212400 edges, 3658 markings/sec, 45 secs
lola: sara is running 50 secs || 218707 markings, 229672 edges, 3413 markings/sec, 50 secs
lola: sara is running 55 secs || 234170 markings, 245216 edges, 3093 markings/sec, 55 secs
lola: sara is running 60 secs || 248968 markings, 260478 edges, 2960 markings/sec, 60 secs
lola: sara is running 65 secs || 263839 markings, 275428 edges, 2974 markings/sec, 65 secs
lola: sara is running 70 secs || 278431 markings, 290040 edges, 2918 markings/sec, 70 secs
lola: sara is running 75 secs || 291604 markings, 303219 edges, 2635 markings/sec, 75 secs
lola: sara is running 80 secs || 304520 markings, 316135 edges, 2583 markings/sec, 80 secs
lola: sara is running 85 secs || 316331 markings, 327946 edges, 2362 markings/sec, 85 secs
lola: sara is running 90 secs || 326984 markings, 338681 edges, 2131 markings/sec, 90 secs
lola: sara is running 95 secs || 339058 markings, 350954 edges, 2415 markings/sec, 95 secs
lola: sara is running 100 secs || 351206 markings, 363309 edges, 2430 markings/sec, 100 secs
lola: sara is running 105 secs || 363352 markings, 375630 edges, 2429 markings/sec, 105 secs
lola: sara is running 110 secs || 375425 markings, 387927 edges, 2415 markings/sec, 110 secs
lola: sara is running 115 secs || 387850 markings, 400478 edges, 2485 markings/sec, 115 secs
lola: sara is running 120 secs || 401852 markings, 414481 edges, 2800 markings/sec, 120 secs
lola: sara is running 125 secs || 416509 markings, 429137 edges, 2931 markings/sec, 125 secs
lola: sara is running 130 secs || 431150 markings, 443778 edges, 2928 markings/sec, 130 secs
lola: sara is running 135 secs || 445786 markings, 458415 edges, 2927 markings/sec, 135 secs
lola: sara is running 140 secs || 460425 markings, 473053 edges, 2928 markings/sec, 140 secs
lola: sara is running 145 secs || 475087 markings, 487719 edges, 2932 markings/sec, 145 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 150 secs || 489762 markings, 502399 edges, 2935 markings/sec, 150 secs
lola: sara is running 155 secs || 504417 markings, 517060 edges, 2931 markings/sec, 155 secs

lola: sara is running 160 secs || 519094 markings, 531743 edges, 2935 markings/sec, 160 secs
lola: sara is running 165 secs || 533808 markings, 546462 edges, 2943 markings/sec, 165 secs
lola: sara is running 170 secs || 548495 markings, 561154 edges, 2937 markings/sec, 170 secs
lola: sara is running 175 secs || 563162 markings, 575827 edges, 2933 markings/sec, 175 secs
lola: sara is running 180 secs || 577833 markings, 590503 edges, 2934 markings/sec, 180 secs
lola: sara is running 185 secs || 592509 markings, 605184 edges, 2935 markings/sec, 185 secs
lola: sara is running 190 secs || 607189 markings, 619870 edges, 2936 markings/sec, 190 secs
lola: sara is running 195 secs || 621842 markings, 634527 edges, 2931 markings/sec, 195 secs
lola: sara is running 200 secs || 636375 markings, 649065 edges, 2907 markings/sec, 200 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 351 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((pi_d4_n1_3_3_3_1_2 <= pb_d1_n2_2_2_1_2_2) OR (2 <= po_d4_n1_3_3_2_1_3) OR ((pol_d1_n1_1_1_1_1_1 <= pb_d4_n2_1_1_1_3_1) AND (pi_d1_n1_3_3_2_1_1 <= pil_d2_n1_1_3_1_2_3))) AND ((3 <= pol_d1_n1_2_3_1_3_3) OR (po_d1_n1_3_2_3_3_1 <= pb_d4_n2_3_1_3_2_3) OR ((pb_d5_n2_2_2_2_3_1 <= pil_d3_n1_2_3_3_2_3) AND (pb_d1_n2_2_1_1_1_3 <= pb_d2_n2_3_2_1_2_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 19436 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-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: 12 markings, 11 edges
lola: ========================================
lola: subprocess 8 will run for 394 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pil_d4_n1_3_3_2_3_1 <= 1) OR ((pb_d2_n1_2_1_2_2_3 + 1 <= pil_d3_n1_1_2_3_3_3) AND (po_d1_n1_3_1_1_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 19436 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 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 25126 markings, 28234 edges, 5025 markings/sec, 0 secs
lola: sara is running 5 secs || 44687 markings, 50170 edges, 3912 markings/sec, 5 secs
lola: sara is running 10 secs || 62557 markings, 68757 edges, 3574 markings/sec, 10 secs
lola: sara is running 15 secs || 79773 markings, 86503 edges, 3443 markings/sec, 15 secs
lola: sara is running 20 secs || 98497 markings, 105827 edges, 3745 markings/sec, 20 secs
lola: sara is running 25 secs || 115830 markings, 123715 edges, 3467 markings/sec, 25 secs
lola: sara is running 30 secs || 133133 markings, 141579 edges, 3461 markings/sec, 30 secs
lola: sara is running 35 secs || 150807 markings, 159814 edges, 3535 markings/sec, 35 secs
lola: sara is running 40 secs || 167574 markings, 177110 edges, 3353 markings/sec, 40 secs
lola: sara is running 45 secs || 184225 markings, 194288 edges, 3330 markings/sec, 45 secs
lola: sara is running 50 secs || 199815 markings, 210373 edges, 3118 markings/sec, 50 secs
lola: sara is running 55 secs || 215847 markings, 226904 edges, 3206 markings/sec, 55 secs
lola: sara is running 60 secs || 231178 markings, 242726 edges, 3066 markings/sec, 60 secs
lola: sara is running 65 secs || 246337 markings, 258377 edges, 3032 markings/sec, 65 secs
lola: sara is running 70 secs || 261336 markings, 273841 edges, 3000 markings/sec, 70 secs
lola: sara is running 75 secs || 275767 markings, 288734 edges, 2886 markings/sec, 75 secs
lola: sara is running 80 secs || 290709 markings, 304138 edges, 2988 markings/sec, 80 secs
lola: sara is running 85 secs || 304961 markings, 318848 edges, 2850 markings/sec, 85 secs
lola: sara is running 90 secs || 319860 markings, 334231 edges, 2980 markings/sec, 90 secs
lola: sara is running 95 secs || 334723 markings, 349575 edges, 2973 markings/sec, 95 secs
lola: sara is running 100 secs || 349219 markings, 364552 edges, 2899 markings/sec, 100 secs
lola: sara is running 105 secs || 363514 markings, 379333 edges, 2859 markings/sec, 105 secs
lola: sara is running 110 secs || 376974 markings, 393286 edges, 2692 markings/sec, 110 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 115 secs || 390708 markings, 407512 edges, 2747 markings/sec, 115 secs
lola: sara is running 120 secs || 404144 markings, 421476 edges, 2687 markings/sec, 120 secs
lola: sara is running 125 secs || 417613 markings, 435413 edges, 2694 markings/sec, 125 secs
lola: sara is running 130 secs || 431865 markings, 450132 edges, 2850 markings/sec, 130 secs

lola: sara is running 135 secs || 445421 markings, 464203 edges, 2711 markings/sec, 135 secs
lola: sara is running 140 secs || 457970 markings, 477302 edges, 2510 markings/sec, 140 secs
lola: sara is running 145 secs || 469902 markings, 489751 edges, 2386 markings/sec, 145 secs
lola: sara is running 150 secs || 481825 markings, 502156 edges, 2385 markings/sec, 150 secs
lola: sara is running 155 secs || 492950 markings, 513762 edges, 2225 markings/sec, 155 secs
lola: sara is running 160 secs || 502617 markings, 524092 edges, 1933 markings/sec, 160 secs
lola: sara is running 165 secs || 512971 markings, 534804 edges, 2071 markings/sec, 165 secs
lola: sara is running 170 secs || 523183 markings, 545347 edges, 2042 markings/sec, 170 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 425 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= pb_d2_n2_3_1_1_2_1) AND (pi_d5_n1_2_2_3_3_1 <= po_d5_n1_3_3_1_2_3)) OR ((3 <= pil_d1_n1_1_3_3_3_1) AND (pol_d3_n1_2_3_3_1_3 <= pi_d3_n1_3_1_2_3_1)) OR (pil_d5_n1_1_1_3_2_2 <= pb_d2_n2_1_3_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 19436 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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-9.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: 8 markings, 7 edges
lola: ========================================
lola: subprocess 10 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((pol_d3_n1_3_1_1_1_3 <= pi_d2_n1_3_2_3_2_2) AND (3 <= pil_d5_n1_1_3_3_1_2)) OR (pi_d2_n1_3_3_1_2_3 <= po_d5_n1_1_3_2_3_3) OR (((2 <= pil_d1_n1_2_2_3_3_2) OR (pol_d3_n1_1_1_3_2_2 <= pb_d2_n2_3_2_1_2_2)) AND (pb_d1_n1_1_3_2_1_1 + 1 <= pb_d2_n2_1_2_2_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 19436 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 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 596 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((2 <= pb_d1_n1_2_1_1_1_3) OR (1 <= pil_d1_n1_3_3_1_2_1)) AND (pbl_3_1_3_2_1 <= 0)) OR (((2 <= pb_d5_n2_1_3_2_2_1) OR (1 <= po_d5_n1_1_2_2_2_1)) AND ((pil_d5_n1_2_3_2_2_1 <= pol_d3_n1_3_2_2_2_2) OR (pb_d3_n2_2_2_3_3_2 <= pb_d4_n2_3_2_2_2_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 19436 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 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 12 will run for 745 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((po_d1_n1_1_3_1_3_3 <= 1) AND (pb_d3_n1_1_1_2_1_1 + 1 <= pb_d2_n2_1_1_3_3_1) AND ((3 <= pol_d3_n1_3_1_1_2_1) OR (pb_d1_n1_1_1_3_2_2 <= pol_d4_n1_3_1_1_1_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 19436 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 13 will run for 993 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pb_d5_n1_1_3_3_2_2) AND (po_d3_n1_2_1_3_1_3 <= pi_d5_n1_1_1_1_2_3) AND (pil_d3_n1_3_2_1_1_2 <= 0) AND (pol_d3_n1_1_3_2_1_2 <= pb_d4_n2_2_3_2_1_1) AND (po_d5_n1_2_1_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 19436 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 14 will run for 1490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((po_d3_n1_3_2_3_1_3 <= pb_d2_n1_2_2_2_2_2) AND (1 <= po_d5_n1_3_3_3_2_2) AND (1 <= pol_d2_n1_2_1_1_1_3) AND (2 <= pil_d3_n1_1_2_3_3_2) AND ((3 <= pbl_2_1_1_3_1) OR (3 <= pol_d2_n1_1_3_2_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 19436 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 HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 33569 markings, 34465 edges, 6714 markings/sec, 0 secs
lola: sara is running 5 secs || 57851 markings, 58863 edges, 4856 markings/sec, 5 secs
lola: sara is running 10 secs || 80537 markings, 82128 edges, 4537 markings/sec, 10 secs
lola: sara is running 15 secs || 100743 markings, 102619 edges, 4041 markings/sec, 15 secs
lola: sara is running 20 secs || 122108 markings, 123984 edges, 4273 markings/sec, 20 secs
lola: sara is running 25 secs || 141565 markings, 143442 edges, 3891 markings/sec, 25 secs
lola: sara is running 30 secs || 158195 markings, 160135 edges, 3326 markings/sec, 30 secs
lola: sara is running 35 secs || 171557 markings, 173746 edges, 2672 markings/sec, 35 secs
lola: sara is running 40 secs || 185453 markings, 188510 edges, 2779 markings/sec, 40 secs
lola: sara is running 45 secs || 198176 markings, 202394 edges, 2545 markings/sec, 45 secs
lola: sara is running 50 secs || 211891 markings, 217489 edges, 2743 markings/sec, 50 secs
lola: sara is running 55 secs || 225699 markings, 232728 edges, 2762 markings/sec, 55 secs
lola: sara is running 60 secs || 239358 markings, 247783 edges, 2732 markings/sec, 60 secs
lola: sara is running 65 secs || 252979 markings, 262716 edges, 2724 markings/sec, 65 secs
lola: sara is running 70 secs || 266051 markings, 277105 edges, 2614 markings/sec, 70 secs
lola: sara is running 75 secs || 279411 markings, 291845 edges, 2672 markings/sec, 75 secs
lola: sara is running 80 secs || 292475 markings, 306243 edges, 2613 markings/sec, 80 secs
lola: sara is running 85 secs || 305239 markings, 320221 edges, 2553 markings/sec, 85 secs
lola: sara is running 90 secs || 317989 markings, 334246 edges, 2550 markings/sec, 90 secs
lola: sara is running 95 secs || 330913 markings, 348499 edges, 2585 markings/sec, 95 secs
lola: sara is running 100 secs || 343844 markings, 362761 edges, 2586 markings/sec, 100 secs
lola: sara is running 105 secs || 356513 markings, 375986 edges, 2534 markings/sec, 105 secs
lola: sara is running 110 secs || 368928 markings, 388401 edges, 2483 markings/sec, 110 secs
lola: sara is running 115 secs || 381690 markings, 401163 edges, 2552 markings/sec, 115 secs
lola: sara is running 120 secs || 394526 markings, 413999 edges, 2567 markings/sec, 120 secs
lola: sara is running 125 secs || 406319 markings, 425801 edges, 2359 markings/sec, 125 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 130 secs || 416093 markings, 435802 edges, 1955 markings/sec, 130 secs
lola: sara is running 135 secs || 425772 markings, 445790 edges, 1936 markings/sec, 135 secs
lola: sara is running 140 secs || 435608 markings, 455891 edges, 1967 markings/sec, 140 secs
lola: sara is running 145 secs || 445863 markings, 466338 edges, 2051 markings/sec, 145 secs

lola: sara is running 150 secs || 456076 markings, 476716 edges, 2043 markings/sec, 150 secs
lola: sara is running 155 secs || 465967 markings, 487010 edges, 1978 markings/sec, 155 secs
lola: sara is running 160 secs || 474847 markings, 495954 edges, 1776 markings/sec, 160 secs
lola: sara is running 165 secs || 484123 markings, 505279 edges, 1855 markings/sec, 165 secs
lola: sara is running 170 secs || 493487 markings, 514761 edges, 1873 markings/sec, 170 secs
lola: sara is running 175 secs || 502931 markings, 524285 edges, 1889 markings/sec, 175 secs
lola: sara is running 180 secs || 512204 markings, 533638 edges, 1855 markings/sec, 180 secs
lola: sara is running 185 secs || 521433 markings, 542953 edges, 1846 markings/sec, 185 secs
lola: sara is running 190 secs || 531038 markings, 552647 edges, 1921 markings/sec, 190 secs
lola: sara is running 195 secs || 540416 markings, 562072 edges, 1876 markings/sec, 195 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 2777 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pb_d5_n1_3_1_2_3_1 <= po_d1_n1_3_3_3_1_3) OR (pol_d2_n1_3_2_3_3_3 <= po_d4_n1_1_2_2_2_3) OR (pi_d2_n1_2_2_2_2_2 <= 2) OR (pil_d3_n1_1_2_1_1_3 <= pol_d1_n1_3_1_2_3_2) OR (po_d3_n1_1_3_1_3_1 <= pi_d4_n1_2_1_2_3_1) OR ((2 <= pi_d4_n1_3_3_1_1_2) AND (3 <= pb_d3_n1_2_3_3_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 19436 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 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 48253 markings, 48283 edges, 9651 markings/sec, 0 secs
lola: sara is running 5 secs || 92923 markings, 93033 edges, 8934 markings/sec, 5 secs
lola: sara is running 10 secs || 118181 markings, 118302 edges, 5052 markings/sec, 10 secs
lola: sara is running 15 secs || 136102 markings, 136277 edges, 3584 markings/sec, 15 secs
lola: sara is running 20 secs || 150985 markings, 151160 edges, 2977 markings/sec, 20 secs
lola: sara is running 25 secs || 165028 markings, 165240 edges, 2809 markings/sec, 25 secs
lola: sara is running 30 secs || 177657 markings, 178089 edges, 2526 markings/sec, 30 secs
lola: sara is running 35 secs || 190429 markings, 190912 edges, 2554 markings/sec, 35 secs
lola: sara is running 40 secs || 203225 markings, 203761 edges, 2559 markings/sec, 40 secs
lola: sara is running 45 secs || 216097 markings, 216960 edges, 2574 markings/sec, 45 secs
lola: sara is running 50 secs || 228945 markings, 230079 edges, 2570 markings/sec, 50 secs
lola: sara is running 55 secs || 241825 markings, 243111 edges, 2576 markings/sec, 55 secs
lola: sara is running 60 secs || 254661 markings, 256104 edges, 2567 markings/sec, 60 secs
lola: sara is running 65 secs || 263506 markings, 265437 edges, 1769 markings/sec, 65 secs
lola: sara is running 70 secs || 268506 markings, 270995 edges, 1000 markings/sec, 70 secs
lola: sara is running 75 secs || 273414 markings, 276432 edges, 982 markings/sec, 75 secs
lola: sara is running 80 secs || 278321 markings, 281892 edges, 981 markings/sec, 80 secs
lola: sara is running 85 secs || 283221 markings, 287328 edges, 980 markings/sec, 85 secs
lola: sara is running 90 secs || 288174 markings, 292811 edges, 991 markings/sec, 90 secs
lola: sara is running 95 secs || 293156 markings, 298364 edges, 996 markings/sec, 95 secs
lola: sara is running 100 secs || 298146 markings, 303894 edges, 998 markings/sec, 100 secs
lola: sara is running 105 secs || 302998 markings, 309268 edges, 970 markings/sec, 105 secs
lola: sara is running 110 secs || 307752 markings, 314560 edges, 951 markings/sec, 110 secs
lola: sara is running 115 secs || 312647 markings, 319979 edges, 979 markings/sec, 115 secs
lola: sara is running 120 secs || 317725 markings, 325639 edges, 1016 markings/sec, 120 secs
lola: sara is running 125 secs || 322764 markings, 331202 edges, 1008 markings/sec, 125 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 130 secs || 327810 markings, 336812 edges, 1009 markings/sec, 130 secs
lola: sara is running 135 secs || 332817 markings, 342343 edges, 1001 markings/sec, 135 secs
lola: sara is running 140 secs || 337874 markings, 347947 edges, 1011 markings/sec, 140 secs
lola: sara is running 145 secs || 343065 markings, 353377 edges, 1038 markings/sec, 145 secs

lola: sara is running 150 secs || 348650 markings, 359274 edges, 1117 markings/sec, 150 secs
lola: sara is running 155 secs || 355196 markings, 366050 edges, 1309 markings/sec, 155 secs
lola: sara is running 160 secs || 360306 markings, 371243 edges, 1022 markings/sec, 160 secs
lola: sara is running 165 secs || 365819 markings, 376756 edges, 1103 markings/sec, 165 secs
lola: sara is running 170 secs || 374354 markings, 385301 edges, 1707 markings/sec, 170 secs
lola: sara is running 175 secs || 382320 markings, 393267 edges, 1593 markings/sec, 175 secs
lola: sara is running 180 secs || 390132 markings, 401079 edges, 1562 markings/sec, 180 secs
lola: sara is running 185 secs || 397797 markings, 408744 edges, 1533 markings/sec, 185 secs
lola: sara is running 190 secs || 405424 markings, 416471 edges, 1525 markings/sec, 190 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes no no no no yes no no no yes yes no yes
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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="HypertorusGrid-PT-d5k3p2b10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-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/HypertorusGrid-PT-d5k3p2b10.tgz
mv HypertorusGrid-PT-d5k3p2b10 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 irma4mcc-full"
echo " Input is HypertorusGrid-PT-d5k3p2b10, 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 r102-smll-152658633000166"
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 ;