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 392K
-rw-r--r-- 1 mcc users 3.2K May 30 22:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 30 22:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 16:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 16:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 11:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 28 11:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.3K May 28 09:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.9K May 28 07:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 28 07:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 27 05:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 27 05:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 217K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-100101, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170400763
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527826934182

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-100101 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-100101 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ RefineWMG-PT-100101 @ 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: 907/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16128
lola: finding significant places
lola: 504 places, 403 transitions, 302 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 504 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-100-101-ReachabilityCardinality.task
lola: E (F (((p333 <= 1) AND (p297 + 1 <= p17) AND (p398 + 1 <= p206) AND (p164 <= 1)))) : A (G ((((3 <= p394) OR (p88 <= p10)) AND ((p483 <= p250) OR (2 <= p73) OR (p396 <= p105))))) : A (G (((p316 + 1 <= p393) OR (p409 + 1 <= p122) OR ((p229 <= p304) AND (p81 + 1 <= p450))))) : A (G (((p197 <= 2) OR (p229 <= 1) OR (p40 <= p383)))) : A (G ((p442 <= p107))) : E (F ((p95 + 1 <= p411))) : E (F ((2 <= p466))) : A (G ((p247 <= p164))) : A (G (((p336 <= 0) AND ((p469 <= 2) OR ((p6 <= p433) AND (p341 <= p147)))))) : A (G ((((p28 <= 2) AND (p212 <= 2)) OR ((p476 <= p328) AND (p26 <= p311))))) : E (F ((((p420 + 1 <= p352) OR (p250 + 1 <= p352)) AND ((p170 <= p292) OR (p494 <= 0))))) : A (G (((2 <= p384) OR (1 <= p187) OR (p266 <= 1) OR ((p410 <= p242) AND (p267 <= p343) AND (p96 + 1 <= p476))))) : E (F ((((1 <= p388) OR (2 <= p487) OR (p401 <= p158) OR (p379 <= p265)) AND ((p328 <= 1) OR ((p148 <= p296) AND (1 <= p493)))))) : E (F ((((p28 + 1 <= p192) OR (p119 + 1 <= p369)) AND ((p237 + 1 <= p166) OR (p499 + 1 <= p298))))) : A (G (((p43 <= 0) OR (p352 <= 2) OR (p352 <= p248)))) : E (F ((((2 <= p182) AND (2 <= p95)) OR (1 <= p357) OR (1 <= p186))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p466)))
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 <= p466)))
lola: processed formula length: 19
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 <= p466)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-0.sara
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p95 + 1 <= p411)))
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 ((p95 + 1 <= p411)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 equation: calling and running sara
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: (p95 + 1 <= p411)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-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: 38 markings, 55 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-5 TRUE 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: A (G ((p442 <= p107)))
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 ((p442 <= p107)))
lola: processed formula length: 22
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14 markings, 13 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-4 FALSE 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: A (G ((p247 <= p164)))
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 ((p247 <= p164)))
lola: processed formula length: 22
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 204 markings, 254 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-7 FALSE 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: A (G (((p43 <= 0) OR (p352 <= 2) OR (p352 <= p248))))
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 (((p43 <= 0) OR (p352 <= 2) OR (p352 <= p248))))
lola: processed formula length: 55
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: lola: ========================================
RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((1 <= p43) AND (3 <= p352) AND (p248 + 1 <= p352))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-4-0.sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityCardinality-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4858 markings, 4857 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-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 (((p197 <= 2) OR (p229 <= 1) OR (p40 <= p383))))
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 (((p197 <= 2) OR (p229 <= 1) OR (p40 <= p383))))
lola: processed formula length: 55
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 <= p197) AND (2 <= p229) AND (p383 + 1 <= p40))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityCardinality-5-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 285 markings, 284 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-3 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: E (F ((((2 <= p182) AND (2 <= p95)) OR (1 <= p357) OR (1 <= p186))))
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 <= p182) AND (2 <= p95)) OR (1 <= p357) OR (1 <= p186))))
lola: processed formula length: 70
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 <= p182) AND (2 <= p95)) OR (1 <= p357) OR (1 <= p186))
lola: state equation: Generated DNF with 4 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 31 markings, 30 edges

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p28 <= 2) AND (p212 <= 2)) OR ((p476 <= p328) AND (p26 <= p311)))))
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 ((((p28 <= 2) AND (p212 <= 2)) OR ((p476 <= p328) AND (p26 <= p311)))))
lola: processed formula length: 77
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 <= p28) OR (3 <= p212)) AND ((p328 + 1 <= p476) OR (p311 + 1 <= p26)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 295 markings, 294 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p420 + 1 <= p352) OR (p250 + 1 <= p352)) AND ((p170 <= p292) OR (p494 <= 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 ((((p420 + 1 <= p352) OR (p250 + 1 <= p352)) AND ((p170 <= p292) OR (p494 <= 0)))))
lola: processed formula length: 90
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: (((p420 + 1 <= p352) OR (p250 + 1 <= p352)) AND ((p170 <= p292) OR (p494 <= 0)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-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: 119 markings, 202 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-10 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 (((p333 <= 1) AND (p297 + 1 <= p17) AND (p398 + 1 <= p206) AND (p164 <= 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 (((p333 <= 1) AND (p297 + 1 <= p17) AND (p398 + 1 <= p206) AND (p164 <= 1))))
lola: processed formula length: 82
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: ((p333 <= 1) AND (p297 + 1 <= p17) AND (p398 + 1 <= p206) AND (p164 <= 1))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9958 markings, 9957 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-0 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 (((p336 <= 0) AND ((p469 <= 2) OR ((p6 <= p433) AND (p341 <= p147))))))
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 (((p336 <= 0) AND ((p469 <= 2) OR ((p6 <= p433) AND (p341 <= p147))))))
lola: processed formula length: 77
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: ((1 <= p336) OR ((3 <= p469) AND ((p433 + 1 <= p6) OR (p147 + 1 <= p341))))
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-10-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 107 markings, 106 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-8 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: E (F ((((p28 + 1 <= p192) OR (p119 + 1 <= p369)) AND ((p237 + 1 <= p166) OR (p499 + 1 <= p298)))))
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 ((((p28 + 1 <= p192) OR (p119 + 1 <= p369)) AND ((p237 + 1 <= p166) OR (p499 + 1 <= p298)))))
lola: processed formula length: 100
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: (((p28 + 1 <= p192) OR (p119 + 1 <= p369)) AND ((p237 + 1 <= p166) OR (p499 + 1 <= p298)))
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-11-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p394) OR (p88 <= p10)) AND ((p483 <= p250) OR (2 <= p73) OR (p396 <= p105)))))
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 <= p394) OR (p88 <= p10)) AND ((p483 <= p250) OR (2 <= p73) OR (p396 <= p105)))))
lola: processed formula length: 95
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: (((p394 <= 2) AND (p10 + 1 <= p88)) OR ((p250 + 1 <= p483) AND (p73 <= 1) AND (p105 + 1 <= p396)))
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-12-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: 100 markings, 99 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-1 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 (((p316 + 1 <= p393) OR (p409 + 1 <= p122) OR ((p229 <= p304) AND (p81 + 1 <= p450)))))
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 (((p316 + 1 <= p393) OR (p409 + 1 <= p122) OR ((p229 <= p304) AND (p81 + 1 <= p450)))))
lola: processed formula length: 94
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: ((p393 <= p316) AND (p122 <= p409) AND ((p304 + 1 <= p229) OR (p450 <= p81)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9486 markings, 9485 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p384) OR (1 <= p187) OR (p266 <= 1) OR ((p410 <= p242) AND (p267 <= p343) AND (p96 + 1 <= p476)))))
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 <= p384) OR (1 <= p187) OR (p266 <= 1) OR ((p410 <= p242) AND (p267 <= p343) AND (p96 + 1 <= p476)))))
lola: processed formula length: 115
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-100-101-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: ((p384 <= 1) AND (p187 <= 0) AND (2 <= p266) AND ((p242 + 1 <= p410) OR (p343 + 1 <= p267) OR (p476 <= p96)))
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 194 markings, 193 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p388) OR (2 <= p487) OR (p401 <= p158) OR (p379 <= p265)) AND ((p328 <= 1) OR ((p148 <= p296) AND (1 <= p493))))))
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 <= p388) OR (2 <= p487) OR (p401 <= p158) OR (p379 <= p265)) AND ((p328 <= 1) OR ((p148 <= p296) AND (1 <= p493))))))
lola: processed formula length: 132
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-100-101-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 <= p388) OR (2 <= p487) OR (p401 <= p158) OR (p379 <= p265)) AND ((p328 <= 1) OR ((p148 <= p296) AND (1 <= p493))))
lola: state equation: Generated DNF with 20 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-100-101-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-100-101-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9921 markings, 9920 edges
lola: ========================================

FORMULA RefineWMG-PT-100-101-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no yes yes no no no yes no yes yes no yes
lola:
preliminary result: yes no no no no yes yes no no no yes no yes yes no yes
lola: memory consumption: 27608 KB
lola: time consumption: 2 seconds

BK_STOP 1527830435652

--------------------
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="RefineWMG-PT-100101"
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/RefineWMG-PT-100101.tgz
mv RefineWMG-PT-100101 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 RefineWMG-PT-100101, 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 r280-csrt-152749170400763"
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 ;