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-155246566100308.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 JoinFreeModules-PT-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-155246566100308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 4.0K Feb 11 05:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 11 05:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 7 05:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 7 05:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 110 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 348 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.7K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 3 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 3 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Jan 31 06:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K Jan 31 06:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 57K Mar 10 17:31 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552873822926

info: Time: 3600 - MCC
===========================================================================================
prep: translating JoinFreeModules-PT-0010 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating JoinFreeModules-PT-0010 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ JoinFreeModules-PT-0010 @ 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: 132/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1632
lola: finding significant places
lola: 51 places, 81 transitions, 40 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 91 transition conflict sets
lola: TASK
lola: reading formula from JoinFreeModules-PT-0010-LTLCardinality.task
lola: place invariant simplifies atomic proposition
lola: before: (p <= p35)
lola: after: (1 <= p35)
lola: place invariant simplifies atomic proposition
lola: before: (p14 <= p)
lola: after: (p14 <= 1)
lola: A (X (G (G ((p36 <= p40))))) : A (F (F (F (F ((1 <= p32)))))) : A ((p3 <= p15)) : A (F (F (X (X ((p47 <= p21)))))) : A (G ((G ((2 <= p36)) U F ((1 <= p35))))) : A ((F ((3 <= p32)) U X (G ((1 <= p43))))) : A ((1 <= p37)) : A (G ((X ((p15 <= p28)) U X ((2 <= p41))))) : A (G (X (((2 <= p41) U (p17 <= p11))))) : A ((1 <= p21)) : A ((X (F ((p25 <= p45))) U ((3 <= p42) U (p14 <= 1)))) : A ((p4 <= p3)) : A ((F (X ((1 <= p32))) U ((p25 <= p42) U (2 <= p31)))) : A ((G (G ((p15 <= p48))) U (p35 <= p5))) : A (G ((3 <= p41))) : A (G (((p47 <= p32) U F ((p5 <= p40)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:356
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
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: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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p3 <= p15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3 <= p15)
lola: processed formula length: 11
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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 JoinFreeModules-PT-0010-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p37)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p37)
lola: processed formula length: 10
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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 JoinFreeModules-PT-0010-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p21)
lola: processed formula length: 10
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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 JoinFreeModules-PT-0010-LTLCardinality-9 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: (p4 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4 <= p3)
lola: processed formula length: 10
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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 JoinFreeModules-PT-0010-LTLCardinality-11 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 (G ((p36 <= p40))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((p36 <= p40))))
lola: processed formula length: 24
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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 JoinFreeModules-PT-0010-LTLCardinality-0 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: A (X (G ((F ((2 <= p41)) AND ((p15 <= p28) OR (2 <= p41))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((2 <= p41)) AND ((p15 <= p28) OR (2 <= p41))))))
lola: processed formula length: 61
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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: 1725950 markings, 2044677 edges

FORMULA JoinFreeModules-PT-0010-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((p17 <= p11)) AND ((2 <= p41) OR (p17 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((p17 <= p11)) AND ((2 <= p41) OR (p17 <= p11))))))
lola: processed formula length: 63
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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: ========================================
lola: 3349570 markings, 3968144 edges, 669914 markings/sec, 0 secs
lola: 6458485 markings, 7651242 edges, 621783 markings/sec, 5 secs
lola: 9354098 markings, 11081675 edges, 579123 markings/sec, 10 secs
lola: 12123271 markings, 14362308 edges, 553835 markings/sec, 15 secs
lola: 14932060 markings, 17689844 edges, 561758 markings/sec, 20 secs
lola: 17594226 markings, 20843699 edges, 532433 markings/sec, 25 secs
lola: 20252125 markings, 23992491 edges, 531580 markings/sec, 30 secs
lola: 22794191 markings, 27004065 edges, 508413 markings/sec, 35 secs
lola: 25146606 markings, 29790970 edges, 470483 markings/sec, 40 secs
lola: 27925435 markings, 33083006 edges, 555766 markings/sec, 45 secs
lola: 30560343 markings, 36204570 edges, 526982 markings/sec, 50 secs
lola: 33227803 markings, 39364681 edges, 533492 markings/sec, 55 secs
lola: 35624327 markings, 42203828 edges, 479305 markings/sec, 60 secs
lola: 38117778 markings, 45157827 edges, 498690 markings/sec, 65 secs
lola: 40601054 markings, 48099741 edges, 496655 markings/sec, 70 secs
lola: 42907671 markings, 50832382 edges, 461323 markings/sec, 75 secs
lola: 45037164 markings, 53355168 edges, 425899 markings/sec, 80 secs
lola: 47381594 markings, 56132615 edges, 468886 markings/sec, 85 secs
lola: 49931255 markings, 59153177 edges, 509932 markings/sec, 90 secs
lola: 52358174 markings, 62028326 edges, 485384 markings/sec, 95 secs
lola: 54682714 markings, 64782189 edges, 464908 markings/sec, 100 secs
lola: 56879018 markings, 67384146 edges, 439261 markings/sec, 105 secs
lola: 59083344 markings, 69995586 edges, 440865 markings/sec, 110 secs
lola: 61610644 markings, 72989659 edges, 505460 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((p47 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((p47 <= p21)))))
lola: processed formula length: 28
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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: 69 markings, 75 edges

