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

About the Execution of 2018-Gold for FMS-PT-20000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15918.770 266068.00 260516.00 2967.10 TF?FFTFTFFFFTFFT 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.r088-csrt-155246565600038.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 win2018
Input is FMS-PT-20000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-155246565600038
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 176K
-rw-r--r-- 1 mcc users 3.2K Feb 10 23:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 10 23:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 6 21:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 6 21:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 99 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 337 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 23:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.1K Feb 4 23:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 3 08:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 3 08:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Jan 31 01:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Jan 31 01:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:20 UpperBounds.xml

-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 16K 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 FMS-PT-20000-LTLCardinality-00
FORMULA_NAME FMS-PT-20000-LTLCardinality-01
FORMULA_NAME FMS-PT-20000-LTLCardinality-02
FORMULA_NAME FMS-PT-20000-LTLCardinality-03
FORMULA_NAME FMS-PT-20000-LTLCardinality-04
FORMULA_NAME FMS-PT-20000-LTLCardinality-05
FORMULA_NAME FMS-PT-20000-LTLCardinality-06
FORMULA_NAME FMS-PT-20000-LTLCardinality-07
FORMULA_NAME FMS-PT-20000-LTLCardinality-08
FORMULA_NAME FMS-PT-20000-LTLCardinality-09
FORMULA_NAME FMS-PT-20000-LTLCardinality-10
FORMULA_NAME FMS-PT-20000-LTLCardinality-11
FORMULA_NAME FMS-PT-20000-LTLCardinality-12
FORMULA_NAME FMS-PT-20000-LTLCardinality-13
FORMULA_NAME FMS-PT-20000-LTLCardinality-14
FORMULA_NAME FMS-PT-20000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552863303470

info: Time: 3600 - MCC
===========================================================================================
prep: translating FMS-PT-20000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating FMS-PT-20000 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ FMS-PT-20000 @ 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: 42/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 704
lola: finding significant places
lola: 22 places, 20 transitions, 16 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from FMS-PT-20000-LTLCardinality.task
lola: A (((P2wP1 <= P3s) U (1 <= M1))) : A (X (X (X (F ((1 <= P1s)))))) : A (G (X (G ((P12s <= P1s))))) : A ((M2 <= P1wP2)) : A ((P2 <= P2s)) : A (X ((F ((3 <= P2)) U (2 <= P1)))) : A (X ((1 <= P12s))) : A (X ((P2M2 <= P3M2))) : A (G (X ((2 <= P2d)))) : A (X (X (F (F ((2 <= P12s)))))) : A (F (F (G (G ((2 <= P1d)))))) : A (X ((2 <= P12M3))) : A (F ((P3s <= P1M1))) : A ((1 <= P3s)) : A (F (X (F ((P2 <= P3s))))) : A ((P3s <= P12))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (M2 <= P1wP2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (M2 <= P1wP2)
lola: processed formula length: 13
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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 FMS-PT-20000-LTLCardinality-3 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: (P2 <= P2s)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P2 <= P2s)
lola: processed formula length: 11
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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 FMS-PT-20000-LTLCardinality-4 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 <= P3s)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P3s)
lola: processed formula length: 10
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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 FMS-PT-20000-LTLCardinality-13 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: (P3s <= P12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P3s <= P12)
lola: processed formula length: 12
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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 FMS-PT-20000-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((3 <= P2)) U (2 <= P1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((3 <= P2)) U (2 <= P1))))
lola: processed formula length: 35
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================

