Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r088-csrt-155246565800134.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is GPPP-PT-C0100N0000000100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-155246565800134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 3.8K Feb 11 01:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 11 01:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 7 00:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 7 00:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 111 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 349 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 23:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 23:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 4 22:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K Feb 4 22:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 3 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 3 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Jan 31 01:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Jan 31 01:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 17 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 1 Mar 10 17:31 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000000100-LTLCardinality-00
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-01
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-02
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-03
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-04
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-05
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-06
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-07
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-08
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-09
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-10
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-11
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-12
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-13
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-14
FORMULA_NAME GPPP-PT-C0100N0000000100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1552865081475

info: Time: 3600 - MCC
===========================================================================================
prep: translating GPPP-PT-C0100N0000000100 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating GPPP-PT-C0100N0000000100 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ GPPP-PT-C0100N0000000100 @ 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: 55/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1056
lola: finding significant places
lola: 33 places, 22 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 30 transition conflict sets
lola: TASK
lola: reading formula from GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: LP says that atomic proposition is always true: (Lac <= NADplus)
lola: A (G ((X ((1 <= S7P)) U F ((1 <= NADPH))))) : A ((Lac <= ATP)) : A ((F (G ((1 <= GSH))) U G (F ((F6P <= GSSG))))) : A (X (X (G (F ((2 <= FBP)))))) : A ((3 <= GAP)) : A ((3 <= Pyr)) : A (X (G (X (X ((F6P <= GAP)))))) : A ((1 <= NADPplus)) : A ((DHAP <= NADH)) : A ((F (G ((2 <= _1_3_BPG))) U G (X ((GAP <= GSH))))) : A (G (G (X ((b2 <= _2PG))))) : A (X (G (((3 <= GAP) U (GAP <= R5P))))) : A (F (F (G (G ((NADH <= c1)))))) : A (X (TRUE)) : A (X (G ((2 <= c1)))) : A (X ((Lac <= R5P)))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:353
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:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 214 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Lac <= ATP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Lac <= ATP)
lola: processed formula length: 12
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-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 GPPP-PT-C0100N0000000100-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 228 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= GAP)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= GAP)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 244 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= Pyr)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Pyr)
lola: processed formula length: 10
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges

FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= NADPplus)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= NADPplus)
lola: processed formula length: 15
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-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 GPPP-PT-C0100N0000000100-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DHAP <= NADH)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (DHAP <= NADH)
lola: processed formula length: 14
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-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 GPPP-PT-C0100N0000000100-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((F6P <= GAP))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((F6P <= GAP))))))
lola: processed formula length: 32
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: ========================================
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 405 markings, 405 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((GAP <= GSH))) OR (F (G ((GAP <= GSH))) AND F (G ((2 <= _1_3_BPG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((GAP <= GSH))) OR (F (G ((GAP <= GSH))) AND F (G ((2 <= _1_3_BPG))))))
lola: processed formula length: 80
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-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: add low 7
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: 406 markings, 407 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((b2 <= _2PG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((b2 <= _2PG))))
lola: processed formula length: 24
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-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: 405 markings, 405 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 428 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((GAP <= R5P)) AND ((3 <= GAP) OR (GAP <= R5P))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((GAP <= R5P)) AND ((3 <= GAP) OR (GAP <= R5P))))))
lola: processed formula length: 63
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-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: 405 markings, 405 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 489 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges

FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((2 <= c1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((2 <= c1))))
lola: processed formula length: 21
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-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: 4183 markings, 4978 edges

FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 11 will run for 685 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((Lac <= R5P)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((Lac <= R5P)))
lola: processed formula length: 20
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 857 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= FBP))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= FBP))))
lola: processed formula length: 22
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-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: 23 markings, 23 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1143 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= NADPH))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= NADPH))))
lola: processed formula length: 24
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-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: 406 markings, 406 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((NADH <= c1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((NADH <= c1))))
lola: processed formula length: 24
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-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: 3332074 markings, 4239869 edges
lola: ========================================

