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 220K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 56K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Planning-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-152732257600351
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527963862033

info: Time: 3600 - MCC
===========================================================================================
prep: translating Planning-PT-none Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Planning-PT-none formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ Planning-PT-none @ 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: 254/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 4032
lola: finding significant places
lola: 126 places, 128 transitions, 82 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 124 transition conflict sets
lola: TASK
lola: reading formula from Planning-PT-none-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p39)
lola: LP says that atomic proposition is always true: (p10 <= p118)
lola: LP says that atomic proposition is always false: (3 <= p11)
lola: atomic prop true by contained trap!
lola: place invariant simplifies atomic proposition
lola: before: (p54 <= p24)
lola: after: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p54 <= 1)
lola: LP says that atomic proposition is always true: (p55 <= p117)
lola: LP says that atomic proposition is always false: (2 <= p42)
lola: LP says that atomic proposition is always false: (3 <= p15)
lola: atomic prop true by contained trap!
lola: A (G (FALSE)) : A (G ((F (TRUE) U G ((1 <= p93))))) : A (F ((p26 <= p30))) : A ((X (X ((p61 <= p33))) U F ((1 <= p1)))) : A ((p25 <= p89)) : A ((p121 <= p108)) : A (G (X (F (X (FALSE))))) : A ((p117 <= p21)) : A (F (F (F (G (TRUE))))) : A ((G (X ((p64 <= p57))) U (TRUE U TRUE))) : A (FALSE) : A (G ((X ((3 <= p86)) U FALSE))) : A (G (X ((1 <= p17)))) : A (X (F (X (X ((p102 <= p118)))))) : A (X ((p10 <= p9))) : A (F (G (TRUE)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:154
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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 43 rewrites
lola: closed formula file Planning-PT-none-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 Planning-PT-none-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: (p25 <= p89)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p25 <= p89)
lola: processed formula length: 12
lola: 43 rewrites
lola: closed formula file Planning-PT-none-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 Planning-PT-none-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: (p121 <= p108)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p121 <= p108)
lola: processed formula length: 14
lola: 43 rewrites
lola: closed formula file Planning-PT-none-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 Planning-PT-none-LTLCardinality-5 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: 43 rewrites
lola: closed formula file Planning-PT-none-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 Planning-PT-none-LTLCardinality-6 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: (p117 <= p21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p117 <= p21)
lola: processed formula length: 13
lola: 43 rewrites
lola: closed formula file Planning-PT-none-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 Planning-PT-none-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 43 rewrites
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: processed formula with 0 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 Planning-PT-none-LTLCardinality-8 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 43 rewrites
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: processed formula with 0 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 Planning-PT-none-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 43 rewrites
lola: closed formula file Planning-PT-none-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 Planning-PT-none-LTLCardinality-10 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 43 rewrites
lola: closed formula file Planning-PT-none-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 Planning-PT-none-LTLCardinality-11 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 43 rewrites
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: processed formula with 0 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 Planning-PT-none-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((p102 <= p118))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((p102 <= p118))))))
lola: processed formula length: 34
lola: 43 rewrites
lola: closed formula file Planning-PT-none-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: 5150 markings, 14604 edges
lola: ========================================

