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 192K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_pt
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 31K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is PhilosophersDyn-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666470000836
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527062108755

info: Time: 3600 - MCC
===========================================================================================
prep: translating PhilosophersDyn-COL-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PhilosophersDyn-COL-03 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ PhilosophersDyn-COL-03 @ 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: 114/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 960
lola: finding significant places
lola: 30 places, 84 transitions, 19 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 145 transition conflict sets
lola: TASK
lola: reading formula from PhilosophersDyn-COL-03-CTLCardinality.task
lola: LP says that atomic proposition is always true: (p15 + p16 + p17 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6)
lola: always true
lola: always true
lola: E (G (A (F (((p24 + p25 + p26 <= p15 + p16 + p17) AND (p23 + p22 + p21 <= p27 + p28 + p29)))))) : NOT(A (F ((1 <= p24 + p25 + p26)))) : TRUE : E (X (((p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= 1) AND (p11 + p10 + p9 + 1 <= p24 + p25 + p26) AND ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6) OR (3 <= p24 + p25 + p26) OR (3 <= p15 + p16 + p17))))) : (E (((p15 + p16 + p17 + 1 <= p12 + p13 + p14) U ((p23 + p22 + p21 <= p20 + p19 + p18) AND (p15 + p16 + p17 <= p12 + p13 + p14)))) OR ((p11 + p10 + p9 + 1 <= p24 + p25 + p26) OR E (G (((3 <= p15 + p16 + p17) OR (p23 + p22 + p21 <= p24 + p25 + p26)))))) : (2 <= p15 + p16 + p17) : NOT(((E (G ((2 <= p23 + p22 + p21))) AND E (F ((2 <= p11 + p10 + p9)))) AND A (X ((p27 + p28 + p29 <= 2))))) : NOT((((2 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6) OR ((p23 + p22 + p21 <= 2) AND (p27 + p28 + p29 <= 1))) AND (A (F ((p27 + p28 + p29 <= p23 + p22 + p21))) OR A (G ((1 <= p27 + p28 + p29)))))) : ((p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= p24 + p25 + p26) OR ((p23 + p22 + p21 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6) AND (p11 + p10 + p9 <= 0))) : E (F (((p12 + p13 + p14 <= 2) OR (p20 + p19 + p18 + 1 <= p23 + p22 + p21) OR (p11 + p10 + p9 <= p24 + p25 + p26) OR (1 <= p11 + p10 + p9) OR ((1 <= p20 + p19 + p18) AND (p11 + p10 + p9 <= p27 + p28 + p29))))) : E (F (TRUE)) : ((E (F ((p23 + p22 + p21 <= 0))) OR (p27 + p28 + p29 <= p11 + p10 + p9)) OR A (X ((((p27 + p28 + p29 <= p20 + p19 + p18) AND (p15 + p16 + p17 <= p24 + p25 + p26)) OR (p20 + p19 + p18 + 1 <= p23 + p22 + p21))))) : ((1 <= p20 + p19 + p18) OR (3 <= p15 + p16 + p17)) : (p12 + p13 + p14 <= p11 + p10 + p9) : (p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= p24 + p25 + p26) : A ((E (G (TRUE)) U (p27 + p28 + p29 <= p24 + p25 + p26)))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 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: 33 rewrites
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.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 PhilosophersDyn-COL-03-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p15 + p16 + p17)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p15 + p16 + p17)
lola: processed formula length: 22
lola: 33 rewrites
lola: closed formula file PhilosophersDyn-COL-03-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

FORMULA PhilosophersDyn-COL-03-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= p24 + p25 + p26) OR ((p23 + p22 + p21 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6) AND (p11 + p10 + p9 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= p24 + p25 + p26) OR ((p23 + p22 + p21 + 1 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6) AND (p11 + p10 + p9 <= 0)))
lola: processed formula length: 165
lola: 33 rewrites
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: processed formula with 3 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 PhilosophersDyn-COL-03-CTLCardinality-8 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: 33 rewrites
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.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 PhilosophersDyn-COL-03-CTLCardinality-10 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: ((1 <= p20 + p19 + p18) OR (3 <= p15 + p16 + p17))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= p20 + p19 + p18) OR (3 <= p15 + p16 + p17))
lola: processed formula length: 51
lola: 33 rewrites
lola: closed formula file PhilosophersDyn-COL-03-CTLCardinality.task
lola: processed formula with 2 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 PhilosophersDyn-COL-03-CTLCardinality-12 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: (p12 + p13 + p14 <= p11 + p10 + p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p12 + p13 + p14 <= p11 + p10 + p9)
lola: processed formula length: 35
lola: 33 rewrites
lola: closed formula file PhilosophersDyn-COL-03-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: ========================================

FORMULA PhilosophersDyn-COL-03-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= p24 + p25 + p26)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= p24 + p25 + p26)
lola: processed formula length: 63
lola: 33 rewrites
lola: closed formula file PhilosophersDyn-COL-03-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: ========================================

