Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2019-input.r121-smll-155272326000026.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3957
Executing tool win2018
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 r121-smll-155272326000026
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 2.9K Feb 12 09:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 12 09:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 8 09:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 8 09:32 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 103 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 341 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 00:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K Feb 4 22:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Feb 4 12:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Feb 4 12:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 1 08:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 08:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:23 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 56K Mar 10 17:31 model.pnml
-rw-r--r-- 1 mcc users 1 Mar 10 17:31 unfinite

--------------------
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 1552865427631

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: (2 <= p47)
lola: LP says that atomic proposition is always false: (2 <= p3)
lola: LP says that atomic proposition is always true: (p27 <= p119)
lola: LP says that atomic proposition is always false: (3 <= p52)
lola: LP says that atomic proposition is always false: (3 <= p46)
lola: LP says that atomic proposition is always true: (p43 <= p119)
lola: A (F ((G (FALSE) U FALSE))) : A ((p126 <= p36)) : A (F ((X ((p111 <= p46)) U TRUE))) : A (G (X (G (G (FALSE))))) : A (G (((p60 <= p102) U F ((3 <= p111))))) : A ((G (G (FALSE)) U F (X ((1 <= p16))))) : A (F ((p31 <= p51))) : A (((p117 <= p57) U X (F ((1 <= p76))))) : A (TRUE) : A (G ((p44 <= p17))) : A (((1 <= p17) U F ((1 <= p10)))) : A (F (G (X ((p43 <= p14))))) : A (X (G (((1 <= p103) U (p22 <= p108))))) : A (X (F (((1 <= p60) U (2 <= p123))))) : A ((p48 <= p100)) : A (G (F ((p59 <= p3))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:157
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:166
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
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:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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: 33 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

FORMULA Planning-PT-none-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p126 <= p36)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p126 <= p36)
lola: processed formula length: 13
lola: 33 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

FORMULA Planning-PT-none-LTLCardinality-1 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 33 rewrites
lola: closed formula file Planning-PT-none-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: 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-2 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: 33 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-3 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 33 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 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p48 <= p100)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p48 <= p100)
lola: processed formula length: 13
lola: 33 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-14 TRUE 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 (F ((1 <= p16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p16))))
lola: processed formula length: 22
lola: 33 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: 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: 32 markings, 31 edges

