Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r132-oct2-155403939300143.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 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 win2018
Input is RERS17pb114-PT-4, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-oct2-155403939300143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 4.1K Feb 13 08:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 13 08:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Feb 13 08:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 13 08:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 103 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 341 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 13 08:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K Feb 13 08:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 13 08:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K Feb 13 08:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 13 08:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 13 08:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 13 08:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 13 08:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 13 08:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 13 08:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Feb 13 08:05 equiv_col
-rw-r--r-- 1 mcc users 2 Feb 13 08:05 instance
-rw-r--r-- 1 mcc users 6 Feb 13 08:05 iscolored
-rw-r--r-- 1 mcc users 73M 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 RERS17pb114-PT-4-LTLCardinality-00
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-01
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-02
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-03
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-04
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-05
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-06
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-07
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-08
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-09
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-10
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-11
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-12
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-13
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-14
FORMULA_NAME RERS17pb114-PT-4-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1554081109189

info: Time: 3600 - MCC
===========================================================================================
prep: translating RERS17pb114-PT-4 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RERS17pb114-PT-4 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ RERS17pb114-PT-4 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 152531/65536 symbol table entries, 94907 collisions
lola: preprocessing...
lola: Size of bit vector: 46272
lola: finding significant places
lola: 1446 places, 151085 transitions, 1411 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 210714 transition conflict sets
lola: TASK
lola: reading formula from RERS17pb114-PT-4-LTLCardinality.task
lola: A (F (X (F (F ((3 <= p510)))))) : A (G ((X ((3 <= p303)) U (1 <= p943)))) : A (X ((2 <= p692))) : A ((F (G ((2 <= p203))) U F (X ((p1392 <= p1258))))) : A (G (X (G (X ((p354 <= p602)))))) : A (F ((G ((p583 <= p812)) U (1 <= p992)))) : A (G (X (G (G ((1 <= p783)))))) : A (X (F (((p336 <= p1228) U (2 <= p326))))) : A ((2 <= p953)) : A ((p940 <= p1378)) : A ((3 <= p453)) : A ((3 <= p1317)) : A (F (G (F (F ((3 <= p1406)))))) : A (G (X (((p4 <= p107) U (2 <= p601))))) : A ((3 <= p899)) : A (G (((p630 <= p798) U G ((p937 <= p99)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 194 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p953)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p953)
lola: processed formula length: 11
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.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 RERS17pb114-PT-4-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 207 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p940 <= p1378)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p940 <= p1378)
lola: processed formula length: 15
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.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 RERS17pb114-PT-4-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p453)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p453)
lola: processed formula length: 11
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.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 RERS17pb114-PT-4-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p1317)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p1317)
lola: processed formula length: 12
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.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 RERS17pb114-PT-4-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p899)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p899)
lola: processed formula length: 11
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.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 RERS17pb114-PT-4-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 282 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((1 <= p783))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((1 <= p783))))
lola: processed formula length: 23
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================

FORMULA RERS17pb114-PT-4-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= p326))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= p326))))
lola: processed formula length: 23
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================

FORMULA RERS17pb114-PT-4-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((3 <= p510))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= p510))))
lola: processed formula length: 23
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================

FORMULA RERS17pb114-PT-4-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((1 <= p943)))) AND A (G ((X ((3 <= p303)) OR (1 <= p943)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 388 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= p943))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= p943))))
lola: processed formula length: 23
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RERS17pb114-PT-4-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 443 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p692)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= p692)))
lola: processed formula length: 19
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================

FORMULA RERS17pb114-PT-4-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 517 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p1392 <= p1258))) OR (X (F ((p1392 <= p1258))) AND F (G ((2 <= p203))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((p1392 <= p1258))) OR (X (F ((p1392 <= p1258))) AND F (G ((2 <= p203))))))
lola: processed formula length: 84
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================

FORMULA RERS17pb114-PT-4-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 620 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((2 <= p601)) AND ((p4 <= p107) OR (2 <= p601))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((2 <= p601)) AND ((p4 <= p107) OR (2 <= p601))))))
lola: processed formula length: 63
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================