FORMULA GPPP-PT-C0100N0000000100-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3426 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((F6P <= GSSG))) OR (G (F ((F6P <= GSSG))) AND F (G ((1 <= GSH))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((F6P <= GSSG))) OR (G (F ((F6P <= GSSG))) AND F (G ((1 <= GSH))))))
lola: processed formula length: 77
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 8 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: 4710203 markings, 5401143 edges, 942041 markings/sec, 0 secs
lola: 9039035 markings, 10431498 edges, 865766 markings/sec, 5 secs
lola: 13047060 markings, 15372281 edges, 801605 markings/sec, 10 secs
lola: 16593260 markings, 19775634 edges, 709240 markings/sec, 15 secs
lola: 20619913 markings, 24552316 edges, 805331 markings/sec, 20 secs
lola: 24500982 markings, 28995496 edges, 776214 markings/sec, 25 secs
lola: 28194387 markings, 33492349 edges, 738681 markings/sec, 30 secs
lola: 32107404 markings, 38273979 edges, 782603 markings/sec, 35 secs
lola: 35541217 markings, 42543636 edges, 686763 markings/sec, 40 secs
lola: 39315197 markings, 47169042 edges, 754796 markings/sec, 45 secs
lola: 43239055 markings, 51716093 edges, 784772 markings/sec, 50 secs
lola: 46836018 markings, 56093440 edges, 719393 markings/sec, 55 secs
lola: 50804847 markings, 60782136 edges, 793766 markings/sec, 60 secs
lola: 54354063 markings, 65007593 edges, 709843 markings/sec, 65 secs
lola: 58022833 markings, 69597533 edges, 733754 markings/sec, 70 secs
lola: 61896073 markings, 74332622 edges, 774648 markings/sec, 75 secs
lola: 65375751 markings, 78575768 edges, 695936 markings/sec, 80 secs
lola: 69113392 markings, 83020890 edges, 747528 markings/sec, 85 secs
lola: 72778694 markings, 87228181 edges, 733060 markings/sec, 90 secs
lola: 76314392 markings, 91536721 edges, 707140 markings/sec, 95 secs
lola: 80133566 markings, 96072771 edges, 763835 markings/sec, 100 secs
lola: 83368490 markings, 100054640 edges, 646985 markings/sec, 105 secs
lola: 86923775 markings, 104421144 edges, 711057 markings/sec, 110 secs
lola: 90586281 markings, 108874844 edges, 732501 markings/sec, 115 secs
lola: 93865134 markings, 112892482 edges, 655771 markings/sec, 120 secs
lola: 97544400 markings, 117320144 edges, 735853 markings/sec, 125 secs
lola: 101384887 markings, 121695236 edges, 768097 markings/sec, 130 secs
lola: 104926420 markings, 125997734 edges, 708307 markings/sec, 135 secs
lola: 108816234 markings, 130599765 edges, 777963 markings/sec, 140 secs
lola: 112170031 markings, 134776152 edges, 670759 markings/sec, 145 secs
lola: 115848727 markings, 139313042 edges, 735739 markings/sec, 150 secs
lola: 119714117 markings, 143867547 edges, 773078 markings/sec, 155 secs
lola: 123190510 markings, 148087188 edges, 695279 markings/sec, 160 secs
lola: 123815198 markings, 148738298 edges, 124938 markings/sec, 165 secs
lola: 123845580 markings, 148770192 edges, 6076 markings/sec, 170 secs
lola: 123864100 markings, 148789807 edges, 3704 markings/sec, 175 secs
lola: 123882381 markings, 148808979 edges, 3656 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A ((G (F ((F6P <= GSSG))) OR (G (F ((F6P <= GSSG))) AND F (G ((1 <= GSH))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((F6P <= GSSG))) OR (G (F ((F6P <= GSSG))) AND F (G ((1 <= GSH))))))
lola: processed formula length: 77
lola: 24 rewrites
lola: closed formula file GPPP-PT-C0100N0000000100-LTLCardinality.task
lola: the resulting Büchi automaton has 8 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: 4740771 markings, 5432752 edges, 948154 markings/sec, 0 secs
lola: 9059441 markings, 10457879 edges, 863734 markings/sec, 5 secs
lola: 13058060 markings, 15388602 edges, 799724 markings/sec, 10 secs
lola: 16579746 markings, 19757155 edges, 704337 markings/sec, 15 secs
lola: 20597913 markings, 24529914 edges, 803633 markings/sec, 20 secs
lola: 24458267 markings, 28950401 edges, 772071 markings/sec, 25 secs
lola: 28140649 markings, 33434562 edges, 736476 markings/sec, 30 secs
lola: 32072763 markings, 38215711 edges, 786423 markings/sec, 35 secs
lola: 35483839 markings, 42463741 edges, 682215 markings/sec, 40 secs
lola: 39236704 markings, 47067289 edges, 750573 markings/sec, 45 secs
lola: 43162774 markings, 51637845 edges, 785214 markings/sec, 50 secs
lola: 46747633 markings, 56001236 edges, 716972 markings/sec, 55 secs
lola: 50699867 markings, 60672593 edges, 790447 markings/sec, 60 secs
lola: 54278170 markings, 64874927 edges, 715661 markings/sec, 65 secs
lola: 57880555 markings, 69348082 edges, 720477 markings/sec, 70 secs
lola: 61638586 markings, 73982868 edges, 751606 markings/sec, 75 secs
lola: 64937755 markings, 78041357 edges, 659834 markings/sec, 80 secs
lola: 68557556 markings, 82442799 edges, 723960 markings/sec, 85 secs
lola: 72306908 markings, 86736430 edges, 749870 markings/sec, 90 secs
lola: 75475779 markings, 90659778 edges, 633774 markings/sec, 95 secs
lola: 79222150 markings, 95108699 edges, 749274 markings/sec, 100 secs
lola: 82736763 markings, 99170122 edges, 702923 markings/sec, 105 secs
lola: 86195481 markings, 103397388 edges, 691744 markings/sec, 110 secs
lola: 89920804 markings, 107876016 edges, 745065 markings/sec, 115 secs
lola: 92974363 markings, 111644316 edges, 610712 markings/sec, 120 secs
lola: 96358571 markings, 115697079 edges, 676842 markings/sec, 125 secs
lola: 99917080 markings, 120043806 edges, 711702 markings/sec, 130 secs
lola: 102987446 markings, 123791898 edges, 614073 markings/sec, 135 secs
lola: 106360842 markings, 127900094 edges, 674679 markings/sec, 140 secs
lola: 109996738 markings, 132216626 edges, 727179 markings/sec, 145 secs
lola: 113350885 markings, 136312733 edges, 670829 markings/sec, 150 secs
lola: 117181956 markings, 140839034 edges, 766214 markings/sec, 155 secs
lola: 120862861 markings, 145062290 edges, 736181 markings/sec, 160 secs
lola: 123823797 markings, 148747370 edges, 592187 markings/sec, 165 secs
lola: 123900219 markings, 148827890 edges, 15284 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA GPPP-PT-C0100N0000000100-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 no no no yes yes no no no yes yes no yes
lola:
preliminary result: no yes unknown no no no no yes yes no no no yes yes no yes
lola: memory consumption: 16144 KB
lola: time consumption: 508 seconds

BK_STOP 1552865589900

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is GPPP-PT-C0100N0000000100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-csrt-155246565800134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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