Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
.................
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 862K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PolyORBLF-PT-S02J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r210-smll-152732260800389
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527426668432


BK_STOP 1527426877627

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-PT-S02J04T06 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 289, 'Memory': 105.27, 'Tool': 'lola'}, {'Time': 401, 'Memory': 106.9, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola PolyORBLF-PT-S02J04T06...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
PolyORBLF-PT-S02J04T06: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S02J04T06: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ PolyORBLF-PT-S02J04T06 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1396/65536 symbol table entries, 7 collisions
lola: preprocessing...
lola: finding significant places
lola: 476 places, 920 transitions, 430 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1243 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S02J04T06-LTLCardinality.task
lola: A (X ((3 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6))) : A ((SigAbort <= MarkerWrite)) : A ((F ((Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 <= cBlockedTasks)) U ((AbourtToModifySrc_1 + AbourtToModifySrc_2 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_4_1 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_2_2 + DisablePollingB_2_1 + DisablePollingB_4_2) U (1 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6)))) : A ((3 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6)) : A (F ((Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6))) : A (((P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= P_2579_4_1 + P_2579_4_2 + P_2579_5_1 + P_2579_5_2 + P_2579_6_1 + P_2579_6_2 + P_2579_2_2 + P_2579_2_1 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2) U G ((ORB_Lock <= ModifiedSrc_1 + ModifiedSrc_2)))) : A (X (X ((cPollingAbort <= JobCnt)))) : A ((2 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6)) : A ((RunB_6 <= P_1725_4)) : A (F (X (G (F ((TryAllocateOneTaskE_3 <= NotifyEventJobQueuedB_2_2)))))) : A (X (G (X (X ((NotifyEventJobQueuedB_6_4 <= CreatedJobs_3_2)))))) : A (F (G (F (X ((RunB_2 <= DisablePollingB_2_2)))))) : A ((X (X ((NotifyEventJobCompletedB_2 <= FetchJobE_2_2))) U F ((P_2321_3 <= RunB_2)))) : A ((IdleTasks_6 <= CreatedJobs_2_1)) : A ((ScheduleTaskE_Work_6_0 <= P_1712_3)) : A (((CreatedJobs_0_2 <= QueueJobB_5_4) U (TryAllocateOneTaskB_4 <= NotifyEventJobQueuedB_1_4)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)))
lola: processed formula: A (X ((3 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6)))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 30 unused bits
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: 390 markings, 390 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((SigAbort <= MarkerWrite))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SigAbort <= MarkerWrite)
lola: processed formula length: 25
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 <= cBlockedTasks)) U ((AbourtToModifySrc_1 + AbourtToModifySrc_2 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_4_1 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_2_2 + DisablePollingB_2_1 + DisablePollingB_4_2) U (1 <= N... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 <= cBlockedTasks)) U ((AbourtToModifySrc_1 + AbourtToModifySrc_2 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_4_1 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_2_2 + DisablePollingB_2_1 + DisablePollingB_4_2) U (1 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6))))
lola: processed formula: A ((F ((Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6 <= cBlockedTasks)) U ((AbourtToModifySrc_1 + AbourtToModifySrc_2 <= DisablePollingB_5_1 + DisablePollingB_5_2 + DisablePollingB_6_1 + DisablePollingB_6_2 + DisablePollingB_4_1 + DisablePollingB_3_2 + DisablePollingB_3_1 + DisablePollingB_1_1 + DisablePollingB_1_2 + DisablePollingB_2_2 + DisablePollingB_2_1 + DisablePollingB_4_2) U (1 <= N... (shortened)
lola: processed formula length: 604
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 30 unused bits
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: 8263 markings, 10625 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4 + Try_Check_Sources_E_5 + Try_Check_Sources_E_6)
lola: processed formula length: 148
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-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
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6)))
lola: processed formula: A (F ((Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6)))
lola: processed formula length: 242
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 31 unused bits
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: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= P_2579_4_1 + P_2579_4_2 + P_2579_5_1 + P_2579_5_2 + P_2579_6_1 + P_2579_6_2 + P_2579_2_2 + P_2579_2_1 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2) U G ((ORB_Lock <= ModifiedSrc_1 + ModifiedSrc_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= P_2579_4_1 + P_2579_4_2 + P_2579_5_1 + P_2579_5_2 + P_2579_6_1 + P_2579_6_2 + P_2579_2_2 + P_2579_2_1 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2) U G ((ORB_Lock <= ModifiedSrc_1 + ModifiedSrc_2))))
lola: processed formula: A (((P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= P_2579_4_1 + P_2579_4_2 + P_2579_5_1 + P_2579_5_2 + P_2579_6_1 + P_2579_6_2 + P_2579_2_2 + P_2579_2_1 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2) U G ((ORB_Lock <= ModifiedSrc_1 + ModifiedSrc_2))))
lola: processed formula length: 267
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 29 unused bits
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: 631 markings, 631 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((cPollingAbort <= JobCnt))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((cPollingAbort <= JobCnt))))
lola: processed formula: A (X (X ((cPollingAbort <= JobCnt))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 29 unused bits
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: 390 markings, 390 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6)
lola: processed formula length: 112
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-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
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((RunB_6 <= P_1725_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (RunB_6 <= P_1725_4)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-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: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (G (F ((TryAllocateOneTaskE_3 <= NotifyEventJobQueuedB_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (G (F ((TryAllocateOneTaskE_3 <= NotifyEventJobQueuedB_2_2))))))
lola: processed formula: A (F (X (G (F ((TryAllocateOneTaskE_3 <= NotifyEventJobQueuedB_2_2))))))
lola: processed formula length: 72
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 861304 markings, 1174111 edges, 172261 markings/sec, 0 secs
lola: 1649638 markings, 2393601 edges, 157667 markings/sec, 5 secs
lola: 2380969 markings, 3613743 edges, 146266 markings/sec, 10 secs
lola: 3088794 markings, 4825881 edges, 141565 markings/sec, 15 secs
lola: 3776676 markings, 6037584 edges, 137576 markings/sec, 20 secs
lola: 4449565 markings, 7242974 edges, 134578 markings/sec, 25 secs
lola: 5091546 markings, 8419582 edges, 128396 markings/sec, 30 secs
lola: 5747759 markings, 9660626 edges, 131243 markings/sec, 35 secs
lola: 6388791 markings, 10921968 edges, 128206 markings/sec, 40 secs
lola: 7019695 markings, 12158575 edges, 126181 markings/sec, 45 secs
lola: 7640309 markings, 13402452 edges, 124123 markings/sec, 50 secs
lola: 8266295 markings, 14670394 edges, 125197 markings/sec, 55 secs
lola: 8868523 markings, 15957256 edges, 120446 markings/sec, 60 secs
lola: 9487821 markings, 17185126 edges, 123860 markings/sec, 65 secs
lola: 10090522 markings, 18402927 edges, 120540 markings/sec, 70 secs
lola: 10686994 markings, 19667077 edges, 119294 markings/sec, 75 secs
lola: 11278903 markings, 20910523 edges, 118382 markings/sec, 80 secs
lola: 11864501 markings, 22188686 edges, 117120 markings/sec, 85 secs
lola: 12474954 markings, 23443608 edges, 122091 markings/sec, 90 secs
lola: 13075247 markings, 24728868 edges, 120059 markings/sec, 95 secs
lola: 13665260 markings, 25986050 edges, 118003 markings/sec, 100 secs
lola: 14221173 markings, 27332511 edges, 111183 markings/sec, 105 secs
lola: 14790618 markings, 28603936 edges, 113889 markings/sec, 110 secs
lola: 15391031 markings, 29901377 edges, 120083 markings/sec, 115 secs
lola: 15962862 markings, 31219345 edges, 114366 markings/sec, 120 secs
lola: 16543165 markings, 32459428 edges, 116061 markings/sec, 125 secs
lola: 17138500 markings, 33791372 edges, 119067 markings/sec, 130 secs
lola: 17739938 markings, 35119801 edges, 120288 markings/sec, 135 secs
lola: 18316846 markings, 36410128 edges, 115382 markings/sec, 140 secs
lola: 18883534 markings, 37706385 edges, 113338 markings/sec, 145 secs
lola: 19441152 markings, 39055955 edges, 111524 markings/sec, 150 secs
lola: 20004016 markings, 40478273 edges, 112573 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 563 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (X ((NotifyEventJobQueuedB_6_4 <= CreatedJobs_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (X ((NotifyEventJobQueuedB_6_4 <= CreatedJobs_3_2))))))
lola: processed formula: A (X (G (X (X ((NotifyEventJobQueuedB_6_4 <= CreatedJobs_3_2))))))
lola: processed formula length: 66
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 29 unused bits
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: 3952 markings, 4112 edges
lola: ========================================
lola: subprocess 11 will run for 675 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (X ((RunB_2 <= DisablePollingB_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X ((RunB_2 <= DisablePollingB_2_2)))))
lola: processed formula: A (G (F (X ((RunB_2 <= DisablePollingB_2_2)))))
lola: processed formula length: 47
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 30 unused bits
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: 2654 markings, 2722 edges
lola: ========================================
lola: subprocess 12 will run for 844 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((NotifyEventJobCompletedB_2 <= FetchJobE_2_2))) U F ((P_2321_3 <= RunB_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (X ((NotifyEventJobCompletedB_2 <= FetchJobE_2_2))) U F ((P_2321_3 <= RunB_2))))
lola: processed formula: A ((X (X ((NotifyEventJobCompletedB_2 <= FetchJobE_2_2))) U F ((P_2321_3 <= RunB_2))))
lola: processed formula length: 86
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 31 unused bits
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1126 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((IdleTasks_6 <= CreatedJobs_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (IdleTasks_6 <= CreatedJobs_2_1)
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-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
lola: ========================================
lola: subprocess 14 will run for 1689 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((ScheduleTaskE_Work_6_0 <= P_1712_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ScheduleTaskE_Work_6_0 <= P_1712_3)
lola: processed formula length: 36
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-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: ========================================
lola: subprocess 15 will run for 3378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((CreatedJobs_0_2 <= QueueJobB_5_4) U (TryAllocateOneTaskB_4 <= NotifyEventJobQueuedB_1_4)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((CreatedJobs_0_2 <= QueueJobB_5_4) U (TryAllocateOneTaskB_4 <= NotifyEventJobQueuedB_1_4)))
lola: processed formula: A (((CreatedJobs_0_2 <= QueueJobB_5_4) U (TryAllocateOneTaskB_4 <= NotifyEventJobQueuedB_1_4)))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1724 bytes per marking, with 30 unused bits
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: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes no yes no no no yes unknown no no yes no yes yes
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished 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="PolyORBLF-PT-S02J04T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T06.tgz
mv PolyORBLF-PT-S02J04T06 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is PolyORBLF-PT-S02J04T06, 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 r210-smll-152732260800389"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;