About the Execution of M4M.struct for PolyORBLF-PT-S02J04T06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13010.950 | 597589.00 | 1187351.00 | 2488.30 | ???????????????? | 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 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.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 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 mcc4mcc-structural
Input is PolyORBLF-PT-S02J04T06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r131-smll-152673534100136
=====================================================================
--------------------
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-CTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S02J04T06-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526935356873
BK_STOP 1526935954462
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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': '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': 1505862, 'Memory': 15952.85, 'Tool': 'lola'}, {'Time': 1512128, 'Memory': 15952.64, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality 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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-PT-S02J04T06 @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 134 (ignored)
----- 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-CTLCardinality.task
lola: A (F (((3 <= CanInjectEvent) AND (ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6) AND (TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 <= IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1) AND (P_1160_5 + P_1160_4 + P_1160_3 + P_1160_2 + P_1160_1 + P_1160_6 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6) AND (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + 1 <= cPollingAbort) AND (1 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4)))) : NOT(A (G ((((3 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6) AND (3 <= P_1093)) OR ((P_1716 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_3_3 + NotifyEventJobQueuedB_3_4 + NotifyEventJobQueuedB_4_0 + NotifyEventJobQueuedB_4_1 + NotifyEventJobQueuedB_4_2 + NotifyEventJobQueuedB_4_3 + NotifyEventJobQueuedB_4_4 + NotifyEventJobQueuedB_5_0 + NotifyEventJobQueuedB_5_1 + NotifyEventJobQueuedB_5_2 + NotifyEventJobQueuedB_5_3 + NotifyEventJobQueuedB_5_4 + NotifyEventJobQueuedB_6_0 + NotifyEventJobQueuedB_6_1 + NotifyEventJobQueuedB_6_2 + NotifyEventJobQueuedB_6_3 + NotifyEventJobQueuedB_6_4 + NotifyEventJobQueuedB_1_0 + NotifyEventJobQueuedB_1_1 + NotifyEventJobQueuedB_1_2 + NotifyEventJobQueuedB_1_3 + NotifyEventJobQueuedB_1_4)))))) : E ((((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6) OR (1 <= ORB_Lock)) U ((SigAbort <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4) AND (1 <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6) AND (cPollingAbort <= IsMonitoring) AND (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6)))) : A (G ((((P_1097 + 1 <= NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6) OR ((P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_6) AND (NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= SigAbort))) AND (((cIdleTasks <= Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6) AND (2 <= JobCnt)) OR ((ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6) AND (EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 <= 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)))))) : ((NOT(E (G ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1)))) AND (A (G ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6))) OR E (G ((3 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6))))) AND (P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 <= P_1726)) : (E (G (E (X ((EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6))))) AND (NOT(E (X ((2 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6)))) OR (A (X ((Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 <= P_1726))) AND A (F ((P_1717 <= MarkerRead)))))) : (A (F (A (X ((3 <= AbourtToModifySrc_1 + AbourtToModifySrc_2))))) AND ((A (X ((P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= P_1160_5 + P_1160_4 + P_1160_3 + P_1160_2 + P_1160_1 + P_1160_6))) OR A (G ((3 <= P_1093)))) AND (2 <= DataOnSrc_1 + DataOnSrc_2))) : E (G (A (F (((P_1097 <= PlaceSources_1 + PlaceSources_2) OR (TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 <= P_1093)))))) : E (X ((((2 <= CreatedJobs_4_1) AND (1 <= TryAllocateOneTaskE_1) AND (cIdleTasks + 1 <= Insert_Source_B_3_2)) OR A (F ((1 <= PollingAbort)))))) : ((NOT(E (G ((DisablePollingB_2_1 <= ScheduleTaskE_Work_3_2)))) AND (Try_Check_Sources_B_6 <= IsMonitoring)) OR ((Perform_Work_E_3 <= P_1155_5) AND (Abort_Check_Sources_B_2 <= QueueJobE_1) AND ((2 <= NotifyEventJobCompletedE_6) OR (ScheduleTaskE_Work_6_4 <= NotifyEventJobQueuedB_2_4)) AND (2 <= RunE_1) AND (P_1712_0 <= 2) AND (Try_Check_Sources_E_4 + 1 <= AbourtToModifySrc_1) AND (NotifyEventJobQueuedB_4_4 + 1 <= FetchJobE_6_2))) : ((P_2579_1_1 <= P_1617_4) AND E (F (((P_2321_1 <= P_1724_0) AND (IdleTasks_2 <= Try_Check_Sources_B_1) AND (2 <= CreatedJobs_1_2))))) : E (F ((((CreatedJobs_0_1 <= 0) OR (P_1712_3 <= 0)) AND (P_2579_4_1 + 1 <= FetchJobB_1)))) : (E (((Insert_Source_B_5_2 <= P_1119_4_2) U ((RunE_2 <= NotifyEventJobCompletedE_3) AND (2 <= P_2318_4)))) OR (1 <= P_1113_3)) : E (((Check_Sources_B_6 <= Insert_Source_B_3_2) U (((3 <= P_2579_3_1) AND (AvailableJobId_0 <= NotifyEventJobQueuedB_5_0)) OR (DisablePollingE_3_2 + 1 <= EnablePollingE_6)))) : NOT(A (G ((((3 <= IdleTasks_4) AND (P_1159_1 <= P_1113_4)) OR ((Try_Check_Sources_B_1 <= cIdleTasks) AND (ScheduleTaskE_Idle_6 <= P_2579_4_1)))))) : (NOT(((((1 <= NotifyEventJobQueuedE_6) AND (FetchJobE_2_2 <= NotifyEventJobCompletedB_5)) OR ((3 <= NotifyEventEndOfCheckSourcesE_4) AND (3 <= P_1160_5))) OR E (G ((AbourtToModifySrc_1 <= P_1712_3))))) AND ((((DisablePollingE_3_1 <= 1) AND (IdleTasks_4 + 1 <= CreatedJobs_1_1)) OR E (X ((1 <= Insert_Source_B_6_1)))) OR (((P_2579_1_2 <= 1) OR (AvailableJobId_2 <= 0)) OR E (X ((2 <= P_1712_2))))))
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 (F (((3 <= CanInjectEvent) AND (ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6) AND (TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + T... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= CanInjectEvent) AND (ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6) AND (TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 <= IdleTasks_6 + IdleTasks_5 + IdleTasks_4 + IdleTasks_3 + IdleTasks_2 + IdleTasks_1) AND (P_1160_5 + P_1160_4 + P_1160_3 + P_1160_2 + P_1160_1 + P_1160_6 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6) AND (NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 + 1 <= cPollingAbort) AND (1 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4))))
lola: processed formula: A (F (((3 <= CanInjectEvent) AND (ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6) AND (TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + T... (shortened)
lola: processed formula length: 1388
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 386 markings, 386 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G ((((3 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6) AND (3 <= P_1093)) OR ((P_1716 <= NotifyEventJobQueuedB_2_0 + NotifyEventJobQueuedB_2_1 + NotifyEventJobQueuedB_2_2 + NotifyEventJobQueuedB_2_3 + NotifyEventJobQueuedB_2_4 + NotifyEventJobQueuedB_3_0 + NotifyEventJobQueuedB_3_1 + NotifyEventJobQueuedB_3_2 + NotifyEven... (shortened)
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 1720 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 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6) OR (1 <= ORB_Lock)) U ((SigAbort <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + Sc... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 <= EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6) OR (1 <= ORB_Lock)) U ((SigAbort <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + Sche... (shortened)
lola: processed formula length: 1262
lola: 1 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: 43 markings, 42 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((P_1097 + 1 <= NotifyEventSourceAddedE_1 + NotifyEventSourceAddedE_2 + NotifyEventSourceAddedE_3 + NotifyEventSourceAddedE_4 + NotifyEventSourceAddedE_5 + NotifyEventSourceAddedE_6) OR ((P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= Abort_Check_Sources_B_1 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_5 + Abort_C... (shortened)
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 1720 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 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J04T06-CTLCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 18 markings, 17 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (G ((NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_2_2 + DisablePollingE_2_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1 + 1 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventS... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1 + 1 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6)))
lola: processed formula: A (F ((DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_2 + DisablePollingE_1_1 + 1 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventS... (shortened)
lola: processed formula length: 444
lola: 4 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.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: 31668 markings, 37730 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 <= NotifyEventSourceAddedB_1 + NotifyEventSourceAddedB_2 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_6)))
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 1720 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-S02J04T06-CTLCardinality-5.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28 markings, 27 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 <= 2)))
lola: processed formula length: 127
lola: 6 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6))))) AND (NOT(E (X ((2 <= NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 <= TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6)))))
lola: processed formula length: 282
lola: 5 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: 428 markings, 441 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= 1)))
lola: processed formula: A (X ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= 1)))
lola: processed formula length: 186
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= AbourtToModifySrc_1 + AbourtToModifySrc_2))))) AND ((A (X ((P_2321_6 + P_2321_5 + P_2321_4 + P_2321_3 + P_2321_2 + P_2321_1 <= P_1160_5 + P_1160_4 + P_1160_3 + P_1160_2 + P_1160_1 + P_1160_6))) OR A (G ((3 <= P_1093)))) AND (2 <= DataOnSrc_1 + DataOnSrc_2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= AbourtToModifySrc_1 + AbourtToModifySrc_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= AbourtToModifySrc_1 + AbourtToModifySrc_2)))
lola: processed formula length: 62
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 390 markings, 390 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((P_1097 <= PlaceSources_1 + PlaceSources_2) OR (TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 <= P_1093))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((P_1097 <= PlaceSources_1 + PlaceSources_2) OR (TryAllocateOneTaskB_1 + TryAllocateOneTaskB_2 + TryAllocateOneTaskB_3 + TryAllocateOneTaskB_4 + TryAllocateOneTaskB_5 + TryAllocateOneTaskB_6 <= P_1093))))))
lola: processed formula length: 233
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 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 2 significant temporal operators and needs 9 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: 389 markings, 778 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((((2 <= CreatedJobs_4_1) AND (1 <= TryAllocateOneTaskE_1) AND (cIdleTasks + 1 <= Insert_Source_B_3_2)) OR A (F ((1 <= PollingAbort))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((2 <= CreatedJobs_4_1) AND (1 <= TryAllocateOneTaskE_1) AND (cIdleTasks + 1 <= Insert_Source_B_3_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((2 <= CreatedJobs_4_1) AND (1 <= TryAllocateOneTaskE_1) AND (cIdleTasks + 1 <= Insert_Source_B_3_2)))
lola: processed formula length: 105
lola: 2 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((1 <= PollingAbort)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (1 <= PollingAbort)))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1720 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: 22948 markings, 33359 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (G ((DisablePollingB_2_1 <= ScheduleTaskE_Work_3_2)))) AND (Try_Check_Sources_B_6 <= IsMonitoring)) OR ((Perform_Work_E_3 <= P_1155_5) AND (Abort_Check_Sources_B_2 <= QueueJobE_1) AND ((2 <= NotifyEventJobCompletedE_6) OR (ScheduleTaskE_Work_6_4 <= NotifyEventJobQueuedB_2_4)) AND (2 <= RunE_1) AND (P_1712_0 <= 2) AND (Try_Check_Sources_E_4 + 1 <= AbourtToModifySrc_1) AND (NotifyEventJobQu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((ScheduleTaskE_Work_3_2 + 1 <= DisablePollingB_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((ScheduleTaskE_Work_3_2 + 1 <= DisablePollingB_2_1)))
lola: processed formula: A (F ((ScheduleTaskE_Work_3_2 + 1 <= DisablePollingB_2_1)))
lola: processed formula length: 59
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 912 markings, 921 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Perform_Work_E_3 <= P_1155_5) AND (Abort_Check_Sources_B_2 <= QueueJobE_1) AND ((2 <= NotifyEventJobCompletedE_6) OR (ScheduleTaskE_Work_6_4 <= NotifyEventJobQueuedB_2_4)) AND (2 <= RunE_1) AND (P_1712_0 <= 2) AND (Try_Check_Sources_E_4 + 1 <= AbourtToModifySrc_1) AND (NotifyEventJobQueuedB_4_4 + 1 <= FetchJobE_6_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Perform_Work_E_3 <= P_1155_5) AND (Abort_Check_Sources_B_2 <= QueueJobE_1) AND ((2 <= NotifyEventJobCompletedE_6) OR (ScheduleTaskE_Work_6_4 <= NotifyEventJobQueuedB_2_4)) AND (2 <= RunE_1) AND (P_1712_0 <= 2) AND (Try_Check_Sources_E_4 + 1 <= AbourtToModifySrc_1) AND (NotifyEventJobQueuedB_4_4 + 1 <= FetchJobE_6_2))
lola: processed formula length: 321
lola: 3 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.task
lola: processed formula with 8 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((P_2579_1_1 <= P_1617_4) AND E (F (((P_2321_1 <= P_1724_0) AND (IdleTasks_2 <= Try_Check_Sources_B_1) AND (2 <= CreatedJobs_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (P_2579_1_1 <= P_1617_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P_2579_1_1 <= P_1617_4)
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 476 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S02J04T06-CTLCardinality.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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P_2321_1 <= P_1724_0) AND (IdleTasks_2 <= Try_Check_Sources_B_1) AND (2 <= CreatedJobs_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 1720 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J04T06-CTLCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J04T06-CTLCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 159271 markings, 186497 edges, 31854 markings/sec, 0 secs
lola: sara is running 5 secs || 323357 markings, 380645 edges, 32817 markings/sec, 5 secs
lola: sara is running 10 secs || 486651 markings, 573792 edges, 32659 markings/sec, 10 secs
lola: sara is running 15 secs || 647574 markings, 765167 edges, 32185 markings/sec, 15 secs
lola: sara is running 20 secs || 808965 markings, 957201 edges, 32278 markings/sec, 20 secs
lola: sara is running 25 secs || 969978 markings, 1148376 edges, 32203 markings/sec, 25 secs
lola: sara is running 30 secs || 1128571 markings, 1337148 edges, 31719 markings/sec, 30 secs
lola: sara is running 35 secs || 1288395 markings, 1528195 edges, 31965 markings/sec, 35 secs
lola: sara is running 40 secs || 1448084 markings, 1718675 edges, 31938 markings/sec, 40 secs
lola: sara is running 45 secs || 1606846 markings, 1907399 edges, 31752 markings/sec, 45 secs
lola: sara is running 50 secs || 1764493 markings, 2095611 edges, 31529 markings/sec, 50 secs
lola: sara is running 55 secs || 1922827 markings, 2284086 edges, 31667 markings/sec, 55 secs
lola: sara is running 60 secs || 2080266 markings, 2471447 edges, 31488 markings/sec, 60 secs
lola: sara is running 65 secs || 2237063 markings, 2658777 edges, 31359 markings/sec, 65 secs
lola: sara is running 70 secs || 2393170 markings, 2844845 edges, 31221 markings/sec, 70 secs
lola: sara is running 75 secs || 2547859 markings, 3028554 edges, 30938 markings/sec, 75 secs
lola: sara is running 80 secs || 2702441 markings, 3212012 edges, 30916 markings/sec, 80 secs
lola: sara is running 85 secs || 2855881 markings, 3395286 edges, 30688 markings/sec, 85 secs
lola: sara is running 90 secs || 3008950 markings, 3575359 edges, 30614 markings/sec, 90 secs
lola: sara is running 95 secs || 3152715 markings, 3744369 edges, 28753 markings/sec, 95 secs
lola: sara is running 100 secs || 3297449 markings, 3915764 edges, 28947 markings/sec, 100 secs
lola: sara is running 105 secs || 3444775 markings, 4089796 edges, 29465 markings/sec, 105 secs
lola: sara is running 110 secs || 3592193 markings, 4263387 edges, 29484 markings/sec, 110 secs
lola: sara is running 115 secs || 3739063 markings, 4436537 edges, 29374 markings/sec, 115 secs
lola: sara is running 120 secs || 3885905 markings, 4610900 edges, 29368 markings/sec, 120 secs
lola: sara is running 125 secs || 4033016 markings, 4784008 edges, 29422 markings/sec, 125 secs
lola: sara is running 130 secs || 4179403 markings, 4956434 edges, 29277 markings/sec, 130 secs
lola: sara is running 135 secs || 4326178 markings, 5129758 edges, 29355 markings/sec, 135 secs
lola: sara is running 140 secs || 4473300 markings, 5305006 edges, 29424 markings/sec, 140 secs
lola: sara is running 145 secs || 4619062 markings, 5479339 edges, 29152 markings/sec, 145 secs
lola: sara is running 150 secs || 4765156 markings, 5651650 edges, 29219 markings/sec, 150 secs
lola: sara is running 155 secs || 4911466 markings, 5826110 edges, 29262 markings/sec, 155 secs
lola: sara is running 160 secs || 5056663 markings, 5999136 edges, 29039 markings/sec, 160 secs
lola: sara is running 165 secs || 5201776 markings, 6171900 edges, 29023 markings/sec, 165 secs
lola: sara is running 170 secs || 5346431 markings, 6343983 edges, 28931 markings/sec, 170 secs
lola: sara is running 175 secs || 5491340 markings, 6518587 edges, 28982 markings/sec, 175 secs
lola: sara is running 180 secs || 5636237 markings, 6692032 edges, 28979 markings/sec, 180 secs
lola: sara is running 185 secs || 5781654 markings, 6866019 edges, 29083 markings/sec, 185 secs
lola: sara is running 190 secs || 5926485 markings, 7038039 edges, 28966 markings/sec, 190 secs
lola: sara is running 195 secs || 6070970 markings, 7208764 edges, 28897 markings/sec, 195 secs
lola: sara is running 200 secs || 6217027 markings, 7384449 edges, 29211 markings/sec, 200 secs
lola: sara is running 205 secs || 6362637 markings, 7559358 edges, 29122 markings/sec, 205 secs
lola: sara is running 210 secs || 6507627 markings, 7732796 edges, 28998 markings/sec, 210 secs
lola: sara is running 215 secs || 6652332 markings, 7909321 edges, 28941 markings/sec, 215 secs
lola: sara is running 220 secs || 6797548 markings, 8087567 edges, 29043 markings/sec, 220 secs
lola: sara is running 225 secs || 6942603 markings, 8262304 edges, 29011 markings/sec, 225 secs
lola: sara is running 230 secs || 7086471 markings, 8434949 edges, 28774 markings/sec, 230 secs
lola: sara is running 235 secs || 7230761 markings, 8612333 edges, 28858 markings/sec, 235 secs
lola: sara is running 240 secs || 7375628 markings, 8787404 edges, 28973 markings/sec, 240 secs
lola: sara is running 245 secs || 7517619 markings, 8961458 edges, 28398 markings/sec, 245 secs
lola: sara is running 250 secs || 7660916 markings, 9131542 edges, 28659 markings/sec, 250 secs
lola: sara is running 255 secs || 7805561 markings, 9311985 edges, 28929 markings/sec, 255 secs
lola: sara is running 260 secs || 7948987 markings, 9487977 edges, 28685 markings/sec, 260 secs
lola: sara is running 265 secs || 8091363 markings, 9661024 edges, 28475 markings/sec, 265 secs
lola: sara is running 270 secs || 8234199 markings, 9835271 edges, 28567 markings/sec, 270 secs
lola: sara is running 275 secs || 8375487 markings, 10005191 edges, 28258 markings/sec, 275 secs
lola: sara is running 280 secs || 8513064 markings, 10173661 edges, 27515 markings/sec, 280 secs
lola: sara is running 285 secs || 8652207 markings, 10342280 edges, 27829 markings/sec, 285 secs
lola: sara is running 290 secs || 8794039 markings, 10517957 edges, 28366 markings/sec, 290 secs
lola: sara is running 295 secs || 8933806 markings, 10687552 edges, 27953 markings/sec, 295 secs
lola: sara is running 300 secs || 9076061 markings, 10863229 edges, 28451 markings/sec, 300 secs
lola: sara is running 305 secs || 9216059 markings, 11037500 edges, 28000 markings/sec, 305 secs
lola: sara is running 310 secs || 9357360 markings, 11214755 edges, 28260 markings/sec, 310 secs
lola: sara is running 315 secs || 9497702 markings, 11394145 edges, 28068 markings/sec, 315 secs
lola: sara is running 320 secs || 9638782 markings, 11567936 edges, 28216 markings/sec, 320 secs
lola: sara is running 325 secs || 9782651 markings, 11746858 edges, 28774 markings/sec, 325 secs
lola: sara is running 330 secs || 9925444 markings, 11922304 edges, 28559 markings/sec, 330 secs
lola: sara is running 335 secs || 10068592 markings, 12102587 edges, 28630 markings/sec, 335 secs
lola: sara is running 340 secs || 10209413 markings, 12284584 edges, 28164 markings/sec, 340 secs
lola: sara is running 345 secs || 10354420 markings, 12465890 edges, 29001 markings/sec, 345 secs
lola: sara is running 350 secs || 10498011 markings, 12647891 edges, 28718 markings/sec, 350 secs
lola: sara is running 355 secs || 10639867 markings, 12829532 edges, 28371 markings/sec, 355 secs
lola: sara is running 360 secs || 10780596 markings, 13009731 edges, 28146 markings/sec, 360 secs
lola: sara is running 365 secs || 10919993 markings, 13183887 edges, 27879 markings/sec, 365 secs
lola: sara is running 370 secs || 11060016 markings, 13364125 edges, 28005 markings/sec, 370 secs
lola: sara is running 375 secs || 11198089 markings, 13539662 edges, 27615 markings/sec, 375 secs
lola: sara is running 380 secs || 11336950 markings, 13720142 edges, 27772 markings/sec, 380 secs
lola: sara is running 385 secs || 11470735 markings, 13886057 edges, 26757 markings/sec, 385 secs
lola: sara is running 390 secs || 11602403 markings, 14048211 edges, 26334 markings/sec, 390 secs
lola: sara is running 395 secs || 11732049 markings, 14225645 edges, 25929 markings/sec, 395 secs
lola: sara is running 400 secs || 11872616 markings, 14407663 edges, 28113 markings/sec, 400 secs
lola: sara is running 405 secs || 12009449 markings, 14582403 edges, 27367 markings/sec, 405 secs
lola: sara is running 410 secs || 12147921 markings, 14771622 edges, 27694 markings/sec, 410 secs
lola: sara is running 415 secs || 12288684 markings, 14952451 edges, 28153 markings/sec, 415 secs
lola: sara is running 420 secs || 12426839 markings, 15134513 edges, 27631 markings/sec, 420 secs
lola: sara is running 425 secs || 12563804 markings, 15312612 edges, 27393 markings/sec, 425 secs
lola: sara is running 430 secs || 12703984 markings, 15504555 edges, 28036 markings/sec, 430 secs
lola: sara is running 435 secs || 12841294 markings, 15684913 edges, 27462 markings/sec, 435 secs
lola: sara is running 440 secs || 12974806 markings, 15874071 edges, 26702 markings/sec, 440 secs
lola: sara is running 445 secs || 13105917 markings, 16037058 edges, 26222 markings/sec, 445 secs
lola: sara is running 450 secs || 13238395 markings, 16206842 edges, 26496 markings/sec, 450 secs
lola: sara is running 455 secs || 13368263 markings, 16377526 edges, 25974 markings/sec, 455 secs
lola: sara is running 460 secs || 13501299 markings, 16554707 edges, 26607 markings/sec, 460 secs
lola: sara is running 465 secs || 13634429 markings, 16734962 edges, 26626 markings/sec, 465 secs
lola: sara is running 470 secs || 13772766 markings, 16922595 edges, 27667 markings/sec, 470 secs
lola: sara is running 475 secs || 13913056 markings, 17109132 edges, 28058 markings/sec, 475 secs
lola: sara is running 480 secs || 14047540 markings, 17286366 edges, 26897 markings/sec, 480 secs
lola: sara is running 485 secs || 14186743 markings, 17472965 edges, 27841 markings/sec, 485 secs
lola: sara is running 490 secs || 14327984 markings, 17652977 edges, 28248 markings/sec, 490 secs
lola: sara is running 495 secs || 14462114 markings, 17849348 edges, 26826 markings/sec, 495 secs
lola: sara is running 500 secs || 14599971 markings, 18031131 edges, 27571 markings/sec, 500 secs
lola: sara is running 505 secs || 14738204 markings, 18216546 edges, 27647 markings/sec, 505 secs
lola: sara is running 510 secs || 14878957 markings, 18404683 edges, 28151 markings/sec, 510 secs
lola: sara is running 515 secs || 15020553 markings, 18610246 edges, 28319 markings/sec, 515 secs
lola: sara is running 520 secs || 15158805 markings, 18789650 edges, 27650 markings/sec, 520 secs
lola: sara is running 525 secs || 15296863 markings, 18969515 edges, 27612 markings/sec, 525 secs
lola: sara is running 530 secs || 15431492 markings, 19142153 edges, 26926 markings/sec, 530 secs
lola: sara is running 535 secs || 15571862 markings, 19331215 edges, 28074 markings/sec, 535 secs
lola: sara is running 540 secs || 15707926 markings, 19516046 edges, 27213 markings/sec, 540 secs
lola: sara is running 545 secs || 15843126 markings, 19713690 edges, 27040 markings/sec, 545 secs
lola: sara is running 550 secs || 15981397 markings, 19943663 edges, 27654 markings/sec, 550 secs
lola: sara is running 555 secs || 16119803 markings, 20144058 edges, 27681 markings/sec, 555 secs
lola: sara is running 560 secs || 16258888 markings, 20321860 edges, 27817 markings/sec, 560 secs
lola: sara is running 565 secs || 16396526 markings, 20499537 edges, 27528 markings/sec, 565 secs
lola: sara is running 570 secs || 16531629 markings, 20688973 edges, 27021 markings/sec, 570 secs
lola: sara is running 575 secs || 16667467 markings, 20870572 edges, 27168 markings/sec, 575 secs
lola: sara is running 580 secs || 16808234 markings, 21049037 edges, 28153 markings/sec, 580 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
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-S02J04T06-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J04T06-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----
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="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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 mcc4mcc-structural"
echo " Input is PolyORBLF-PT-S02J04T06, 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 r131-smll-152673534100136"
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 '
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 ;