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 176K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 17K 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 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 114 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 352 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 5 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 9.7K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Philosophers-COL-000005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r112-csrt-152666469800668
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527051543595

info: Time: 3600 - MCC
===========================================================================================
prep: translating Philosophers-COL-000005 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating COL Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Philosophers-COL-000005 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating COL formula complete
vrfy: Checking CTLCardinality @ Philosophers-COL-000005 @ 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: 50/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 25
lola: finding significant places
lola: 25 places, 25 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 35 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000005-CTLCardinality.task
lola: always true
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (p15 + p16 + p17 + p18 + p19 <= p10 + p11 + p12 + p13 + p14)
lola: always true
lola: LP says that atomic proposition is always false: (3 <= p5 + p6 + p7 + p8 + p9)
lola: A (F ((E (G (TRUE)) AND (1 <= p5 + p6 + p7 + p8 + p9)))) : (3 <= p0 + p1 + p2 + p3 + p4) : ((p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4) AND (p10 + p11 + p12 + p13 + p14 + 1 <= p20 + p21 + p22 + p23 + p24) AND ((p20 + p21 + p22 + p23 + p24 <= 1) OR (p10 + p11 + p12 + p13 + p14 <= 0))) : (A (((1 <= p20 + p21 + p22 + p23 + p24) U (1 <= p0 + p1 + p2 + p3 + p4))) AND (((1 <= p0 + p1 + p2 + p3 + p4) OR (1 <= p15 + p16 + p17 + p18 + p19)) OR (E (F ((3 <= p10 + p11 + p12 + p13 + p14))) OR A (X ((1 <= p0 + p1 + p2 + p3 + p4)))))) : NOT(A (X (A (F ((p5 + p6 + p7 + p8 + p9 <= p20 + p21 + p22 + p23 + p24)))))) : ((A (X (((1 <= p5 + p6 + p7 + p8 + p9) OR (3 <= p10 + p11 + p12 + p13 + p14)))) OR ((p10 + p11 + p12 + p13 + p14 <= 2) AND (p20 + p21 + p22 + p23 + p24 <= 2) AND (1 <= p20 + p21 + p22 + p23 + p24))) AND E (G (((1 <= p10 + p11 + p12 + p13 + p14) AND ((3 <= p20 + p21 + p22 + p23 + p24) OR (2 <= p20 + p21 + p22 + p23 + p24)))))) : (1 <= p20 + p21 + p22 + p23 + p24) : NOT(A (((p15 + p16 + p17 + p18 + p19 <= 1) U ((3 <= p20 + p21 + p22 + p23 + p24))))) : (p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24) : (p10 + p11 + p12 + p13 + p14 + 1 <= p0 + p1 + p2 + p3 + p4) : A (G ((p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24))) : TRUE : (((E (X ((p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9))) OR A (G ((2 <= p10 + p11 + p12 + p13 + p14)))) OR A (F (((p20 + p21 + p22 + p23 + p24 <= p0 + p1 + p2 + p3 + p4) OR (1 <= p0 + p1 + p2 + p3 + p4))))) AND E (F ((((p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9) OR (2 <= p5 + p6 + p7 + p8 + p9)) AND (p10 + p11 + p12 + p13 + p14 <= 1))))) : A (G ((1 <= p10 + p11 + p12 + p13 + p14))) : ((NOT(E (G ((3 <= p15 + p16 + p17 + p18 + p19)))) OR ((p20 + p21 + p22 + p23 + p24 <= p10 + p11 + p12 + p13 + p14) OR E (F (TRUE)))) AND ((p5 + p6 + p7 + p8 + p9 <= 1) AND (p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19) AND (((2 <= p10 + p11 + p12 + p13 + p14)) OR (p10 + p11 + p12 + p13 + p14 <= 0) OR (p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24)))) : NOT(A (G (((p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24) OR (p5 + p6 + p7 + p8 + p9 + 1 <= p15 + p16 + p17 + p18 + p19)))))
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:116
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:254
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:116
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 29
lola: 27 rewrites
lola: closed formula file Philosophers-COL-000005-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: ========================================

FORMULA Philosophers-COL-000005-CTLCardinality-1 FALSE 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: ((p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4) AND (p10 + p11 + p12 + p13 + p14 + 1 <= p20 + p21 + p22 + p23 + p24) AND ((p20 + p21 + p22 + p23 + p24 <= 1) OR (p10 + p11 + p12 + p13 + p14 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p15 + p16 + p17 + p18 + p19 + 1 <= p0 + p1 + p2 + p3 + p4) AND (p10 + p11 + p12 + p13 + p14 + 1 <= p20 + p21 + p22 + p23 + p24) AND ((p20 + p21 + p22 + p23 + p24 <= 1) OR (p10 + p11 + p12 + p13 + p14 <= 0)))
lola: processed formula length: 210
lola: 27 rewrites
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: processed formula with 4 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 Philosophers-COL-000005-CTLCardinality-2 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: (1 <= p20 + p21 + p22 + p23 + p24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p20 + p21 + p22 + p23 + p24)
lola: processed formula length: 34
lola: 27 rewrites
lola: closed formula file Philosophers-COL-000005-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: ========================================

FORMULA Philosophers-COL-000005-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24)
lola: processed formula length: 60
lola: 27 rewrites
lola: closed formula file Philosophers-COL-000005-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: ========================================

