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.r099-smll-155246598200029.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 Kanban-PT-05000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r099-smll-155246598200029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.5K Feb 11 22:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 11 22:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 7 23:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 23:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 102 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 340 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 5 00:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 00:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.9K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 4 06:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 06:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Jan 31 23:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Jan 31 23:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rw-r--r-- 1 mcc users 14K Mar 10 17:31 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1552762452650

info: Time: 3600 - MCC
===========================================================================================
prep: translating Kanban-PT-05000 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating Kanban-PT-05000 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ Kanban-PT-05000 @ 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: 32/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 512
lola: finding significant places
lola: 16 places, 16 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from Kanban-PT-05000-LTLCardinality.task
lola: A (X ((X ((Pout1 <= P4)) U G ((Pm1 <= Pout2))))) : A ((X (G ((Pm4 <= Pm3))) U F (F ((Pm1 <= Pout3))))) : A ((G (X ((2 <= P2))) U (1 <= Pm1))) : A (X (G (((Pout2 <= Pback1) U (P2 <= Pout1))))) : A (X (X ((2 <= P1)))) : A (G ((X ((3 <= Pout4)) U (Pm4 <= Pout2)))) : A (((1 <= Pback1) U G ((Pout2 <= Pout1)))) : A (F (G ((Pback3 <= P1)))) : A (((1 <= Pback3) U X (X ((P3 <= Pback1))))) : A ((Pm2 <= Pback3)) : A ((Pout2 <= P3)) : A ((((1 <= Pback2) U (Pout4 <= Pback4)) U ((Pm4 <= Pback1) U (3 <= P1)))) : A (X ((1 <= Pout2))) : A (G (X ((P3 <= P1)))) : A (G (F (F (X ((3 <= Pback4)))))) : A (F ((1 <= Pback4)))
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Pm2 <= Pback3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pm2 <= Pback3)
lola: processed formula length: 15
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-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 Kanban-PT-05000-LTLCardinality-9 TRUE 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: (Pout2 <= P3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Pout2 <= P3)
lola: processed formula length: 13
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-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 Kanban-PT-05000-LTLCardinality-10 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: A (X (G ((F ((P2 <= Pout1)) AND ((Pout2 <= Pback1) OR (P2 <= Pout1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((P2 <= Pout1)) AND ((Pout2 <= Pback1) OR (P2 <= Pout1))))))
lola: processed formula length: 72
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-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: 4 markings, 4 edges
lola: ========================================

FORMULA Kanban-PT-05000-LTLCardinality-3 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: A (X (X ((2 <= P1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((2 <= P1))))
lola: processed formula length: 21
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-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: 5 markings, 4 edges
lola: ========================================

FORMULA Kanban-PT-05000-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((Pm4 <= Pout2)))) AND A (G ((X ((3 <= Pout4)) OR (Pm4 <= Pout2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Pm4 <= Pout2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Pm4 <= Pout2))))
lola: processed formula length: 26
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-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: 15003 markings, 20004 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================

FORMULA Kanban-PT-05000-LTLCardinality-5 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 (((1 <= Pback3) U X (X ((P3 <= Pback1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= Pback3) U X (X ((P3 <= Pback1)))))
lola: processed formula length: 44
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================

FORMULA Kanban-PT-05000-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((Pout1 <= P4)) U G ((Pm1 <= Pout2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X ((Pout1 <= P4)) U G ((Pm1 <= Pout2)))))
lola: processed formula length: 48
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 34 markings, 49 edges
lola: ========================================

FORMULA Kanban-PT-05000-LTLCardinality-0 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 (G ((2 <= P2))) U (1 <= Pm1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((2 <= P2))) U (1 <= Pm1)))
lola: processed formula length: 36
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-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: 3678209 markings, 5518423 edges, 735642 markings/sec, 0 secs
lola: 7101584 markings, 10655884 edges, 684675 markings/sec, 5 secs
lola: 10710957 markings, 16070631 edges, 721875 markings/sec, 10 secs
lola: 14229729 markings, 21348537 edges, 703754 markings/sec, 15 secs
lola: 17701477 markings, 26557864 edges, 694350 markings/sec, 20 secs
lola: 21132545 markings, 31705838 edges, 686214 markings/sec, 25 secs
lola: 24590944 markings, 36895297 edges, 691680 markings/sec, 30 secs
lola: 28116098 markings, 43934540 edges, 705031 markings/sec, 35 secs
lola: 31456728 markings, 50853065 edges, 668126 markings/sec, 40 secs
lola: 34686589 markings, 57541399 edges, 645972 markings/sec, 45 secs
lola: 37815227 markings, 64022572 edges, 625728 markings/sec, 50 secs
lola: 41062463 markings, 70748610 edges, 649447 markings/sec, 55 secs
lola: 44262017 markings, 77375208 edges, 639911 markings/sec, 60 secs
lola: 47430450 markings, 83936621 edges, 633687 markings/sec, 65 secs
lola: 50524971 markings, 90346815 edges, 618904 markings/sec, 70 secs
lola: 53664191 markings, 96848527 edges, 627844 markings/sec, 75 secs
lola: 56840492 markings, 103427031 edges, 635260 markings/sec, 80 secs
lola: 60072561 markings, 110121621 edges, 646414 markings/sec, 85 secs
lola: 63252889 markings, 116708509 edges, 636066 markings/sec, 90 secs
lola: 66347789 markings, 123120353 edges, 618980 markings/sec, 95 secs
lola: 69513692 markings, 129675040 edges, 633181 markings/sec, 100 secs
lola: 72623209 markings, 136116489 edges, 621903 markings/sec, 105 secs
lola: 75713666 markings, 142516513 edges, 618091 markings/sec, 110 secs
lola: 78718705 markings, 148742415 edges, 601008 markings/sec, 115 secs
lola: 81875179 markings, 155281094 edges, 631295 markings/sec, 120 secs
lola: 85094675 markings, 161949454 edges, 643899 markings/sec, 125 secs
lola: 86808420 markings, 165498880 edges, 342749 markings/sec, 130 secs
lola: 86815368 markings, 165512875 edges, 1390 markings/sec, 135 secs
lola: 86845199 markings, 165574761 edges, 5966 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= Pout2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= Pout2)))
lola: processed formula length: 20
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4 markings, 4 edges
lola: ========================================