FORMULA RERS17pb114-PT-4-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 776 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((p354 <= p602)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((p354 <= p602)))))
lola: processed formula length: 30
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19590 markings, 54213 edges
lola: ========================================

FORMULA RERS17pb114-PT-4-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1033 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= p1406))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= p1406))))
lola: processed formula length: 24
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 6 edges
lola: ========================================

FORMULA RERS17pb114-PT-4-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1550 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p992) OR (G ((p583 <= p812)) AND F ((1 <= p992))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((1 <= p992) OR (G ((p583 <= p812)) AND F ((1 <= p992))))))
lola: processed formula length: 65
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 36 markings, 42 edges, 7 markings/sec, 0 secs
lola: 68 markings, 81 edges, 6 markings/sec, 5 secs
lola: 99 markings, 125 edges, 6 markings/sec, 10 secs
lola: 130 markings, 174 edges, 6 markings/sec, 15 secs
lola: 161 markings, 213 edges, 6 markings/sec, 20 secs
lola: 191 markings, 253 edges, 6 markings/sec, 25 secs
lola: 221 markings, 293 edges, 6 markings/sec, 30 secs
lola: 252 markings, 338 edges, 6 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 274 markings, 368 edges

FORMULA RERS17pb114-PT-4-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3058 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (G ((p937 <= p99)))) AND A (G (((p630 <= p798) OR G ((p937 <= p99))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3058 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p937 <= p99))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p937 <= p99))))
lola: processed formula length: 25
lola: 32 rewrites
lola: closed formula file RERS17pb114-PT-4-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 35 markings, 41 edges, 7 markings/sec, 0 secs
lola: 66 markings, 78 edges, 6 markings/sec, 5 secs
lola: 96 markings, 120 edges, 6 markings/sec, 10 secs
lola: 125 markings, 167 edges, 6 markings/sec, 15 secs
lola: 156 markings, 206 edges, 6 markings/sec, 20 secs
lola: 186 markings, 246 edges, 6 markings/sec, 25 secs
lola: 216 markings, 286 edges, 6 markings/sec, 30 secs
lola: 246 markings, 328 edges, 6 markings/sec, 35 secs
lola: 277 markings, 367 edges, 6 markings/sec, 40 secs
lola: 308 markings, 417 edges, 6 markings/sec, 45 secs
lola: 339 markings, 456 edges, 6 markings/sec, 50 secs
lola: 370 markings, 489 edges, 6 markings/sec, 55 secs
lola: 401 markings, 540 edges, 6 markings/sec, 60 secs
lola: 432 markings, 651 edges, 6 markings/sec, 65 secs
lola: 463 markings, 736 edges, 6 markings/sec, 70 secs
lola: 494 markings, 800 edges, 6 markings/sec, 75 secs
lola: 525 markings, 849 edges, 6 markings/sec, 80 secs
lola: 556 markings, 923 edges, 6 markings/sec, 85 secs
lola: 587 markings, 967 edges, 6 markings/sec, 90 secs
lola: 617 markings, 997 edges, 6 markings/sec, 95 secs
lola: 648 markings, 1139 edges, 6 markings/sec, 100 secs
lola: 661 markings, 1223 edges, 3 markings/sec, 105 secs
lola: 664 markings, 1228 edges, 1 markings/sec, 110 secs
lola: 686 markings, 1422 edges, 4 markings/sec, 115 secs
lola: 715 markings, 1578 edges, 6 markings/sec, 120 secs
lola: 744 markings, 1737 edges, 6 markings/sec, 125 secs
lola: 774 markings, 1858 edges, 6 markings/sec, 130 secs
lola: 804 markings, 1892 edges, 6 markings/sec, 135 secs
lola: 834 markings, 1922 edges, 6 markings/sec, 140 secs
lola: 864 markings, 1952 edges, 6 markings/sec, 145 secs
lola: 895 markings, 2026 edges, 6 markings/sec, 150 secs
lola: 925 markings, 2056 edges, 6 markings/sec, 155 secs
lola: 956 markings, 2183 edges, 6 markings/sec, 160 secs
lola: 986 markings, 2252 edges, 6 markings/sec, 165 secs
lola: 1017 markings, 2289 edges, 6 markings/sec, 170 secs
lola: 1048 markings, 2362 edges, 6 markings/sec, 175 secs
lola: 1078 markings, 2392 edges, 6 markings/sec, 180 secs
lola: 1108 markings, 2422 edges, 6 markings/sec, 185 secs
lola: 1138 markings, 2481 edges, 6 markings/sec, 190 secs
lola: 1168 markings, 2517 edges, 6 markings/sec, 195 secs
lola: 1199 markings, 2566 edges, 6 markings/sec, 200 secs
lola: 1230 markings, 2625 edges, 6 markings/sec, 205 secs
lola: 1260 markings, 2655 edges, 6 markings/sec, 210 secs
lola: 1290 markings, 2694 edges, 6 markings/sec, 215 secs
lola: 1319 markings, 2856 edges, 6 markings/sec, 220 secs
lola: 1349 markings, 2924 edges, 6 markings/sec, 225 secs
lola: 1378 markings, 3116 edges, 6 markings/sec, 230 secs
lola: 1408 markings, 3240 edges, 6 markings/sec, 235 secs
lola: 1439 markings, 3369 edges, 6 markings/sec, 240 secs
lola: 1458 markings, 3459 edges, 4 markings/sec, 245 secs
lola: 1488 markings, 3685 edges, 6 markings/sec, 250 secs
lola: 1518 markings, 3961 edges, 6 markings/sec, 255 secs
lola: 1547 markings, 4170 edges, 6 markings/sec, 260 secs
lola: 1578 markings, 4328 edges, 6 markings/sec, 265 secs
lola: 1609 markings, 4512 edges, 6 markings/sec, 270 secs
lola: 1639 markings, 4654 edges, 6 markings/sec, 275 secs
lola: 1669 markings, 4717 edges, 6 markings/sec, 280 secs
lola: 1699 markings, 4805 edges, 6 markings/sec, 285 secs
lola: 1729 markings, 4970 edges, 6 markings/sec, 290 secs
lola: 1757 markings, 5058 edges, 6 markings/sec, 295 secs
lola: 1788 markings, 5139 edges, 6 markings/sec, 300 secs
lola: 1816 markings, 5213 edges, 6 markings/sec, 305 secs
lola: 1827 markings, 5236 edges, 2 markings/sec, 310 secs
lola: 1839 markings, 5264 edges, 2 markings/sec, 315 secs
lola: 1847 markings, 5276 edges, 2 markings/sec, 320 secs
lola: 1855 markings, 5297 edges, 2 markings/sec, 325 secs
lola: 1867 markings, 5330 edges, 2 markings/sec, 330 secs
lola: 1879 markings, 5344 edges, 2 markings/sec, 335 secs
lola: 1905 markings, 5410 edges, 5 markings/sec, 340 secs
lola: 1917 markings, 5429 edges, 2 markings/sec, 345 secs
lola: 1922 markings, 5439 edges, 1 markings/sec, 350 secs
lola: 1943 markings, 5483 edges, 4 markings/sec, 355 secs
lola: 1973 markings, 5543 edges, 6 markings/sec, 360 secs
lola: 2004 markings, 5624 edges, 6 markings/sec, 365 secs
lola: 2034 markings, 5738 edges, 6 markings/sec, 370 secs
lola: 2064 markings, 5835 edges, 6 markings/sec, 375 secs
lola: 2095 markings, 5986 edges, 6 markings/sec, 380 secs
lola: 2126 markings, 6141 edges, 6 markings/sec, 385 secs
lola: 2157 markings, 6322 edges, 6 markings/sec, 390 secs
lola: 2187 markings, 6526 edges, 6 markings/sec, 395 secs
lola: 2214 markings, 6679 edges, 5 markings/sec, 400 secs
lola: 2222 markings, 6697 edges, 2 markings/sec, 405 secs
lola: 2228 markings, 6713 edges, 1 markings/sec, 410 secs
lola: 2234 markings, 6734 edges, 1 markings/sec, 415 secs
lola: 2240 markings, 6751 edges, 1 markings/sec, 420 secs
lola: 2246 markings, 6769 edges, 1 markings/sec, 425 secs
lola: 2255 markings, 6795 edges, 2 markings/sec, 430 secs
lola: 2263 markings, 6816 edges, 2 markings/sec, 435 secs
lola: 2267 markings, 6824 edges, 1 markings/sec, 440 secs
lola: 2271 markings, 6836 edges, 1 markings/sec, 445 secs
lola: 2275 markings, 6844 edges, 1 markings/sec, 450 secs
lola: 2281 markings, 6860 edges, 1 markings/sec, 455 secs
lola: 2286 markings, 6883 edges, 1 markings/sec, 460 secs
lola: 2293 markings, 6901 edges, 1 markings/sec, 465 secs
lola: 2299 markings, 6914 edges, 1 markings/sec, 470 secs
lola: 2305 markings, 6928 edges, 1 markings/sec, 475 secs
lola: 2312 markings, 6944 edges, 1 markings/sec, 480 secs
lola: 2318 markings, 6956 edges, 1 markings/sec, 485 secs
lola: 2326 markings, 6976 edges, 2 markings/sec, 490 secs
lola: 2333 markings, 6987 edges, 1 markings/sec, 495 secs
lola: 2340 markings, 6997 edges, 1 markings/sec, 500 secs
lola: 2346 markings, 7009 edges, 1 markings/sec, 505 secs
lola: 2352 markings, 7021 edges, 1 markings/sec, 510 secs
lola: 2359 markings, 7032 edges, 1 markings/sec, 515 secs
lola: 2365 markings, 7041 edges, 1 markings/sec, 520 secs
lola: 2370 markings, 7052 edges, 1 markings/sec, 525 secs
lola: 2375 markings, 7066 edges, 1 markings/sec, 530 secs
lola: 2381 markings, 7077 edges, 1 markings/sec, 535 secs
lola: 2387 markings, 7092 edges, 1 markings/sec, 540 secs
lola: 2393 markings, 7103 edges, 1 markings/sec, 545 secs
lola: 2399 markings, 7120 edges, 1 markings/sec, 550 secs
lola: 2407 markings, 7135 edges, 2 markings/sec, 555 secs
lola: 2415 markings, 7149 edges, 2 markings/sec, 560 secs
lola: 2423 markings, 7167 edges, 2 markings/sec, 565 secs
lola: 2433 markings, 7180 edges, 2 markings/sec, 570 secs
lola: 2441 markings, 7197 edges, 2 markings/sec, 575 secs
lola: 2452 markings, 7220 edges, 2 markings/sec, 580 secs
lola: 2463 markings, 7237 edges, 2 markings/sec, 585 secs
lola: 2473 markings, 7257 edges, 2 markings/sec, 590 secs
lola: 2481 markings, 7269 edges, 2 markings/sec, 595 secs
lola: 2488 markings, 7282 edges, 1 markings/sec, 600 secs
lola: 2495 markings, 7298 edges, 1 markings/sec, 605 secs
lola: 2502 markings, 7308 edges, 1 markings/sec, 610 secs
lola: 2522 markings, 7350 edges, 4 markings/sec, 615 secs
lola: 2546 markings, 7472 edges, 5 markings/sec, 620 secs
lola: 2576 markings, 7630 edges, 6 markings/sec, 625 secs
lola: 2605 markings, 7766 edges, 6 markings/sec, 630 secs
lola: 2614 markings, 7795 edges, 2 markings/sec, 635 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2619 markings, 7808 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RERS17pb114-PT-4-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no no no no yes no no no no no no
lola:
preliminary result: no no no yes no no no no no yes no no no no no no
lola: memory consumption: 542788 KB
lola: time consumption: 1154 seconds

BK_STOP 1554082264952

--------------------
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="RERS17pb114-PT-4"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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 win2018"
echo " Input is RERS17pb114-PT-4, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-oct2-155403939300143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb114-PT-4.tgz
mv RERS17pb114-PT-4 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;