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 680K
-rw-r--r-- 1 mcc users 3.0K May 29 16:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 29 16:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 28 11:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 28 11:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.6K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 28 09:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 28 09:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 28 07:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K May 28 07:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.3K May 27 05:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 27 05:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 26 06:29 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 26 06:29 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 26 06:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 26 06:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 28 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 516K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ASLink-PT-05a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-152749145200075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527826871089

info: Time: 3600 - MCC
===========================================================================================
prep: translating ASLink-PT-05a 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 ASLink-PT-05a formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ ASLink-PT-05a @ 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: 3038/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: Size of bit vector: 1211
lola: finding significant places
lola: 1211 places, 1827 transitions, 979 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2066 transition conflict sets
lola: TASK
lola: reading formula from ASLink-PT-05a-CTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p310)
lola: LP says that atomic proposition is always false: (3 <= p200)
lola: LP says that atomic proposition is always false: (3 <= p925)
lola: LP says that atomic proposition is always false: (2 <= p1135)
lola: LP says that atomic proposition is always false: (2 <= p570)
lola: LP says that atomic proposition is always false: (3 <= p893)
lola: LP says that atomic proposition is always false: (2 <= p973)
lola: LP says that atomic proposition is always false: (3 <= p1168)
lola: LP says that atomic proposition is always false: (3 <= p743)
lola: LP says that atomic proposition is always false: (3 <= p2)
lola: LP says that atomic proposition is always false: (3 <= p339)
lola: LP says that atomic proposition is always false: (3 <= p406)
lola: LP says that atomic proposition is always false: (2 <= p621)
lola: LP says that atomic proposition is always false: (3 <= p864)
lola: LP says that atomic proposition is always false: (2 <= p766)
lola: A (F ((A (X ((p817 <= p993))) AND E (F ((1 <= p1012)))))) : E (G (E ((FALSE U (p71 <= p2))))) : E (G (A (F (((p207 <= p860) AND (1 <= p948)))))) : ((A (F ((p615 + 1 <= p548))) AND E (X (((p463 <= p1179))))) OR E (((1 <= p857) U (p849 + 1 <= p803)))) : ((p52 <= 0) AND A (F ((1 <= p705)))) : A (F (A (X (((1 <= p574) AND (1 <= p281)))))) : E (F (A (X (FALSE)))) : E (((p98 <= p625) U ((p754 + 1 <= p815)))) : E (F (A (F ((p243 + 1 <= p231))))) : NOT(A (G (((p679 <= 0))))) : (TRUE AND E (G (((p1074 <= p239) AND (p1065 <= p431))))) : ((1 <= p706) OR E (F (()))) : A (F ((1 <= p525))) : E (F (E (((p939 <= p655) U FALSE)))) : E (F (((1 <= p1073)))) : (E (F (((p1189 + 1 <= p857)))) OR E ((() U FALSE)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:183
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p706)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p706)
lola: processed formula length: 11
lola: 24 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.task
lola: processed formula with 1 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: ========================================
check_solution: Variable C2942 = -2 is below its lower bound 0
check_solution: Variable C2945 = -2 is below its lower bound 0
check_solution: Variable C2946 = -2 is below its lower bound 0
check_solution: Variable C2949 = -1 is below its lower bound 0
check_solution: Variable C2950 = -1 is below its lower bound 0
check_solution: Variable C2953 = -1 is below its lower bound 0
check_solution: Variable C2954 = -1 is below its lower bound 0
check_solution: Variable C2955 = -2 is below its lower bound 0
check_solution: Variable C2956 = -2 is below its lower bound 0
check_solution: Variable C2957 = -2 is below its lower bound 0

Seriously low accuracy found ||*|| = 2 (rel. error 2)

FORMULA ASLink-PT-05a-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 231 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: 24 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.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 ASLink-PT-05a-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((1 <= p574) AND (1 <= p281))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U AX(((1 <= p574) AND (1 <= p281))))
lola: processed formula length: 43
lola: 26 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 708 markings, 1038 edges
lola: ========================================

FORMULA ASLink-PT-05a-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((p817 <= p993))) AND E (F ((1 <= p1012))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (AX((p817 <= p993)) AND E(TRUE U (1 <= p1012))))
lola: processed formula length: 57
lola: 27 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 3372 markings, 3741 edges
lola: ========================================

