Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2019-input.r066-ebro-155234666500113.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is DiscoveryGPU-PT-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-ebro-155234666500113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 3.4K Feb 10 22:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 10 22:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 6 18:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 6 18:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 106 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 344 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 23:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K Feb 4 23:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K Feb 4 22:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 3 07:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Feb 3 07:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Jan 30 23:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Jan 30 23:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 36K 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 DiscoveryGPU-PT-10a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552928359082

info: Time: 3600 - MCC
===========================================================================================
prep: translating DiscoveryGPU-PT-10a Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: net is already safe
prep: check for too many tokens
===========================================================================================
prep: translating DiscoveryGPU-PT-10a formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ DiscoveryGPU-PT-10a @ 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: 244/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 103
lola: finding significant places
lola: 103 places, 141 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 174 transition conflict sets
lola: TASK
lola: reading formula from DiscoveryGPU-PT-10a-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= p91)
lola: LP says that atomic proposition is always false: (3 <= p73)
lola: LP says that atomic proposition is always false: (2 <= p43)
lola: LP says that atomic proposition is always false: (2 <= p27)
lola: LP says that atomic proposition is always false: (2 <= p52)
lola: LP says that atomic proposition is always false: (2 <= p50)
lola: LP says that atomic proposition is always false: (2 <= p69)
lola: A (F ((X ((p8 <= p65)) U F ((1 <= p30))))) : A (F (X (X (F ((1 <= p4)))))) : A (FALSE) : A ((FALSE U ((1 <= p7) U FALSE))) : A (F (F (((p13 <= p74) U (1 <= p6))))) : A (X ((p87 <= p38))) : A ((p75 <= p96)) : A (G (F (G (F (FALSE))))) : A ((G (G ((p8 <= p34))) U ((p20 <= p91) U (p0 <= p38)))) : A (G ((p87 <= p74))) : A ((((1 <= p86) U (p58 <= p71)) U ((p57 <= p16) U (p75 <= p61)))) : A ((((1 <= p13) U (1 <= p41)) U (p31 <= p12))) : A (G (G (F (F (FALSE))))) : A (X (FALSE)) : A ((F (F (FALSE)) U G (F ((p92 <= p4))))) : A (X ((F ((p25 <= p35)) U (1 <= p43))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-LTLCardinality.task
lola: processed formula with 0 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 DiscoveryGPU-PT-10a-LTLCardinality-2 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-LTLCardinality.task
lola: processed formula with 0 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 DiscoveryGPU-PT-10a-LTLCardinality-3 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: (p75 <= p96)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p75 <= p96)
lola: processed formula length: 12
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-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 DiscoveryGPU-PT-10a-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-LTLCardinality.task
lola: processed formula with 0 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 DiscoveryGPU-PT-10a-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-LTLCardinality.task
lola: processed formula with 0 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 DiscoveryGPU-PT-10a-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-LTLCardinality.task
lola: processed formula with 0 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 DiscoveryGPU-PT-10a-LTLCardinality-13 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 (X (F ((1 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((1 <= p4)))))
lola: processed formula length: 25
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-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: 4 markings, 4 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-10a-LTLCardinality-1 FALSE 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 ((p87 <= p38)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p87 <= p38)))
lola: processed formula length: 20
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-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: 2 markings, 1 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-10a-LTLCardinality-5 TRUE 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 ((F ((p25 <= p35)) U (1 <= p43))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((p25 <= p35)) U (1 <= p43))))
lola: processed formula length: 39
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-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: 4 markings, 4 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-10a-LTLCardinality-15 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 (G ((p87 <= p74)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((p87 <= p74)))
lola: processed formula length: 20
lola: 39 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p74 + 1 <= p87)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: state equation: write sara problem file to DiscoveryGPU-PT-10a-LTLCardinality-9-0.sara
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: state equation: calling and running sara
lola: ========================================