FORMULA FMS-PT-20000-LTLCardinality-5 TRUE 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: A (X ((1 <= P12s)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= P12s)))
lola: processed formula length: 19
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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 FMS-PT-20000-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((P2M2 <= P3M2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((P2M2 <= P3M2)))
lola: processed formula length: 22
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================

FORMULA FMS-PT-20000-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((2 <= P2d))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((2 <= P2d))))
lola: processed formula length: 22
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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 FMS-PT-20000-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((2 <= P12s)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((2 <= P12s)))))
lola: processed formula length: 27
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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 FMS-PT-20000-LTLCardinality-9 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: A (X ((2 <= P12M3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((2 <= P12M3)))
lola: processed formula length: 20
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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 FMS-PT-20000-LTLCardinality-11 FALSE 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: A (X (X (X (F ((1 <= P1s))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((1 <= P1s))))))
lola: processed formula length: 30
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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: 6 markings, 6 edges
lola: ========================================

FORMULA FMS-PT-20000-LTLCardinality-1 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 (X (F ((P2 <= P3s))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((P2 <= P3s))))
lola: processed formula length: 23
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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: 4 markings, 4 edges
lola: ========================================

FORMULA FMS-PT-20000-LTLCardinality-14 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 (X (G ((P12s <= P1s))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((P12s <= P1s))))
lola: processed formula length: 25
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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: 4128447 markings, 7568344 edges, 825689 markings/sec, 0 secs
lola: 7881966 markings, 14454416 edges, 750704 markings/sec, 5 secs
lola: 11945617 markings, 21893288 edges, 812730 markings/sec, 10 secs
lola: 15780702 markings, 28920762 edges, 767017 markings/sec, 15 secs
lola: 19672681 markings, 36072189 edges, 778396 markings/sec, 20 secs
lola: 23596013 markings, 43258552 edges, 784666 markings/sec, 25 secs
lola: 27443491 markings, 50317006 edges, 769496 markings/sec, 30 secs
lola: 31375703 markings, 57514920 edges, 786442 markings/sec, 35 secs
lola: 35127466 markings, 64406463 edges, 750353 markings/sec, 40 secs
lola: 38994060 markings, 71493085 edges, 773319 markings/sec, 45 secs
lola: 42699867 markings, 78296994 edges, 741161 markings/sec, 50 secs
lola: 46565748 markings, 85369163 edges, 773176 markings/sec, 55 secs
lola: 50313917 markings, 92245315 edges, 749634 markings/sec, 60 secs
lola: 54028587 markings, 99054468 edges, 742934 markings/sec, 65 secs
lola: 57798436 markings, 105962472 edges, 753970 markings/sec, 70 secs
lola: 61508978 markings, 112758593 edges, 742108 markings/sec, 75 secs
lola: 65299716 markings, 119716163 edges, 758148 markings/sec, 80 secs
lola: 69121934 markings, 126720407 edges, 764444 markings/sec, 85 secs
lola: 72872357 markings, 133601066 edges, 750085 markings/sec, 90 secs
lola: 76698532 markings, 140613225 edges, 765235 markings/sec, 95 secs
lola: 80463630 markings, 147504038 edges, 753020 markings/sec, 100 secs
lola: 84196292 markings, 154355460 edges, 746532 markings/sec, 105 secs
lola: 87928657 markings, 161206141 edges, 746473 markings/sec, 110 secs
lola: 90669846 markings, 166218939 edges, 548238 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1149 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((P3s <= P1M1)))
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: (P1M1 + 1 <= P3s)
lola: processed formula length: 17
lola: 14 rewrites
lola: closed formula file FMS-PT-20000-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola:
========================================
FORMULA FMS-PT-20000-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1724 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= P1d))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= P1d))))
lola: processed formula length: 22
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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: 120007 markings, 120008 edges
lola: ========================================

FORMULA FMS-PT-20000-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3448 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((P2wP1 <= P3s) U (1 <= M1)))
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 (((P2wP1 <= P3s) U (1 <= M1)))
lola: processed formula length: 32
lola: 16 rewrites
lola: closed formula file FMS-PT-20000-LTLCardinality.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: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA FMS-PT-20000-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (G ((P12s <= P1s))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((P12s <= P1s))))
lola: processed formula length: 25
lola: 12 rewrites
lola: closed formula file FMS-PT-20000-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: 4177237 markings, 7672826 edges, 835447 markings/sec, 0 secs
lola: 8224243 markings, 15070085 edges, 809401 markings/sec, 5 secs
lola: 12211222 markings, 22397285 edges, 797396 markings/sec, 10 secs
lola: 16262000 markings, 29803977 edges, 810156 markings/sec, 15 secs
lola: 20306234 markings, 37231448 edges, 808847 markings/sec, 20 secs
lola: 24330153 markings, 44613855 edges, 804784 markings/sec, 25 secs
lola: 28421477 markings, 52120766 edges, 818265 markings/sec, 30 secs
lola: 32421760 markings, 59441895 edges, 800057 markings/sec, 35 secs
lola: 36482297 markings, 66882764 edges, 812107 markings/sec, 40 secs
lola: 40522892 markings, 74294690 edges, 808119 markings/sec, 45 secs
lola: 44610590 markings, 81793679 edges, 817540 markings/sec, 50 secs
lola: 48564969 markings, 89039380 edges, 790876 markings/sec, 55 secs
lola: 52423895 markings, 96122583 edges, 771785 markings/sec, 60 secs
lola: 56371624 markings, 103355531 edges, 789546 markings/sec, 65 secs
lola: 60273582 markings, 110504147 edges, 780392 markings/sec, 70 secs
lola: 64242247 markings, 117780642 edges, 793733 markings/sec, 75 secs
lola: 68279386 markings, 125177678 edges, 807428 markings/sec, 80 secs
lola: 72194083 markings, 132350689 edges, 782939 markings/sec, 85 secs
lola: 76158398 markings, 139621228 edges, 792863 markings/sec, 90 secs
lola: 80128717 markings, 146906778 edges, 794064 markings/sec, 95 secs
lola: 83976716 markings, 153966535 edges, 769600 markings/sec, 100 secs
lola: 87761124 markings, 160897857 edges, 756882 markings/sec, 105 secs
lola: 90644773 markings, 166182507 edges, 576730 markings/sec, 110 secs
lola: 90660747 markings, 166198482 edges, 3195 markings/sec, 115 secs
lola: 90669822 markings, 166218882 edges, 1815 markings/sec, 120 secs
lola: 90678591 markings, 166240803 edges, 1754 markings/sec, 125 secs
lola: 90691084 markings, 166272035 edges, 2499 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA FMS-PT-20000-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no unknown no no yes no yes no no no no yes no no yes
lola:
preliminary result: yes no unknown no no yes no yes no no no no yes no no yes
lola: memory consumption: 16444 KB
lola: time consumption: 266 seconds

BK_STOP 1552863569538

--------------------
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="FMS-PT-20000"
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 FMS-PT-20000, 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 r088-csrt-155246565600038"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FMS-PT-20000.tgz
mv FMS-PT-20000 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 ;