FORMULA Planning-PT-none-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((p22 <= p108)) AND ((1 <= p103) OR (p22 <= p108))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((p22 <= p108)) AND ((1 <= p103) OR (p22 <= p108))))))
lola: processed formula length: 66
lola: 33 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: 2423765 markings, 2423765 edges, 484753 markings/sec, 0 secs
lola: 4895026 markings, 4895026 edges, 494252 markings/sec, 5 secs
lola: 7338243 markings, 7338243 edges, 488643 markings/sec, 10 secs
lola: 9773857 markings, 9773857 edges, 487123 markings/sec, 15 secs
lola: 12196021 markings, 12196020 edges, 484433 markings/sec, 20 secs
lola: 14604181 markings, 14604180 edges, 481632 markings/sec, 25 secs
lola: 17005344 markings, 17005344 edges, 480233 markings/sec, 30 secs
lola: 19394884 markings, 19394883 edges, 477908 markings/sec, 35 secs
lola: 21766766 markings, 21766766 edges, 474376 markings/sec, 40 secs
lola: 24136100 markings, 24136100 edges, 473867 markings/sec, 45 secs
lola: 26511287 markings, 26511287 edges, 475037 markings/sec, 50 secs
lola: 28874514 markings, 28874513 edges, 472645 markings/sec, 55 secs
lola: 31230057 markings, 31230057 edges, 471109 markings/sec, 60 secs
lola: 33576238 markings, 33576238 edges, 469236 markings/sec, 65 secs
lola: 35953616 markings, 35953616 edges, 475476 markings/sec, 70 secs
lola: 38301133 markings, 38301133 edges, 469503 markings/sec, 75 secs
lola: 40660042 markings, 40660041 edges, 471782 markings/sec, 80 secs
lola: 43005633 markings, 43005632 edges, 469118 markings/sec, 85 secs
lola: 45355573 markings, 45355573 edges, 469988 markings/sec, 90 secs
lola: 47699107 markings, 47699106 edges, 468707 markings/sec, 95 secs
lola: 50028545 markings, 50028544 edges, 465888 markings/sec, 100 secs
lola: 52377155 markings, 52377155 edges, 469722 markings/sec, 105 secs
lola: 54715047 markings, 54715047 edges, 467578 markings/sec, 110 secs
lola: 55517988 markings, 55517995 edges, 160588 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 431 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((2 <= p123))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= p123))))
lola: processed formula length: 23
lola: 33 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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2411508 markings, 2411507 edges, 482302 markings/sec, 0 secs
lola: 4923072 markings, 4923072 edges, 502313 markings/sec, 5 secs
lola: 7402752 markings, 7402752 edges, 495936 markings/sec, 10 secs
lola: 9878772 markings, 9878772 edges, 495204 markings/sec, 15 secs
lola: 12337119 markings, 12337119 edges, 491669 markings/sec, 20 secs
lola: 14800470 markings, 14800470 edges, 492670 markings/sec, 25 secs
lola: 17239372 markings, 17239372 edges, 487780 markings/sec, 30 secs
lola: 19654396 markings, 19654396 edges, 483005 markings/sec, 35 secs
lola: 22057822 markings, 22057822 edges, 480685 markings/sec, 40 secs
lola: 24468189 markings, 24468189 edges, 482073 markings/sec, 45 secs
lola: 26883425 markings, 26883425 edges, 483047 markings/sec, 50 secs
lola: 29288702 markings, 29288702 edges, 481055 markings/sec, 55 secs
lola: 31693106 markings, 31693106 edges, 480881 markings/sec, 60 secs
lola: 34089414 markings, 34089414 edges, 479262 markings/sec, 65 secs
lola: 36489333 markings, 36489332 edges, 479984 markings/sec, 70 secs
lola: 38870057 markings, 38870056 edges, 476145 markings/sec, 75 secs
lola: 41249723 markings, 41249723 edges, 475933 markings/sec, 80 secs
lola: 43637236 markings, 43637236 edges, 477503 markings/sec, 85 secs
lola: 46004884 markings, 46004884 edges, 473530 markings/sec, 90 secs
lola: 48377857 markings, 48377856 edges, 474595 markings/sec, 95 secs
lola: 50750187 markings, 50750187 edges, 474466 markings/sec, 100 secs
lola: 53141866 markings, 53141865 edges, 478336 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((p117 <= p57) U X (F ((1 <= p76)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p117 <= p57) U X (F ((1 <= p76)))))
lola: processed formula length: 40
lola: 33 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: 2534623 markings, 2534627 edges, 506925 markings/sec, 0 secs
lola: 4969964 markings, 4969964 edges, 487068 markings/sec, 5 secs
lola: 7373965 markings, 7373965 edges, 480800 markings/sec, 10 secs
lola: 9803380 markings, 9803380 edges, 485883 markings/sec, 15 secs
lola: 12220426 markings, 12220426 edges, 483409 markings/sec, 20 secs
lola: 14627922 markings, 14627921 edges, 481499 markings/sec, 25 secs
lola: 17026823 markings, 17026823 edges, 479780 markings/sec, 30 secs
lola: 19420967 markings, 19420967 edges, 478829 markings/sec, 35 secs
lola: 21796496 markings, 21796496 edges, 475106 markings/sec, 40 secs
lola: 24181590 markings, 24181590 edges, 477019 markings/sec, 45 secs
lola: 26554556 markings, 26554556 edges, 474593 markings/sec, 50 secs
lola: 28926896 markings, 28926896 edges, 474468 markings/sec, 55 secs
lola: 31291121 markings, 31291120 edges, 472845 markings/sec, 60 secs
lola: 33658891 markings, 33658891 edges, 473554 markings/sec, 65 secs
lola: 36049456 markings, 36049456 edges, 478113 markings/sec, 70 secs
lola: 38425356 markings, 38425356 edges, 475180 markings/sec, 75 secs
lola: 40795905 markings, 40795905 edges, 474110 markings/sec, 80 secs
lola: 43162964 markings, 43162964 edges, 473412 markings/sec, 85 secs
lola: 45521805 markings, 45521805 edges, 471768 markings/sec, 90 secs
lola: 47880410 markings, 47880410 edges, 471721 markings/sec, 95 secs
lola: 50230810 markings, 50230810 edges, 470080 markings/sec, 100 secs
lola: 52602618 markings, 52602618 edges, 474362 markings/sec, 105 secs
lola: 54766704 markings, 54766704 edges, 432817 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p44 <= p17)))
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 ((p44 <= p17)))
lola: processed formula length: 20
lola: 35 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)
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: (p17 + 1 <= p44)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Planning-PT-none-LTLCardinality-10-0.sara
lola: ========================================

