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 700K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 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 2.7K 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.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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 4.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 522K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is HypertorusGrid-PT-d3k3p2b06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630800152
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526763126510

info: Time: 3600 - MCC
===========================================================================================
prep: translating HypertorusGrid-PT-d3k3p2b06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating HypertorusGrid-PT-d3k3p2b06 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ HypertorusGrid-PT-d3k3p2b06 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1485/65536 symbol table entries, 20 collisions
lola: preprocessing...
lola: Size of bit vector: 16416
lola: finding significant places
lola: 513 places, 972 transitions, 323 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1161 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (3 <= pi_d2_n1_1_1_1)
lola: LP says that atomic proposition is always false: (3 <= pi_d3_n1_2_2_1)
lola: LP says that atomic proposition is always false: (3 <= pol_d1_n1_2_2_1)
lola: LP says that atomic proposition is always false: (2 <= pil_d1_n1_3_1_2)
lola: LP says that atomic proposition is always false: (3 <= pi_d3_n1_2_2_3)
lola: LP says that atomic proposition is always false: (2 <= pil_d3_n1_3_1_1)
lola: LP says that atomic proposition is always false: (3 <= pi_d3_n1_3_1_3)
lola: LP says that atomic proposition is always false: (3 <= pol_d2_n1_3_3_1)
lola: A (G (())) : E (F ((pb_d1_n1_2_3_2 + 1 <= po_d2_n1_3_1_2))) : E (F (())) : A (G (TRUE)) : A (G (((pil_d3_n1_1_2_3 + 1 <= pb_d3_n2_1_3_3) OR (pb_d2_n2_3_2_1 <= 0) OR (1 <= pb_d3_n2_2_2_1)))) : E (F ((pbl_1_2_3 <= pi_d2_n1_2_1_3))) : A (G (((pi_d2_n1_2_1_3 + 1 <= pbl_2_2_2) OR (pbl_1_3_1 <= 1) OR (2 <= pb_d2_n1_2_1_3)))) : A (G (((po_d2_n1_1_3_3 <= pbl_1_3_3) OR (3 <= pb_d1_n2_3_2_1) OR (1 <= pi_d2_n1_3_3_1) OR (po_d1_n1_2_3_2 + 1 <= po_d2_n1_3_3_1) OR (pi_d3_n1_1_1_1 + 1 <= po_d2_n1_2_3_3)))) : A (G ((1 <= pb_d1_n2_2_1_1))) : A (G (TRUE)) : A (G (((po_d3_n1_1_1_2 <= pb_d3_n1_3_2_3)))) : A (G (((pb_d2_n1_2_2_2 <= pil_d1_n1_3_3_3) OR (po_d1_n1_2_2_1 <= pb_d3_n2_2_1_3)))) : A (G (((pil_d3_n1_1_1_2 <= pol_d1_n1_3_3_3) OR (pb_d2_n2_3_1_2 <= pb_d3_n2_1_1_2)))) : E (F (((2 <= pb_d1_n2_3_3_1) AND (pb_d2_n1_1_2_1 <= 0) AND (2 <= pb_d1_n1_3_2_1) AND (pi_d3_n1_2_1_2 <= pi_d2_n1_2_2_3) AND ((3 <= pbl_2_2_1) OR (po_d1_n1_3_2_2 <= po_d1_n1_3_3_3))))) : E (F (FALSE)) : A (G ((pb_d2_n1_3_3_2 <= 2)))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 15 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 15 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 15 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 15 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 15 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= pb_d1_n2_2_1_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 ((1 <= pb_d1_n2_2_1_1)))
lola: processed formula length: 29
lola: 17 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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_1_1 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-5-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((pb_d2_n1_3_3_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 ((pb_d2_n1_3_3_2 <= 2)))
lola: processed formula length: 29
lola: 17 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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 <= pb_d2_n1_3_3_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
sara: try reading problem file HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-5-0.sara.
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((po_d3_n1_1_1_2 <= pb_d3_n1_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 (((po_d3_n1_1_1_2 <= pb_d3_n1_3_2_3))))
lola: processed formula length: 44
lola: 17 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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_3_2_3 + 1 <= po_d3_n1_1_1_2))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d1_n1_2_3_2 + 1 <= po_d2_n1_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 ((pb_d1_n1_2_3_2 + 1 <= po_d2_n1_3_1_2)))
lola: processed formula length: 46
lola: 16 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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_d1_n1_2_3_2 + 1 <= po_d2_n1_3_1_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-8-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: 5 markings, 4 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pbl_1_2_3 <= pi_d2_n1_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 ((pbl_1_2_3 <= pi_d2_n1_2_1_3)))
lola: processed formula length: 37
lola: 16 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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: (pbl_1_2_3 <= pi_d2_n1_2_1_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-9-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pb_d2_n1_2_2_2 <= pil_d1_n1_3_3_3) OR (po_d1_n1_2_2_1 <= pb_d3_n2_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 (((pb_d2_n1_2_2_2 <= pil_d1_n1_3_3_3) OR (po_d1_n1_2_2_1 <= pb_d3_n2_2_1_3))))
lola: processed formula length: 84
lola: 17 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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_d1_n1_3_3_3 + 1 <= pb_d2_n1_2_2_2) AND (pb_d3_n2_2_1_3 + 1 <= po_d1_n1_2_2_1))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 11 markings, 10 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pil_d3_n1_1_1_2 <= pol_d1_n1_3_3_3) OR (pb_d2_n2_3_1_2 <= pb_d3_n2_1_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_d3_n1_1_1_2 <= pol_d1_n1_3_3_3) OR (pb_d2_n2_3_1_2 <= pb_d3_n2_1_1_2))))
lola: processed formula length: 85
lola: 17 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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_d1_n1_3_3_3 + 1 <= pil_d3_n1_1_1_2) AND (pb_d3_n2_1_1_2 + 1 <= pb_d2_n2_3_1_2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pi_d2_n1_2_1_3 + 1 <= pbl_2_2_2) OR (pbl_1_3_1 <= 1) OR (2 <= pb_d2_n1_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 (((pi_d2_n1_2_1_3 + 1 <= pbl_2_2_2) OR (pbl_1_3_1 <= 1) OR (2 <= pb_d2_n1_2_1_3))))
lola: processed formula length: 90
lola: 17 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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: ((pbl_2_2_2 <= pi_d2_n1_2_1_3) AND (2 <= pbl_1_3_1) AND (pb_d2_n1_2_1_3 <= 1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((pil_d3_n1_1_2_3 + 1 <= pb_d3_n2_1_3_3) OR (pb_d2_n2_3_2_1 <= 0) OR (1 <= pb_d3_n2_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 (((pil_d3_n1_1_2_3 + 1 <= pb_d3_n2_1_3_3) OR (pb_d2_n2_3_2_1 <= 0) OR (1 <= pb_d3_n2_2_2_1))))
lola: processed formula length: 101
lola: 17 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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_n2_1_3_3 <= pil_d3_n1_1_2_3) AND (1 <= pb_d2_n2_3_2_1) AND (pb_d3_n2_2_2_1 <= 0))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-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 HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1783 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((po_d2_n1_1_3_3 <= pbl_1_3_3) OR (3 <= pb_d1_n2_3_2_1) OR (1 <= pi_d2_n1_3_3_1) OR (po_d1_n1_2_3_2 + 1 <= po_d2_n1_3_3_1) OR (pi_d3_n1_1_1_1 + 1 <= po_d2_n1_2_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 (((po_d2_n1_1_3_3 <= pbl_1_3_3) OR (3 <= pb_d1_n2_3_2_1) OR (1 <= pi_d2_n1_3_3_1) OR (po_d1_n1_2_3_2 + 1 <= po_d2_n1_3_3_1) OR (pi_d3_n1_1_1_1 + 1 <= po_d2_n1_2_3_3))))
lola: processed formula length: 177
lola: 17 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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: ((pbl_1_3_3 + 1 <= po_d2_n1_1_3_3) AND (pb_d1_n2_3_2_1 <= 2) AND (pi_d2_n1_3_3_1 <= 0) AND (po_d2_n1_3_3_1 <= po_d1_n1_2_3_2) AND (po_d2_n1_2_3_3 <= pi_d3_n1_1_1_1))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-14-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: 25 markings, 24 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3567 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= pb_d1_n2_3_3_1) AND (pb_d2_n1_1_2_1 <= 0) AND (2 <= pb_d1_n1_3_2_1) AND (pi_d3_n1_2_1_2 <= pi_d2_n1_2_2_3) AND ((3 <= pbl_2_2_1) OR (po_d1_n1_3_2_2 <= po_d1_n1_3_3_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 (((2 <= pb_d1_n2_3_3_1) AND (pb_d2_n1_1_2_1 <= 0) AND (2 <= pb_d1_n1_3_2_1) AND (pi_d3_n1_2_1_2 <= pi_d2_n1_2_2_3) AND ((3 <= pbl_2_2_1) OR (po_d1_n1_3_2_2 <= po_d1_n1_3_3_3)))))
lola: processed formula length: 184
lola: 16 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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_d1_n2_3_3_1) AND (pb_d2_n1_1_2_1 <= 0) AND (2 <= pb_d1_n1_3_2_1) AND (pi_d3_n1_2_1_2 <= pi_d2_n1_2_2_3) AND ((3 <= pbl_2_2_1) OR (po_d1_n1_3_2_2 <= po_d1_n1_3_3_3)))
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: lola: state equation: calling and running sara
produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no yes no yes no no no yes no no no yes no no
lola:
preliminary result: yes yes no yes no yes no no no yes no no no yes no no
sara: try reading problem file HypertorusGrid-PT-d3k3p2b06-ReachabilityCardinality-15-0.sara.
lola: memory consumption: 24316 KB
lola: time consumption: 3 seconds
sara: place or transition ordering is non-deterministic

sara: place or transition ordering is non-deterministic


BK_STOP 1526763129881

--------------------
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-d3k3p2b06"
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-d3k3p2b06.tgz
mv HypertorusGrid-PT-d3k3p2b06 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-d3k3p2b06, 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-152658630800152"
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 ;