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 220K
-rw-r--r-- 1 mcc users 3.0K May 30 22:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 30 22:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 16:50 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:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 11:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.8K May 28 09:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.3K May 28 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 28 07:30 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.4K May 27 05:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 27 05:06 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 55K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-025025, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170300718
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527824983734

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-025025 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-025025 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ RefineWMG-PT-025025 @ 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: 232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4128
lola: finding significant places
lola: 129 places, 103 transitions, 77 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 129 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-025-025-ReachabilityCardinality.task
lola: A (G ((((3 <= p22) OR (1 <= p124) OR (p40 <= p91)) AND (p72 <= p94)))) : E (F ((p109 + 1 <= p76))) : E (F ((((p89 <= 1) OR (p123 <= 2)) AND (pterce <= 0)))) : A (G ((2 <= p84))) : A (G (((p45 <= 2) OR (p93 <= p51) OR (2 <= p93)))) : E (F ((((p72 + 1 <= p82) AND (p122 <= 2)) OR (p94 + 1 <= p10)))) : E (F ((p109 <= p45))) : E (F (((p106 + 1 <= p3) AND (p + 1 <= p62)))) : E (F (((p106 + 1 <= p39) AND ((3 <= p1) OR (2 <= p46)) AND ((p18 <= p92) OR (p97 <= p24) OR (p73 <= 1))))) : A (G (((1 <= p32) OR (p98 <= p33) OR ((p26 <= 2) AND (1 <= p89))))) : E (F (((p23 <= 1) AND ((p107 + 1 <= p100) OR (pterce <= 0))))) : A (G ((3 <= p24))) : A (G ((((p124 + 1 <= p21) AND (p58 <= 2)) OR ((p36 <= 1) AND ((1 <= p78) OR (p3 <= p68)))))) : A (G (((p21 <= 1) OR (p115 <= 0) OR ((p33 + 1 <= p11) AND (1 <= p88))))) : E (F ((1 <= p46))) : E (F ((p68 <= psecond)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p84)))
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 <= p84)))
lola: processed formula length: 18
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-025-025-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: (p84 <= 1)
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: 25 markings, 24 edges
lola: state equation: write sara problem file to RefineWMG-PT-025-025-ReachabilityCardinality-0.sara
lola: state equation: calling and running sara

FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-3 FALSE 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: A (G ((3 <= p24)))
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 <= p24)))
lola: processed formula length: 18
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-025-025-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: (p24 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-025-025-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: 24 markings, 23 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-11 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: E (F ((1 <= p46)))
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 <= p46)))
lola: processed formula length: 18
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-025-025-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: ========================================

FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-14 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: E (F ((p109 + 1 <= p76)))
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 ((p109 + 1 <= p76)))
lola: processed formula length: 25
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-025-025-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: (p109 + 1 <= p76)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-025-025-ReachabilityCardinality-3-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-025-025-ReachabilityCardinality-0.sara.
sara: try reading problem file RefineWMG-PT-025-025-ReachabilityCardinality-3-0.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.

FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-1 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: E (F ((p109 <= p45)))
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 ((p109 <= p45)))
lola: processed formula length: 21
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-025-025-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: ========================================
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: (p109 <= p45)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-025-025-ReachabilityCardinality-4-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: 26 markings, 25 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-6 TRUE 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: E (F ((p68 <= psecond)))
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 ((p68 <= psecond)))
lola: processed formula length: 24
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-025-025-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: (p68 <= psecond)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-025-025-ReachabilityCardinality-5-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: 385 markings, 384 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-15 TRUE 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 ((((p89 <= 1) OR (p123 <= 2)) AND (pterce <= 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 ((((p89 <= 1) OR (p123 <= 2)) AND (pterce <= 0))))
lola: processed formula length: 56
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-025-025-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: (((p89 <= 1) OR (p123 <= 2)) AND (pterce <= 0))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to RefineWMG-PT-025-025-ReachabilityCardinality-6-0.sara
lola: The predicate is reachable.
lola: 25 markings, 24 edges
lola:
FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p45 <= 2) OR (p93 <= p51) OR (2 <= p93))))
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 (((p45 <= 2) OR (p93 <= p51) OR (2 <= p93))))
lola: processed formula length: 52
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-025-025-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 <= p45) AND (p51 + 1 <= p93) AND (p93 <= 1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-025-025-ReachabilityCardinality-7-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: 459 markings, 458 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-4 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 (((p23 <= 1) AND ((p107 + 1 <= p100) OR (pterce <= 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 (((p23 <= 1) AND ((p107 + 1 <= p100) OR (pterce <= 0)))))
lola: processed formula length: 63
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-025-025-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: ((p23 <= 1) AND ((p107 + 1 <= p100) OR (pterce <= 0)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-025-025-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: 513 markings, 512 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-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 (((p106 + 1 <= p3) AND (p + 1 <= p62))))
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 (((p106 + 1 <= p3) AND (p + 1 <= p62))))
lola: processed formula length: 45
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-025-025-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: ((p106 + 1 <= p3) AND (p + 1 <= p62))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 19 markings, 18 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-7 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 (((p21 <= 1) OR (p115 <= 0) OR ((p33 + 1 <= p11) AND (1 <= p88)))))
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 (((p21 <= 1) OR (p115 <= 0) OR ((p33 + 1 <= p11) AND (1 <= p88)))))
lola: processed formula length: 74
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-025-025-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((2 <= p21) AND (1 <= p115) AND ((p11 <= p33) OR (p88 <= 0)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-025-025-ReachabilityCardinality-10-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
state equation: calling and running sara
lola: The predicate is not invariant.
lola: 37 markings, 36 edges
lola: ========================================
sara: try reading problem file RefineWMG-PT-025-025-ReachabilityCardinality-10-0.sara.
sara: place or transition ordering is non-deterministic

FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-13 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 ((((p72 + 1 <= p82) AND (p122 <= 2)) OR (p94 + 1 <= p10))))
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 ((((p72 + 1 <= p82) AND (p122 <= 2)) OR (p94 + 1 <= p10))))
lola: processed formula length: 65
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-025-025-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: (((p72 + 1 <= p82) AND (p122 <= 2)) OR (p94 + 1 <= p10))
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola:
SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 27 markings, 26 edges
lola:
FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
state equation: write sara problem file to RefineWMG-PT-025-025-ReachabilityCardinality-11-0.sara
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p32) OR (p98 <= p33) OR ((p26 <= 2) AND (1 <= p89)))))
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 <= p32) OR (p98 <= p33) OR ((p26 <= 2) AND (1 <= p89)))))
lola: processed formula length: 69
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-025-025-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: ((p32 <= 0) AND (p33 + 1 <= p98) AND ((3 <= p26) OR (p89 <= 0)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-025-025-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-025-025-ReachabilityCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.

FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-9 TRUE 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 ((((3 <= p22) OR (1 <= p124) OR (p40 <= p91)) AND (p72 <= p94))))
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 <= p22) OR (1 <= p124) OR (p40 <= p91)) AND (p72 <= p94))))
lola: processed formula length: 72
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-025-025-ReachabilityCardinality.task
lola: STORE
lola: 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: (((p22 <= 2) AND (p124 <= 0) AND (p91 + 1 <= p40)) OR (p94 + 1 <= p72))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to RefineWMG-PT-025-025-ReachabilityCardinality-13-0.sara
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-0 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 ((((p124 + 1 <= p21) AND (p58 <= 2)) OR ((p36 <= 1) AND ((1 <= p78) OR (p3 <= p68))))))
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 ((((p124 + 1 <= p21) AND (p58 <= 2)) OR ((p36 <= 1) AND ((1 <= p78) OR (p3 <= p68))))))
lola: processed formula length: 94
lola: 2 rewrites
lola: closed formula file RefineWMG-PT-025-025-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: (((p21 <= p124) OR (3 <= p58)) AND ((2 <= p36) OR ((p78 <= 0) AND (p68 + 1 <= p3))))
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-025-025-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file RefineWMG-PT-025-025-ReachabilityCardinality-14-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: 43 markings, 42 edges
lola: ========================================

FORMULA RefineWMG-PT-025-025-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p106 + 1 <= p39) AND ((3 <= p1) OR (2 <= p46)) AND ((p18 <= p92) OR (p97 <= p24) OR (p73 <= 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 (((p106 + 1 <= p39) AND ((3 <= p1) OR (2 <= p46)) AND ((p18 <= p92) OR (p97 <= p24) OR (p73 <= 1)))))
lola: processed formula length: 109
lola: 1 rewrites
lola: closed formula file RefineWMG-PT-025-025-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 66 markings, 65 edges
lola: ========================================

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


BK_TIME_CONFINEMENT_REACHED

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RefineWMG-PT-025025"
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-025025.tgz
mv RefineWMG-PT-025025 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-025025, 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-152749170300718"
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 ;