FORMULA Planning-PT-none-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((p10 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p10 <= p9)))
lola: processed formula length: 19
lola: 43 rewrites
lola: closed formula file Planning-PT-none-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: 2426818 markings, 2426818 edges, 485364 markings/sec, 0 secs
lola: 4900124 markings, 4900124 edges, 494661 markings/sec, 5 secs
lola: 7360426 markings, 7360425 edges, 492060 markings/sec, 10 secs
lola: 9795374 markings, 9795374 edges, 486990 markings/sec, 15 secs
lola: 12225145 markings, 12225144 edges, 485954 markings/sec, 20 secs
lola: 14649756 markings, 14649756 edges, 484922 markings/sec, 25 secs
lola: 17071707 markings, 17071707 edges, 484390 markings/sec, 30 secs
lola: 19456704 markings, 19456703 edges, 476999 markings/sec, 35 secs
lola: 21825291 markings, 21825290 edges, 473717 markings/sec, 40 secs
lola: 24184451 markings, 24184451 edges, 471832 markings/sec, 45 secs
lola: 26380525 markings, 26380525 edges, 439215 markings/sec, 50 secs
lola: 28771016 markings, 28771016 edges, 478098 markings/sec, 55 secs
lola: 31158756 markings, 31158756 edges, 477548 markings/sec, 60 secs
lola: 33539830 markings, 33539830 edges, 476215 markings/sec, 65 secs
lola: 35939847 markings, 35939847 edges, 480003 markings/sec, 70 secs
lola: 38311572 markings, 38311571 edges, 474345 markings/sec, 75 secs
lola: 40679780 markings, 40679780 edges, 473642 markings/sec, 80 secs
lola: 42922672 markings, 42922671 edges, 448578 markings/sec, 85 secs
lola: 45287768 markings, 45287768 edges, 473019 markings/sec, 90 secs
lola: 47643269 markings, 47643269 edges, 471100 markings/sec, 95 secs
lola: 49987523 markings, 49987522 edges, 468851 markings/sec, 100 secs
lola: 52349709 markings, 52349709 edges, 472437 markings/sec, 105 secs
lola: 54399582 markings, 54399582 edges, 409975 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 12 will run for 862 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((1 <= p17))))
lola: processed formula length: 22
lola: 43 rewrites
lola: closed formula file Planning-PT-none-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: 2475405 markings, 2475404 edges, 495081 markings/sec, 0 secs
lola: 4982123 markings, 4982123 edges, 501344 markings/sec, 5 secs
lola: 7476487 markings, 7476487 edges, 498873 markings/sec, 10 secs
lola: 9945703 markings, 9945703 edges, 493843 markings/sec, 15 secs
lola: 12407197 markings, 12407196 edges, 492299 markings/sec, 20 secs
lola: 14865271 markings, 14865271 edges, 491615 markings/sec, 25 secs
lola: 17309117 markings, 17309117 edges, 488769 markings/sec, 30 secs
lola: 19691126 markings, 19691126 edges, 476402 markings/sec, 35 secs
lola: 22072728 markings, 22072728 edges, 476320 markings/sec, 40 secs
lola: 24451450 markings, 24451450 edges, 475744 markings/sec, 45 secs
lola: 26840548 markings, 26840548 edges, 477820 markings/sec, 50 secs
lola: 29227203 markings, 29227203 edges, 477331 markings/sec, 55 secs
lola: 31615839 markings, 31615838 edges, 477727 markings/sec, 60 secs
lola: 34000928 markings, 34000928 edges, 477018 markings/sec, 65 secs
lola: 36385392 markings, 36385392 edges, 476893 markings/sec, 70 secs
lola: 38744389 markings, 38744389 edges, 471799 markings/sec, 75 secs
lola: 41100630 markings, 41100630 edges, 471248 markings/sec, 80 secs
lola: 43459664 markings, 43459663 edges, 471807 markings/sec, 85 secs
lola: 45811487 markings, 45811487 edges, 470365 markings/sec, 90 secs
lola: 48154799 markings, 48154799 edges, 468662 markings/sec, 95 secs
lola: 50485988 markings, 50485988 edges, 466238 markings/sec, 100 secs
lola: 52839011 markings, 52839010 edges, 470605 markings/sec, 105 secs
lola: 55203019 markings, 55203019 edges, 472802 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1111 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p1)))
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: (p1 <= 0)
lola: processed formula length: 9
lola: 45 rewrites
lola: closed formula file Planning-PT-none-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: 12 markings, 12 edges
lola:
========================================
FORMULA Planning-PT-none-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1666 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p26 <= 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 + 1 <= p26)
lola: processed formula length: 16
lola: 45 rewrites
lola: closed formula file Planning-PT-none-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: 12 markings, 12 edges
lola: ========================================

FORMULA Planning-PT-none-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= p93))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= p93))))
lola: processed formula length: 22
lola: 43 rewrites
lola: closed formula file Planning-PT-none-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 126
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: 13 markings, 14 edges
lola: ========================================