FORMULA Philosophers-COL-000005-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p10 + p11 + p12 + p13 + p14 + 1 <= p0 + p1 + p2 + p3 + p4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p10 + p11 + p12 + p13 + p14 + 1 <= p0 + p1 + p2 + p3 + p4)
lola: processed formula length: 59
lola: 27 rewrites
lola: closed formula file Philosophers-COL-000005-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 Philosophers-COL-000005-CTLCardinality-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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 27 rewrites
lola: closed formula file Philosophers-COL-000005-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

FORMULA Philosophers-COL-000005-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p5 + p6 + p7 + p8 + p9 <= 1) AND (p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19) AND (((2 <= p10 + p11 + p12 + p13 + p14)) OR (p10 + p11 + p12 + p13 + p14 <= 0) OR (p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p5 + p6 + p7 + p8 + p9 <= 1) AND (p0 + p1 + p2 + p3 + p4 <= p15 + p16 + p17 + p18 + p19) AND (((2 <= p10 + p11 + p12 + p13 + p14)) OR (p10 + p11 + p12 + p13 + p14 <= 0) OR (p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24)))
lola: processed formula length: 238
lola: 27 rewrites
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: processed formula with 5 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

FORMULA Philosophers-COL-000005-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (X (((1 <= p5 + p6 + p7 + p8 + p9) OR (3 <= p10 + p11 + p12 + p13 + p14)))) OR ((p10 + p11 + p12 + p13 + p14 <= 2) AND (p20 + p21 + p22 + p23 + p24 <= 2) AND (1 <= p20 + p21 + p22 + p23 + p24))) AND E (G (((1 <= p10 + p11 + p12 + p13 + p14) AND ((3 <= p20 + p21 + p22 + p23 + p24) OR (2 <= p20 + p21 + p22 + p23 + p24))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p10 + p11 + p12 + p13 + p14 <= 2) AND (p20 + p21 + p22 + p23 + p24 <= 2) AND (1 <= p20 + p21 + p22 + p23 + p24))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p10 + p11 + p12 + p13 + p14 <= 2) AND (p20 + p21 + p22 + p23 + p24 <= 2) AND (1 <= p20 + p21 + p22 + p23 + p24))
lola: processed formula length: 114
lola: 27 rewrites
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= p10 + p11 + p12 + p13 + p14) AND ((3 <= p20 + p21 + p22 + p23 + p24) OR (2 <= p20 + p21 + p22 + p23 + p24)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((1 <= p10 + p11 + p12 + p13 + p14) AND ((3 <= p20 + p21 + p22 + p23 + p24) OR (2 <= p20 + p21 + p22 + p23 + p24)))))
lola: processed formula length: 124
lola: 27 rewrites
lola: closed formula file Philosophers-COL-000005-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Philosophers-COL-000005-CTLCardinality-5 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 (((1 <= p20 + p21 + p22 + p23 + p24) U (1 <= p0 + p1 + p2 + p3 + p4))) AND (((1 <= p0 + p1 + p2 + p3 + p4) OR (1 <= p15 + p16 + p17 + p18 + p19)) OR (E (F ((3 <= p10 + p11 + p12 + p13 + p14))) OR A (X ((1 <= p0 + p1 + p2 + p3 + p4))))))
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: E (F ((3 <= p10 + p11 + p12 + p13 + p14)))
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 ((3 <= p10 + p11 + p12 + p13 + p14)))
lola: processed formula length: 42
lola: 28 rewrites
lola: closed formula file Philosophers-COL-000005-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: (3 <= p10 + p11 + p12 + p13 + p14)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: state equation: write sara problem file to Philosophers-COL-000005-CTLCardinality-8-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p20 + p21 + p22 + p23 + p24) U (1 <= p0 + p1 + p2 + p3 + p4)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((1 <= p20 + p21 + p22 + p23 + p24) U (1 <= p0 + p1 + p2 + p3 + p4)))
lola: processed formula length: 72
lola: 31 rewrites
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA Philosophers-COL-000005-CTLCardinality-3 FALSE 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 (X ((p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9))) OR (A (G ((2 <= p10 + p11 + p12 + p13 + p14))) OR A (F (((p20 + p21 + p22 + p23 + p24 <= p0 + p1 + p2 + p3 + p4) OR (1 <= p0 + p1 + p2 + p3 + p4)))))) AND E (F ((((p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9) OR (2 <= p5 + p6 + p7 + p8 + p9)) AND (p10 + p11 + p12 + p13 + p14 <= 1)))))
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: E (F ((((p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9) OR (2 <= p5 + p6 + p7 + p8 + p9)) AND (p10 + p11 + p12 + p13 + p14 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((((p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9) OR (2 <= p5 + p6 + p7 + p8 + p9)) AND (p10 + p11 + p12 + p13 + p14 <= 1))))
lola: processed formula length: 135
lola: 28 rewrites
lola: closed formula file Philosophers-COL-000005-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: (((p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9) OR (2 <= p5 + p6 + p7 + p8 + p9)) AND (p10 + p11 + p12 + p13 + p14 <= 1))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: ========================================
sara: try reading problem file Philosophers-COL-000005-CTLCardinality-8-0.sara.
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((p0 + p1 + p2 + p3 + p4 <= p5 + p6 + p7 + p8 + p9))
lola: processed formula length: 54
lola: 28 rewrites
lola: closed formula file Philosophers-COL-000005-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA Philosophers-COL-000005-CTLCardinality-12 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 (X (E (G ((p20 + p21 + p22 + p23 + p24 + 1 <= p5 + p6 + p7 + p8 + p9)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:627
lola: processed formula: (p20 + p21 + p22 + p23 + p24 + 1 <= p5 + p6 + p7 + p8 + p9)
lola: processed formula length: 59
lola: 28 rewrites
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate is not possibly preserved from any successor.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-COL-000005-CTLCardinality-4 FALSE 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: A (G ((1 <= p10 + p11 + p12 + p13 + p14)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((1 <= p10 + p11 + p12 + p13 + p14)))
lola: processed formula length: 42
lola: 29 rewrites
lola: closed formula file Philosophers-COL-000005-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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Philosophers-COL-000005-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p15 + p16 + p17 + p18 + p19 <= p20 + p21 + p22 + p23 + p24)))
lola: processed formula length: 68
lola: 29 rewrites
lola: closed formula file Philosophers-COL-000005-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:631
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-COL-000005-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p20 + p21 + p22 + p23 + p24 + 1 <= p15 + p16 + p17 + p18 + p19) AND (p15 + p16 + p17 + p18 + p19 <= p5 + p6 + p7 + p8 + p9))))
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 (((p20 + p21 + p22 + p23 + p24 + 1 <= p15 + p16 + p17 + p18 + p19) AND (p15 + p16 + p17 + p18 + p19 <= p5 + p6 + p7 + p8 + p9))))
lola: processed formula length: 134
lola: 28 rewrites
lola: closed formula file Philosophers-COL-000005-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: ((p20 + p21 + p22 + p23 + p24 + 1 <= p15 + p16 + p17 + p18 + p19) AND (p15 + p16 + p17 + p18 + p19 <= p5 + p6 + p7 + p8 + p9))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Philosophers-COL-000005-CTLCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Philosophers-COL-000005-CTLCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 88 markings, 133 edges
lola: ========================================

