Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2019-input.r132-oct2-155403939200050.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 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 PolyORBNT-PT-S10J30, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-oct2-155403939200050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 14K Feb 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Feb 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 477K Feb 8 11:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 8 11:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 106 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 344 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 5.4K Feb 5 00:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 5 00:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 4 22:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K Feb 4 22:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Feb 4 13:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 4 13:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 467K Feb 1 09:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.3M Feb 1 09:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 4 22:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.6K Feb 4 22:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 18M 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 PolyORBNT-PT-S10J30-LTLCardinality-00
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-01
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-02
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-03
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-04
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-05
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-06
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-07
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-08
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-09
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-10
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-11
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-12
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-13
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-14
FORMULA_NAME PolyORBNT-PT-S10J30-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1554070130216

info: Time: 3600 - MCC
===========================================================================================
prep: translating PolyORBNT-PT-S10J30 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating PolyORBNT-PT-S10J30 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ PolyORBNT-PT-S10J30 @ 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: 12714/65536 symbol table entries, 4655 collisions
lola: preprocessing...
lola: Size of bit vector: 21248
lola: finding significant places
lola: 664 places, 12050 transitions, 572 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2298 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-PT-S10J30-LTLCardinality.task
lola: LP says that atomic proposition is always false: (3 <= CanInjectEvent)
lola: A (X (F (G ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + TheSour_6 + TheSour_7 + TheSour_8 + TheSour_9 + TheSour_10 <= JobCnt))))) : A (G (((NotifyEventJobQueuedB_1_29 + NotifyEventJobQueuedB_1_28 + NotifyEventJobQueuedB_1_27 + NotifyEventJobQueuedB_1_26 + NotifyEventJobQueuedB_1_25 + NotifyEventJobQueuedB_1_24 + NotifyEventJobQueuedB_1_23 + NotifyEventJobQueuedB_1_22 + NotifyEventJobQueuedB_1_21 + NotifyEventJobQueuedB_1_20 + NotifyEventJobQueuedB_1_19 + NotifyEventJobQueuedB_1_18 + NotifyEventJobQueuedB_1_17 + NotifyEventJobQueuedB_1_16 + NotifyEventJobQueuedB_1_15 + NotifyEventJobQueuedB_1_14 + NotifyEventJobQueuedB_1_13 + NotifyEventJobQueuedB_1_12 + NotifyEventJobQueuedB_1_11 + NotifyEventJobQueuedB_1_10 + NotifyEventJobQueuedB_1_30 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_9 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9) U G (FALSE)))) : A (G (X (X (F ((2 <= place_521_1)))))) : A ((Try_Check_Sources_E_1 <= NotifyEventEndOfCheckSourcesB_1)) : A (X (X (((1 <= place_460) U (Try_Check_Sources_B_1 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9))))) : A (F (F (G (X ((mo1 <= place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9)))))) : A (F ((DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 <= place_518_1))) : A (G (F ((2 <= NotifyEventJobQueuedB_1_29 + NotifyEventJobQueuedB_1_28 + NotifyEventJobQueuedB_1_27 + NotifyEventJobQueuedB_1_26 + NotifyEventJobQueuedB_1_25 + NotifyEventJobQueuedB_1_24 + NotifyEventJobQueuedB_1_23 + NotifyEventJobQueuedB_1_22 + NotifyEventJobQueuedB_1_21 + NotifyEventJobQueuedB_1_20 + NotifyEventJobQueuedB_1_19 + NotifyEventJobQueuedB_1_18 + NotifyEventJobQueuedB_1_17 + NotifyEventJobQueuedB_1_16 + NotifyEventJobQueuedB_1_15 + NotifyEventJobQueuedB_1_14 + NotifyEventJobQueuedB_1_13 + NotifyEventJobQueuedB_1_12 + NotifyEventJobQueuedB_1_11 + NotifyEventJobQueuedB_1_10 + NotifyEventJobQueuedB_1_30 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4 + NotifyEventJobQueuedB_1_5 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_1_7 + NotifyEventJobQueuedB_1_8 + NotifyEventJobQueuedB_1_9)))) : A ((Perform_Work_B_1_26 <= CreatedJobs_1_10)) : A (X (X (F (X ((Schedule_Task_E_1_CheckSource_0 <= AvailableJobId_11)))))) : A (F (F ((CreatedJobs_27_2 <= CreatedJobs_27_7)))) : A ((Perform_Work_B_1_4 <= NotifyEventJobQueuedB_1_21)) : A (G ((place_500_1 <= place_482_1_9))) : A (F (G (G ((CreatedJobs_19_1 <= place_787_1))))) : A (F ((G ((CreatedJobs_0_5 <= CreatedJobs_10_2)) U F ((f3_14 <= NotifyEventJobQueuedB_1_2))))) : A (X ((X ((CreatedJobs_2_3 <= CreatedJobs_17_5)) U F ((CreatedJobs_26_10 <= f3_22)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 214 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: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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 PolyORBNT-PT-S10J30-LTLCardinality-1 FALSE 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: (Try_Check_Sources_E_1 <= NotifyEventEndOfCheckSourcesB_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Try_Check_Sources_E_1 <= NotifyEventEndOfCheckSourcesB_1)
lola: processed formula length: 58
lola: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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 PolyORBNT-PT-S10J30-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Perform_Work_B_1_26 <= CreatedJobs_1_10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Perform_Work_B_1_26 <= CreatedJobs_1_10)
lola: processed formula length: 41
lola: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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 PolyORBNT-PT-S10J30-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 263 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Perform_Work_B_1_4 <= NotifyEventJobQueuedB_1_21)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Perform_Work_B_1_4 <= NotifyEventJobQueuedB_1_21)
lola: processed formula length: 50
lola: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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 PolyORBNT-PT-S10J30-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((Schedule_Task_E_1_CheckSource_0 <= AvailableJobId_11))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (F ((Schedule_Task_E_1_CheckSource_0 <= AvailableJobId_11))))))
lola: processed formula length: 74
lola: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 244 markings, 638 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 311 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((1 <= place_460) U (Try_Check_Sources_B_1 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((1 <= place_460) U (Try_Check_Sources_B_1 <= f3_10 + f3_11 + f3_12 + f3_13 + f3_14 + f3_15 + f3_16 + f3_17 + f3_18 + f3_19 + f3_20 + f3_21 + f3_22 + f3_23 + f3_24 + f3_25 + f3_26 + f3_27 + f3_28 + f3_29 + f3_30 + f3_0 + f3_1 + f3_2 + f3_3 + f3_4 + f3_5 + f3_6 + f3_7 + f3_8 + f3_9)))))
lola: processed formula length: 295
lola: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 68 markings, 122 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 343 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((CreatedJobs_26_10 <= f3_22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((CreatedJobs_26_10 <= f3_22))))
lola: processed formula length: 40
lola: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 12 markings, 11 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-LTLCardinality-15 TRUE 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 (G ((place_500_1 <= place_482_1_9)))
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 ((place_500_1 <= place_482_1_9)))
lola: processed formula length: 38
lola: 25 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: (place_482_1_9 + 1 <= place_500_1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBNT-PT-S10J30-LTLCardinality-7-0.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBNT-PT-S10J30-LTLCardinality-7-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-LTLCardinality-12 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 (F ((CreatedJobs_27_2 <= CreatedJobs_27_7)))
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: (CreatedJobs_27_7 + 1 <= CreatedJobs_27_2)
lola: processed formula length: 42
lola: 25 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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 PolyORBNT-PT-S10J30-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 490 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 <= place_518_1)))
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: (place_518_1 + 1 <= DataOnSrc_10 + DataOnSrc_9 + DataOnSrc_8 + DataOnSrc_7 + DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1)
lola: processed formula length: 159
lola: 25 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 13 markings, 12 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 571 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= place_521_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= place_521_1))))
lola: processed formula length: 30
lola: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 18 markings, 18 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 686 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((CreatedJobs_19_1 <= place_787_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((CreatedJobs_19_1 <= place_787_1))))
lola: processed formula length: 45
lola: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 6251 markings, 9253 edges, 1250 markings/sec, 0 secs
lola: 11578 markings, 17581 edges, 1065 markings/sec, 5 secs
lola: 17563 markings, 26131 edges, 1197 markings/sec, 10 secs
lola: 22836 markings, 34656 edges, 1055 markings/sec, 15 secs
lola: 29002 markings, 43163 edges, 1233 markings/sec, 20 secs
lola: 34212 markings, 51609 edges, 1042 markings/sec, 25 secs
lola: 40426 markings, 60161 edges, 1243 markings/sec, 30 secs
lola: 45447 markings, 68374 edges, 1004 markings/sec, 35 secs
lola: 51840 markings, 77146 edges, 1279 markings/sec, 40 secs
lola: 56862 markings, 85380 edges, 1004 markings/sec, 45 secs
lola: 63424 markings, 94367 edges, 1312 markings/sec, 50 secs
lola: 68286 markings, 102404 edges, 972 markings/sec, 55 secs
lola: 74792 markings, 111879 edges, 1301 markings/sec, 60 secs
lola: 79859 markings, 119851 edges, 1013 markings/sec, 65 secs
lola: 86156 markings, 128934 edges, 1259 markings/sec, 70 secs
lola: 91442 markings, 137064 edges, 1057 markings/sec, 75 secs
lola: 97504 markings, 145975 edges, 1212 markings/sec, 80 secs
lola: 103013 markings, 154267 edges, 1102 markings/sec, 85 secs
lola: 108854 markings, 163010 edges, 1168 markings/sec, 90 secs
lola: 114558 markings, 171430 edges, 1141 markings/sec, 95 secs
lola: 120166 markings, 179993 edges, 1122 markings/sec, 100 secs
lola: 126043 markings, 188520 edges, 1175 markings/sec, 105 secs
lola: 131452 markings, 196930 edges, 1082 markings/sec, 110 secs
lola: 137441 markings, 206059 edges, 1198 markings/sec, 115 secs
lola: 142979 markings, 214408 edges, 1108 markings/sec, 120 secs
lola: 148325 markings, 223084 edges, 1069 markings/sec, 125 secs
lola: 153957 markings, 231844 edges, 1126 markings/sec, 130 secs
lola: 159863 markings, 240722 edges, 1181 markings/sec, 135 secs
lola: 165633 markings, 249214 edges, 1154 markings/sec, 140 secs
lola: 170980 markings, 257884 edges, 1069 markings/sec, 145 secs
lola: 176419 markings, 266413 edges, 1088 markings/sec, 150 secs
lola: 182291 markings, 275379 edges, 1174 markings/sec, 155 secs
lola: 188348 markings, 284627 edges, 1211 markings/sec, 160 secs
lola: 193919 markings, 293072 edges, 1114 markings/sec, 165 secs
lola: 199371 markings, 301881 edges, 1090 markings/sec, 170 secs
lola: 205054 markings, 310713 edges, 1137 markings/sec, 175 secs
lola: 210953 markings, 319582 edges, 1180 markings/sec, 180 secs
lola: 216762 markings, 328125 edges, 1162 markings/sec, 185 secs
lola: 222201 markings, 336887 edges, 1088 markings/sec, 190 secs
lola: 227678 markings, 345678 edges, 1095 markings/sec, 195 secs
lola: 233230 markings, 354539 edges, 1110 markings/sec, 200 secs
lola: 238793 markings, 363409 edges, 1113 markings/sec, 205 secs
lola: 244433 markings, 372120 edges, 1128 markings/sec, 210 secs
lola: 250094 markings, 381106 edges, 1132 markings/sec, 215 secs
lola: 255749 markings, 390091 edges, 1131 markings/sec, 220 secs
lola: 261663 markings, 399116 edges, 1183 markings/sec, 225 secs
lola: 267474 markings, 408233 edges, 1162 markings/sec, 230 secs
lola: 273260 markings, 417316 edges, 1157 markings/sec, 235 secs
lola: 279058 markings, 426414 edges, 1160 markings/sec, 240 secs
lola: 284495 markings, 435789 edges, 1087 markings/sec, 245 secs
lola: 290113 markings, 445538 edges, 1124 markings/sec, 250 secs
lola: 295887 markings, 455280 edges, 1155 markings/sec, 255 secs
lola: 301402 markings, 464667 edges, 1103 markings/sec, 260 secs
lola: 306916 markings, 474292 edges, 1103 markings/sec, 265 secs
lola: 312546 markings, 483230 edges, 1126 markings/sec, 270 secs
lola: 318108 markings, 494389 edges, 1112 markings/sec, 275 secs
lola: 323602 markings, 505005 edges, 1099 markings/sec, 280 secs
lola: 329213 markings, 515160 edges, 1122 markings/sec, 285 secs
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: 334053 markings, 529410 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((f3_14 <= NotifyEventJobQueuedB_1_2)) OR (G ((CreatedJobs_0_5 <= CreatedJobs_10_2)) AND F ((f3_14 <= NotifyEventJobQueuedB_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F ((f3_14 <= NotifyEventJobQueuedB_1_2)) OR (G ((CreatedJobs_0_5 <= CreatedJobs_10_2)) AND F ((f3_14 <= NotifyEventJobQueuedB_1_2))))))
lola: processed formula length: 142
lola: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 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 PolyORBNT-PT-S10J30-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1045 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((mo1 <= place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((mo1 <= place_482_1_10 + place_482_1_1 + place_482_1_2 + place_482_1_3 + place_482_1_4 + place_482_1_5 + place_482_1_6 + place_482_1_7 + place_482_1_8 + place_482_1_9))))
lola: processed formula length: 179
lola: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 19 markings, 20 edges
lola: ========================================
FORMULA PolyORBNT-PT-S10J30-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