FORMULA Planning-PT-none-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 643 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p10)))
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: (p10 <= 0)
lola: processed formula length: 10
lola: 35 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA Planning-PT-none-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 804 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((p31 <= p51)))
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: (p51 + 1 <= p31)
lola: processed formula length: 16
lola: 35 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: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA Planning-PT-none-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= p111))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= p111))))
lola: processed formula length: 23
lola: 33 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: 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: 12 markings, 12 edges
lola: ========================================

FORMULA Planning-PT-none-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1608 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((p43 <= p14))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((p43 <= p14))))
lola: processed formula length: 24
lola: 33 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: 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: 12 markings, 12 edges

FORMULA Planning-PT-none-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 15 will run for 3216 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p59 <= p3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p59 <= p3))))
lola: processed formula length: 23
lola: 33 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: 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: 11 markings, 11 edges
lola: ========================================

FORMULA Planning-PT-none-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((p22 <= p108)) AND ((1 <= p103) OR (p22 <= p108))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((p22 <= p108)) AND ((1 <= p103) OR (p22 <= p108))))))
lola: processed formula length: 66
lola: 33 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: 2532614 markings, 2532614 edges, 506523 markings/sec, 0 secs
lola: 4997299 markings, 4997299 edges, 492937 markings/sec, 5 secs
lola: 7446707 markings, 7446707 edges, 489882 markings/sec, 10 secs
lola: 9874620 markings, 9874619 edges, 485583 markings/sec, 15 secs
lola: 12285406 markings, 12285406 edges, 482157 markings/sec, 20 secs
lola: 14690050 markings, 14690050 edges, 480929 markings/sec, 25 secs
lola: 17095558 markings, 17095558 edges, 481102 markings/sec, 30 secs
lola: 19474999 markings, 19474999 edges, 475888 markings/sec, 35 secs
lola: 21826974 markings, 21826973 edges, 470395 markings/sec, 40 secs
lola: 24201450 markings, 24201450 edges, 474895 markings/sec, 45 secs
lola: 26583431 markings, 26583431 edges, 476396 markings/sec, 50 secs
lola: 28955731 markings, 28955731 edges, 474460 markings/sec, 55 secs
lola: 31325845 markings, 31325845 edges, 474023 markings/sec, 60 secs
lola: 33692647 markings, 33692647 edges, 473360 markings/sec, 65 secs
lola: 36076517 markings, 36076517 edges, 476774 markings/sec, 70 secs
lola: 38429280 markings, 38429280 edges, 470553 markings/sec, 75 secs
lola: 40783464 markings, 40783464 edges, 470837 markings/sec, 80 secs
lola: 43136155 markings, 43136154 edges, 470538 markings/sec, 85 secs
lola: 45482872 markings, 45482872 edges, 469343 markings/sec, 90 secs
lola: 47821151 markings, 47821151 edges, 467656 markings/sec, 95 secs
lola: 50159341 markings, 50159341 edges, 467638 markings/sec, 100 secs
lola: 52511580 markings, 52511580 edges, 470448 markings/sec, 105 secs
lola: 54840201 markings, 54840201 edges, 465724 markings/sec, 110 secs
lola: 55484200 markings, 55484199 edges, 128800 markings/sec, 115 secs
lola: 55496174 markings, 55496174 edges, 2395 markings/sec, 120 secs
lola: 55517771 markings, 55517770 edges, 4319 markings/sec, 125 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: ========================================
lola: ...considering subproblem: A (X (F ((2 <= p123))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((2 <= p123))))
lola: processed formula length: 23
lola: 33 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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2570051 markings, 2570050 edges, 514010 markings/sec, 0 secs
lola: 4911478 markings, 4911477 edges, 468285 markings/sec, 5 secs
lola: 7434241 markings, 7434240 edges, 504553 markings/sec, 10 secs
lola: 9927688 markings, 9927688 edges, 498689 markings/sec, 15 secs
lola: 12385769 markings, 12385768 edges, 491616 markings/sec, 20 secs
lola: 14839866 markings, 14839866 edges, 490819 markings/sec, 25 secs
lola: 17275866 markings, 17275866 edges, 487200 markings/sec, 30 secs
lola: 19699935 markings, 19699934 edges, 484814 markings/sec, 35 secs
lola: 22124098 markings, 22124098 edges, 484833 markings/sec, 40 secs
lola: 24530376 markings, 24530375 edges, 481256 markings/sec, 45 secs
lola: 26954323 markings, 26954323 edges, 484789 markings/sec, 50 secs
lola: 29372770 markings, 29372770 edges, 483689 markings/sec, 55 secs
lola: 31800070 markings, 31800070 edges, 485460 markings/sec, 60 secs
lola: 34222311 markings, 34222310 edges, 484448 markings/sec, 65 secs
lola: 36650468 markings, 36650468 edges, 485631 markings/sec, 70 secs
lola: 39082601 markings, 39082601 edges, 486427 markings/sec, 75 secs
lola: 41501570 markings, 41501570 edges, 483794 markings/sec, 80 secs
lola: 43922277 markings, 43922277 edges, 484141 markings/sec, 85 secs
lola: 46330171 markings, 46330171 edges, 481579 markings/sec, 90 secs
lola: 48737063 markings, 48737063 edges, 481378 markings/sec, 95 secs
lola: 51139686 markings, 51139686 edges, 480525 markings/sec, 100 secs
lola: 53549886 markings, 53549885 edges, 482040 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA Planning-PT-none-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (((p117 <= p57) U X (F ((1 <= p76)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p117 <= p57) U X (F ((1 <= p76)))))
lola: processed formula length: 40
lola: 33 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: 2329518 markings, 2329518 edges, 465904 markings/sec, 0 secs
lola: 4846687 markings, 4846686 edges, 503434 markings/sec, 5 secs
lola: 7333755 markings, 7333754 edges, 497414 markings/sec, 10 secs
lola: 9800733 markings, 9800733 edges, 493396 markings/sec, 15 secs
lola: 12249119 markings, 12249119 edges, 489677 markings/sec, 20 secs
lola: 14688467 markings, 14688466 edges, 487870 markings/sec, 25 secs
lola: 17127821 markings, 17127821 edges, 487871 markings/sec, 30 secs
lola: 19544864 markings, 19544863 edges, 483409 markings/sec, 35 secs
lola: 21950345 markings, 21950345 edges, 481096 markings/sec, 40 secs
lola: 24268629 markings, 24268629 edges, 463657 markings/sec, 45 secs
lola: 26653862 markings, 26653862 edges, 477047 markings/sec, 50 secs
lola: 29058376 markings, 29058376 edges, 480903 markings/sec, 55 secs
lola: 31465803 markings, 31465803 edges, 481485 markings/sec, 60 secs
lola: 33867247 markings, 33867246 edges, 480289 markings/sec, 65 secs
lola: 36284820 markings, 36284820 edges, 483515 markings/sec, 70 secs
lola: 38687177 markings, 38687177 edges, 480471 markings/sec, 75 secs
lola: 41095536 markings, 41095536 edges, 481672 markings/sec, 80 secs
lola: 43508439 markings, 43508439 edges, 482581 markings/sec, 85 secs
lola: 45900181 markings, 45900181 edges, 478348 markings/sec, 90 secs
lola: 48288675 markings, 48288674 edges, 477699 markings/sec, 95 secs
lola: 50674964 markings, 50674963 edges, 477258 markings/sec, 100 secs
lola: 53065199 markings, 53065199 edges, 478047 markings/sec, 105 secs
lola: 54775906 markings, 54775906 edges, 342141 markings/sec, 110 secs
lola: Child process aborted or communication problem between parent and child process

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

BK_STOP 1552866144060

--------------------
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="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-3957"
echo " Executing tool win2018"
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 r121-smll-155272326000026"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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