Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..........................
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.7K May 30 22:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 30 22:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 28 11:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.5K May 28 11:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K May 28 09:15 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.2K May 28 07:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 28 07:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 27 05:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 27 05:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 55K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-025026, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170300725
=====================================================================

--------------------
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 RefineWMG-PT-025-026-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-025-026-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527825437057

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-025026 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-025026 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ RefineWMG-PT-025026 @ 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: 232/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4128
lola: finding significant places
lola: 129 places, 103 transitions, 77 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 129 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-025-026-LTLCardinality.task
lola: A ((2 <= p7)) : A (G ((p113 <= p70))) : A (F ((G ((2 <= p84)) U G ((p36 <= p96))))) : A (G ((p82 <= p71))) : A ((p11 <= p33)) : A (X (G (F ((p82 <= p99))))) : A ((2 <= p15)) : A (X ((X ((p97 <= p28)) U F ((p72 <= p50))))) : A (G ((1 <= p116))) : A (X ((G ((1 <= p25)) U F ((2 <= p114))))) : A ((2 <= p93)) : A (X (X (G ((1 <= p100))))) : A (F (G ((2 <= p55)))) : A (X ((p117 <= p111))) : A ((3 <= p55)) : A (X ((p125 <= p77)))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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: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: (2 <= p7)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p7)
lola: processed formula length: 9
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-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 RefineWMG-PT-025-026-LTLCardinality-0 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: (p11 <= p33)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p11 <= p33)
lola: processed formula length: 12
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-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 RefineWMG-PT-025-026-LTLCardinality-4 TRUE 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: (2 <= p15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p15)
lola: processed formula length: 10
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-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 RefineWMG-PT-025-026-LTLCardinality-6 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: (2 <= p93)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p93)
lola: processed formula length: 10
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-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

FORMULA RefineWMG-PT-025-026-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p55)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p55)
lola: processed formula length: 10
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-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 RefineWMG-PT-025-026-LTLCardinality-14 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 (F ((p72 <= p50))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((p72 <= p50))))
lola: processed formula length: 24
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 31 markings, 30 edges
lola: ========================================

FORMULA RefineWMG-PT-025-026-LTLCardinality-7 TRUE 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 (G ((1 <= p100)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((1 <= p100)))))
lola: processed formula length: 27
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-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: 55 markings, 55 edges
lola: ========================================

FORMULA RefineWMG-PT-025-026-LTLCardinality-11 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 ((p117 <= p111)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p117 <= p111)))
lola: processed formula length: 22
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-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: 62 markings, 62 edges
lola: ========================================

FORMULA RefineWMG-PT-025-026-LTLCardinality-13 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 ((F ((2 <= p114)) OR (G ((1 <= p25)) AND F ((2 <= p114))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= p114)) OR (G ((1 <= p25)) AND F ((2 <= p114))))))
lola: processed formula length: 65
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 61 markings, 60 edges
lola: ========================================

FORMULA RefineWMG-PT-025-026-LTLCardinality-9 TRUE 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 ((p125 <= p77)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p125 <= p77)))
lola: processed formula length: 21
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-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: 56 markings, 56 edges
lola: ========================================

FORMULA RefineWMG-PT-025-026-LTLCardinality-15 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 (G ((1 <= p116)))
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 ((1 <= p116)))
lola: processed formula length: 19
lola: 12 rewrites
lola: closed formula file RefineWMG-PT-025-026-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: (p116 <= 0)
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 RefineWMG-PT-025-026-LTLCardinality-8 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 (G ((p113 <= p70)))
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 ((p113 <= p70)))
lola: processed formula length: 21
lola: 12 rewrites
lola: closed formula file RefineWMG-PT-025-026-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: (p70 + 1 <= p113)
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: state equation: write sara problem file to RefineWMG-PT-025-026-LTLCardinality-11-0.sara

FORMULA RefineWMG-PT-025-026-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p82 <= p71)))
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 ((p82 <= p71)))
lola: processed formula length: 20
lola: 12 rewrites
lola: closed formula file RefineWMG-PT-025-026-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: (p71 + 1 <= p82)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RefineWMG-PT-025-026-LTLCardinality-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
sara: try reading problem file RefineWMG-PT-025-026-LTLCardinality-11-0.sara.

FORMULA RefineWMG-PT-025-026-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1190 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= p55))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= p55))))
lola: processed formula length: 22
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-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: add low 75
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: 8 markings, 9 edges
lola: ========================================

FORMULA RefineWMG-PT-025-026-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1785 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p82 <= p99))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p82 <= p99))))
lola: processed formula length: 24
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-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: place or transition ordering is non-deterministic