FORMULA DiscoveryGPU-PT-10a-LTLCardinality-9 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 (F ((1 <= p6)))
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: (p6 <= 0)
lola: processed formula length: 9
lola: 39 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-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: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 6 markings, 6 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-10a-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p30)))
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: (p30 <= 0)
lola: processed formula length: 10
lola: 39 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-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 DiscoveryGPU-PT-10a-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p92 <= p4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p92 <= p4))))
lola: processed formula length: 23
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-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
sara: try reading problem file DiscoveryGPU-PT-10a-LTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: 327967 markings, 1513082 edges, 65593 markings/sec, 0 secs
lola: 620379 markings, 3073949 edges, 58482 markings/sec, 5 secs
lola: 895539 markings, 4595843 edges, 55032 markings/sec, 10 secs
lola: 1180484 markings, 6121802 edges, 56989 markings/sec, 15 secs
lola: 1448538 markings, 7613618 edges, 53611 markings/sec, 20 secs
lola: 1842892 markings, 9021129 edges, 78871 markings/sec, 25 secs
lola: 2194158 markings, 10466604 edges, 70253 markings/sec, 30 secs
lola: 2541182 markings, 11865030 edges, 69405 markings/sec, 35 secs
lola: 2874193 markings, 13273595 edges, 66602 markings/sec, 40 secs
lola: 3234368 markings, 14702175 edges, 72035 markings/sec, 45 secs
lola: 3569708 markings, 16139897 edges, 67068 markings/sec, 50 secs
lola: 3865908 markings, 17565295 edges, 59240 markings/sec, 55 secs
lola: 4134543 markings, 19164855 edges, 53727 markings/sec, 60 secs
lola: 4375414 markings, 20710201 edges, 48174 markings/sec, 65 secs
lola: 4603139 markings, 22211914 edges, 45545 markings/sec, 70 secs
lola: 4835721 markings, 23762934 edges, 46516 markings/sec, 75 secs
lola: 5050651 markings, 25342762 edges, 42986 markings/sec, 80 secs
lola: 5300193 markings, 26824501 edges, 49908 markings/sec, 85 secs
lola: 5551881 markings, 28299800 edges, 50338 markings/sec, 90 secs
lola: 5849772 markings, 29850972 edges, 59578 markings/sec, 95 secs
lola: 6088264 markings, 31388568 edges, 47698 markings/sec, 100 secs
lola: 6334939 markings, 32899998 edges, 49335 markings/sec, 105 secs
lola: 6581001 markings, 34383882 edges, 49212 markings/sec, 110 secs
lola: 6820234 markings, 35817879 edges, 47847 markings/sec, 115 secs
lola: 7042647 markings, 37361772 edges, 44483 markings/sec, 120 secs
lola: 7274368 markings, 38877670 edges, 46344 markings/sec, 125 secs
lola: 7525467 markings, 40429842 edges, 50220 markings/sec, 130 secs
lola: 7739456 markings, 41983182 edges, 42798 markings/sec, 135 secs
lola: 7975382 markings, 43483035 edges, 47185 markings/sec, 140 secs
lola: 8208737 markings, 44946080 edges, 46671 markings/sec, 145 secs
lola: 8472713 markings, 46466983 edges, 52795 markings/sec, 150 secs
lola: 8701539 markings, 47935993 edges, 45765 markings/sec, 155 secs
lola: 8922453 markings, 49379424 edges, 44183 markings/sec, 160 secs
lola: 9145958 markings, 50926240 edges, 44701 markings/sec, 165 secs
lola: 9364810 markings, 52468027 edges, 43770 markings/sec, 170 secs
lola: 9600433 markings, 53924429 edges, 47125 markings/sec, 175 secs
lola: 9881926 markings, 55400496 edges, 56299 markings/sec, 180 secs
lola: 10133641 markings, 56885103 edges, 50343 markings/sec, 185 secs
lola: 10379255 markings, 58337356 edges, 49123 markings/sec, 190 secs
lola: 10630052 markings, 59820808 edges, 50159 markings/sec, 195 secs
lola: 10858313 markings, 61326891 edges, 45652 markings/sec, 200 secs
lola: 11108281 markings, 62748985 edges, 49994 markings/sec, 205 secs
lola: 11369899 markings, 64187784 edges, 52324 markings/sec, 210 secs
lola: 11649588 markings, 65733412 edges, 55938 markings/sec, 215 secs
lola: 11886803 markings, 67248780 edges, 47443 markings/sec, 220 secs
lola: 12132286 markings, 68749064 edges, 49097 markings/sec, 225 secs
lola: 12372875 markings, 70199177 edges, 48118 markings/sec, 230 secs
lola: 12612179 markings, 71629259 edges, 47861 markings/sec, 235 secs
lola: 12832555 markings, 73153255 edges, 44075 markings/sec, 240 secs
lola: 13061136 markings, 74657992 edges, 45716 markings/sec, 245 secs
lola: 13307538 markings, 76186443 edges, 49280 markings/sec, 250 secs
lola: 13520692 markings, 77725451 edges, 42631 markings/sec, 255 secs
lola: 13753674 markings, 79206761 edges, 46596 markings/sec, 260 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: 13859856 markings, 79919687 edges

FORMULA DiscoveryGPU-PT-10a-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 1100 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p13) U (1 <= p41)) U (p31 <= p12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= p13) U (1 <= p41)) U (p31 <= p12)))
lola: processed formula length: 46
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-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: using ltl preserving stubborn set method (--stubborn)
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: 1 markings, 0 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-10a-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1651 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((p20 <= p91) U (p0 <= p38)) OR (G ((p8 <= p34)) AND F ((p0 <= p38)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p20 <= p91) U (p0 <= p38)) OR (G ((p8 <= p34)) AND F ((p0 <= p38)))))
lola: processed formula length: 75
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 7 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: 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 DiscoveryGPU-PT-10a-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= p86) U (p58 <= p71)) U ((p57 <= p16) U (p75 <= p61))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= p86) U (p58 <= p71)) U ((p57 <= p16) U (p75 <= p61))))
lola: processed formula length: 65
lola: 37 rewrites
lola: closed formula file DiscoveryGPU-PT-10a-LTLCardinality.task
lola: the resulting Büchi automaton has 5 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA DiscoveryGPU-PT-10a-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no no yes yes no yes no yes yes no no no no
lola:
preliminary result: yes no no no no yes yes no yes no yes yes no no no no
lola: memory consumption: 20360 KB
lola: time consumption: 268 seconds

BK_STOP 1552928627216

--------------------
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="DiscoveryGPU-PT-10a"
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 DiscoveryGPU-PT-10a, 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 r066-ebro-155234666500113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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