About the Execution of M4M.struct for HypertorusGrid-PT-d5k3p2b10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6498.500 | 972184.00 | 1859888.00 | 3179.90 | TFTTFFFFTFFFTTFT | 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 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 mcc4mcc-structural
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 r107-smll-152658637500166
=====================================================================
--------------------
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 1526817171181
BK_STOP 1526818143365
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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 stderr -----
----- Start make result stdout -----
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 || 35383 markings, 35706 edges, 7077 markings/sec, 0 secs
lola: sara is running 5 secs || 57963 markings, 58436 edges, 4516 markings/sec, 5 secs
lola: sara is running 10 secs || 76960 markings, 77729 edges, 3799 markings/sec, 10 secs
lola: sara is running 15 secs || 93476 markings, 94325 edges, 3303 markings/sec, 15 secs
lola: sara is running 20 secs || 108559 markings, 109676 edges, 3017 markings/sec, 20 secs
lola: sara is running 25 secs || 123090 markings, 124546 edges, 2906 markings/sec, 25 secs
lola: sara is running 30 secs || 137526 markings, 139260 edges, 2887 markings/sec, 30 secs
lola: sara is running 35 secs || 150229 markings, 152053 edges, 2541 markings/sec, 35 secs
lola: sara is running 40 secs || 161054 markings, 162903 edges, 2165 markings/sec, 40 secs
lola: sara is running 45 secs || 172239 markings, 174097 edges, 2237 markings/sec, 45 secs
lola: sara is running 50 secs || 182318 markings, 184396 edges, 2016 markings/sec, 50 secs
lola: sara is running 55 secs || 191892 markings, 194623 edges, 1915 markings/sec, 55 secs
lola: sara is running 60 secs || 201188 markings, 203919 edges, 1859 markings/sec, 60 secs
lola: sara is running 65 secs || 210146 markings, 213422 edges, 1792 markings/sec, 65 secs
lola: sara is running 70 secs || 219105 markings, 223079 edges, 1792 markings/sec, 70 secs
lola: sara is running 75 secs || 228048 markings, 233075 edges, 1789 markings/sec, 75 secs
lola: sara is running 80 secs || 236995 markings, 242129 edges, 1789 markings/sec, 80 secs
lola: sara is running 85 secs || 245382 markings, 250534 edges, 1677 markings/sec, 85 secs
lola: sara is running 90 secs || 253230 markings, 258382 edges, 1570 markings/sec, 90 secs
lola: sara is running 95 secs || 260848 markings, 266086 edges, 1524 markings/sec, 95 secs
lola: sara is running 100 secs || 268428 markings, 273697 edges, 1516 markings/sec, 100 secs
lola: sara is running 105 secs || 275779 markings, 281048 edges, 1470 markings/sec, 105 secs
lola: sara is running 110 secs || 283034 markings, 288387 edges, 1451 markings/sec, 110 secs
lola: sara is running 115 secs || 290287 markings, 295678 edges, 1451 markings/sec, 115 secs
lola: sara is running 120 secs || 297680 markings, 303093 edges, 1479 markings/sec, 120 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 125 secs || 304662 markings, 310113 edges, 1396 markings/sec, 125 secs
lola: sara is running 130 secs || 311555 markings, 317029 edges, 1379 markings/sec, 130 secs
lola: sara is running 135 secs || 318288 markings, 323788 edges, 1347 markings/sec, 135 secs
lola: sara is running 140 secs || 324803 markings, 330303 edges, 1303 markings/sec, 140 secs
lola: sara is running 145 secs || 331174 markings, 336969 edges, 1274 markings/sec, 145 secs
lola: sara is running 150 secs || 337606 markings, 343434 edges, 1286 markings/sec, 150 secs
lola: sara is running 155 secs || 344083 markings, 349959 edges, 1295 markings/sec, 155 secs
lola: sara is running 160 secs || 350507 markings, 356403 edges, 1285 markings/sec, 160 secs
lola: sara is running 165 secs || 356679 markings, 362633 edges, 1234 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 || 25792 markings, 27789 edges, 5158 markings/sec, 0 secs
lola: sara is running 5 secs || 46423 markings, 49938 edges, 4126 markings/sec, 5 secs
lola: sara is running 10 secs || 65875 markings, 70809 edges, 3890 markings/sec, 10 secs
lola: sara is running 15 secs || 84626 markings, 90938 edges, 3750 markings/sec, 15 secs
lola: sara is running 20 secs || 102671 markings, 110295 edges, 3609 markings/sec, 20 secs
lola: sara is running 25 secs || 120708 markings, 129622 edges, 3607 markings/sec, 25 secs
lola: sara is running 30 secs || 138227 markings, 148384 edges, 3504 markings/sec, 30 secs
lola: sara is running 35 secs || 168074 markings, 178621 edges, 5969 markings/sec, 35 secs
lola: sara is running 40 secs || 189082 markings, 199809 edges, 4202 markings/sec, 40 secs
lola: sara is running 45 secs || 207016 markings, 217958 edges, 3587 markings/sec, 45 secs
lola: sara is running 50 secs || 223208 markings, 234173 edges, 3238 markings/sec, 50 secs
lola: sara is running 55 secs || 237935 markings, 248993 edges, 2945 markings/sec, 55 secs
lola: sara is running 60 secs || 252338 markings, 263871 edges, 2881 markings/sec, 60 secs
lola: sara is running 65 secs || 266589 markings, 278181 edges, 2850 markings/sec, 65 secs
lola: sara is running 70 secs || 280467 markings, 292076 edges, 2776 markings/sec, 70 secs
lola: sara is running 75 secs || 293326 markings, 304941 edges, 2572 markings/sec, 75 secs
lola: sara is running 80 secs || 306624 markings, 318239 edges, 2660 markings/sec, 80 secs
lola: sara is running 85 secs || 317323 markings, 328938 edges, 2140 markings/sec, 85 secs
lola: sara is running 90 secs || 327474 markings, 339170 edges, 2030 markings/sec, 90 secs
lola: sara is running 95 secs || 339086 markings, 350982 edges, 2322 markings/sec, 95 secs
lola: sara is running 100 secs || 350771 markings, 362866 edges, 2337 markings/sec, 100 secs
lola: sara is running 105 secs || 362978 markings, 375252 edges, 2441 markings/sec, 105 secs
lola: sara is running 110 secs || 375429 markings, 387931 edges, 2490 markings/sec, 110 secs
lola: sara is running 115 secs || 388378 markings, 401006 edges, 2590 markings/sec, 115 secs
lola: sara is running 120 secs || 403086 markings, 415714 edges, 2942 markings/sec, 120 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 125 secs || 417663 markings, 430291 edges, 2915 markings/sec, 125 secs
lola: sara is running 130 secs || 432104 markings, 444732 edges, 2888 markings/sec, 130 secs
lola: sara is running 135 secs || 446478 markings, 459106 edges, 2875 markings/sec, 135 secs
lola: sara is running 140 secs || 460834 markings, 473462 edges, 2871 markings/sec, 140 secs
lola: sara is running 145 secs || 475304 markings, 487936 edges, 2894 markings/sec, 145 secs
lola: sara is running 150 secs || 489795 markings, 502432 edges, 2898 markings/sec, 150 secs
lola: sara is running 155 secs || 504229 markings, 516873 edges, 2887 markings/sec, 155 secs
lola: sara is running 160 secs || 518608 markings, 531256 edges, 2876 markings/sec, 160 secs
lola: sara is running 165 secs || 533062 markings, 545716 edges, 2891 markings/sec, 165 secs
lola: sara is running 170 secs || 547434 markings, 560093 edges, 2874 markings/sec, 170 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 354 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: 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 398 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 || 26341 markings, 29596 edges, 5268 markings/sec, 0 secs
lola: sara is running 5 secs || 47370 markings, 52975 edges, 4206 markings/sec, 5 secs
lola: sara is running 10 secs || 65024 markings, 71292 edges, 3531 markings/sec, 10 secs
lola: sara is running 15 secs || 82553 markings, 89382 edges, 3506 markings/sec, 15 secs
lola: sara is running 20 secs || 101046 markings, 108469 edges, 3699 markings/sec, 20 secs
lola: sara is running 25 secs || 119088 markings, 127072 edges, 3608 markings/sec, 25 secs
lola: sara is running 30 secs || 136756 markings, 145301 edges, 3534 markings/sec, 30 secs
lola: sara is running 35 secs || 154712 markings, 163851 edges, 3591 markings/sec, 35 secs
lola: sara is running 40 secs || 171801 markings, 181468 edges, 3418 markings/sec, 40 secs
lola: sara is running 45 secs || 187955 markings, 198147 edges, 3231 markings/sec, 45 secs
lola: sara is running 50 secs || 204080 markings, 214770 edges, 3225 markings/sec, 50 secs
lola: sara is running 55 secs || 220116 markings, 231317 edges, 3207 markings/sec, 55 secs
lola: sara is running 60 secs || 235873 markings, 247583 edges, 3151 markings/sec, 60 secs
lola: sara is running 65 secs || 250973 markings, 263148 edges, 3020 markings/sec, 65 secs
lola: sara is running 70 secs || 266174 markings, 278840 edges, 3040 markings/sec, 70 secs
lola: sara is running 75 secs || 281023 markings, 294155 edges, 2970 markings/sec, 75 secs
lola: sara is running 80 secs || 295717 markings, 309312 edges, 2939 markings/sec, 80 secs
lola: sara is running 85 secs || 310350 markings, 324414 edges, 2927 markings/sec, 85 secs
lola: sara is running 90 secs || 325247 markings, 339797 edges, 2979 markings/sec, 90 secs
lola: sara is running 95 secs || 339880 markings, 354925 edges, 2927 markings/sec, 95 secs
lola: sara is running 100 secs || 354821 markings, 370332 edges, 2988 markings/sec, 100 secs
lola: sara is running 105 secs || 369053 markings, 385083 edges, 2846 markings/sec, 105 secs
lola: sara is running 110 secs || 383019 markings, 399545 edges, 2793 markings/sec, 110 secs
lola: sara is running 115 secs || 397223 markings, 414273 edges, 2841 markings/sec, 115 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 120 secs || 411258 markings, 428841 edges, 2807 markings/sec, 120 secs
lola: sara is running 125 secs || 425580 markings, 443648 edges, 2864 markings/sec, 125 secs
lola: sara is running 130 secs || 439817 markings, 458397 edges, 2847 markings/sec, 130 secs
lola: sara is running 135 secs || 454210 markings, 473382 edges, 2879 markings/sec, 135 secs
lola: sara is running 140 secs || 466493 markings, 486150 edges, 2457 markings/sec, 140 secs
lola: sara is running 145 secs || 478685 markings, 498865 edges, 2438 markings/sec, 145 secs
lola: sara is running 150 secs || 490777 markings, 511454 edges, 2418 markings/sec, 150 secs
lola: sara is running 155 secs || 500452 markings, 521862 edges, 1935 markings/sec, 155 secs
lola: sara is running 160 secs || 511179 markings, 532946 edges, 2145 markings/sec, 160 secs
lola: sara is running 165 secs || 521689 markings, 543783 edges, 2102 markings/sec, 165 secs
lola: sara is running 170 secs || 532055 markings, 554507 edges, 2073 markings/sec, 170 secs
lola: sara is running 175 secs || 542527 markings, 565339 edges, 2094 markings/sec, 175 secs
lola: sara is running 180 secs || 552928 markings, 576069 edges, 2080 markings/sec, 180 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 428 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 500 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 600 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 750 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 1000 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-13.sara
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 14 will run for 1500 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 || 33257 markings, 34153 edges, 6651 markings/sec, 0 secs
lola: sara is running 5 secs || 56897 markings, 57910 edges, 4728 markings/sec, 5 secs
lola: sara is running 10 secs || 78404 markings, 79923 edges, 4301 markings/sec, 10 secs
lola: sara is running 15 secs || 99717 markings, 101593 edges, 4263 markings/sec, 15 secs
lola: sara is running 20 secs || 120326 markings, 122202 edges, 4122 markings/sec, 20 secs
lola: sara is running 25 secs || 139292 markings, 141168 edges, 3793 markings/sec, 25 secs
lola: sara is running 30 secs || 156480 markings, 158402 edges, 3438 markings/sec, 30 secs
lola: sara is running 35 secs || 169871 markings, 172005 edges, 2678 markings/sec, 35 secs
lola: sara is running 40 secs || 183397 markings, 186446 edges, 2705 markings/sec, 40 secs
lola: sara is running 45 secs || 196481 markings, 200599 edges, 2617 markings/sec, 45 secs
lola: sara is running 50 secs || 209471 markings, 214828 edges, 2598 markings/sec, 50 secs
lola: sara is running 55 secs || 222463 markings, 229122 edges, 2598 markings/sec, 55 secs
lola: sara is running 60 secs || 235448 markings, 243445 edges, 2597 markings/sec, 60 secs
lola: sara is running 65 secs || 248428 markings, 257761 edges, 2596 markings/sec, 65 secs
lola: sara is running 70 secs || 261349 markings, 271923 edges, 2584 markings/sec, 70 secs
lola: sara is running 75 secs || 274268 markings, 286144 edges, 2584 markings/sec, 75 secs
lola: sara is running 80 secs || 287511 markings, 300724 edges, 2649 markings/sec, 80 secs
lola: sara is running 85 secs || 301211 markings, 315842 edges, 2740 markings/sec, 85 secs
lola: sara is running 90 secs || 314399 markings, 330336 edges, 2638 markings/sec, 90 secs
lola: sara is running 95 secs || 327318 markings, 344526 edges, 2584 markings/sec, 95 secs
lola: sara is running 100 secs || 340270 markings, 358779 edges, 2590 markings/sec, 100 secs
lola: sara is running 105 secs || 353120 markings, 372593 edges, 2570 markings/sec, 105 secs
lola: sara is running 110 secs || 365647 markings, 385120 edges, 2505 markings/sec, 110 secs
lola: sara is running 115 secs || 378029 markings, 397502 edges, 2476 markings/sec, 115 secs
lola: sara is running 120 secs || 390985 markings, 410458 edges, 2591 markings/sec, 120 secs
lola: sara is running 125 secs || 403553 markings, 423026 edges, 2514 markings/sec, 125 secs
lola: sara is running 130 secs || 413643 markings, 433273 edges, 2018 markings/sec, 130 secs
lola: sara is running 135 secs || 423274 markings, 443173 edges, 1926 markings/sec, 135 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 140 secs || 433075 markings, 453328 edges, 1960 markings/sec, 140 secs
lola: sara is running 145 secs || 443421 markings, 463853 edges, 2069 markings/sec, 145 secs
lola: sara is running 150 secs || 453899 markings, 474502 edges, 2096 markings/sec, 150 secs
lola: sara is running 155 secs || 464138 markings, 485169 edges, 2048 markings/sec, 155 secs
lola: sara is running 160 secs || 473146 markings, 494253 edges, 1802 markings/sec, 160 secs
lola: sara is running 165 secs || 482362 markings, 503500 edges, 1843 markings/sec, 165 secs
lola: sara is running 170 secs || 491767 markings, 513028 edges, 1881 markings/sec, 170 secs
lola: sara is running 175 secs || 501257 markings, 522596 edges, 1898 markings/sec, 175 secs
lola: sara is running 180 secs || 510634 markings, 532052 edges, 1875 markings/sec, 180 secs
lola: sara is running 185 secs || 519744 markings, 541248 edges, 1822 markings/sec, 185 secs
lola: sara is running 190 secs || 528862 markings, 550452 edges, 1824 markings/sec, 190 secs
lola: sara is running 195 secs || 537833 markings, 559475 edges, 1794 markings/sec, 195 secs
lola: sara is running 200 secs || 546982 markings, 568700 edges, 1830 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 15 will run for 2795 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 || 49980 markings, 50012 edges, 9996 markings/sec, 0 secs
lola: sara is running 5 secs || 94248 markings, 94358 edges, 8854 markings/sec, 5 secs
lola: sara is running 10 secs || 119185 markings, 119306 edges, 4987 markings/sec, 10 secs
lola: sara is running 15 secs || 135595 markings, 135770 edges, 3282 markings/sec, 15 secs
lola: sara is running 20 secs || 149440 markings, 149615 edges, 2769 markings/sec, 20 secs
lola: sara is running 25 secs || 163299 markings, 163510 edges, 2772 markings/sec, 25 secs
lola: sara is running 30 secs || 175478 markings, 175897 edges, 2436 markings/sec, 30 secs
lola: sara is running 35 secs || 187684 markings, 188157 edges, 2441 markings/sec, 35 secs
lola: sara is running 40 secs || 199544 markings, 200064 edges, 2372 markings/sec, 40 secs
lola: sara is running 45 secs || 211484 markings, 212079 edges, 2388 markings/sec, 45 secs
lola: sara is running 50 secs || 223400 markings, 224469 edges, 2383 markings/sec, 50 secs
lola: sara is running 55 secs || 235266 markings, 236474 edges, 2373 markings/sec, 55 secs
lola: sara is running 60 secs || 247210 markings, 248561 edges, 2389 markings/sec, 60 secs
lola: sara is running 65 secs || 258524 markings, 260142 edges, 2263 markings/sec, 65 secs
lola: sara is running 70 secs || 265027 markings, 267128 edges, 1301 markings/sec, 70 secs
lola: sara is running 75 secs || 269646 markings, 272252 edges, 924 markings/sec, 75 secs
lola: sara is running 80 secs || 274172 markings, 277268 edges, 905 markings/sec, 80 secs
lola: sara is running 85 secs || 278726 markings, 282329 edges, 911 markings/sec, 85 secs
lola: sara is running 90 secs || 283274 markings, 287389 edges, 910 markings/sec, 90 secs
lola: sara is running 95 secs || 287837 markings, 292455 edges, 913 markings/sec, 95 secs
lola: sara is running 100 secs || 292575 markings, 297701 edges, 948 markings/sec, 100 secs
lola: sara is running 105 secs || 297394 markings, 303072 edges, 964 markings/sec, 105 secs
lola: sara is running 110 secs || 302260 markings, 308455 edges, 973 markings/sec, 110 secs
lola: sara is running 115 secs || 307212 markings, 313954 edges, 990 markings/sec, 115 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 120 secs || 312079 markings, 319368 edges, 973 markings/sec, 120 secs
lola: sara is running 125 secs || 316962 markings, 324774 edges, 977 markings/sec, 125 secs
lola: sara is running 130 secs || 321851 markings, 330198 edges, 978 markings/sec, 130 secs
lola: sara is running 135 secs || 326679 markings, 335562 edges, 966 markings/sec, 135 secs
lola: sara is running 140 secs || 331432 markings, 340797 edges, 951 markings/sec, 140 secs
lola: sara is running 145 secs || 336106 markings, 345986 edges, 935 markings/sec, 145 secs
lola: sara is running 150 secs || 340730 markings, 351042 edges, 925 markings/sec, 150 secs
lola: sara is running 155 secs || 345800 markings, 356239 edges, 1014 markings/sec, 155 secs
lola: sara is running 160 secs || 351246 markings, 361957 edges, 1089 markings/sec, 160 secs
lola: sara is running 165 secs || 356689 markings, 367584 edges, 1089 markings/sec, 165 secs
lola: sara is running 170 secs || 361356 markings, 372293 edges, 933 markings/sec, 170 secs
lola: sara is running 175 secs || 366635 markings, 377572 edges, 1056 markings/sec, 175 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="mcc4mcc-structural"
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 mcc4mcc-structural"
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 r107-smll-152658637500166"
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 '
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 ;