FORMULA Planning-PT-none-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X ((p10 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((p10 <= p9)))
lola: processed formula length: 19
lola: 43 rewrites
lola: closed formula file Planning-PT-none-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: 2439475 markings, 2439475 edges, 487895 markings/sec, 0 secs
lola: 4922230 markings, 4922231 edges, 496551 markings/sec, 5 secs
lola: 7380993 markings, 7380992 edges, 491753 markings/sec, 10 secs
lola: 9805276 markings, 9805275 edges, 484857 markings/sec, 15 secs
lola: 12224884 markings, 12224884 edges, 483922 markings/sec, 20 secs
lola: 14636558 markings, 14636558 edges, 482335 markings/sec, 25 secs
lola: 17028905 markings, 17028905 edges, 478469 markings/sec, 30 secs
lola: 19427061 markings, 19427061 edges, 479631 markings/sec, 35 secs
lola: 21812714 markings, 21812713 edges, 477131 markings/sec, 40 secs
lola: 24185808 markings, 24185808 edges, 474619 markings/sec, 45 secs
lola: 26568306 markings, 26568306 edges, 476500 markings/sec, 50 secs
lola: 28949623 markings, 28949623 edges, 476263 markings/sec, 55 secs
lola: 31329944 markings, 31329944 edges, 476064 markings/sec, 60 secs
lola: 33706760 markings, 33706760 edges, 475363 markings/sec, 65 secs
lola: 36092741 markings, 36092740 edges, 477196 markings/sec, 70 secs
lola: 38455427 markings, 38455427 edges, 472537 markings/sec, 75 secs
lola: 40810499 markings, 40810498 edges, 471014 markings/sec, 80 secs
lola: 43161356 markings, 43161356 edges, 470171 markings/sec, 85 secs
lola: 45513692 markings, 45513692 edges, 470467 markings/sec, 90 secs
lola: 47858133 markings, 47858133 edges, 468888 markings/sec, 95 secs
lola: 50195949 markings, 50195949 edges, 467563 markings/sec, 100 secs
lola: 52548847 markings, 52548847 edges, 470580 markings/sec, 105 secs
lola: 54419981 markings, 54420076 edges, 374227 markings/sec, 110 secs
lola: 54461701 markings, 54461701 edges, 8344 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA Planning-PT-none-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (G ((1 <= p17))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((1 <= p17))))
lola: processed formula length: 22
lola: 43 rewrites
lola: closed formula file Planning-PT-none-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: 2465847 markings, 2465847 edges, 493169 markings/sec, 0 secs
lola: 4950146 markings, 4950146 edges, 496860 markings/sec, 5 secs
lola: 7415128 markings, 7415128 edges, 492996 markings/sec, 10 secs
lola: 9853874 markings, 9853874 edges, 487749 markings/sec, 15 secs
lola: 12279844 markings, 12279844 edges, 485194 markings/sec, 20 secs
lola: 14703396 markings, 14703396 edges, 484710 markings/sec, 25 secs
lola: 17123432 markings, 17123432 edges, 484007 markings/sec, 30 secs
lola: 19522970 markings, 19522969 edges, 479908 markings/sec, 35 secs
lola: 21908120 markings, 21908119 edges, 477030 markings/sec, 40 secs
lola: 24284716 markings, 24284716 edges, 475319 markings/sec, 45 secs
lola: 26665761 markings, 26665761 edges, 476209 markings/sec, 50 secs
lola: 29049437 markings, 29049437 edges, 476735 markings/sec, 55 secs
lola: 31433473 markings, 31433472 edges, 476807 markings/sec, 60 secs
lola: 33812276 markings, 33812275 edges, 475761 markings/sec, 65 secs
lola: 36200391 markings, 36200391 edges, 477623 markings/sec, 70 secs
lola: 38562819 markings, 38562819 edges, 472486 markings/sec, 75 secs
lola: 40920252 markings, 40920252 edges, 471487 markings/sec, 80 secs
lola: 43282767 markings, 43282767 edges, 472503 markings/sec, 85 secs
lola: 45632657 markings, 45632657 edges, 469978 markings/sec, 90 secs
lola: 47975647 markings, 47975647 edges, 468598 markings/sec, 95 secs
lola: 50304641 markings, 50304640 edges, 465799 markings/sec, 100 secs
lola: 52663479 markings, 52663478 edges, 471768 markings/sec, 105 secs
lola: 54996241 markings, 54996241 edges, 466552 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA Planning-PT-none-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no yes yes no yes yes yes no no unknown yes unknown yes
lola:
preliminary result: no no no no yes yes no yes yes yes no no unknown yes unknown yes
lola: memory consumption: 17028 KB
lola: time consumption: 478 seconds

BK_STOP 1527964340039

--------------------
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="Planning-PT-none"
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/Planning-PT-none.tgz
mv Planning-PT-none 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 Planning-PT-none, 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 r208-smll-152732257600351"
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 ;