lola: 2334022 markings, 2917526 edges, 466804 markings/sec, 0 secs
lola: 4981460 markings, 6226824 edges, 529488 markings/sec, 5 secs
lola: 7606434 markings, 9508041 edges, 524995 markings/sec, 10 secs
lola: 10228033 markings, 12785040 edges, 524320 markings/sec, 15 secs
lola: 12826453 markings, 16033065 edges, 519684 markings/sec, 20 secs
lola: 15411297 markings, 19264120 edges, 516969 markings/sec, 25 secs
lola: 17990595 markings, 22488243 edges, 515860 markings/sec, 30 secs
lola: 20529387 markings, 25661732 edges, 507758 markings/sec, 35 secs
lola: 23097396 markings, 28871744 edges, 513602 markings/sec, 40 secs
lola: 25654424 markings, 32068029 edges, 511406 markings/sec, 45 secs
lola: 28164520 markings, 35205649 edges, 502019 markings/sec, 50 secs
lola: 30730462 markings, 38413075 edges, 513188 markings/sec, 55 secs
lola: 33279926 markings, 41599906 edges, 509893 markings/sec, 60 secs
lola: 35811999 markings, 44764997 edges, 506415 markings/sec, 65 secs
lola: 38328024 markings, 47910029 edges, 503205 markings/sec, 70 secs
lola: 40793319 markings, 50991647 edges, 493059 markings/sec, 75 secs
lola: 43296897 markings, 54121120 edges, 500716 markings/sec, 80 secs
lola: 45772916 markings, 57216144 edges, 495204 markings/sec, 85 secs
lola: 48234723 markings, 60293402 edges, 492361 markings/sec, 90 secs
lola: 50710697 markings, 63388370 edges, 495195 markings/sec, 95 secs
lola: 53194043 markings, 66492552 edges, 496669 markings/sec, 100 secs
lola: 55664486 markings, 69580606 edges, 494089 markings/sec, 105 secs
lola: 58136113 markings, 72670140 edges, 494325 markings/sec, 110 secs
lola: 60636500 markings, 75795624 edges, 500077 markings/sec, 115 secs
lola: 63138151 markings, 78922687 edges, 500330 markings/sec, 120 secs
lola: 65509785 markings, 81887230 edges, 474327 markings/sec, 125 secs
lola: 67746430 markings, 84683035 edges, 447329 markings/sec, 130 secs
lola: 69940376 markings, 87425469 edges, 438789 markings/sec, 135 secs
lola: 72121910 markings, 90152385 edges, 436307 markings/sec, 140 secs
lola: 74312934 markings, 92891166 edges, 438205 markings/sec, 145 secs
lola: 76556329 markings, 95695410 edges, 448679 markings/sec, 150 secs
lola: 79092490 markings, 98865610 edges, 507232 markings/sec, 155 secs
lola: 81579151 markings, 101973937 edges, 497332 markings/sec, 160 secs
lola: 84089186 markings, 105111480 edges, 502007 markings/sec, 165 secs
lola: 84422396 markings, 105527993 edges, 66642 markings/sec, 170 secs
lola: 84442612 markings, 105553263 edges, 4043 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3386 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((G ((p36 <= p96)) OR (G ((2 <= p84)) AND F (G ((p36 <= p96)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((p36 <= p96)) OR (G ((2 <= p84)) AND F (G ((p36 <= p96)))))))
lola: processed formula length: 71
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-LTLCardinality.task
lola: the resulting Büchi automaton has 11 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: 2697625 markings, 3372030 edges, 539525 markings/sec, 0 secs
lola: 5341978 markings, 6677471 edges, 528871 markings/sec, 5 secs
lola: 7964567 markings, 9955708 edges, 524518 markings/sec, 10 secs
lola: 10570756 markings, 13213443 edges, 521238 markings/sec, 15 secs
lola: 13141506 markings, 16426882 edges, 514150 markings/sec, 20 secs
lola: 15652031 markings, 19565037 edges, 502105 markings/sec, 25 secs
lola: 18240110 markings, 22800137 edges, 517616 markings/sec, 30 secs
lola: 20800668 markings, 26000833 edges, 512112 markings/sec, 35 secs
lola: 23354622 markings, 29193276 edges, 510791 markings/sec, 40 secs
lola: 25904017 markings, 32380021 edges, 509879 markings/sec, 45 secs
lola: 28409032 markings, 35511289 edges, 501003 markings/sec, 50 secs
lola: 30916345 markings, 38645430 edges, 501463 markings/sec, 55 secs
lola: 33426992 markings, 41783739 edges, 502129 markings/sec, 60 secs
lola: 35882250 markings, 44852812 edges, 491052 markings/sec, 65 secs
lola: 38055992 markings, 47569988 edges, 434748 markings/sec, 70 secs
lola: 40216487 markings, 50270608 edges, 432099 markings/sec, 75 secs
lola: 42408004 markings, 53010004 edges, 438303 markings/sec, 80 secs
lola: 44570223 markings, 55712778 edges, 432444 markings/sec, 85 secs
lola: 46878948 markings, 58598683 edges, 461745 markings/sec, 90 secs
lola: 49008207 markings, 61260258 edges, 425852 markings/sec, 95 secs
lola: 51191809 markings, 63989759 edges, 436720 markings/sec, 100 secs
lola: 53431901 markings, 66789875 edges, 448018 markings/sec, 105 secs
lola: 55793110 markings, 69741387 edges, 472242 markings/sec, 110 secs
lola: 57922089 markings, 72402610 edges, 425796 markings/sec, 115 secs
lola: 60076992 markings, 75096238 edges, 430981 markings/sec, 120 secs
lola: 62221957 markings, 77777444 edges, 428993 markings/sec, 125 secs
lola: 64502576 markings, 80628218 edges, 456124 markings/sec, 130 secs
lola: 66874685 markings, 83593355 edges, 474422 markings/sec, 135 secs
lola: 69278804 markings, 86598503 edges, 480824 markings/sec, 140 secs
lola: 71704113 markings, 89630141 edges, 485062 markings/sec, 145 secs
lola: 74130123 markings, 92662653 edges, 485202 markings/sec, 150 secs
lola: 76486356 markings, 95607943 edges, 471247 markings/sec, 155 secs
lola: 78857777 markings, 98572221 edges, 474284 markings/sec, 160 secs
lola: 81199908 markings, 101499883 edges, 468426 markings/sec, 165 secs
lola: 83275983 markings, 104094978 edges, 415215 markings/sec, 170 secs
lola: 83487152 markings, 104358939 edges, 42234 markings/sec, 175 secs
lola: 83536767 markings, 104420958 edges, 9923 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (F ((p82 <= p99))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p82 <= p99))))
lola: processed formula length: 24
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-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: 2614979 markings, 3268722 edges, 522996 markings/sec, 0 secs
lola: 5197070 markings, 6496335 edges, 516418 markings/sec, 5 secs
lola: 7761662 markings, 9702076 edges, 512918 markings/sec, 10 secs
lola: 10312195 markings, 12890243 edges, 510107 markings/sec, 15 secs
lola: 12560214 markings, 15700266 edges, 449604 markings/sec, 20 secs
lola: 14790064 markings, 18487579 edges, 445970 markings/sec, 25 secs
lola: 16971919 markings, 21214899 edges, 436371 markings/sec, 30 secs
lola: 19259203 markings, 24074003 edges, 457457 markings/sec, 35 secs
lola: 21709235 markings, 27136542 edges, 490006 markings/sec, 40 secs
lola: 24211176 markings, 30263969 edges, 500388 markings/sec, 45 secs
lola: 26704515 markings, 33380643 edges, 498668 markings/sec, 50 secs
lola: 29179911 markings, 36474887 edges, 495079 markings/sec, 55 secs
lola: 31648727 markings, 39560908 edges, 493763 markings/sec, 60 secs
lola: 34049787 markings, 42562232 edges, 480212 markings/sec, 65 secs
lola: 36513439 markings, 45641797 edges, 492730 markings/sec, 70 secs
lola: 38799576 markings, 48499469 edges, 457227 markings/sec, 75 secs
lola: 40939398 markings, 51174245 edges, 427964 markings/sec, 80 secs
lola: 43077042 markings, 53846300 edges, 427529 markings/sec, 85 secs
lola: 45299152 markings, 56623939 edges, 444422 markings/sec, 90 secs
lola: 47417086 markings, 59271356 edges, 423587 markings/sec, 95 secs
lola: 49622701 markings, 62028375 edges, 441123 markings/sec, 100 secs
lola: 51744040 markings, 64680049 edges, 424268 markings/sec, 105 secs
lola: 53895028 markings, 67368785 edges, 430198 markings/sec, 110 secs
lola: 56052771 markings, 70065961 edges, 431549 markings/sec, 115 secs
lola: 58194006 markings, 72742506 edges, 428247 markings/sec, 120 secs
lola: 60363067 markings, 75453832 edges, 433812 markings/sec, 125 secs
lola: 62528170 markings, 78160211 edges, 433021 markings/sec, 130 secs
lola: 64626285 markings, 80782855 edges, 419623 markings/sec, 135 secs
lola: 66729108 markings, 83411384 edges, 420565 markings/sec, 140 secs
lola: 68975182 markings, 86218975 edges, 449215 markings/sec, 145 secs
lola: 71116227 markings, 88895282 edges, 428209 markings/sec, 150 secs
lola: 73375643 markings, 91719552 edges, 451883 markings/sec, 155 secs
lola: 75809243 markings, 94761553 edges, 486720 markings/sec, 160 secs
lola: 78214635 markings, 97768292 edges, 481078 markings/sec, 165 secs
lola: 80601105 markings, 100751380 edges, 477294 markings/sec, 170 secs
lola: 83032351 markings, 103790438 edges, 486249 markings/sec, 175 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-025-026-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (F ((G ((p36 <= p96)) OR (G ((2 <= p84)) AND F (G ((p36 <= p96)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((G ((p36 <= p96)) OR (G ((2 <= p84)) AND F (G ((p36 <= p96)))))))
lola: processed formula length: 71
lola: 10 rewrites
lola: closed formula file RefineWMG-PT-025-026-LTLCardinality.task
lola: the resulting Büchi automaton has 11 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: 2686379 markings, 3357972 edges, 537276 markings/sec, 0 secs
lola: 5277825 markings, 6597280 edges, 518289 markings/sec, 5 secs
lola: 7863721 markings, 9829650 edges, 517179 markings/sec, 10 secs
lola: 10487281 markings, 13109101 edges, 524712 markings/sec, 15 secs
lola: 13068565 markings, 16335706 edges, 516257 markings/sec, 20 secs
lola: 15645068 markings, 19556333 edges, 515301 markings/sec, 25 secs
lola: 18235253 markings, 22794065 edges, 518037 markings/sec, 30 secs
lola: 20796486 markings, 25995607 edges, 512247 markings/sec, 35 secs
lola: 23354687 markings, 29193358 edges, 511640 markings/sec, 40 secs
lola: 25976706 markings, 32470883 edges, 524404 markings/sec, 45 secs
lola: 28529475 markings, 35661843 edges, 510554 markings/sec, 50 secs
lola: 31128152 markings, 38910188 edges, 519735 markings/sec, 55 secs
lola: 33703567 markings, 42129458 edges, 515083 markings/sec, 60 secs
lola: 36262188 markings, 45327733 edges, 511724 markings/sec, 65 secs
lola: 38736874 markings, 48421092 edges, 494937 markings/sec, 70 secs
lola: 41122244 markings, 51402803 edges, 477074 markings/sec, 75 secs
lola: 43505906 markings, 54382382 edges, 476732 markings/sec, 80 secs
lola: 46055977 markings, 57569971 edges, 510014 markings/sec, 85 secs
lola: 48378199 markings, 60472748 edges, 464444 markings/sec, 90 secs
lola: 50729625 markings, 63412030 edges, 470285 markings/sec, 95 secs
lola: 53072726 markings, 66340907 edges, 468620 markings/sec, 100 secs
lola: 55544366 markings, 69430457 edges, 494328 markings/sec, 105 secs
lola: 58015028 markings, 72518792 edges, 494132 markings/sec, 110 secs
lola: 60523478 markings, 75654347 edges, 501690 markings/sec, 115 secs
lola: 63007724 markings, 78759653 edges, 496849 markings/sec, 120 secs
lola: 65412852 markings, 81766063 edges, 481026 markings/sec, 125 secs
lola: 67979472 markings, 84974338 edges, 513324 markings/sec, 130 secs
lola: 70623985 markings, 88279979 edges, 528903 markings/sec, 135 secs
lola: 73207826 markings, 91509782 edges, 516768 markings/sec, 140 secs
lola: 75785644 markings, 94732053 edges, 515564 markings/sec, 145 secs
lola: 78392791 markings, 97990988 edges, 521429 markings/sec, 150 secs
lola: 80946064 markings, 101182578 edges, 510655 markings/sec, 155 secs
lola: 83236721 markings, 104045901 edges, 458131 markings/sec, 160 secs
lola: 83487593 markings, 104359490 edges, 50174 markings/sec, 165 secs
lola: 83493228 markings, 104366534 edges, 1127 markings/sec, 170 secs
lola: 83512833 markings, 104391039 edges, 3921 markings/sec, 175 secs
lola: 83533275 markings, 104416592 edges, 4088 markings/sec, 180 secs
lola: 83546234 markings, 104432791 edges, 2592 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA RefineWMG-PT-025-026-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no unknown no yes unknown no yes no yes yes no no no no no
lola:
preliminary result: no no unknown no yes unknown no yes no yes yes no no no no no
lola: memory consumption: 16736 KB
lola: time consumption: 749 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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="RefineWMG-PT-025026"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-025026.tgz
mv RefineWMG-PT-025026 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is RefineWMG-PT-025026, 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 r280-csrt-152749170300725"
echo "====================================================================="
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 ;