About the Execution of LoLA for HypercubeGrid-PT-C5K3P3B15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 986.200 | 3600000.00 | 2164928.00 | 7696.20 | TTTFTTTFFFFFFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 14M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is HypercubeGrid-PT-C5K3P3B15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630700124
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-00
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-01
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-02
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-03
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-04
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-05
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-06
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-07
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-08
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-09
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14
FORMULA_NAME HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526744746658
info: Time: 3600 - MCC
===========================================================================================
prep: translating HypercubeGrid-PT-C5K3P3B15 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating HypercubeGrid-PT-C5K3P3B15 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ HypercubeGrid-PT-C5K3P3B15 @ 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: 34263/65536 symbol table entries, 18076 collisions
lola: preprocessing...
lola: Size of bit vector: 292896
lola: finding significant places
lola: 9153 places, 25110 transitions, 5669 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 28593 transition conflict sets
lola: TASK
lola: reading formula from HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality.task
lola: A (G (((pi_d2_n1_2_4_3_3_1 <= pil_d5_n1_1_1_2_3_2) OR (po_d4_n1_3_3_1_2_1 <= pb_d2_n2_1_3_3_1_2) OR (pol_d4_n1_2_1_2_1_1 <= 1) OR (pil_d3_n1_2_1_1_3_1 + 1 <= pol_d1_n1_4_2_3_3_3)))) : E (F ((pol_d3_n1_3_2_1_3_2 + 1 <= pi_d3_n1_1_3_3_1_3))) : E (F (((pol_d1_n1_3_2_3_1_1 <= 1) AND (pb_d3_n2_3_1_2_3_3 <= 0) AND (pil_d4_n1_2_1_2_2_2 <= pi_d2_n1_1_2_2_1_3)))) : A (G ((1 <= pb_d4_n2_2_2_1_2_2))) : E (F (((1 <= po_d1_n1_4_1_1_3_3) AND (pb_d5_n1_2_3_1_1_1 <= pb_d2_n1_1_3_2_2_1) AND (pi_d4_n1_3_3_3_4_2 + 1 <= pb_d2_n2_1_3_3_3_3) AND ((3 <= pb_d2_n2_2_2_1_2_1) OR (pi_d5_n1_3_2_3_2_2 <= pol_d2_n1_3_4_2_1_2)) AND (pol_d2_n1_2_4_2_1_3 + 1 <= pil_d4_n1_3_1_3_2_1)))) : A (G (((pol_d2_n1_2_1_3_2_1 <= 2) OR (pi_d2_n1_2_4_2_2_3 <= 1) OR (3 <= po_d1_n1_2_2_1_2_3)))) : E (F ((((pol_d5_n1_1_1_1_3_3 <= pol_d5_n1_2_1_1_3_3) AND (pb_d4_n1_2_3_1_1_2 <= pol_d2_n1_2_4_3_3_2) AND ((2 <= pol_d5_n1_2_2_1_2_3) OR (po_d2_n1_3_3_1_1_1 <= po_d1_n1_4_2_2_1_2))) OR (2 <= po_d4_n1_2_1_3_1_1)))) : A (G (((3 <= po_d1_n1_2_1_3_2_2) OR (1 <= po_d4_n1_2_1_1_1_3) OR (1 <= pb_d5_n1_3_3_1_1_2) OR (po_d1_n1_1_1_3_1_3 <= pb_d2_n2_2_3_1_1_3) OR (pil_d4_n1_3_1_3_1_2 <= pol_d2_n1_3_4_1_3_1)))) : E (F (((2 <= pb_d4_n2_1_2_1_1_2) AND (3 <= pil_d1_n1_3_2_3_2_3) AND (1 <= pi_d5_n1_2_3_2_1_4)))) : A (G (((po_d3_n1_1_2_4_3_2 <= pol_d5_n1_1_1_1_3_4) OR ((2 <= po_d4_n1_3_2_3_4_2) AND (1 <= pil_d5_n1_3_1_3_3_1)) OR (2 <= po_d1_n1_3_2_2_2_2)))) : A (G (((po_d5_n1_3_3_3_1_1 <= pil_d1_n1_2_2_3_3_3) OR (pb_d5_n2_1_3_3_1_3 <= pb_d3_n2_3_2_3_1_1) OR (3 <= pbl_3_3_2_3_1) OR ((pil_d5_n1_1_2_1_3_4 + 1 <= pi_d4_n1_1_2_3_1_2) AND ((pi_d5_n1_1_2_1_3_2 <= pi_d3_n1_1_3_4_2_3) OR (2 <= pil_d2_n1_2_4_3_3_1)))))) : A (G (((pol_d4_n1_3_3_3_2_1 <= pb_d3_n1_2_3_2_3_3) OR (pil_d2_n1_2_3_2_1_3 <= pol_d1_n1_3_3_3_3_2)))) : E (F (((3 <= pol_d3_n1_2_2_4_3_2) AND (pil_d2_n1_2_4_3_3_1 <= pb_d4_n1_1_2_3_1_1) AND (pil_d1_n1_1_3_1_2_1 + 1 <= pol_d2_n1_2_3_1_1_3) AND ((po_d2_n1_2_1_3_3_2 + 1 <= pil_d3_n1_3_3_2_1_3) OR (pb_d1_n1_3_1_1_3_3 <= 0))))) : E (F (((3 <= pi_d1_n1_2_3_2_3_2) OR (2 <= po_d4_n1_3_2_2_4_2) OR (3 <= po_d2_n1_3_2_3_2_2) OR ((pb_d2_n2_2_1_3_2_2 <= pil_d3_n1_2_1_3_2_2) AND ((1 <= pb_d1_n2_1_2_3_3_3) OR (po_d2_n1_1_3_3_2_1 <= pb_d2_n2_2_1_3_3_2)))))) : E (F ((pil_d2_n1_2_2_1_2_1 + 1 <= po_d5_n1_3_2_1_3_1))) : A (G (((pb_d5_n1_2_1_1_2_1 + 1 <= po_d1_n1_1_3_2_1_3) OR (pil_d1_n1_1_1_3_2_3 + 1 <= pil_d3_n1_2_1_4_3_1) OR (pol_d2_n1_3_1_1_3_2 <= pol_d1_n1_1_3_1_3_3) OR (po_d5_n1_1_1_2_1_2 <= pil_d2_n1_1_1_3_1_3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pb_d4_n2_2_2_1_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= pb_d4_n2_2_2_1_2_2)))
lola: processed formula length: 33
lola: 2 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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_d4_n2_2_2_1_2_2 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-0.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: 6 markings, 5 edges
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pol_d3_n1_3_2_1_3_2 + 1 <= pi_d3_n1_1_3_3_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((pol_d3_n1_3_2_1_3_2 + 1 <= pi_d3_n1_1_3_3_1_3)))
lola: processed formula length: 55
lola: 1 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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: (pol_d3_n1_3_2_1_3_2 + 1 <= pi_d3_n1_1_3_3_1_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 203 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pil_d2_n1_2_2_1_2_1 + 1 <= po_d5_n1_3_2_1_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((pil_d2_n1_2_2_1_2_1 + 1 <= po_d5_n1_3_2_1_3_1)))
lola: processed formula length: 55
lola: 1 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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_2_1_2_1 + 1 <= po_d5_n1_3_2_1_3_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-2-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pb_d4_n2_1_2_1_1_2) AND (3 <= pil_d1_n1_3_2_3_2_3) AND (1 <= pi_d5_n1_2_3_2_1_4))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((2 <= pb_d4_n2_1_2_1_1_2) AND (3 <= pil_d1_n1_3_2_3_2_3) AND (1 <= pi_d5_n1_2_3_2_1_4))))
lola: processed formula length: 96
lola: 1 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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 <= pb_d4_n2_1_2_1_1_2) AND (3 <= pil_d1_n1_3_2_3_2_3) AND (1 <= pi_d5_n1_2_3_2_1_4))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-3-0.sara.
lola: sara is running 0 secs || 45597 markings, 45988 edges, 9119 markings/sec, 0 secs
lola: sara is running 5 secs || 75841 markings, 76317 edges, 6049 markings/sec, 5 secs
lola: sara is running 10 secs || 100159 markings, 101410 edges, 4864 markings/sec, 10 secs
lola: sara is running 15 secs || 121109 markings, 122444 edges, 4190 markings/sec, 15 secs
lola: sara is running 20 secs || 139545 markings, 140928 edges, 3687 markings/sec, 20 secs
lola: sara is running 25 secs || 156779 markings, 158309 edges, 3447 markings/sec, 25 secs
lola: sara is running 30 secs || 174405 markings, 176212 edges, 3525 markings/sec, 30 secs
lola: sara is running 35 secs || 192144 markings, 194187 edges, 3548 markings/sec, 35 secs
lola: sara is running 40 secs || 209411 markings, 211676 edges, 3453 markings/sec, 40 secs
lola: sara is running 45 secs || 228641 markings, 230994 edges, 3846 markings/sec, 45 secs
lola: sara is running 50 secs || 248424 markings, 250778 edges, 3957 markings/sec, 50 secs
lola: sara is running 55 secs || 268216 markings, 270569 edges, 3958 markings/sec, 55 secs
lola: sara is running 60 secs || 287891 markings, 290244 edges, 3935 markings/sec, 60 secs
lola: sara is running 65 secs || 307571 markings, 309925 edges, 3936 markings/sec, 65 secs
lola: sara is running 70 secs || 327474 markings, 329848 edges, 3981 markings/sec, 70 secs
lola: sara is running 75 secs || 347271 markings, 349645 edges, 3959 markings/sec, 75 secs
lola: sara is running 80 secs || 366806 markings, 369181 edges, 3907 markings/sec, 80 secs
lola: sara is running 85 secs || 386496 markings, 388894 edges, 3938 markings/sec, 85 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 90 secs || 406292 markings, 408707 edges, 3959 markings/sec, 90 secs
lola: sara is running 95 secs || 426058 markings, 428476 edges, 3953 markings/sec, 95 secs
lola: sara is running 100 secs || 445845 markings, 448418 edges, 3957 markings/sec, 100 secs
lola: sara is running 105 secs || 465220 markings, 469633 edges, 3875 markings/sec, 105 secs
lola: sara is running 110 secs || 484272 markings, 491559 edges, 3810 markings/sec, 110 secs
lola: sara is running 115 secs || 503094 markings, 514176 edges, 3764 markings/sec, 115 secs
lola: sara is running 120 secs || 521611 markings, 537486 edges, 3703 markings/sec, 120 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pol_d2_n1_2_1_3_2_1 <= 2) OR (pi_d2_n1_2_4_2_2_3 <= 1) OR (3 <= po_d1_n1_2_2_1_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((pol_d2_n1_2_1_3_2_1 <= 2) OR (pi_d2_n1_2_4_2_2_3 <= 1) OR (3 <= po_d1_n1_2_2_1_2_3))))
lola: processed formula length: 96
lola: 2 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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: ((3 <= pol_d2_n1_2_1_3_2_1) AND (2 <= pi_d2_n1_2_4_2_2_3) AND (po_d1_n1_2_2_1_2_3 <= 2))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-4-0.sara.
lola: sara is running 0 secs || 42480 markings, 43326 edges, 8496 markings/sec, 0 secs
lola: sara is running 5 secs || 68952 markings, 70200 edges, 5294 markings/sec, 5 secs
lola: sara is running 10 secs || 92052 markings, 93493 edges, 4620 markings/sec, 10 secs
lola: sara is running 15 secs || 111469 markings, 113026 edges, 3883 markings/sec, 15 secs
lola: sara is running 20 secs || 129463 markings, 131409 edges, 3599 markings/sec, 20 secs
lola: sara is running 25 secs || 146913 markings, 148928 edges, 3490 markings/sec, 25 secs
lola: sara is running 30 secs || 163374 markings, 165698 edges, 3292 markings/sec, 30 secs
lola: sara is running 35 secs || 179413 markings, 181970 edges, 3208 markings/sec, 35 secs
lola: sara is running 40 secs || 193978 markings, 196692 edges, 2913 markings/sec, 40 secs
lola: sara is running 45 secs || 207594 markings, 211355 edges, 2723 markings/sec, 45 secs
lola: sara is running 50 secs || 221269 markings, 225838 edges, 2735 markings/sec, 50 secs
lola: sara is running 55 secs || 235202 markings, 240000 edges, 2787 markings/sec, 55 secs
lola: sara is running 60 secs || 249164 markings, 254115 edges, 2792 markings/sec, 60 secs
lola: sara is running 65 secs || 263169 markings, 268303 edges, 2801 markings/sec, 65 secs
lola: sara is running 70 secs || 277213 markings, 282402 edges, 2809 markings/sec, 70 secs
lola: sara is running 75 secs || 290498 markings, 295879 edges, 2657 markings/sec, 75 secs
lola: sara is running 80 secs || 303716 markings, 309831 edges, 2644 markings/sec, 80 secs
lola: sara is running 85 secs || 316965 markings, 323553 edges, 2650 markings/sec, 85 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 90 secs || 330152 markings, 337521 edges, 2637 markings/sec, 90 secs
lola: sara is running 95 secs || 343278 markings, 351323 edges, 2625 markings/sec, 95 secs
lola: sara is running 100 secs || 356377 markings, 365089 edges, 2620 markings/sec, 100 secs
lola: sara is running 105 secs || 369760 markings, 379194 edges, 2677 markings/sec, 105 secs
lola: sara is running 110 secs || 383232 markings, 393219 edges, 2694 markings/sec, 110 secs
lola: sara is running 115 secs || 396862 markings, 407452 edges, 2726 markings/sec, 115 secs
lola: sara is running 120 secs || 410160 markings, 421276 edges, 2660 markings/sec, 120 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pol_d4_n1_3_3_3_2_1 <= pb_d3_n1_2_3_2_3_3) OR (pil_d2_n1_2_3_2_1_3 <= pol_d1_n1_3_3_3_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((pol_d4_n1_3_3_3_2_1 <= pb_d3_n1_2_3_2_3_3) OR (pil_d2_n1_2_3_2_1_3 <= pol_d1_n1_3_3_3_3_2))))
lola: processed formula length: 102
lola: 2 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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_d3_n1_2_3_2_3_3 + 1 <= pol_d4_n1_3_3_3_2_1) AND (pol_d1_n1_3_3_3_3_2 + 1 <= pil_d2_n1_2_3_2_1_3))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 259 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((pol_d1_n1_3_2_3_1_1 <= 1) AND (pb_d3_n2_3_1_2_3_3 <= 0) AND (pil_d4_n1_2_1_2_2_2 <= pi_d2_n1_1_2_2_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((pol_d1_n1_3_2_3_1_1 <= 1) AND (pb_d3_n2_3_1_2_3_3 <= 0) AND (pil_d4_n1_2_1_2_2_2 <= pi_d2_n1_1_2_2_1_3))))
lola: processed formula length: 114
lola: 1 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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: ((pol_d1_n1_3_2_3_1_1 <= 1) AND (pb_d3_n2_3_1_2_3_3 <= 0) AND (pil_d4_n1_2_1_2_2_2 <= pi_d2_n1_1_2_2_1_3))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-6-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 7 markings, 6 edges
lola:
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((po_d3_n1_1_2_4_3_2 <= pol_d5_n1_1_1_1_3_4) OR ((2 <= po_d4_n1_3_2_3_4_2) AND (1 <= pil_d5_n1_3_1_3_3_1)) OR (2 <= po_d1_n1_3_2_2_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((po_d3_n1_1_2_4_3_2 <= pol_d5_n1_1_1_1_3_4) OR ((2 <= po_d4_n1_3_2_3_4_2) AND (1 <= pil_d5_n1_3_1_3_3_1)) OR (2 <= po_d1_n1_3_2_2_2_2))))
lola: processed formula length: 146
lola: 2 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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: ((pol_d5_n1_1_1_1_3_4 + 1 <= po_d3_n1_1_2_4_3_2) AND ((po_d4_n1_3_2_3_4_2 <= 1) OR (pil_d5_n1_3_1_3_3_1 <= 0)) AND (po_d1_n1_3_2_2_2_2 <= 1))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-7-0.sara.
lola: sara is running 0 secs || 36817 markings, 37045 edges, 7363 markings/sec, 0 secs
lola: sara is running 5 secs || 64360 markings, 64871 edges, 5509 markings/sec, 5 secs
lola: sara is running 10 secs || 89893 markings, 90812 edges, 5107 markings/sec, 10 secs
lola: sara is running 15 secs || 115387 markings, 116614 edges, 5099 markings/sec, 15 secs
lola: sara is running 20 secs || 140724 markings, 142272 edges, 5067 markings/sec, 20 secs
lola: sara is running 25 secs || 167127 markings, 168737 edges, 5281 markings/sec, 25 secs
lola: sara is running 30 secs || 193730 markings, 195340 edges, 5321 markings/sec, 30 secs
lola: sara is running 35 secs || 220237 markings, 221847 edges, 5301 markings/sec, 35 secs
lola: sara is running 40 secs || 246559 markings, 248169 edges, 5264 markings/sec, 40 secs
lola: sara is running 45 secs || 272821 markings, 274452 edges, 5252 markings/sec, 45 secs
lola: sara is running 50 secs || 298747 markings, 300377 edges, 5185 markings/sec, 50 secs
lola: sara is running 55 secs || 324347 markings, 326064 edges, 5120 markings/sec, 55 secs
lola: sara is running 60 secs || 349758 markings, 351484 edges, 5082 markings/sec, 60 secs
lola: sara is running 65 secs || 375064 markings, 376809 edges, 5061 markings/sec, 65 secs
lola: sara is running 70 secs || 400326 markings, 402072 edges, 5052 markings/sec, 70 secs
lola: sara is running 75 secs || 425528 markings, 427297 edges, 5040 markings/sec, 75 secs
lola: sara is running 80 secs || 450550 markings, 452320 edges, 5004 markings/sec, 80 secs
lola: sara is running 85 secs || 475581 markings, 477368 edges, 5006 markings/sec, 85 secs
lola: sara is running 90 secs || 500551 markings, 502355 edges, 4994 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 525439 markings, 527277 edges, 4978 markings/sec, 95 secs
lola: sara is running 100 secs || 550378 markings, 552288 edges, 4988 markings/sec, 100 secs
lola: sara is running 105 secs || 575305 markings, 577231 edges, 4985 markings/sec, 105 secs
lola: sara is running 110 secs || 600254 markings, 602186 edges, 4990 markings/sec, 110 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pi_d2_n1_2_4_3_3_1 <= pil_d5_n1_1_1_2_3_2) OR (po_d4_n1_3_3_1_2_1 <= pb_d2_n2_1_3_3_1_2) OR (pol_d4_n1_2_1_2_1_1 <= 1) OR (pil_d3_n1_2_1_1_3_1 + 1 <= pol_d1_n1_4_2_3_3_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((pi_d2_n1_2_4_3_3_1 <= pil_d5_n1_1_1_2_3_2) OR (po_d4_n1_3_3_1_2_1 <= pb_d2_n2_1_3_3_1_2) OR (pol_d4_n1_2_1_2_1_1 <= 1) OR (pil_d3_n1_2_1_1_3_1 + 1 <= pol_d1_n1_4_2_3_3_3))))
lola: processed formula length: 184
lola: 2 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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: ((pil_d5_n1_1_1_2_3_2 + 1 <= pi_d2_n1_2_4_3_3_1) AND (pb_d2_n2_1_3_3_1_2 + 1 <= po_d4_n1_3_3_1_2_1) AND (2 <= pol_d4_n1_2_1_2_1_1) AND (pol_d1_n1_4_2_3_3_3 <= pil_d3_n1_2_1_1_3_1))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-8-0.sara.
lola: sara is running 0 secs || 33988 markings, 34335 edges, 6798 markings/sec, 0 secs
lola: sara is running 5 secs || 60337 markings, 60694 edges, 5270 markings/sec, 5 secs
lola: sara is running 10 secs || 80888 markings, 81268 edges, 4110 markings/sec, 10 secs
lola: sara is running 15 secs || 99205 markings, 99585 edges, 3663 markings/sec, 15 secs
lola: sara is running 20 secs || 114071 markings, 114568 edges, 2973 markings/sec, 20 secs
lola: sara is running 25 secs || 128265 markings, 128854 edges, 2839 markings/sec, 25 secs
lola: sara is running 30 secs || 142345 markings, 142970 edges, 2816 markings/sec, 30 secs
lola: sara is running 35 secs || 155648 markings, 156432 edges, 2661 markings/sec, 35 secs
lola: sara is running 40 secs || 168776 markings, 170202 edges, 2626 markings/sec, 40 secs
lola: sara is running 45 secs || 182052 markings, 183518 edges, 2655 markings/sec, 45 secs
lola: sara is running 50 secs || 195149 markings, 196691 edges, 2619 markings/sec, 50 secs
lola: sara is running 55 secs || 208239 markings, 209860 edges, 2618 markings/sec, 55 secs
lola: sara is running 60 secs || 221378 markings, 223128 edges, 2628 markings/sec, 60 secs
lola: sara is running 65 secs || 234622 markings, 236504 edges, 2649 markings/sec, 65 secs
lola: sara is running 70 secs || 247949 markings, 249948 edges, 2665 markings/sec, 70 secs
lola: sara is running 75 secs || 261161 markings, 263248 edges, 2642 markings/sec, 75 secs
lola: sara is running 80 secs || 274445 markings, 276619 edges, 2657 markings/sec, 80 secs
lola: sara is running 85 secs || 287661 markings, 289950 edges, 2643 markings/sec, 85 secs
lola: sara is running 90 secs || 300813 markings, 303284 edges, 2630 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 313924 markings, 316577 edges, 2622 markings/sec, 95 secs
lola: sara is running 100 secs || 327022 markings, 329858 edges, 2620 markings/sec, 100 secs
lola: sara is running 105 secs || 340044 markings, 343395 edges, 2604 markings/sec, 105 secs
lola: sara is running 110 secs || 352991 markings, 356439 edges, 2589 markings/sec, 110 secs
lola: sara is running 115 secs || 364757 markings, 368413 edges, 2353 markings/sec, 115 secs
lola: sara is running 120 secs || 377274 markings, 381046 edges, 2503 markings/sec, 120 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 336 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= po_d1_n1_2_1_3_2_2) OR (1 <= po_d4_n1_2_1_1_1_3) OR (1 <= pb_d5_n1_3_3_1_1_2) OR (po_d1_n1_1_1_3_1_3 <= pb_d2_n2_2_3_1_1_3) OR (pil_d4_n1_3_1_3_1_2 <= pol_d2_n1_3_4_1_3_1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((3 <= po_d1_n1_2_1_3_2_2) OR (1 <= po_d4_n1_2_1_1_1_3) OR (1 <= pb_d5_n1_3_3_1_1_2) OR (po_d1_n1_1_1_3_1_3 <= pb_d2_n2_2_3_1_1_3) OR (pil_d4_n1_3_1_3_1_2 <= pol_d2_n1_3_4_1_3_1))))
lola: processed formula length: 191
lola: 2 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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_2_1_3_2_2 <= 2) AND (po_d4_n1_2_1_1_1_3 <= 0) AND (pb_d5_n1_3_3_1_1_2 <= 0) AND (pb_d2_n2_2_3_1_1_3 + 1 <= po_d1_n1_1_1_3_1_3) AND (pol_d2_n1_3_4_1_3_1 + 1 <= pil_d4_n1_3_1_3_1_2))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 17 markings, 16 edges
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pol_d3_n1_2_2_4_3_2) AND (pil_d2_n1_2_4_3_3_1 <= pb_d4_n1_1_2_3_1_1) AND (pil_d1_n1_1_3_1_2_1 + 1 <= pol_d2_n1_2_3_1_1_3) AND ((po_d2_n1_2_1_3_3_2 + 1 <= pil_d3_n1_3_3_2_1_3) OR (pb_d1_n1_3_1_1_3_3 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((3 <= pol_d3_n1_2_2_4_3_2) AND (pil_d2_n1_2_4_3_3_1 <= pb_d4_n1_1_2_3_1_1) AND (pil_d1_n1_1_3_1_2_1 + 1 <= pol_d2_n1_2_3_1_1_3) AND ((po_d2_n1_2_1_3_3_2 + 1 <= pil_d3_n1_3_3_2_1_3) OR (pb_d1_n1_3_1_1_3_3 <= 0)))))
lola: processed formula length: 221
lola: 1 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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 <= pol_d3_n1_2_2_4_3_2) AND (pil_d2_n1_2_4_3_3_1 <= pb_d4_n1_1_2_3_1_1) AND (pil_d1_n1_1_3_1_2_1 + 1 <= pol_d2_n1_2_3_1_1_3) AND ((po_d2_n1_2_1_3_3_2 + 1 <= pil_d3_n1_3_3_2_1_3) OR (pb_d1_n1_3_1_1_3_3 <= 0)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10-0.sara.
lola: sara is running 0 secs || 34028 markings, 34800 edges, 6806 markings/sec, 0 secs
lola: sara is running 5 secs || 69945 markings, 71671 edges, 7183 markings/sec, 5 secs
lola: sara is running 10 secs || 111905 markings, 113768 edges, 8392 markings/sec, 10 secs
lola: sara is running 15 secs || 137578 markings, 140311 edges, 5135 markings/sec, 15 secs
lola: sara is running 20 secs || 164715 markings, 167872 edges, 5427 markings/sec, 20 secs
lola: sara is running 25 secs || 185289 markings, 188583 edges, 4115 markings/sec, 25 secs
lola: sara is running 30 secs || 202909 markings, 206357 edges, 3524 markings/sec, 30 secs
lola: sara is running 35 secs || 220486 markings, 224210 edges, 3515 markings/sec, 35 secs
lola: sara is running 40 secs || 238025 markings, 242403 edges, 3508 markings/sec, 40 secs
lola: sara is running 45 secs || 255080 markings, 259903 edges, 3411 markings/sec, 45 secs
lola: sara is running 50 secs || 270149 markings, 275162 edges, 3014 markings/sec, 50 secs
lola: sara is running 55 secs || 284293 markings, 289561 edges, 2829 markings/sec, 55 secs
lola: sara is running 60 secs || 297168 markings, 302476 edges, 2575 markings/sec, 60 secs
lola: sara is running 65 secs || 308711 markings, 314113 edges, 2309 markings/sec, 65 secs
lola: sara is running 70 secs || 319769 markings, 325444 edges, 2212 markings/sec, 70 secs
lola: sara is running 75 secs || 330202 markings, 335922 edges, 2087 markings/sec, 75 secs
lola: sara is running 80 secs || 340420 markings, 346206 edges, 2044 markings/sec, 80 secs
lola: sara is running 85 secs || 350210 markings, 356347 edges, 1958 markings/sec, 85 secs
lola: sara is running 90 secs || 359975 markings, 366298 edges, 1953 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 369485 markings, 376003 edges, 1902 markings/sec, 95 secs
lola: sara is running 100 secs || 379151 markings, 386290 edges, 1933 markings/sec, 100 secs
lola: sara is running 105 secs || 388601 markings, 396326 edges, 1890 markings/sec, 105 secs
lola: sara is running 110 secs || 398108 markings, 406156 edges, 1901 markings/sec, 110 secs
lola: sara is running 115 secs || 407675 markings, 415805 edges, 1913 markings/sec, 115 secs
lola: sara is running 120 secs || 417313 markings, 425546 edges, 1928 markings/sec, 120 secs
lola: sara is running 125 secs || 426901 markings, 435266 edges, 1918 markings/sec, 125 secs
lola: sara is running 130 secs || 436413 markings, 444987 edges, 1902 markings/sec, 130 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= pi_d1_n1_2_3_2_3_2) OR (2 <= po_d4_n1_3_2_2_4_2) OR (3 <= po_d2_n1_3_2_3_2_2) OR ((pb_d2_n2_2_1_3_2_2 <= pil_d3_n1_2_1_3_2_2) AND ((1 <= pb_d1_n2_1_2_3_3_3) OR (po_d2_n1_1_3_3_2_1 <= pb_d2_n2_2_1_3_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((3 <= pi_d1_n1_2_3_2_3_2) OR (2 <= po_d4_n1_3_2_2_4_2) OR (3 <= po_d2_n1_3_2_3_2_2) OR ((pb_d2_n2_2_1_3_2_2 <= pil_d3_n1_2_1_3_2_2) AND ((1 <= pb_d1_n2_1_2_3_3_3) OR (po_d2_n1_1_3_3_2_1 <= pb_d2_n2_2_1_3_3_2))))))
lola: processed formula length: 224
lola: 1 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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 <= pi_d1_n1_2_3_2_3_2) OR (2 <= po_d4_n1_3_2_2_4_2) OR (3 <= po_d2_n1_3_2_3_2_2) OR ((pb_d2_n2_2_1_3_2_2 <= pil_d3_n1_2_1_3_2_2) AND ((1 <= pb_d1_n2_1_2_3_3_3) OR (po_d2_n1_1_3_3_2_1 <= pb_d2_n2_2_1_3_3_2))))
lola: state equation: Generated DNF with 7 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-11-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 30 markings, 29 edges
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 554 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((pol_d5_n1_1_1_1_3_3 <= pol_d5_n1_2_1_1_3_3) AND (pb_d4_n1_2_3_1_1_2 <= pol_d2_n1_2_4_3_3_2) AND ((2 <= pol_d5_n1_2_2_1_2_3) OR (po_d2_n1_3_3_1_1_1 <= po_d1_n1_4_2_2_1_2))) OR (2 <= po_d4_n1_2_1_3_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((pol_d5_n1_1_1_1_3_3 <= pol_d5_n1_2_1_1_3_3) AND (pb_d4_n1_2_3_1_1_2 <= pol_d2_n1_2_4_3_3_2) AND ((2 <= pol_d5_n1_2_2_1_2_3) OR (po_d2_n1_3_3_1_1_1 <= po_d1_n1_4_2_2_1_2))) OR (2 <= po_d4_n1_2_1_3_1_1))))
lola: processed formula length: 214
lola: 1 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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: (((pol_d5_n1_1_1_1_3_3 <= pol_d5_n1_2_1_1_3_3) AND (pb_d4_n1_2_3_1_1_2 <= pol_d2_n1_2_4_3_3_2) AND ((2 <= pol_d5_n1_2_2_1_2_3) OR (po_d2_n1_3_3_1_1_1 <= po_d1_n1_4_2_2_1_2))) OR (2 <= po_d4_n1_2_1_3_1_1))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-12-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 738 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pb_d5_n1_2_1_1_2_1 + 1 <= po_d1_n1_1_3_2_1_3) OR (pil_d1_n1_1_1_3_2_3 + 1 <= pil_d3_n1_2_1_4_3_1) OR (pol_d2_n1_3_1_1_3_2 <= pol_d1_n1_1_3_1_3_3) OR (po_d5_n1_1_1_2_1_2 <= pil_d2_n1_1_1_3_1_3))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((pb_d5_n1_2_1_1_2_1 + 1 <= po_d1_n1_1_3_2_1_3) OR (pil_d1_n1_1_1_3_2_3 + 1 <= pil_d3_n1_2_1_4_3_1) OR (pol_d2_n1_3_1_1_3_2 <= pol_d1_n1_1_3_1_3_3) OR (po_d5_n1_1_1_2_1_2 <= pil_d2_n1_1_1_3_1_3))))
lola: processed formula length: 206
lola: 2 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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_1_3_2_1_3 <= pb_d5_n1_2_1_1_2_1) AND (pil_d3_n1_2_1_4_3_1 <= pil_d1_n1_1_1_3_2_3) AND (pol_d1_n1_1_3_1_3_3 + 1 <= pol_d2_n1_3_1_1_3_2) AND (pil_d2_n1_1_1_3_1_3 + 1 <= po_d5_n1_1_1_2_1_2))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 14 will run for 1108 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((po_d5_n1_3_3_3_1_1 <= pil_d1_n1_2_2_3_3_3) OR (pb_d5_n2_1_3_3_1_3 <= pb_d3_n2_3_2_3_1_1) OR (3 <= pbl_3_3_2_3_1) OR ((pil_d5_n1_1_2_1_3_4 + 1 <= pi_d4_n1_1_2_3_1_2) AND ((pi_d5_n1_1_2_1_3_2 <= pi_d3_n1_1_3_4_2_3) OR (2 <= pil_d2_n1_2_4_3_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((po_d5_n1_3_3_3_1_1 <= pil_d1_n1_2_2_3_3_3) OR (pb_d5_n2_1_3_3_1_3 <= pb_d3_n2_3_2_3_1_1) OR (3 <= pbl_3_3_2_3_1) OR ((pil_d5_n1_1_2_1_3_4 + 1 <= pi_d4_n1_1_2_3_1_2) AND ((pi_d5_n1_1_2_1_3_2 <= pi_d3_n1_1_3_4_2_3) OR (2 <= pil_d2_n1_2_4_3_3_1))))))
lola: processed formula length: 259
lola: 2 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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)
sara: try reading problem file HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-13-0.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((pil_d1_n1_2_2_3_3_3 + 1 <= po_d5_n1_3_3_3_1_1) AND (pb_d3_n2_3_2_3_1_1 + 1 <= pb_d5_n2_1_3_3_1_3) AND (pbl_3_3_2_3_1 <= 2) AND ((pi_d4_n1_1_2_3_1_2 <= pil_d5_n1_1_2_1_3_4) OR ((pi_d3_n1_1_3_4_2_3 + 1 <= pi_d5_n1_1_2_1_3_2) AND (pil_d2_n1_2_4_3_3_1 <= 1))))
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-14-0.sara
lola:
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 2216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= po_d1_n1_4_1_1_3_3) AND (pb_d5_n1_2_3_1_1_1 <= pb_d2_n1_1_3_2_2_1) AND (pi_d4_n1_3_3_3_4_2 + 1 <= pb_d2_n2_1_3_3_3_3) AND ((3 <= pb_d2_n2_2_2_1_2_1) OR (pi_d5_n1_3_2_3_2_2 <= pol_d2_n1_3_4_2_1_2)) AND (pol_d2_n1_2_4_2_1_3 + 1 <= pil_d4_n1_3_1_3_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((1 <= po_d1_n1_4_1_1_3_3) AND (pb_d5_n1_2_3_1_1_1 <= pb_d2_n1_1_3_2_2_1) AND (pi_d4_n1_3_3_3_4_2 + 1 <= pb_d2_n2_1_3_3_3_3) AND ((3 <= pb_d2_n2_2_2_1_2_1) OR (pi_d5_n1_3_2_3_2_2 <= pol_d2_n1_3_4_2_1_2)) AND (pol_d2_n1_2_4_2_1_3 + 1 <= pil_d4_n1_3_1_3_2_1))))
lola: processed formula length: 266
lola: 1 rewrites
lola: closed formula file HypercubeGrid-PT-C5K3P3B15-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 <= po_d1_n1_4_1_1_3_3) AND (pb_d5_n1_2_3_1_1_1 <= pb_d2_n1_1_3_2_2_1) AND (pi_d4_n1_3_3_3_4_2 + 1 <= pb_d2_n2_1_3_3_3_3) AND ((3 <= pb_d2_n2_2_2_1_2_1) OR (pi_d5_n1_3_2_3_2_2 <= pol_d2_n1_3_4_2_1_2)) AND (pol_d2_n1_2_4_2_1_3 + 1 <= pil_d4_n1_3_1_3_2_1))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: ========================================
FORMULA HypercubeGrid-PT-C5K3P3B15-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes yes no no no no no no yes yes no
lola:
preliminary result: yes yes yes no yes yes yes no no no no no no yes yes no
lola: memory consumption: 74024 KB
lola: time consumption: 1353 seconds
sara: place or transition ordering is non-deterministic
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="HypercubeGrid-PT-C5K3P3B15"
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/HypercubeGrid-PT-C5K3P3B15.tgz
mv HypercubeGrid-PT-C5K3P3B15 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is HypercubeGrid-PT-C5K3P3B15, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r100-smll-152658630700124"
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 ;