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

About the Execution of LoLA for HypertorusGrid-PT-d5k3p2b10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1367.670 3600000.00 2073379.00 7898.10 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 lola
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 r100-smll-152658630800166
=====================================================================


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

info: Time: 3600 - MCC
===========================================================================================
prep: translating HypertorusGrid-PT-d5k3p2b10 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating HypertorusGrid-PT-d5k3p2b10 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ HypertorusGrid-PT-d5k3p2b10 @ 3569 seconds
lola: LoLA will run for 3569 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: Size of bit vector: 241056
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 169 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((2 <= pol_d1_n1_3_3_1_1_1)))
lola: processed formula length: 34
lola: 1 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (2 <= pol_d1_n1_3_3_1_1_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-0.sara.
lola: sara is running 0 secs || 21184 markings, 22842 edges, 4237 markings/sec, 0 secs
lola: sara is running 5 secs || 37808 markings, 40699 edges, 3325 markings/sec, 5 secs
lola: sara is running 10 secs || 54977 markings, 59119 edges, 3434 markings/sec, 10 secs
lola: sara is running 15 secs || 71747 markings, 77119 edges, 3354 markings/sec, 15 secs
lola: sara is running 20 secs || 88052 markings, 94617 edges, 3261 markings/sec, 20 secs
lola: sara is running 25 secs || 103912 markings, 111623 edges, 3172 markings/sec, 25 secs
lola: sara is running 30 secs || 119559 markings, 128387 edges, 3129 markings/sec, 30 secs
lola: sara is running 35 secs || 134530 markings, 144423 edges, 2994 markings/sec, 35 secs
lola: sara is running 40 secs || 156036 markings, 166359 edges, 4301 markings/sec, 40 secs
lola: sara is running 45 secs || 178045 markings, 188656 edges, 4402 markings/sec, 45 secs
lola: sara is running 50 secs || 195020 markings, 205750 edges, 3395 markings/sec, 50 secs
lola: sara is running 55 secs || 210788 markings, 221738 edges, 3154 markings/sec, 55 secs
lola: sara is running 60 secs || 225474 markings, 236475 edges, 2937 markings/sec, 60 secs
lola: sara is running 65 secs || 239015 markings, 250078 edges, 2708 markings/sec, 65 secs
lola: sara is running 70 secs || 252191 markings, 263723 edges, 2635 markings/sec, 70 secs
lola: sara is running 75 secs || 265716 markings, 277307 edges, 2705 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 80 secs || 278916 markings, 290525 edges, 2640 markings/sec, 80 secs
lola: sara is running 85 secs || 291044 markings, 302659 edges, 2426 markings/sec, 85 secs

lola: sara is running 90 secs || 303010 markings, 314626 edges, 2393 markings/sec, 90 secs
lola: sara is running 95 secs || 314131 markings, 325746 edges, 2224 markings/sec, 95 secs
lola: sara is running 100 secs || 324106 markings, 335731 edges, 1995 markings/sec, 100 secs
lola: sara is running 105 secs || 335337 markings, 347188 edges, 2246 markings/sec, 105 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 173 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((1 <= pi_d4_n1_2_1_3_2_3) AND (3 <= po_d1_n1_2_3_1_1_3))))
lola: processed formula length: 65
lola: 1 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((1 <= pi_d4_n1_2_1_3_2_3) AND (3 <= po_d1_n1_2_3_1_1_3))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-0.sara.
lola: sara is running 0 secs || 29310 markings, 29633 edges, 5862 markings/sec, 0 secs
lola: sara is running 5 secs || 51375 markings, 51841 edges, 4413 markings/sec, 5 secs
lola: sara is running 10 secs || 69411 markings, 70161 edges, 3607 markings/sec, 10 secs
lola: sara is running 15 secs || 85600 markings, 86397 edges, 3238 markings/sec, 15 secs
lola: sara is running 20 secs || 100483 markings, 101370 edges, 2977 markings/sec, 20 secs
lola: sara is running 25 secs || 114521 markings, 115958 edges, 2808 markings/sec, 25 secs
lola: sara is running 30 secs || 127226 markings, 128799 edges, 2541 markings/sec, 30 secs
lola: sara is running 35 secs || 140350 markings, 142151 edges, 2625 markings/sec, 35 secs
lola: sara is running 40 secs || 151898 markings, 153722 edges, 2310 markings/sec, 40 secs
lola: sara is running 45 secs || 162721 markings, 164575 edges, 2165 markings/sec, 45 secs
lola: sara is running 50 secs || 173919 markings, 175789 edges, 2240 markings/sec, 50 secs
lola: sara is running 55 secs || 183746 markings, 185950 edges, 1965 markings/sec, 55 secs
lola: sara is running 60 secs || 193296 markings, 196028 edges, 1910 markings/sec, 60 secs
lola: sara is running 65 secs || 202543 markings, 205274 edges, 1849 markings/sec, 65 secs
lola: sara is running 70 secs || 211503 markings, 214790 edges, 1792 markings/sec, 70 secs
lola: sara is running 75 secs || 220350 markings, 224478 edges, 1769 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 80 secs || 229160 markings, 234187 edges, 1762 markings/sec, 80 secs
lola: sara is running 85 secs || 237790 markings, 242928 edges, 1726 markings/sec, 85 secs