lola: subprocess 14 will run for 1568 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + TheSour_6 + TheSour_7 + TheSour_8 + TheSour_9 + TheSour_10 <= JobCnt))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((TheSour_1 + TheSour_2 + TheSour_3 + TheSour_4 + TheSour_5 + TheSour_6 + TheSour_7 + TheSour_8 + TheSour_9 + TheSour_10 <= JobCnt))))
lola: processed formula length: 142
lola: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 14 markings, 15 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3136 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= NotifyEventJobQueuedB_1_29 + NotifyEventJobQueuedB_1_28 + NotifyEventJobQueuedB_1_27 + NotifyEventJobQueuedB_1_26 + NotifyEventJobQueuedB_1_25 + NotifyEventJobQueuedB_1_24 + NotifyEventJobQueuedB_1_23 + NotifyEventJobQueuedB_1_22 + NotifyEventJobQueuedB_1_21 + NotifyEventJobQueuedB_1_20 + NotifyEventJobQueuedB_1_19 + NotifyEventJobQueuedB_1_18 + NotifyEventJobQueuedB_1_17 + NotifyEv... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= NotifyEventJobQueuedB_1_29 + NotifyEventJobQueuedB_1_28 + NotifyEventJobQueuedB_1_27 + NotifyEventJobQueuedB_1_26 + NotifyEventJobQueuedB_1_25 + NotifyEventJobQueuedB_1_24 + NotifyEventJobQueuedB_1_23 + NotifyEventJobQueuedB_1_22 + NotifyEventJobQueuedB_1_21 + NotifyEventJobQueuedB_1_20 + NotifyEventJobQueuedB_1_19 + NotifyEventJobQueuedB_1_18 + NotifyEventJobQueuedB_1_17 + NotifyEv... (shortened)
lola: processed formula length: 905
lola: 23 rewrites
lola: closed formula file PolyORBNT-PT-S10J30-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: 18 markings, 18 edges
lola: ========================================

FORMULA PolyORBNT-PT-S10J30-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes yes no no no yes yes yes yes no no yes yes
lola:
preliminary result: no no no yes yes no no no yes yes yes yes no no yes yes
lola: memory consumption: 64100 KB
lola: time consumption: 434 seconds

BK_STOP 1554070564121

--------------------
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="PolyORBNT-PT-S10J30"
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 PolyORBNT-PT-S10J30, 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 r132-oct2-155403939200050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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