FORMULA PhilosophersDyn-COL-03-CTLCardinality-14 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: E (X (((p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= 1) AND (p11 + p10 + p9 + 1 <= p24 + p25 + p26) AND ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6) OR (3 <= p24 + p25 + p26) OR (3 <= p15 + p16 + p17)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(((p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= 1) AND (p11 + p10 + p9 + 1 <= p24 + p25 + p26) AND ((3 <= p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6) OR (3 <= p24 + p25 + p26) OR (3 <= p15 + p16 + p17))))
lola: processed formula length: 209
lola: 34 rewrites
lola: closed formula file PhilosophersDyn-COL-03-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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-CTLCardinality-3 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: (A (F ((p23 + p22 + p21 <= 1))) OR (A (G ((p11 + p10 + p9 <= 1))) OR E (X ((3 <= p27 + p28 + p29)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p23 + p22 + p21 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (2 <= p23 + p22 + p21)
lola: processed formula length: 22
lola: 35 rewrites
lola: closed formula file PhilosophersDyn-COL-03-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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA PhilosophersDyn-COL-03-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((p23 + p22 + p21 <= 0))) OR ((p27 + p28 + p29 <= p11 + p10 + p9) OR A (X ((((p27 + p28 + p29 <= p20 + p19 + p18) AND (p15 + p16 + p17 <= p24 + p25 + p26)) OR (p20 + p19 + p18 + 1 <= p23 + p22 + p21))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p27 + p28 + p29 <= p11 + p10 + p9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p27 + p28 + p29 <= p11 + p10 + p9)
lola: processed formula length: 35
lola: 33 rewrites
lola: closed formula file PhilosophersDyn-COL-03-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================

FORMULA PhilosophersDyn-COL-03-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p12 + p13 + p14 <= 2) OR (p20 + p19 + p18 + 1 <= p23 + p22 + p21) OR (p11 + p10 + p9 <= p24 + p25 + p26) OR (1 <= p11 + p10 + p9) OR ((1 <= p20 + p19 + p18) AND (p11 + p10 + p9 <= p27 + p28 + p29)))))
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 (((p12 + p13 + p14 <= 2) OR (p20 + p19 + p18 + 1 <= p23 + p22 + p21) OR (p11 + p10 + p9 <= p24 + p25 + p26) OR (1 <= p11 + p10 + p9) OR ((1 <= p20 + p19 + p18) AND (p11 + p10 + p9 <= p27 + p28 + p29)))))
lola: processed formula length: 212
lola: 34 rewrites
lola: closed formula file PhilosophersDyn-COL-03-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: ((p12 + p13 + p14 <= 2) OR (p20 + p19 + p18 + 1 <= p23 + p22 + p21) OR (p11 + p10 + p9 <= p24 + p25 + p26) OR (1 <= p11 + p10 + p9) OR ((1 <= p20 + p19 + p18) AND (p11 + p10 + p9 <= p27 + p28 + p29)))
lola: state equation: Generated DNF with 6 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to PhilosophersDyn-COL-03-CTLCardinality-10-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: 0 markings, 0 edges
lola:
FORMULA PhilosophersDyn-COL-03-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p24 + p25 + p26 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p24 + p25 + p26 <= 0)))
lola: processed formula length: 30
lola: 33 rewrites
lola: closed formula file PhilosophersDyn-COL-03-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: 6 markings, 5 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p27 + p28 + p29 <= p24 + p25 + p26)))
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: (p24 + p25 + p26 + 1 <= p27 + p28 + p29)
lola: processed formula length: 40
lola: 35 rewrites
lola: closed formula file PhilosophersDyn-COL-03-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 eventually occurs.
lola: 1 markings, 0 edges

FORMULA PhilosophersDyn-COL-03-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((p24 + p25 + p26 <= p15 + p16 + p17) AND (p23 + p22 + p21 <= p27 + p28 + p29))))))
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 ((p24 + p25 + p26 <= p15 + p16 + p17) AND (p23 + p22 + p21 <= p27 + p28 + p29))))))
lola: processed formula length: 109
lola: 35 rewrites
lola: closed formula file PhilosophersDyn-COL-03-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: 139 markings, 244 edges
lola: ========================================

FORMULA PhilosophersDyn-COL-03-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
========================================
lola: ...considering subproblem: (((p0 + p1 + p2 + p3 + p4 + p5 + p8 + p7 + p6 <= 1) AND ((3 <= p23 + p22 + p21) OR (2 <= p27 + p28 + p29))) OR (E (G ((p23 + p22 + p21 + 1 <= p27 + p28 + p29))) AND E (F ((p27 + p28 + p29 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p27 + p28 + p29 <= 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 ((p27 + p28 + p29 <= 0)))
lola: processed formula length: 30
lola: 34 rewrites
lola: closed formula file PhilosophersDyn-COL-03-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: (p27 + p28 + p29 <= 0)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((p23 + p22 + p21 + 1 <= p27 + p28 + p29)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((p23 + p22 + p21 + 1 <= p27 + p28 + p29)))
lola: processed formula length: 48
lola: 33 rewrites
lola: closed formula file PhilosophersDyn-COL-03-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 is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((p15 + p16 + p17 + 1 <= p12 + p13 + p14) U ((p23 + p22 + p21 <= p20 + p19 + p18) AND (p15 + p16 + p17 <= p12 + p13 + p14)))) OR ((p11 + p10 + p9 + 1 <= p24 + p25 + p26) OR E (G (((3 <= p15 + p16 + p17) OR (p23 + p22 + p21 <= p24 + p25 + p26))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: local time limit reached - aborting
lola:
preliminary result: no yes yes no unknown no yes unknown yes yes yes yes no yes yes yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 23464 KB
lola: time consumption: 3570 seconds
lola: time limit reached - aborting
lola:
preliminary result: no yes yes no unknown no yes unknown yes yes yes yes no yes yes yes
lola:
preliminary result: no yes yes no unknown no yes unknown yes yes yes yes no yes yes yes
lola: memory consumption: 23464 KB
lola: time consumption: 3570 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="PhilosophersDyn-COL-03"
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/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 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 PhilosophersDyn-COL-03, 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 r112-csrt-152666470000836"
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 ;