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 260K
-rw-r--r-- 1 mcc users 3.7K May 29 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 29 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 28 11:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 28 11:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.7K May 28 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 4.2K May 27 05:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K May 27 05:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 26 06:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 26 06:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 28 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 3 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 85K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is BusinessProcesses-PT-06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145500232
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527984421849

info: Time: 3600 - MCC
===========================================================================================
prep: translating BusinessProcesses-PT-06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating BusinessProcesses-PT-06 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ BusinessProcesses-PT-06 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 673/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 376
lola: finding significant places
lola: 376 places, 297 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 381 transition conflict sets
lola: TASK
lola: reading formula from BusinessProcesses-PT-06-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p90)
lola: LP says that atomic proposition is always false: (2 <= p183)
lola: LP says that atomic proposition is always false: (3 <= p184)
lola: LP says that atomic proposition is always false: (3 <= p13)
lola: LP says that atomic proposition is always false: (2 <= p231)
lola: LP says that atomic proposition is always false: (3 <= p242)
lola: LP says that atomic proposition is always false: (2 <= p85)
lola: LP says that atomic proposition is always false: (3 <= p352)
lola: LP says that atomic proposition is always false: (2 <= p24)
lola: LP says that atomic proposition is always false: (3 <= p247)
lola: LP says that atomic proposition is always false: (2 <= p110)
lola: LP says that atomic proposition is always false: (3 <= p11)
lola: LP says that atomic proposition is always false: (3 <= p158)
lola: LP says that atomic proposition is always false: (3 <= p323)
lola: LP says that atomic proposition is always false: (2 <= p50)
lola: LP says that atomic proposition is always false: (3 <= p109)
lola: LP says that atomic proposition is always false: (3 <= p325)
lola: LP says that atomic proposition is always false: (3 <= p346)
lola: LP says that atomic proposition is always false: (3 <= p371)
lola: LP says that atomic proposition is always false: (3 <= p359)
lola: LP says that atomic proposition is always false: (2 <= p255)
lola: LP says that atomic proposition is always false: (3 <= p154)
lola: LP says that atomic proposition is always false: (3 <= p229)
lola: LP says that atomic proposition is always false: (2 <= p154)
lola: LP says that atomic proposition is always false: (3 <= p358)
lola: A (G ((p372 <= p154))) : E (F (FALSE)) : E (F (())) : A (G (((((p313 <= p275) OR (1 <= p25)) AND ((p367 <= p351))) OR ((p123 <= p289) AND (p84 <= p184) AND (p223 <= p272))))) : A (G (((p75 + 1 <= p354) OR (p197 <= p189) OR (p249 <= p265)))) : E (F (((1 <= p348) OR ((p77 <= p272) AND (p282 <= p53) AND ((1 <= p327)))))) : A (G ((((p55 <= p265) OR (1 <= p346))))) : A (G (())) : A (G (())) : E (F (())) : E (F ((((p37 + 1 <= p27) AND (p334 + 1 <= p281))))) : E (F (((p151 + 1 <= p64) AND (p361 + 1 <= p198)))) : E (F (())) : E (F (((1 <= p138) AND ((p220 + 1 <= p365))))) : A (G (((p219 <= p19)))) : E (F (()))
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: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: 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: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 223 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: 21 rewrites
lola: closed formula file BusinessProcesses-PT-06-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 BusinessProcesses-PT-06-ReachabilityCardinality-1 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file BusinessProcesses-PT-06-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

FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
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: 21 rewrites
lola: closed formula file BusinessProcesses-PT-06-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 BusinessProcesses-PT-06-ReachabilityCardinality-7 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: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 21 rewrites
lola: closed formula file BusinessProcesses-PT-06-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 BusinessProcesses-PT-06-ReachabilityCardinality-8 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: 21 rewrites
lola: closed formula file BusinessProcesses-PT-06-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 BusinessProcesses-PT-06-ReachabilityCardinality-9 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file BusinessProcesses-PT-06-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 BusinessProcesses-PT-06-ReachabilityCardinality-12 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 21 rewrites
lola: closed formula file BusinessProcesses-PT-06-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 BusinessProcesses-PT-06-ReachabilityCardinality-15 FALSE 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 (((p219 <= p19))))
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 (((p219 <= p19))))
lola: processed formula length: 23
lola: 23 rewrites
lola: closed formula file BusinessProcesses-PT-06-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: ((p19 + 1 <= p219))
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: 15 markings, 14 edges

FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p372 <= p154)))
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 ((p372 <= p154)))
lola: processed formula length: 22
lola: 23 rewrites
lola: closed formula file BusinessProcesses-PT-06-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: (p154 + 1 <= p372)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityCardinality-8-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 38 markings, 37 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((p55 <= p265) OR (1 <= p346)))))
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 ((((p55 <= p265) OR (1 <= p346)))))
lola: processed formula length: 41
lola: 23 rewrites
lola: closed formula file BusinessProcesses-PT-06-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: 96 markings, 95 edges
lola: ========================================
sara: try reading problem file BusinessProcesses-PT-06-ReachabilityCardinality-8-0.sara.

FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-6 FALSE 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: E (F (((1 <= p138) AND ((p220 + 1 <= p365)))))
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 <= p138) AND ((p220 + 1 <= p365)))))
lola: processed formula length: 46
lola: 22 rewrites
lola: closed formula file BusinessProcesses-PT-06-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 <= p138) AND ((p220 + 1 <= p365)))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityCardinality-10-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 51 markings, 50 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-13 TRUE 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 ((((p37 + 1 <= p27) AND (p334 + 1 <= p281)))))
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 ((((p37 + 1 <= p27) AND (p334 + 1 <= p281)))))
lola: processed formula length: 51
lola: 22 rewrites
lola: closed formula file BusinessProcesses-PT-06-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: 17 markings, 16 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-10 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: E (F (((p151 + 1 <= p64) AND (p361 + 1 <= p198))))
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 (((p151 + 1 <= p64) AND (p361 + 1 <= p198))))
lola: processed formula length: 50
lola: 22 rewrites
lola: closed formula file BusinessProcesses-PT-06-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: ((p151 + 1 <= p64) AND (p361 + 1 <= p198))
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: 659 markings, 724 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-11 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 (((p75 + 1 <= p354) OR (p197 <= p189) OR (p249 <= p265))))
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 (((p75 + 1 <= p354) OR (p197 <= p189) OR (p249 <= p265))))
lola: processed formula length: 65
lola: 23 rewrites
lola: closed formula file BusinessProcesses-PT-06-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: ((p354 <= p75) AND (p189 + 1 <= p197) AND (p265 + 1 <= p249))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityCardinality-13-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 85 markings, 84 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-4 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: E (F (((1 <= p348) OR ((p77 <= p272) AND (p282 <= p53) AND ((1 <= p327))))))
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 <= p348) OR ((p77 <= p272) AND (p282 <= p53) AND ((1 <= p327))))))
lola: processed formula length: 77
lola: 22 rewrites
lola: closed formula file BusinessProcesses-PT-06-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 <= p348) OR ((p77 <= p272) AND (p282 <= p53) AND ((1 <= p327))))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityCardinality-14-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 42 markings, 42 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-5 TRUE 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: A (G (((((p313 <= p275) OR (1 <= p25)) AND ((p367 <= p351))) OR ((p123 <= p289) AND (p84 <= p184) AND (p223 <= p272)))))
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 (((((p313 <= p275) OR (1 <= p25)) AND ((p367 <= p351))) OR ((p123 <= p289) AND (p84 <= p184) AND (p223 <= p272)))))
lola: processed formula length: 122
lola: 23 rewrites
lola: closed formula file BusinessProcesses-PT-06-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: ((((p275 + 1 <= p313) AND (p25 <= 0)) OR ((p351 + 1 <= p367))) AND ((p289 + 1 <= p123) OR (p184 + 1 <= p84) OR (p272 + 1 <= p223)))
lola: state equation: Generated DNF with 15 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to BusinessProcesses-PT-06-ReachabilityCardinality-15-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 362 markings, 394 edges
lola: ========================================

FORMULA BusinessProcesses-PT-06-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no yes no yes yes no yes yes no yes no no
lola:
preliminary result: no no no no no yes no yes yes no yes yes no yes no no
lola: memory consumption: 27612 KB
lola: time consumption: 1 seconds
sara: place or transition ordering is non-deterministic


BK_STOP 1527984423848

--------------------
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="BusinessProcesses-PT-06"
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/BusinessProcesses-PT-06.tgz
mv BusinessProcesses-PT-06 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 BusinessProcesses-PT-06, 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 r268-smll-152749145500232"
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 ;