FORMULA Philosophers-COL-000005-CTLCardinality-15 TRUE 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: A (F ((1 <= p5 + p6 + p7 + p8 + p9)))
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: (p5 + p6 + p7 + p8 + p9 <= 0)
lola: processed formula length: 29
lola: 29 rewrites
lola: closed formula file Philosophers-COL-000005-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: 6 markings, 5 edgessara: place or transition ordering is non-deterministic


FORMULA Philosophers-COL-000005-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3570 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((2 <= p15 + p16 + p17 + p18 + p19) R ((p20 + p21 + p22 + p23 + p24 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking existential release
lola: rewrite Frontend/Parser/formula_rewrite.k:646
lola: rewrite Frontend/Parser/formula_rewrite.k:610
lola: processed formula: E (((2 <= p15 + p16 + p17 + p18 + p19) R ((p20 + p21 + p22 + p23 + p24 <= 2))))
lola: processed formula length: 79
lola: 29 rewrites
lola: closed formula file Philosophers-COL-000005-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: There is a path where Predicate Phi releases Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA Philosophers-COL-000005-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no no no yes no no no yes yes no yes yes
lola:
preliminary result: no no no no no no no yes no no no yes yes no yes yes
lola: ========================================

lola: memory consumption: 23084 KB
lola: time consumption: 0 seconds

BK_STOP 1527051543949

--------------------
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="Philosophers-COL-000005"
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/Philosophers-COL-000005.tgz
mv Philosophers-COL-000005 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 Philosophers-COL-000005, 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-152666469800668"
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 ;