lola: sara is running 90 secs || 246222 markings, 251374 edges, 1686 markings/sec, 90 secs
lola: sara is running 95 secs || 254240 markings, 259392 edges, 1604 markings/sec, 95 secs
lola: sara is running 100 secs || 262015 markings, 267253 edges, 1555 markings/sec, 100 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 177 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: 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: processed formula length: 117
lola: 1 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((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: 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: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-2-0.sara

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 191 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: 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: processed formula length: 99
lola: 2 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((pb_d5_n1_3_1_3_1_2 <= pil_d2_n1_3_2_2_3_1) AND (pbl_3_3_3_1_2 + 1 <= pb_d4_n1_1_2_1_1_1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-3-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 207 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: 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: processed formula length: 120
lola: 2 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((2 <= pil_d4_n1_3_3_2_3_1) AND ((pil_d3_n1_1_2_3_3_3 <= pb_d2_n1_2_1_2_2_3) OR (3 <= po_d1_n1_3_1_1_1_2)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-4-0.sara.
lola: sara is running 0 secs || 23813 markings, 26732 edges, 4763 markings/sec, 0 secs
lola: sara is running 5 secs || 42411 markings, 47768 edges, 3720 markings/sec, 5 secs
lola: sara is running 10 secs || 59420 markings, 65519 edges, 3402 markings/sec, 10 secs
lola: sara is running 15 secs || 75789 markings, 82397 edges, 3274 markings/sec, 15 secs
lola: sara is running 20 secs || 93585 markings, 100777 edges, 3559 markings/sec, 20 secs
lola: sara is running 25 secs || 110005 markings, 117713 edges, 3284 markings/sec, 25 secs
lola: sara is running 30 secs || 126694 markings, 134941 edges, 3338 markings/sec, 30 secs
lola: sara is running 35 secs || 143032 markings, 151778 edges, 3268 markings/sec, 35 secs
lola: sara is running 40 secs || 159120 markings, 168392 edges, 3218 markings/sec, 40 secs
lola: sara is running 45 secs || 175412 markings, 185203 edges, 3258 markings/sec, 45 secs
lola: sara is running 50 secs || 190274 markings, 200535 edges, 2972 markings/sec, 50 secs
lola: sara is running 55 secs || 205685 markings, 216441 edges, 3082 markings/sec, 55 secs
lola: sara is running 60 secs || 220867 markings, 232085 edges, 3036 markings/sec, 60 secs
lola: sara is running 65 secs || 235814 markings, 247517 edges, 2989 markings/sec, 65 secs
lola: sara is running 70 secs || 250281 markings, 262426 edges, 2893 markings/sec, 70 secs
lola: sara is running 75 secs || 264884 markings, 277488 edges, 2921 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 80 secs || 278730 markings, 291790 edges, 2769 markings/sec, 80 secs
lola: sara is running 85 secs || 292991 markings, 306486 edges, 2852 markings/sec, 85 secs
lola: sara is running 90 secs || 306856 markings, 320783 edges, 2773 markings/sec, 90 secs
lola: sara is running 95 secs || 321051 markings, 335465 edges, 2839 markings/sec, 95 secs

lola: sara is running 100 secs || 335302 markings, 350171 edges, 2850 markings/sec, 100 secs
lola: sara is running 105 secs || 349226 markings, 364560 edges, 2785 markings/sec, 105 secs
lola: sara is running 110 secs || 363095 markings, 378914 edges, 2774 markings/sec, 110 secs
lola: sara is running 115 secs || 376125 markings, 392430 edges, 2606 markings/sec, 115 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 215 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: 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: processed formula length: 175
lola: 2 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((pb_d1_n1_3_3_1_3_1 + 1 <= pi_d3_n1_2_3_1_1_2) AND (po_d1_n1_1_1_3_2_3 <= 1) AND ((pol_d3_n1_1_1_3_1_1 <= 0) OR (po_d4_n1_1_2_2_3_1 <= 0) OR (1 <= pb_d4_n1_1_1_1_2_3)))
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 9 literals and 3 conjunctive subformulas
lola: The predicate is not invariant.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-5-0.sara
lola: ========================================

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 237 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: 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: processed formula length: 154
lola: 1 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((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: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20 markings, 19 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 263 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: 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: processed formula length: 167
lola: 1 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((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: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola:
========================================
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 296 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: 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: processed formula length: 191
lola: 1 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((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: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 338 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: 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: processed formula length: 202
lola: 1 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((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: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-9-0.sara.
lola: sara is running 0 secs || 29646 markings, 30543 edges, 5929 markings/sec, 0 secs
lola: sara is running 5 secs || 51659 markings, 52618 edges, 4403 markings/sec, 5 secs
lola: sara is running 10 secs || 71220 markings, 72521 edges, 3912 markings/sec, 10 secs
lola: sara is running 15 secs || 90917 markings, 92793 edges, 3939 markings/sec, 15 secs
lola: sara is running 20 secs || 110609 markings, 112486 edges, 3938 markings/sec, 20 secs
lola: sara is running 25 secs || 129209 markings, 131085 edges, 3720 markings/sec, 25 secs
lola: sara is running 30 secs || 146010 markings, 147894 edges, 3360 markings/sec, 30 secs
lola: sara is running 35 secs || 160458 markings, 162398 edges, 2890 markings/sec, 35 secs
lola: sara is running 40 secs || 172888 markings, 175171 edges, 2486 markings/sec, 40 secs
lola: sara is running 45 secs || 185715 markings, 188774 edges, 2565 markings/sec, 45 secs
lola: sara is running 50 secs || 198343 markings, 202577 edges, 2526 markings/sec, 50 secs
lola: sara is running 55 secs || 210918 markings, 216431 edges, 2515 markings/sec, 55 secs
lola: sara is running 60 secs || 223569 markings, 230355 edges, 2530 markings/sec, 60 secs
lola: sara is running 65 secs || 236180 markings, 244260 edges, 2522 markings/sec, 65 secs
lola: sara is running 70 secs || 248780 markings, 258147 edges, 2520 markings/sec, 70 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 75 secs || 261341 markings, 271915 edges, 2512 markings/sec, 75 secs
lola: sara is running 80 secs || 273876 markings, 285710 edges, 2507 markings/sec, 80 secs
lola: sara is running 85 secs || 286434 markings, 299525 edges, 2512 markings/sec, 85 secs
lola: sara is running 90 secs || 299034 markings, 313417 edges, 2520 markings/sec, 90 secs

lola: sara is running 95 secs || 311637 markings, 327313 edges, 2521 markings/sec, 95 secs
lola: sara is running 100 secs || 324191 markings, 341145 edges, 2511 markings/sec, 100 secs
lola: sara is running 105 secs || 336726 markings, 354870 edges, 2507 markings/sec, 105 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 376 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: 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: processed formula length: 213
lola: 2 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((pb_d2_n2_3_1_1_2_1 <= 2) OR (po_d5_n1_3_3_1_2_3 + 1 <= pi_d5_n1_2_2_3_3_1)) AND ((pil_d1_n1_1_3_3_3_1 <= 2) OR (pi_d3_n1_3_1_2_3_1 + 1 <= pol_d3_n1_2_3_3_1_3)) AND (pb_d2_n2_1_3_1_3_1 + 1 <= pil_d5_n1_1_1_3_2_2))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola:
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 11 will run for 451 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: 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: processed formula length: 257
lola: 2 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((((pb_d1_n1_2_1_1_1_3 <= 1) AND (pil_d1_n1_3_3_1_2_1 <= 0)) OR (1 <= pbl_3_1_3_2_1)) AND (((pb_d5_n2_1_3_2_2_1 <= 1) AND (po_d5_n1_1_2_2_2_1 <= 0)) OR ((pol_d3_n1_3_2_2_2_2 + 1 <= pil_d5_n1_2_3_2_2_1) AND (pb_d4_n2_3_2_2_2_1 + 1 <= pb_d3_n2_2_2_3_3_2))))
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-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 564 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: 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: processed formula length: 267
lola: 2 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((pi_d2_n1_3_2_3_2_2 + 1 <= pol_d3_n1_3_1_1_1_3) OR (pil_d5_n1_1_3_3_1_2 <= 2)) AND (po_d5_n1_1_3_2_3_3 + 1 <= pi_d2_n1_3_3_1_2_3) AND (((pil_d1_n1_2_2_3_3_2 <= 1) AND (pb_d2_n2_3_2_1_2_2 + 1 <= pol_d3_n1_1_1_3_2_2)) OR (pb_d2_n2_1_2_2_1_3 <= pb_d1_n1_1_3_2_1_1)))
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-12-0.sara

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 752 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: 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: processed formula length: 288
lola: 2 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((po_d1_n1_3_3_3_1_3 + 1 <= pb_d5_n1_3_1_2_3_1) AND (po_d4_n1_1_2_2_2_3 + 1 <= pol_d2_n1_3_2_3_3_3) AND (3 <= pi_d2_n1_2_2_2_2_2) AND (pol_d1_n1_3_1_2_3_2 + 1 <= pil_d3_n1_1_2_1_1_3) AND (pi_d4_n1_2_1_2_3_1 + 1 <= po_d3_n1_1_3_1_3_1) AND ((pi_d4_n1_3_3_1_1_2 <= 1) OR (pb_d3_n1_2_3_3_2_3 <= 2)))
lola: state equation: Generated DNF with 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-13-0.sara.
lola: sara is running 0 secs || 38124 markings, 38151 edges, 7625 markings/sec, 0 secs
lola: sara is running 5 secs || 71828 markings, 71886 edges, 6741 markings/sec, 5 secs
lola: sara is running 10 secs || 100296 markings, 100406 edges, 5694 markings/sec, 10 secs
lola: sara is running 15 secs || 120459 markings, 120581 edges, 4033 markings/sec, 15 secs
lola: sara is running 20 secs || 135582 markings, 135757 edges, 3025 markings/sec, 20 secs
lola: sara is running 25 secs || 148742 markings, 148917 edges, 2632 markings/sec, 25 secs
lola: sara is running 30 secs || 161525 markings, 161736 edges, 2557 markings/sec, 30 secs
lola: sara is running 35 secs || 172763 markings, 173139 edges, 2248 markings/sec, 35 secs
lola: sara is running 40 secs || 184107 markings, 184567 edges, 2269 markings/sec, 40 secs
lola: sara is running 45 secs || 195474 markings, 195977 edges, 2273 markings/sec, 45 secs
lola: sara is running 50 secs || 206879 markings, 207434 edges, 2281 markings/sec, 50 secs
lola: sara is running 55 secs || 218272 markings, 219284 edges, 2279 markings/sec, 55 secs
lola: sara is running 60 secs || 229740 markings, 230883 edges, 2294 markings/sec, 60 secs
lola: sara is running 65 secs || 241183 markings, 242460 edges, 2289 markings/sec, 65 secs
lola: sara is running 70 secs || 252658 markings, 254083 edges, 2295 markings/sec, 70 secs
lola: sara is running 75 secs || 262218 markings, 264054 edges, 1912 markings/sec, 75 secs
lola: sara is running 80 secs || 266943 markings, 269251 edges, 945 markings/sec, 80 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 85 secs || 271554 markings, 274368 edges, 922 markings/sec, 85 secs
lola: sara is running 90 secs || 276146 markings, 279470 edges, 918 markings/sec, 90 secs
lola: sara is running 95 secs || 280877 markings, 284717 edges, 946 markings/sec, 95 secs
lola: sara is running 100 secs || 285378 markings, 289722 edges, 900 markings/sec, 100 secs

lola: sara is running 105 secs || 289944 markings, 294798 edges, 913 markings/sec, 105 secs
lola: sara is running 110 secs || 294576 markings, 299918 edges, 926 markings/sec, 110 secs
lola: sara is running 115 secs || 299225 markings, 305094 edges, 930 markings/sec, 115 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1067 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: 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: processed formula length: 302
lola: 1 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola:
FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (((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: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-14-0.sara
lola: ========================================
lola: subprocess 15 will run for 2134 seconds at most (--localtimelimit=0)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: 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: processed formula length: 359
lola: 2 rewrites
lola: closed formula file HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((pb_d1_n2_2_2_1_2_2 + 1 <= pi_d4_n1_3_3_3_1_2) AND (po_d4_n1_3_3_2_1_3 <= 1) AND ((pb_d4_n2_1_1_1_3_1 + 1 <= pol_d1_n1_1_1_1_1_1) OR (pil_d2_n1_1_3_1_2_3 + 1 <= pi_d1_n1_3_3_2_1_1))) OR ((pol_d1_n1_2_3_1_3_3 <= 2) AND (pb_d4_n2_3_1_3_2_3 + 1 <= po_d1_n1_3_2_3_3_1) AND ((pil_d3_n1_2_3_3_2_3 + 1 <= pb_d5_n2_2_2_2_3_1) OR (pb_d2_n2_3_2_1_2_1 + 1 <= pb_d1_n2_2_1_1_1_3))))
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 12 markings, 11 edges

FORMULA HypertorusGrid-PT-d5k3p2b10-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes no no no no yes no no no yes yes no yes
lola:
preliminary result: yes no yes yes no no no no yes no no no yes yes no yes
lola: ========================================
lola: memory consumption: 74532 KB
lola: time consumption: 1435 seconds

BK_TIME_CONFINEMENT_REACHED

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HypertorusGrid-PT-d5k3p2b10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
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 lola"
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 r100-smll-152658630800166"
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 ;