FORMULA Kanban-PT-05000-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((P3 <= P1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((P3 <= P1))))
lola: processed formula length: 22
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-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: 40006 markings, 60009 edges
lola: ========================================

FORMULA Kanban-PT-05000-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= Pback4)))
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: (Pback4 <= 0)
lola: processed formula length: 13
lola: 18 rewrites
lola: closed formula file Kanban-PT-05000-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: 5005 markings, 5005 edges
lola: ========================================

FORMULA Kanban-PT-05000-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 683 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Pm1 <= Pout3)))
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: (Pout3 + 1 <= Pm1)
lola: processed formula length: 18
lola: 18 rewrites
lola: closed formula file Kanban-PT-05000-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 Kanban-PT-05000-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 854 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((3 <= Pback4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= Pback4))))
lola: processed formula length: 25
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-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: 5004 markings, 5004 edges
lola: ========================================

FORMULA Kanban-PT-05000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1139 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((Pback3 <= P1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((Pback3 <= P1))))
lola: processed formula length: 26
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-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 8
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: 50012 markings, 65017 edges
lola: ========================================

FORMULA Kanban-PT-05000-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1709 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= Pback1) U G ((Pout2 <= Pout1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= Pback1) U G ((Pout2 <= Pout1))))
lola: processed formula length: 42
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45009 markings, 60010 edges
lola: ========================================

FORMULA Kanban-PT-05000-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3419 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((1 <= Pback2) U (Pout4 <= Pback4)) U ((Pm4 <= Pback1) U (3 <= P1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((1 <= Pback2) U (Pout4 <= Pback4)) U ((Pm4 <= Pback1) U (3 <= P1))))
lola: processed formula length: 73
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================

FORMULA Kanban-PT-05000-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A ((X (G ((2 <= P2))) U (1 <= Pm1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((2 <= P2))) U (1 <= Pm1)))
lola: processed formula length: 36
lola: 16 rewrites
lola: closed formula file Kanban-PT-05000-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: 3804338 markings, 5708486 edges, 760868 markings/sec, 0 secs
lola: 7534556 markings, 11303668 edges, 746044 markings/sec, 5 secs
lola: 11148087 markings, 16726004 edges, 722706 markings/sec, 10 secs
lola: 14677384 markings, 22020856 edges, 705859 markings/sec, 15 secs
lola: 18180405 markings, 27276576 edges, 700604 markings/sec, 20 secs
lola: 21629006 markings, 32450289 edges, 689720 markings/sec, 25 secs
lola: 25156933 markings, 37808539 edges, 705585 markings/sec, 30 secs
lola: 28646745 markings, 45033498 edges, 697962 markings/sec, 35 secs
lola: 31965289 markings, 51906826 edges, 663709 markings/sec, 40 secs
lola: 35212999 markings, 58631973 edges, 649542 markings/sec, 45 secs
lola: 38359038 markings, 65147985 edges, 629208 markings/sec, 50 secs
lola: 41622330 markings, 71907722 edges, 652658 markings/sec, 55 secs
lola: 44837215 markings, 78565594 edges, 642977 markings/sec, 60 secs
lola: 48013906 markings, 85143684 edges, 635338 markings/sec, 65 secs
lola: 51134458 markings, 91609659 edges, 624110 markings/sec, 70 secs
lola: 54272347 markings, 98106067 edges, 627578 markings/sec, 75 secs
lola: 57498748 markings, 104790689 edges, 645280 markings/sec, 80 secs
lola: 60723481 markings, 111467876 edges, 644947 markings/sec, 85 secs
lola: 63899337 markings, 118046280 edges, 635171 markings/sec, 90 secs
lola: 67005377 markings, 124479981 edges, 621208 markings/sec, 95 secs
lola: 70204010 markings, 131106020 edges, 639727 markings/sec, 100 secs
lola: 73308852 markings, 137535518 edges, 620968 markings/sec, 105 secs
lola: 76406652 markings, 143951301 edges, 619560 markings/sec, 110 secs
lola: 79443426 markings, 150242625 edges, 607355 markings/sec, 115 secs
lola: 82671418 markings, 156928125 edges, 645598 markings/sec, 120 secs
lola: 85864362 markings, 163544606 edges, 638589 markings/sec, 125 secs
lola: 86852783 markings, 165591992 edges, 197684 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA Kanban-PT-05000-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes unknown no yes no no no no yes yes yes no no no no
lola:
preliminary result: no yes unknown no yes no no no no yes yes yes no no no no
lola: memory consumption: 17712 KB
lola: time consumption: 290 seconds

BK_STOP 1552762742146

--------------------
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="Kanban-PT-05000"
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 Kanban-PT-05000, 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 r099-smll-155246598200029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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