fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r082-csrt-155246550300994
Last Updated
Apr 15, 2019

About the Execution of LoLA for JoinFreeModules-PT-5000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.850 1070494.00 1123646.00 1130.70 ????T??TF?F?T??? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r082-csrt-155246550300994.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is JoinFreeModules-PT-5000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550300994
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 3.7K Feb 11 22:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 11 22:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 7 23:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 23:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 4 06:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 4 06:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jan 31 23:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Jan 31 23:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:21 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 29M Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552688325841

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ JoinFreeModules-PT-5000 @ 3570 seconds

FORMULA JoinFreeModules-PT-5000-CTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-09 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-01 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-13 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-05 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-06 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-00 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-02 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-15 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-03 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-5000-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
Makefile:16: recipe for target 'verify' failed
vrfy: finished
info: timeLeft: 2499
rslt: Output for CTLCardinality @ JoinFreeModules-PT-5000
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 65002/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 800032
lola: finding significant places
lola: 25001 places, 40001 transitions, 20000 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: A (((1 <= p241) U (p20521 <= p64))) : E (G (((p15352 <= 1) OR (p4320 + 1 <= p3260) OR ((1 <= p7173) AND (1 <= p17091) AND (p21126 <= p16404) AND (p14004 <= p3078))))) : E (((2 <= p13283) U (((p14349 <= p14430) AND (1 <= p7510)) OR (p14808 <= p6779)))) : E (G (NOT(A (G ((2 <= p6677)))))) : E (G (A (X (((1 <= p2402) AND (p19225 <= p7033)))))) : A (F (E (G ((p10118 <= p13674))))) : E (G ((E (F ((3 <= p17980))) OR ((p9302 <= p20867) OR (p20584 <= p11993) OR ((p16898 <= p7381) AND (2 <= p8861)))))) : (((p11589 <= 1) OR (p24555 <= 1)) AND A (X (A (F ((1 <= p24308)))))) : E (X (E (G ((p22258 <= p5899))))) : A (G ((p15946 <= p19013))) : A (((1 <= p10827) U A (X ((p6054 <= p3730))))) : E (F ((E (F ((p21843 <= p6334))) AND (1 <= p4379)))) : ((((p17801 <= p17376) OR (3 <= p17158)) AND (p5980 <= 0)) AND (A (X (((1 <= p7887) OR (1 <= p23329)))) AND E (((p6437 <= p5776) U (p19590 <= p18100))))) : A (F (E (G ((p5330 <= p5164))))) : (A (X (E (F ((1 <= p23582))))) AND E ((((p4115 <= p23122) AND (2 <= p10491)) U (3 <= p8940)))) : ((p6954 + 1 <= p5008) AND (((1 <= p15188) AND (p21829 <= 1) AND ((p930 <= 1) OR (p11139 <= 1))) AND (((p13264 + 1 <= p12747) OR (p13197 <= 0)) AND E (G ((1 <= p8847))))))
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 162 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((1 <= p2402) AND (p19225 <= p7033))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(AX(((1 <= p2402) AND (p19225 <= p7033))))
lola: processed formula length: 44
lola: 5 rewrites
lola: closed formula file CTLCardinality.xml
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: 2734 markings, 2733 edges, 547 markings/sec, 0 secs
lola: 5620 markings, 5620 edges, 577 markings/sec, 5 secs
lola: 8521 markings, 8520 edges, 580 markings/sec, 10 secs
lola: 11361 markings, 11360 edges, 568 markings/sec, 15 secs
lola: 14334 markings, 14333 edges, 595 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 15002 markings, 15002 edges
lola: ========================================
lola: subprocess 1 will run for 171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p11589 <= 1) OR (p24555 <= 1)) AND A (X (A (F ((1 <= p24308))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 171 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p11589 <= 1) OR (p24555 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p11589 <= 1) OR (p24555 <= 1))
lola: processed formula length: 33
lola: 3 rewrites
lola: closed formula file CTLCardinality.xml
lola: processed formula with 2 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 2 will run for 184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((1 <= p24308)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:754
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p24308 <= 0)
lola: processed formula length: 13
lola: 6 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:753
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (1 <= p24308)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEG
lola: The predicate eventually occurs from all successors.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 184 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((p22258 <= p5899)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: rewrite Frontend/Parser/formula_rewrite.k:715
lola: processed formula: (p22258 <= p5899)
lola: processed formula length: 17
lola: 5 rewrites
lola: closed formula file CTLCardinality.xml
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: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p22258 <= p5899)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
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: ========================================
lola: subprocess 3 will run for 198 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p10827) U A (X ((p6054 <= p3730)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: processed formula: A((1 <= p10827) U AX((p6054 <= p3730)))
lola: processed formula length: 39
lola: 5 rewrites
lola: closed formula file CTLCardinality.xml
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: 8874 markings, 8873 edges, 1775 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 15002 markings, 15002 edges
lola: ========================================
lola: subprocess 4 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((p17801 <= p17376) OR (3 <= p17158)) AND (p5980 <= 0)) AND (A (X (((1 <= p7887) OR (1 <= p23329)))) AND E (((p6437 <= p5776) U (p19590 <= p18100)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 213 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((p17801 <= p17376) OR (3 <= p17158)) AND (p5980 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p17801 <= p17376) OR (3 <= p17158)) AND (p5980 <= 0))
lola: processed formula length: 57
lola: 3 rewrites
lola: closed formula file CTLCardinality.xml
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: ========================================
lola: subprocess 5 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((p6437 <= p5776) U (p19590 <= p18100)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E (((p6437 <= p5776) U (p19590 <= p18100)))
lola: processed formula length: 43
lola: 6 rewrites
lola: closed formula file CTLCardinality.xml
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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p19590 <= p18100)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((1 <= p7887) OR (1 <= p23329))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(((1 <= p7887) OR (1 <= p23329)))
lola: processed formula length: 36
lola: 4 rewrites
lola: closed formula file CTLCardinality.xml
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: ========================================
lola: subprocess 5 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F ((1 <= p23582))))) AND E ((((p4115 <= p23122) AND (2 <= p10491)) U (3 <= p8940))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 233 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((p4115 <= p23122) AND (2 <= p10491)) U (3 <= p8940)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:618
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: rewrite Frontend/Parser/formula_rewrite.k:738
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: E ((((p4115 <= p23122) AND (2 <= p10491)) U (3 <= p8940)))
lola: processed formula length: 58
lola: 6 rewrites
lola: closed formula file CTLCardinality.xml
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: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (3 <= p8940)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-5-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-5-0.sara.
lola: sara is running 0 secs || 17545 markings, 19452 edges, 3509 markings/sec, 0 secs
lola: sara is running 5 secs || 30874 markings, 42777 edges, 2666 markings/sec, 5 secs
lola: sara is running 10 secs || 48564 markings, 63552 edges, 3538 markings/sec, 10 secs
lola: sara is running 15 secs || 62350 markings, 86616 edges, 2757 markings/sec, 15 secs
lola: sara is running 20 secs || 78887 markings, 108865 edges, 3307 markings/sec, 20 secs
lola: sara is running 25 secs || 94430 markings, 131509 edges, 3109 markings/sec, 25 secs
lola: sara is running 30 secs || 109119 markings, 154084 edges, 2938 markings/sec, 30 secs
lola: sara is running 35 secs || 125583 markings, 174786 edges, 3293 markings/sec, 35 secs
lola: sara is running 40 secs || 138493 markings, 197376 edges, 2582 markings/sec, 40 secs
lola: sara is running 45 secs || 154034 markings, 213986 edges, 3108 markings/sec, 45 secs
lola: sara is running 50 secs || 155717 markings, 216265 edges, 337 markings/sec, 50 secs
lola: sara is running 55 secs || 155831 markings, 216463 edges, 23 markings/sec, 55 secs
lola: Child process aborted or communication problem between parent and child process
lola: Cannot launch process for handling subproblem
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: RESULT
lola:
SUMMARY: yes yes no no yes unknown
lola:
preliminary result: yes yes no no yes unknown
Segmentation fault
rslt: finished

BK_STOP 1552689396335

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

make: [verify] Error 139 (ignored)

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="JoinFreeModules-PT-5000"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is JoinFreeModules-PT-5000, 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 r082-csrt-155246550300994"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-5000.tgz
mv JoinFreeModules-PT-5000 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;