FORMULA ASLink-PT-05a-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((p615 + 1 <= p548))) AND E (X (((p463 <= p1179))))) OR E (((1 <= p857) U (p849 + 1 <= p803))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p615 + 1 <= p548)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p548 <= p615)
lola: processed formula length: 14
lola: 26 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 24 markings, 23 edges
lola: ========================================
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((1 <= p857) U (p849 + 1 <= p803)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((1 <= p857) U (p849 + 1 <= p803)))
lola: processed formula length: 38
lola: 27 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (p849 + 1 <= p803)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EU
lola: There is no path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to ASLink-PT-05a-CTLCardinality-5-0.sara
lola: state equation: calling and running sara
lola: lola: SUBRESULT
========================================
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ASLink-PT-05a-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (DEADLOCK))
lola: ========================================
lola: SUBTASK
lola: checking reachability of deadlocks
lola: Planning: workflow for deadlock check: search (--findpath=off,--siphontrap=off)
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 deadlock preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: RUNNING
sara: try reading problem file ASLink-PT-05a-CTLCardinality-5-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The net has deadlock(s).
lola: 24 markings, 23 edges
lola: ========================================
FORMULA ASLink-PT-05a-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 6 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p679))))
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 <= p679))))
lola: processed formula length: 21
lola: 25 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.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 <= p679))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-05a-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ASLink-PT-05a-CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 41 markings, 40 edges
lola: ========================================

FORMULA ASLink-PT-05a-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1073))))
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 <= p1073))))
lola: processed formula length: 22
lola: 25 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.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 <= p1073))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-05a-CTLCardinality-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 93 markings, 92 edges
lola:
========================================FORMULA ASLink-PT-05a-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 8 will run for 434 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p243 + 1 <= p231)))
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 ((p243 + 1 <= p231)))
lola: processed formula length: 26
lola: 25 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.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: (p243 + 1 <= p231)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-05a-CTLCardinality-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: 80 markings, 79 edges
lola: ========================================

FORMULA ASLink-PT-05a-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 496 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p1189 + 1 <= p857))))
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 (((p1189 + 1 <= p857))))
lola: processed formula length: 29
lola: 25 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.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: ((p1189 + 1 <= p857))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-05a-CTLCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ASLink-PT-05a-CTLCardinality-9-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 62 markings, 62 edges
lola: ========================================

FORMULA ASLink-PT-05a-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p525)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p525 <= 0)
lola: processed formula length: 11
lola: 26 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 87 markings, 86 edges
lola: ========================================

FORMULA ASLink-PT-05a-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 694 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p71 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p71 <= p2)))
lola: processed formula length: 19
lola: 24 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 24 markings, 23 edges
lola: ========================================

FORMULA ASLink-PT-05a-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 868 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((p1074 <= p239) AND (p1065 <= p431))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((p1074 <= p239) AND (p1065 <= p431))))
lola: processed formula length: 45
lola: 24 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 24 markings, 23 edges
lola: ========================================

FORMULA ASLink-PT-05a-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1157 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p207 <= p860) AND (1 <= p948))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((p207 <= p860) AND (1 <= p948))))))
lola: processed formula length: 62
lola: 26 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 169 markings, 169 edges
lola: ========================================
FORMULA ASLink-PT-05a-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 14 will run for 1736 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p52 <= 0) AND A (F ((1 <= p705))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1736 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p52 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p52 <= 0)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 15 will run for 3473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p705)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p705 <= 0)
lola: processed formula length: 11
lola: 26 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 96 markings, 95 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ASLink-PT-05a-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3473 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p98 <= p625) U ((p754 + 1 <= p815))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((p98 <= p625) U ((p754 + 1 <= p815))))
lola: processed formula length: 42
lola: 27 rewrites
lola: closed formula file ASLink-PT-05a-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: ((p754 + 1 <= p815))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ASLink-PT-05a-CTLCardinality-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 47 markings, 46 edges
lola: ========================================

FORMULA ASLink-PT-05a-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes yes no no no no yes yes yes yes yes no no no yes yes
lola:
preliminary result: yes yes no no no no yes yes yes yes yes no no no yes yes
lola: memory consumption: 25340 KB
lola: time consumption: 97 seconds
sara: place or transition ordering is non-deterministic


BK_STOP 1527826969931

--------------------
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="ASLink-PT-05a"
export BK_EXAMINATION="CTLCardinality"
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/ASLink-PT-05a.tgz
mv ASLink-PT-05a 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 ASLink-PT-05a, examination is CTLCardinality"
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-152749145200075"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;