FORMULA JoinFreeModules-PT-0010-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 430 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((p25 <= p45))) U ((3 <= p42) U (p14 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((p25 <= p45))) U ((3 <= p42) U (p14 <= 1))))
lola: processed formula length: 54
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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: 1 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 491 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((F ((3 <= p32)) U X (G ((1 <= p43)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((3 <= p32)) U X (G ((1 <= p43)))))
lola: processed formula length: 41
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3583220 markings, 4244940 edges, 716644 markings/sec, 0 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: 3896170 markings, 4615727 edges

FORMULA JoinFreeModules-PT-0010-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 572 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((1 <= p32))) U ((p25 <= p42) U (2 <= p31))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((1 <= p32))) U ((p25 <= p42) U (2 <= p31))))
lola: processed formula length: 54
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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: 1 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 687 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p41)))
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 ((3 <= p41)))
lola: processed formula length: 18
lola: 28 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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: (p41 <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 859 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p32)))
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: (p32 <= 0)
lola: processed formula length: 10
lola: 28 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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 JoinFreeModules-PT-0010-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1145 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((1 <= p35)) OR (G ((2 <= p36)) AND F ((1 <= p35))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((F ((1 <= p35)) OR (G ((2 <= p36)) AND F ((1 <= p35))))))
lola: processed formula length: 63
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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: 2558431 markings, 2991110 edges, 511686 markings/sec, 0 secs
lola: 5178920 markings, 6050098 edges, 524098 markings/sec, 5 secs
lola: 7841512 markings, 9156891 edges, 532518 markings/sec, 10 secs
lola: 10390730 markings, 12133276 edges, 509844 markings/sec, 15 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: 11450505 markings, 13371038 edges

FORMULA JoinFreeModules-PT-0010-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1706 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p5 <= p40))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p5 <= p40))))
lola: processed formula length: 23
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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: 5 markings, 5 edges
lola: ========================================

FORMULA JoinFreeModules-PT-0010-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p35 <= p5) OR (G ((p15 <= p48)) AND F ((p35 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p35 <= p5) OR (G ((p15 <= p48)) AND F ((p35 <= p5)))))
lola: processed formula length: 59
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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: 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 JoinFreeModules-PT-0010-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((p17 <= p11)) AND ((2 <= p41) OR (p17 <= p11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((p17 <= p11)) AND ((2 <= p41) OR (p17 <= p11))))))
lola: processed formula length: 63
lola: 26 rewrites
lola: closed formula file JoinFreeModules-PT-0010-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: 3346554 markings, 3964563 edges, 669311 markings/sec, 0 secs
lola: 6539615 markings, 7747383 edges, 638612 markings/sec, 5 secs
lola: 9474806 markings, 11224684 edges, 587038 markings/sec, 10 secs
lola: 12257484 markings, 14521302 edges, 556536 markings/sec, 15 secs
lola: 15066581 markings, 17849213 edges, 561819 markings/sec, 20 secs
lola: 17940217 markings, 21253601 edges, 574727 markings/sec, 25 secs
lola: 20816553 markings, 24661187 edges, 575267 markings/sec, 30 secs
lola: 23463060 markings, 27796486 edges, 529301 markings/sec, 35 secs
lola: 26082364 markings, 30899557 edges, 523861 markings/sec, 40 secs
lola: 28909569 markings, 34248912 edges, 565441 markings/sec, 45 secs
lola: 31590054 markings, 37424485 edges, 536097 markings/sec, 50 secs
lola: 34065085 markings, 40356629 edges, 495006 markings/sec, 55 secs
lola: 36559358 markings, 43311562 edges, 498855 markings/sec, 60 secs
lola: 39306095 markings, 46565624 edges, 549347 markings/sec, 65 secs
lola: 41941932 markings, 49688266 edges, 527167 markings/sec, 70 secs
lola: 44212539 markings, 52378239 edges, 454121 markings/sec, 75 secs
lola: 46633104 markings, 55245858 edges, 484113 markings/sec, 80 secs
lola: 49350647 markings, 58465318 edges, 543509 markings/sec, 85 secs
lola: 51893410 markings, 61477736 edges, 508553 markings/sec, 90 secs
lola: 54307666 markings, 64337892 edges, 482851 markings/sec, 95 secs
lola: 56680137 markings, 67148543 edges, 474494 markings/sec, 100 secs
lola: 58958472 markings, 69847656 edges, 455667 markings/sec, 105 secs
lola: 61455924 markings, 72806364 edges, 499490 markings/sec, 110 secs
lola: 63039425 markings, 74682327 edges, 316700 markings/sec, 115 secs
lola: 63050484 markings, 74695439 edges, 2212 markings/sec, 120 secs
lola: 63055869 markings, 74701815 edges, 1077 markings/sec, 125 secs
lola: 63062561 markings, 74709742 edges, 1338 markings/sec, 130 secs
lola: 63067984 markings, 74716165 edges, 1085 markings/sec, 135 secs
lola: 63078352 markings, 74728454 edges, 2074 markings/sec, 140 secs
lola: 63083809 markings, 74734920 edges, 1091 markings/sec, 145 secs
lola: 63087650 markings, 74739462 edges, 768 markings/sec, 150 secs
lola: 63093731 markings, 74746664 edges, 1216 markings/sec, 155 secs
lola: 63098693 markings, 74752538 edges, 992 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA JoinFreeModules-PT-0010-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no no no no yes no unknown yes yes yes yes yes no no
lola:
preliminary result: no yes no no no no yes no unknown yes yes yes yes yes no no
lola: memory consumption: 17324 KB
lola: time consumption: 325 seconds

BK_STOP 1552874148052

--------------------
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="JoinFreeModules-PT-0010"
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 JoinFreeModules-PT-0010, 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-155246566100308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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