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

About the Execution of Irma.struct for PolyORBLF-PT-S06J06T08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.080 508733.00 494372.00 3053.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 21M
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 232K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 724K 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 7.1K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K 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 24K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 20M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PolyORBLF-PT-S06J06T08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-152673529300255
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526853849694


BK_STOP 1526854358427

--------------------
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-S06J06T08 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': 1130462, 'Memory': 15940.47, 'Tool': 'lola'}, {'Time': 1130977, 'Memory': 15942.59, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola PolyORBLF-PT-S06J06T08...

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S06J06T08: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ PolyORBLF-PT-S06J06T08 @ 3538 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 15228/65536 symbol table entries, 9133 collisions
lola: preprocessing...
lola: finding significant places
lola: 894 places, 14334 transitions, 832 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4215 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S06J06T08-CTLCardinality.task
lola: ((2 <= MarkerRead) OR E (F (((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8 + 1 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6) AND (P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6 <= 0))))) : E (G (NOT(A (X ((3 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4_2 + FetchJobE_4_3 + FetchJobE_4_4 + FetchJobE_4_5 + FetchJobE_4_6 + FetchJobE_5_0 + FetchJobE_5_1 + FetchJobE_5_2 + FetchJobE_5_3 + FetchJobE_5_4 + FetchJobE_5_5 + FetchJobE_5_6 + FetchJobE_6_0 + FetchJobE_6_1 + FetchJobE_6_2 + FetchJobE_6_3 + FetchJobE_6_4 + FetchJobE_6_5 + FetchJobE_6_6 + FetchJobE_7_0 + FetchJobE_7_1 + FetchJobE_7_2 + FetchJobE_7_3 + FetchJobE_7_4 + FetchJobE_7_5 + FetchJobE_7_6 + FetchJobE_8_0 + FetchJobE_8_1 + FetchJobE_8_2 + FetchJobE_8_3 + FetchJobE_8_4 + FetchJobE_8_5 + FetchJobE_8_6)))))) : A (F (E (G ((QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_4_5 + QueueJobB_4_6 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_5_5 + QueueJobB_5_6 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + QueueJobB_6_5 + QueueJobB_6_6 + QueueJobB_7_0 + QueueJobB_7_1 + QueueJobB_7_2 + QueueJobB_7_3 + QueueJobB_7_4 + QueueJobB_7_5 + QueueJobB_7_6 + QueueJobB_8_0 + QueueJobB_8_1 + QueueJobB_8_2 + QueueJobB_8_3 + QueueJobB_8_4 + QueueJobB_8_5 + QueueJobB_8_6 <= 1))))) : A (X (NOT(E (G ((P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6 <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTaskE_Work_3_1 + ScheduleTaskE_Work_3_2 + ScheduleTaskE_Work_3_3 + ScheduleTaskE_Work_3_4 + ScheduleTaskE_Work_3_5 + ScheduleTaskE_Work_3_6 + ScheduleTaskE_Work_4_0 + ScheduleTaskE_Work_4_1 + ScheduleTaskE_Work_4_2 + ScheduleTaskE_Work_4_3 + ScheduleTaskE_Work_4_4 + ScheduleTaskE_Work_4_5 + ScheduleTaskE_Work_4_6 + ScheduleTaskE_Work_5_0 + ScheduleTaskE_Work_5_1 + ScheduleTaskE_Work_5_2 + ScheduleTaskE_Work_5_3 + ScheduleTaskE_Work_5_4 + ScheduleTaskE_Work_5_5 + ScheduleTaskE_Work_5_6 + ScheduleTaskE_Work_6_0 + ScheduleTaskE_Work_6_1 + ScheduleTaskE_Work_6_2 + ScheduleTaskE_Work_6_3 + ScheduleTaskE_Work_6_4 + ScheduleTaskE_Work_6_5 + ScheduleTaskE_Work_6_6 + ScheduleTaskE_Work_7_0 + ScheduleTaskE_Work_7_1 + ScheduleTaskE_Work_7_2 + ScheduleTaskE_Work_7_3 + ScheduleTaskE_Work_7_4 + ScheduleTaskE_Work_7_5 + ScheduleTaskE_Work_7_6 + ScheduleTaskE_Work_8_0 + ScheduleTaskE_Work_8_1 + ScheduleTaskE_Work_8_2 + ScheduleTaskE_Work_8_3 + ScheduleTaskE_Work_8_4 + ScheduleTaskE_Work_8_5 + ScheduleTaskE_Work_8_6)))))) : NOT(A (F (((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 + 1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8) OR (PollingAbort + 1 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6 + P_1158_7 + P_1158_8))))) : A (G ((cPollingAbort <= NoSigAbort))) : A (F (A (X (((2 <= AwakeTasks_1 + AwakeTasks_2 + AwakeTasks_3 + AwakeTasks_4 + AwakeTasks_5 + AwakeTasks_6 + AwakeTasks_7 + AwakeTasks_8) AND (Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_4_3 + Insert_Source_B_4_4 + Insert_Source_B_4_5 + Insert_Source_B_4_6 + Insert_Source_B_5_1 + Insert_Source_B_5_2 + Insert_Source_B_5_3 + Insert_Source_B_5_4 + Insert_Source_B_5_5 + Insert_Source_B_5_6 + Insert_Source_B_8_6 + Insert_Source_B_8_5 + Insert_Source_B_8_4 + Insert_Source_B_8_3 + Insert_Source_B_8_2 + Insert_Source_B_8_1 + Insert_Source_B_6_1 + Insert_Source_B_6_2 + Insert_Source_B_6_3 + Insert_Source_B_6_4 + Insert_Source_B_6_5 + Insert_Source_B_6_6 + Insert_Source_B_7_1 + Insert_Source_B_7_2 + Insert_Source_B_7_3 + Insert_Source_B_7_4 + Insert_Source_B_7_5 + Insert_Source_B_7_6 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_5_6 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_6_6)))))) : E ((((DataOnSrc_6 + DataOnSrc_5 + DataOnSrc_4 + DataOnSrc_3 + DataOnSrc_2 + DataOnSrc_1 <= cIsMonitoring) OR (2 <= NotifyEventEndOfCheckSourcesE_1 + NotifyEventEndOfCheckSourcesE_2 + NotifyEventEndOfCheckSourcesE_3 + NotifyEventEndOfCheckSourcesE_4 + NotifyEventEndOfCheckSourcesE_5 + NotifyEventEndOfCheckSourcesE_6 + NotifyEventEndOfCheckSourcesE_7 + NotifyEventEndOfCheckSourcesE_8) OR (P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_1_5 + P_1119_1_6 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_2_5 + P_1119_2_6 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_3_5 + P_1119_3_6 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_4_5 + P_1119_4_6 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_5_5 + P_1119_5_6 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_6_5 + P_1119_6_6 + P_1119_7_1 + P_1119_7_2 + P_1119_7_3 + P_1119_7_4 + P_1119_7_5 + P_1119_7_6 + P_1119_8_1 + P_1119_8_2 + P_1119_8_3 + P_1119_8_4 + P_1119_8_5 + P_1119_8_6 + 1 <= CreatedJobs_0_1 + CreatedJobs_0_2 + CreatedJobs_0_3 + CreatedJobs_0_4 + CreatedJobs_0_5 + CreatedJobs_0_6 + CreatedJobs_1_1 + CreatedJobs_1_2 + CreatedJobs_1_3 + CreatedJobs_1_4 + CreatedJobs_1_5 + CreatedJobs_1_6 + CreatedJobs_2_1 + CreatedJobs_2_2 + CreatedJobs_2_3 + CreatedJobs_2_4 + CreatedJobs_2_5 + CreatedJobs_2_6 + CreatedJobs_3_1 + CreatedJobs_3_2 + CreatedJobs_3_3 + CreatedJobs_3_4 + CreatedJobs_3_5 + CreatedJobs_3_6 + CreatedJobs_4_1 + CreatedJobs_4_2 + CreatedJobs_4_3 + CreatedJobs_4_4 + CreatedJobs_4_5 + CreatedJobs_4_6 + CreatedJobs_5_1 + CreatedJobs_5_2 + CreatedJobs_5_3 + CreatedJobs_5_4 + CreatedJobs_5_5 + CreatedJobs_5_6 + CreatedJobs_6_1 + CreatedJobs_6_2 + CreatedJobs_6_3 + CreatedJobs_6_4 + CreatedJobs_6_5 + CreatedJobs_6_6)) U E (G ((1 <= NoSigAbort))))) : A (F (NOT(A (F ((3 <= ProcessingEvt_4)))))) : (NOT((((3 <= DisablePollingE_2_3) AND (FetchJobE_4_3 <= Abort_Check_Sources_B_4) AND (P_1724_5 <= EnablePollingE_3) AND (3 <= QueueJobB_5_4)) AND E (G ((3 <= P_1158_8))))) AND A (F ((3 <= AvailableJobId_2)))) : E ((((NotifyEventJobQueuedB_4_4 <= 1) OR (P_1119_8_2 <= 2)) U ((P_1158_1 <= DisablePollingB_3_4) AND (P_2579_7_1 <= P_2579_8_1) AND (P_1159_5 + 1 <= DisablePollingE_1_5)))) : (A (X ((1 <= DisablePollingE_1_4))) OR E (G (A (G ((P_2579_3_1 <= QueueJobB_2_5)))))) : E ((((Insert_Source_B_6_4 <= P_1155_2) OR (1 <= QueueJobB_7_2)) U E (G ((QueueJobE_8 <= ScheduleTaskE_Work_8_2))))) : A (G (E (F (((3 <= Insert_Source_B_3_6) OR (SigAbort <= Abort_Check_Sources_E_6)))))) : A (F (((2 <= PlaceSources_3) AND (QueueJobB_8_3 <= DisablePollingB_5_2) AND (Abort_Check_Sources_E_1 + 1 <= FetchJobE_8_0) AND (1 <= CreatedJobs_3_4)))) : (A (G (((Insert_Source_B_7_5 <= 2) AND (Abort_Check_Sources_B_2 <= 2)))) OR ((A (X ((1 <= QueueJobB_1_5))) OR E (F ((2 <= AvailableJobId_0)))) AND E (X ((3 <= Abort_Check_Sources_E_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: ((2 <= MarkerRead) OR E (F (((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8 + 1 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6) AND (P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= MarkerRead)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= MarkerRead)
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T08-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 + NotifyEventJobCompletedE_7 + NotifyEventJobCompletedE_8 + 1 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6) AND (P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6... (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 3328 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S06J06T08-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S06J06T08-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (X ((3 <= FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((FetchJobE_1_0 + FetchJobE_1_1 + FetchJobE_1_2 + FetchJobE_1_3 + FetchJobE_1_4 + FetchJobE_1_5 + FetchJobE_1_6 + FetchJobE_2_0 + FetchJobE_2_1 + FetchJobE_2_2 + FetchJobE_2_3 + FetchJobE_2_4 + FetchJobE_2_5 + FetchJobE_2_6 + FetchJobE_3_0 + FetchJobE_3_1 + FetchJobE_3_2 + FetchJobE_3_3 + FetchJobE_3_4 + FetchJobE_3_5 + FetchJobE_3_6 + FetchJobE_4_0 + FetchJobE_4_1 + FetchJobE_4... (shortened)
lola: processed formula length: 924
lola: 5 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 51172 markings, 188980 edges, 2316348567939186688 markings/sec, 0 secs
lola: 104555 markings, 398578 edges, 10677 markings/sec, 5 secs
lola: 157791 markings, 612123 edges, 10647 markings/sec, 10 secs
lola: 211964 markings, 827004 edges, 10835 markings/sec, 15 secs
lola: 266265 markings, 1045622 edges, 10860 markings/sec, 20 secs
lola: 320542 markings, 1265275 edges, 10855 markings/sec, 25 secs
lola: 375117 markings, 1489858 edges, 10915 markings/sec, 30 secs
lola: 429261 markings, 1702348 edges, 10829 markings/sec, 35 secs
lola: 483478 markings, 1921478 edges, 10843 markings/sec, 40 secs
lola: 537826 markings, 2142071 edges, 10870 markings/sec, 45 secs
lola: 592482 markings, 2364580 edges, 10931 markings/sec, 50 secs
lola: 646743 markings, 2586270 edges, 10852 markings/sec, 55 secs
lola: 701519 markings, 2810809 edges, 10955 markings/sec, 60 secs
lola: 755161 markings, 3041224 edges, 10728 markings/sec, 65 secs
lola: 806814 markings, 3293304 edges, 10331 markings/sec, 70 secs
lola: 858740 markings, 3553152 edges, 10385 markings/sec, 75 secs
lola: 908798 markings, 3799225 edges, 10012 markings/sec, 80 secs
lola: 961329 markings, 4062647 edges, 10506 markings/sec, 85 secs
lola: 1012009 markings, 4267233 edges, 10136 markings/sec, 90 secs
lola: 1062798 markings, 4471061 edges, 10158 markings/sec, 95 secs
lola: 1113229 markings, 4677067 edges, 10086 markings/sec, 100 secs
lola: 1162617 markings, 4884045 edges, 9878 markings/sec, 105 secs
lola: 1211828 markings, 5091270 edges, 9842 markings/sec, 110 secs
lola: 1262323 markings, 5296394 edges, 10099 markings/sec, 115 secs
lola: 1313456 markings, 5505267 edges, 10227 markings/sec, 120 secs
lola: 1365263 markings, 5719554 edges, 10361 markings/sec, 125 secs
lola: 1415198 markings, 5929928 edges, 9987 markings/sec, 130 secs
lola: 1465070 markings, 6142220 edges, 9974 markings/sec, 135 secs
lola: 1515150 markings, 6372040 edges, 10016 markings/sec, 140 secs
lola: 1565208 markings, 6618358 edges, 10012 markings/sec, 145 secs
lola: 1615232 markings, 6866751 edges, 10005 markings/sec, 150 secs
lola: 1665225 markings, 7116598 edges, 9999 markings/sec, 155 secs
lola: 1715615 markings, 7362493 edges, 10078 markings/sec, 160 secs
lola: 1760180 markings, 7548149 edges, 8913 markings/sec, 165 secs
lola: 1810783 markings, 7748821 edges, 10121 markings/sec, 170 secs
lola: 1861525 markings, 7954377 edges, 10148 markings/sec, 175 secs
lola: 1912517 markings, 8162655 edges, 10198 markings/sec, 180 secs
lola: 1959922 markings, 8361052 edges, 9481 markings/sec, 185 secs
lola: 2008234 markings, 8566221 edges, 9662 markings/sec, 190 secs
lola: 2059476 markings, 8775481 edges, 10248 markings/sec, 195 secs
lola: 2110576 markings, 8985549 edges, 10220 markings/sec, 200 secs
lola: 2161459 markings, 9197148 edges, 10177 markings/sec, 205 secs
lola: 2206557 markings, 9417863 edges, 9020 markings/sec, 210 secs
lola: 2255479 markings, 9661134 edges, 9784 markings/sec, 215 secs
lola: 2300884 markings, 9889254 edges, 9081 markings/sec, 220 secs
lola: 2349981 markings, 10135260 edges, 9819 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + Que... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (2 <= QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_1_5 + QueueJobB_1_6 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_2_5 + QueueJobB_2_6 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_3_5 + QueueJobB_3_6 + QueueJobB_4_0 + QueueJobB_4_1 + Queu... (shortened)
lola: processed formula length: 925
lola: 3 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 212 markings, 212 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(E (G ((P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6 <= ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + Sched... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (ScheduleTaskE_Work_1_0 + ScheduleTaskE_Work_1_1 + ScheduleTaskE_Work_1_2 + ScheduleTaskE_Work_1_3 + ScheduleTaskE_Work_1_4 + ScheduleTaskE_Work_1_5 + ScheduleTaskE_Work_1_6 + ScheduleTaskE_Work_2_0 + ScheduleTaskE_Work_2_1 + ScheduleTaskE_Work_2_2 + ScheduleTaskE_Work_2_3 + ScheduleTaskE_Work_2_4 + ScheduleTaskE_Work_2_5 + ScheduleTaskE_Work_2_6 + ScheduleTaskE_Work_3_0 + ScheduleTask... (shortened)
lola: processed formula length: 1495
lola: 5 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 64885 markings, 123716 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 + 1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8) OR (PollingAbort + 1 <=... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8 + 1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8) OR (PollingAbort + 1... (shortened)
lola: processed formula length: 493
lola: 5 rewrites
lola: formula mentions 0 of 894 places; total mentions: 0
lola: closed formula file PolyORBLF-PT-S06J06T08-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3328 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: 221996 markings, 493966 edges, 3067840576268271616 markings/sec, 0 secs
lola: 439208 markings, 1007716 edges, 43442 markings/sec, 5 secs
lola: 657104 markings, 1532250 edges, 43579 markings/sec, 10 secs
lola: 872859 markings, 2046587 edges, 43151 markings/sec, 15 secs
lola: 1087710 markings, 2558811 edges, 42970 markings/sec, 20 secs
lola: 1301114 markings, 3070466 edges, 42681 markings/sec, 25 secs
lola: 1513788 markings, 3576479 edges, 42535 markings/sec, 30 secs
lola: 1725941 markings, 4087082 edges, 42431 markings/sec, 35 secs
lola: 1938276 markings, 4588701 edges, 42467 markings/sec, 40 secs
lola: 2148798 markings, 5094786 edges, 42104 markings/sec, 45 secs
lola: 2362924 markings, 5605350 edges, 42825 markings/sec, 50 secs
lola: 2574670 markings, 6113514 edges, 42349 markings/sec, 55 secs
lola: 2786706 markings, 6627358 edges, 42407 markings/sec, 60 secs
lola: 2996464 markings, 7134763 edges, 41952 markings/sec, 65 secs
lola: 3205143 markings, 7648327 edges, 41736 markings/sec, 70 secs
lola: 3411936 markings, 8156364 edges, 41359 markings/sec, 75 secs
lola: 3619250 markings, 8704434 edges, 41463 markings/sec, 80 secs
lola: 3834987 markings, 9380573 edges, 43147 markings/sec, 85 secs
lola: 4051918 markings, 10064533 edges, 43386 markings/sec, 90 secs
lola: 4263812 markings, 10740546 edges, 42379 markings/sec, 95 secs
lola: 4478826 markings, 11430201 edges, 43003 markings/sec, 100 secs
lola: 4693097 markings, 12101246 edges, 42854 markings/sec, 105 secs
lola: 4902940 markings, 12761893 edges, 41969 markings/sec, 110 secs
lola: 5104151 markings, 13410608 edges, 40242 markings/sec, 115 secs
lola: 5309616 markings, 14072673 edges, 41093 markings/sec, 120 secs
lola: 5518131 markings, 14734770 edges, 41703 markings/sec, 125 secs
lola: 5721669 markings, 15393697 edges, 40708 markings/sec, 130 secs
lola: 5930257 markings, 16052834 edges, 41718 markings/sec, 135 secs
lola: 6137766 markings, 16712623 edges, 41502 markings/sec, 140 secs
lola: 6345900 markings, 17387672 edges, 41627 markings/sec, 145 secs
lola: 6552974 markings, 18047853 edges, 41415 markings/sec, 150 secs
lola: 6757768 markings, 18709700 edges, 40959 markings/sec, 155 secs
lola: 6950179 markings, 19363042 edges, 38482 markings/sec, 160 secs
lola: 7152464 markings, 20012694 edges, 40457 markings/sec, 165 secs
lola: 7356275 markings, 20692152 edges, 40762 markings/sec, 170 secs
lola: 7549577 markings, 21385284 edges, 38660 markings/sec, 175 secs
lola: 7759121 markings, 22050591 edges, 41909 markings/sec, 180 secs
lola: 7965499 markings, 22706694 edges, 41276 markings/sec, 185 secs
lola: 8174121 markings, 23362904 edges, 41724 markings/sec, 190 secs
lola: 8379127 markings, 24029716 edges, 41001 markings/sec, 195 secs
lola: 8589519 markings, 24689993 edges, 42078 markings/sec, 200 secs
lola: 8809906 markings, 25380619 edges, 44077 markings/sec, 205 secs
lola: 9018142 markings, 26040877 edges, 41647 markings/sec, 210 secs
lola: 9226016 markings, 26720587 edges, 41575 markings/sec, 215 secs
lola: 9425162 markings, 27351931 edges, 39829 markings/sec, 220 secs
lola: 9623994 markings, 27985339 edges, 39766 markings/sec, 225 secs
lola: 9826381 markings, 28636971 edges, 40477 markings/sec, 230 secs
lola: 10030939 markings, 29285922 edges, 40912 markings/sec, 235 secs
lola: 10211519 markings, 29856634 edges, 36116 markings/sec, 240 secs
lola: 10212033 markings, 29857887 edges, 103 markings/sec, 245 secs
lola: 10212504 markings, 29859203 edges, 94 markings/sec, 250 secs
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-S06J06T08-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S06J06T08-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- 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-S06J06T08"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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-S06J06T08.tgz
mv PolyORBLF-PT-S06J06T08 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is PolyORBLF-PT-S06J06T08, 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 r127-smll-152673529300255"
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 ;