fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r130-smll-152673532900220
Last Updated
June 26, 2018

About the Execution of M4M.full for PolyORBLF-PT-S06J04T04

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1476.200 300869.00 599038.00 1044.20 ???????????????? normal

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 10M
-rw-r--r-- 1 mcc users 6.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 6.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 21K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K 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 56K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 185K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.8K 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 9.4M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is PolyORBLF-PT-S06J04T04, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-152673532900220
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526945847698


BK_STOP 1526946148567

--------------------
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-S06J04T04 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 2810, 'Memory': 176.16, 'Tool': 'lola'}, {'Time': 3092, 'Memory': 176.48, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-PT-S06J04T04...

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J04T04: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-PT-S06J04T04 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7448/65536 symbol table entries, 4121 collisions
lola: preprocessing...
lola: finding significant places
lola: 454 places, 6994 transitions, 404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1823 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J04T04-CTLCardinality.task
lola: A (((P_1113_3 + P_1113_2 + P_1113_1 + P_1113_4 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4) U ((1 <= CanInjectEvent) AND (1 <= IsMonitoring) AND (3 <= P_1717) AND (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4)))) : (((3 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4) OR (3 <= P_1097) OR (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + 1 <= MarkerRead)) AND E (G (((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_6 + DisablePollingE_1_5 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1 <= CanInjectEvent) OR (FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4) OR (1 <= RunE_1 + RunE_2 + RunE_3 + RunE_4))))) : A (F ((A (G ((2 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6))) AND ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 <= 1) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + 1 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6))))) : ((E (F ((IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 <= 2))) AND ((cPollingAbort <= 0) OR (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= 2) OR (P_1727 <= 1))) AND A (G (A (G ((RunE_1 + RunE_2 + RunE_3 + RunE_4 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4)))))) : A (G ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 <= 2))) : A (G (E (G (((1 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4) OR (2 <= AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0)))))) : A ((E (F ((3 <= RunB_1 + RunB_2 + RunB_3 + RunB_4))) U ((cBlockedTasks <= 2) AND (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 <= 0)))) : NOT(E (X (E (F ((1 <= P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4)))))) : NOT(((DataOnSrc_3 <= QueueJobB_4_1) OR A (F ((1 <= DisablePollingB_4_1))))) : NOT(A (((NotifyEventJobQueuedB_2_3 <= 2) U ((cJobCnt <= QueueJobB_4_2) AND (1 <= Try_Check_Sources_B_1))))) : (((A (X ((1 <= ScheduleTaskE_Work_1_2))) AND (DisablePollingB_1_4 + 1 <= RunE_2)) OR A (((Insert_Source_B_2_5 <= P_2579_3_5) U (2 <= Insert_Source_B_1_1)))) AND E (F (((QueueJobB_3_2 + 1 <= QueueJobB_4_4) OR (DataOnSrc_2 + 1 <= P_2579_4_6))))) : E (F ((2 <= CreatedJobs_1_6))) : NOT((A (G (((NotifyEventJobQueuedB_3_1 <= EnablePollingB_2) OR (P_2579_1_2 <= NotifyEventJobCompletedE_2)))) OR ((cBlockedTasks <= DisablePollingE_1_3) AND (2 <= CreatedJobs_4_3) AND (3 <= DisablePollingE_3_3) AND (P_1155_3 <= CreatedJobs_0_6) AND (cJobCnt <= Abort_Check_Sources_B_1)))) : NOT(E (((Insert_Source_B_1_3 <= P_1095) U (DisablePollingE_4_4 + 1 <= ScheduleTaskE_Work_1_3)))) : ((NOT(A (G ((1 <= Abort_Check_Sources_E_3)))) AND E (G ((ScheduleTaskE_Work_4_2 <= 0)))) AND A (F ((NotifyEventJobQueuedB_2_1 <= Insert_Source_B_2_2)))) : NOT(NOT(A (G ((TryAllocateOneTaskE_4 <= NotifyEventJobQueuedB_2_1)))))
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 (((P_1113_3 + P_1113_2 + P_1113_1 + P_1113_4 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4) U ((1 <= CanInjectEvent) AND (1 <= IsMonitoring) AND (3 <= P_1717) AND (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((P_1113_3 + P_1113_2 + P_1113_1 + P_1113_4 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4) U ((1 <= CanInjectEvent) AND (1 <= IsMonitoring) AND (3 <= P_1717) AND (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4))))
lola: processed formula: A (((P_1113_3 + P_1113_2 + P_1113_1 + P_1113_4 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4) U ((1 <= CanInjectEvent) AND (1 <= IsMonitoring) AND (3 <= P_1717) AND (AbourtToModifySrc_1 + AbourtToModifySrc_2 + AbourtToModifySrc_3 + AbourtToModifySrc_4 + AbourtToModifySrc_5 + AbourtToModifySrc_6 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4))))
lola: processed formula length: 379
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 61 markings, 61 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4) OR (3 <= P_1097) OR (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + 1 <= MarkerRead)) AND E (G (((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= Try_Check_Sources_E_1 + Try_Check_Sources_E_2 + Try_Check_Sources_E_3 + Try_Check_Sources_E_4) OR (3 <= P_1097) OR (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + 1 <= MarkerRead))
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) OR (3 <= P_1097) OR (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + 1 <= MarkerRead))
lola: processed formula length: 254
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-CTLCardinality.task
lola: processed formula with 3 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: E (G (((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((CanInjectEvent + 1 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_3_5 + DisablePollingE_3_6 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_4_5 + DisablePollingE_4_6 + DisablePollingE_2_6 + DisablePollingE_2_5 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePoll... (shortened)
lola: processed formula length: 772
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 198 markings, 197 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((2 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6))) AND ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 <= 1) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + 1 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((2 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6))) AND ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 <= 1) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + 1 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6)))))
lola: processed formula: A (F ((A (G ((2 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6))) AND ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 <= 1) OR (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + 1 <= PlaceSources_1 + PlaceSources_2 + PlaceSources_3 + PlaceSources_4 + PlaceSources_5 + PlaceSources_6)))... (shortened)
lola: processed formula length: 402
lola: 0 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1620 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 119 markings, 119 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F ((IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 <= 2))) AND ((cPollingAbort <= 0) OR (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= 2) OR (P_1727 <= 1))) AND A (G (A (G ((RunE_1 + RunE_2 + RunE_3 + RunE_4 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
----- Kill lola and sara stderr -----
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to PolyORBLF-PT-S06J04T04-CTLCardinality-3.sara
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((cPollingAbort <= 0) OR (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= 2) OR (P_1727 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cPollingAbort <= 0) OR (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= 2) OR (P_1727 <= 1))
lola: processed formula length: 104
lola: 2 rewrites
lola: formula mentions 0 of 454 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J04T04-CTLCardinality.task
lola: processed formula with 3 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((RunE_1 + RunE_2 + RunE_3 + RunE_4 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S06J04T04-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J04T04-CTLCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 447 markings, 679 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1616 bytes per marking, with 0 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S06J04T04-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J04T04-CTLCardinality-4.sara.
lola: sara is running 0 secs || 11407 markings, 29315 edges, 2281 markings/sec, 0 secs
lola: sara is running 5 secs || 28848 markings, 57392 edges, 3488 markings/sec, 5 secs
lola: sara is running 10 secs || 45012 markings, 88611 edges, 3233 markings/sec, 10 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 15 secs || 61764 markings, 120095 edges, 3350 markings/sec, 15 secs
lola: sara is running 20 secs || 81661 markings, 148545 edges, 3979 markings/sec, 20 secs
lola: sara is running 25 secs || 102011 markings, 177482 edges, 4070 markings/sec, 25 secs
lola: sara is running 30 secs || 120809 markings, 207954 edges, 3760 markings/sec, 30 secs
lola: sara is running 35 secs || 139574 markings, 240014 edges, 3753 markings/sec, 35 secs
lola: sara is running 40 secs || 158818 markings, 270483 edges, 3849 markings/sec, 40 secs
lola: sara is running 45 secs || 179856 markings, 300491 edges, 4208 markings/sec, 45 secs
lola: sara is running 50 secs || 199698 markings, 331287 edges, 3968 markings/sec, 50 secs
lola: sara is running 55 secs || 220964 markings, 360873 edges, 4253 markings/sec, 55 secs
lola: sara is running 60 secs || 241463 markings, 390669 edges, 4100 markings/sec, 60 secs
lola: sara is running 65 secs || 261773 markings, 419846 edges, 4062 markings/sec, 65 secs
lola: sara is running 70 secs || 280619 markings, 450605 edges, 3769 markings/sec, 70 secs
lola: sara is running 75 secs || 300793 markings, 479954 edges, 4035 markings/sec, 75 secs
lola: sara is running 80 secs || 320886 markings, 509307 edges, 4019 markings/sec, 80 secs
lola: sara is running 85 secs || 343583 markings, 537623 edges, 4539 markings/sec, 85 secs
lola: sara is running 90 secs || 364913 markings, 567753 edges, 4266 markings/sec, 90 secs
lola: sara is running 95 secs || 385950 markings, 597107 edges, 4207 markings/sec, 95 secs
lola: sara is running 100 secs || 408581 markings, 625276 edges, 4526 markings/sec, 100 secs
lola: sara is running 105 secs || 432270 markings, 652663 edges, 4738 markings/sec, 105 secs
lola: sara is running 110 secs || 456251 markings, 680714 edges, 4796 markings/sec, 110 secs
lola: sara is running 115 secs || 479762 markings, 709171 edges, 4702 markings/sec, 115 secs
lola: sara is running 120 secs || 499606 markings, 738998 edges, 3969 markings/sec, 120 secs
lola: sara is running 125 secs || 526424 markings, 782878 edges, 5364 markings/sec, 125 secs
lola: sara is running 130 secs || 550414 markings, 811001 edges, 4798 markings/sec, 130 secs
lola: sara is running 135 secs || 571262 markings, 840360 edges, 4170 markings/sec, 135 secs
lola: sara is running 140 secs || 596928 markings, 874332 edges, 5133 markings/sec, 140 secs
lola: sara is running 145 secs || 622236 markings, 912603 edges, 5062 markings/sec, 145 secs
lola: sara is running 150 secs || 645621 markings, 940923 edges, 4677 markings/sec, 150 secs
lola: sara is running 155 secs || 669370 markings, 969591 edges, 4750 markings/sec, 155 secs
lola: sara is running 160 secs || 693085 markings, 997519 edges, 4743 markings/sec, 160 secs
lola: sara is running 165 secs || 716137 markings, 1026731 edges, 4610 markings/sec, 165 secs
lola: sara is running 170 secs || 739590 markings, 1054712 edges, 4691 markings/sec, 170 secs
lola: sara is running 175 secs || 763698 markings, 1083694 edges, 4822 markings/sec, 175 secs
lola: sara is running 180 secs || 779555 markings, 1118723 edges, 3171 markings/sec, 180 secs
lola: sara is running 185 secs || 798153 markings, 1150345 edges, 3720 markings/sec, 185 secs
lola: sara is running 190 secs || 821570 markings, 1179263 edges, 4683 markings/sec, 190 secs
lola: sara is running 195 secs || 842947 markings, 1207705 edges, 4275 markings/sec, 195 secs
lola: sara is running 200 secs || 865675 markings, 1236255 edges, 4546 markings/sec, 200 secs
lola: sara is running 205 secs || 888521 markings, 1265913 edges, 4569 markings/sec, 205 secs
lola: sara is running 210 secs || 907040 markings, 1297176 edges, 3704 markings/sec, 210 secs
lola: sara is running 215 secs || 931478 markings, 1326248 edges, 4888 markings/sec, 215 secs
lola: sara is running 220 secs || 954625 markings, 1357905 edges, 4629 markings/sec, 220 secs
lola: sara is running 225 secs || 972407 markings, 1393066 edges, 3556 markings/sec, 225 secs
lola: sara is running 230 secs || 994132 markings, 1425709 edges, 4345 markings/sec, 230 secs
lola: sara is running 235 secs || 1017372 markings, 1457676 edges, 4648 markings/sec, 235 secs
lola: sara is running 240 secs || 1040331 markings, 1488773 edges, 4592 markings/sec, 240 secs
lola: sara is running 245 secs || 1063018 markings, 1519707 edges, 4537 markings/sec, 245 secs
lola: sara is running 250 secs || 1085530 markings, 1549845 edges, 4502 markings/sec, 250 secs
lola: sara is running 255 secs || 1106131 markings, 1580239 edges, 4120 markings/sec, 255 secs
lola: sara is running 260 secs || 1126989 markings, 1610300 edges, 4172 markings/sec, 260 secs
lola: sara is running 265 secs || 1149594 markings, 1637598 edges, 4521 markings/sec, 265 secs
lola: sara is running 270 secs || 1170871 markings, 1667803 edges, 4255 markings/sec, 270 secs
lola: sara is running 275 secs || 1191606 markings, 1697685 edges, 4147 markings/sec, 275 secs
lola: sara is running 280 secs || 1207140 markings, 1732684 edges, 3107 markings/sec, 280 secs
lola: sara is running 285 secs || 1231712 markings, 1771376 edges, 4914 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J04T04-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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-S06J04T04"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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-S06J04T04.tgz
mv PolyORBLF-PT-S06J04T04 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 mcc4mcc-full"
echo " Input is PolyORBLF-PT-S06J04T04, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-152673532900220"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;