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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6673.990 649015.00 1292532.00 2519.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.6M
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 7.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.7K 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 1.3M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is PolyORBLF-PT-S02J06T08, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r127-smll-152673529100166
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526831926108


BK_STOP 1526832575123

--------------------
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-S02J06T08 as instance name.
Using PolyORBLF as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 3100892, 'Memory': 8534.62, 'Tool': 'lola'}, {'Time': 3102973, 'Memory': 8713.55, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityCardinality lola PolyORBLF-PT-S02J06T08...

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S02J06T08: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ PolyORBLF-PT-S02J06T08 @ 3540 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- 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: 2124/65536 symbol table entries, 10 collisions
lola: preprocessing...
lola: finding significant places
lola: 690 places, 1434 transitions, 636 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2005 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S02J06T08-ReachabilityCardinality.task
lola: E (F (((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8) AND (1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourcesB_7 + NotifyEventEndOfCheckSourcesB_8)))) : E (F ((((RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 <= 2) AND (nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + 1 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8)) OR (NoSigAbort + 1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6)))) : E (F (((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 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_2 + P_1119_8_1 + P_1119_8_2) AND (1 <= P_1717)))) : E (F (((P_1716 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6) AND (2 <= NoSigAbort)))) : A (G (((P_1160_7 + P_1160_6 + P_1160_5 + P_1160_4 + P_1160_3 + P_1160_2 + P_1160_1 + P_1160_8 <= P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8) AND (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 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8)))) : E (F (((EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8 + 1 <= 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 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8) AND (QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + 1 <= P_1099) AND (P_1716 <= 2)))) : A (G ((P_1160_7 + P_1160_6 + P_1160_5 + P_1160_4 + P_1160_3 + P_1160_2 + P_1160_1 + P_1160_8 <= 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 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8))) : A (G ((Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 <= AvailableJobId_6 + AvailableJobId_5 + AvailableJobId_4 + AvailableJobId_3 + AvailableJobId_2 + AvailableJobId_1 + AvailableJobId_0))) : A (G ((((3 <= FetchJobE_4_1) AND (3 <= DisablePollingB_3_1)) OR (NotifyEventJobQueuedB_8_5 <= 1) OR (((2 <= P_1155_3) OR (2 <= Perform_Work_E_4)) AND (2 <= NotifyEventJobQueuedB_7_1))))) : A (G ((NotifyEventJobQueuedB_6_0 <= RunE_2))) : A (G (((NotifyEventJobQueuedE_6 <= 1) AND (cIsMonitoring <= P_1160_7)))) : A (G (((1 <= NotifyEventJobQueuedE_8) OR (2 <= cIdleTasks) OR ((P_1724_0 <= 1) AND (NotifyEventSourceAddedE_4 <= 0))))) : A (G ((((Abort_Check_Sources_B_4 + 1 <= nyo_5) OR (P_1158_3 <= 2)) AND (FetchJobE_5_1 <= 1)))) : A (G (((NotifyEventJobQueuedB_4_0 <= ScheduleTaskE_Work_6_2) AND (TryAllocateOneTaskB_7 <= ScheduleTaskE_Work_8_1) AND (FetchJobE_5_3 <= ScheduleTaskE_Work_6_0) AND (ScheduleTaskE_Idle_4 <= Insert_Source_B_5_1) AND (ScheduleTaskE_Work_5_1 <= P_1155_7) AND (ScheduleTaskE_Work_3_3 <= P_1113_2)))) : E (F ((((DisablePollingE_5_2 <= 1) OR (NoSigAbort <= QueueJobB_6_4)) AND (3 <= Check_Sources_E_4)))) : A (G (((Insert_Source_E_2 + 1 <= RunE_8) OR (P_1159_7 <= 0) OR (ScheduleTaskE_Work_1_6 <= NotifyEventEndOfCheckSourcesE_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: E (F (((P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8) AND (1 <= NotifyEventEndOfCheckSourcesB_1 + NotifyEventEndOfCheckSourcesB_2 + NotifyEventEndOfCheckSourcesB_3 + NotifyEventEndOfCheckSourcesB_4 + NotifyEventEndOfCheckSourcesB_5 + NotifyEventEndOfCheckSourcesB_6 + NotifyEventEndOfCheckSourc... (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 2544 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 15 markings, 14 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6 + RunB_7 + RunB_8 <= 2) AND (nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + 1 <= P_1159_1 + P_1159_2 + P_1159_3 + P_1159_4 + P_1159_5 + P_1159_6 + P_1159_7 + P_1159_8)) OR (NoSigAbort + 1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6))))
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 2544 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T08-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T08-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 177 markings, 176 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((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 + Abort_Check_Sources_B_7 + Abort_Check_Sources_B_8 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_2 + P... (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 2544 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-S02J06T08-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 34 markings, 33 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P_1716 <= P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6) AND (2 <= NoSigAbort))))
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 2544 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-S02J06T08-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T08-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P_1160_7 + P_1160_6 + P_1160_5 + P_1160_4 + P_1160_3 + P_1160_2 + P_1160_1 + P_1160_8 <= P_1155_1 + P_1155_2 + P_1155_3 + P_1155_4 + P_1155_5 + P_1155_6 + P_1155_7 + P_1155_8) AND (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 + Fet... (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 2544 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S02J06T08-ReachabilityCardinality-4.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: 26 markings, 25 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6 + EnablePollingB_7 + EnablePollingB_8 + 1 <= 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 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8) AND (QueueJobE_1 + QueueJobE_2 + QueueJobE_3... (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 2544 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-S02J06T08-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T08-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 88682 markings, 102100 edges, 17736 markings/sec, 0 secs
lola: sara is running 5 secs || 181021 markings, 209113 edges, 18468 markings/sec, 5 secs
lola: sara is running 10 secs || 273173 markings, 316374 edges, 18430 markings/sec, 10 secs
lola: sara is running 15 secs || 365168 markings, 424132 edges, 18399 markings/sec, 15 secs
lola: sara is running 20 secs || 456984 markings, 532266 edges, 18363 markings/sec, 20 secs
lola: sara is running 25 secs || 548031 markings, 639039 edges, 18209 markings/sec, 25 secs
lola: sara is running 30 secs || 638677 markings, 744907 edges, 18129 markings/sec, 30 secs
lola: sara is running 35 secs || 729506 markings, 852409 edges, 18166 markings/sec, 35 secs
lola: sara is running 40 secs || 820322 markings, 959539 edges, 18163 markings/sec, 40 secs
lola: sara is running 45 secs || 910985 markings, 1066921 edges, 18133 markings/sec, 45 secs
lola: sara is running 50 secs || 1001926 markings, 1175254 edges, 18188 markings/sec, 50 secs
lola: sara is running 55 secs || 1092409 markings, 1281990 edges, 18097 markings/sec, 55 secs
lola: sara is running 60 secs || 1182898 markings, 1389905 edges, 18098 markings/sec, 60 secs
lola: sara is running 65 secs || 1273315 markings, 1496378 edges, 18083 markings/sec, 65 secs
lola: sara is running 70 secs || 1363937 markings, 1603434 edges, 18124 markings/sec, 70 secs
lola: sara is running 75 secs || 1454310 markings, 1710438 edges, 18075 markings/sec, 75 secs
lola: sara is running 80 secs || 1544873 markings, 1817044 edges, 18113 markings/sec, 80 secs
lola: sara is running 85 secs || 1634904 markings, 1923410 edges, 18006 markings/sec, 85 secs
lola: sara is running 90 secs || 1724758 markings, 2029540 edges, 17971 markings/sec, 90 secs
lola: sara is running 95 secs || 1814472 markings, 2135505 edges, 17943 markings/sec, 95 secs
lola: sara is running 100 secs || 1904555 markings, 2243695 edges, 18017 markings/sec, 100 secs
lola: sara is running 105 secs || 1995470 markings, 2351241 edges, 18183 markings/sec, 105 secs
lola: sara is running 110 secs || 2085889 markings, 2458574 edges, 18084 markings/sec, 110 secs
lola: sara is running 115 secs || 2176081 markings, 2564480 edges, 18038 markings/sec, 115 secs
lola: sara is running 120 secs || 2266661 markings, 2672382 edges, 18116 markings/sec, 120 secs
lola: sara is running 125 secs || 2357533 markings, 2780742 edges, 18174 markings/sec, 125 secs
lola: sara is running 130 secs || 2447844 markings, 2888924 edges, 18062 markings/sec, 130 secs
lola: sara is running 135 secs || 2537912 markings, 2995525 edges, 18014 markings/sec, 135 secs
lola: sara is running 140 secs || 2628432 markings, 3102965 edges, 18104 markings/sec, 140 secs
lola: sara is running 145 secs || 2718653 markings, 3210872 edges, 18044 markings/sec, 145 secs
lola: sara is running 150 secs || 2808841 markings, 3319680 edges, 18038 markings/sec, 150 secs
lola: sara is running 155 secs || 2898948 markings, 3427137 edges, 18021 markings/sec, 155 secs
lola: sara is running 160 secs || 2988968 markings, 3534638 edges, 18004 markings/sec, 160 secs
lola: sara is running 165 secs || 3078993 markings, 3642066 edges, 18005 markings/sec, 165 secs
lola: sara is running 170 secs || 3169131 markings, 3750009 edges, 18028 markings/sec, 170 secs
lola: sara is running 175 secs || 3258795 markings, 3857897 edges, 17933 markings/sec, 175 secs
lola: sara is running 180 secs || 3348658 markings, 3965709 edges, 17973 markings/sec, 180 secs
lola: sara is running 185 secs || 3438691 markings, 4072843 edges, 18007 markings/sec, 185 secs
lola: sara is running 190 secs || 3528649 markings, 4181466 edges, 17992 markings/sec, 190 secs
lola: sara is running 195 secs || 3618826 markings, 4290275 edges, 18035 markings/sec, 195 secs
lola: sara is running 200 secs || 3707062 markings, 4395756 edges, 17647 markings/sec, 200 secs
lola: sara is running 205 secs || 3795995 markings, 4501867 edges, 17787 markings/sec, 205 secs
lola: sara is running 210 secs || 3884848 markings, 4607529 edges, 17771 markings/sec, 210 secs
lola: sara is running 215 secs || 3974253 markings, 4713817 edges, 17881 markings/sec, 215 secs
lola: sara is running 220 secs || 4063338 markings, 4821077 edges, 17817 markings/sec, 220 secs
lola: sara is running 225 secs || 4152475 markings, 4927529 edges, 17827 markings/sec, 225 secs
lola: sara is running 230 secs || 4241104 markings, 5034561 edges, 17726 markings/sec, 230 secs
lola: sara is running 235 secs || 4329050 markings, 5138963 edges, 17589 markings/sec, 235 secs
lola: sara is running 240 secs || 4416297 markings, 5243189 edges, 17449 markings/sec, 240 secs
lola: sara is running 245 secs || 4503146 markings, 5346835 edges, 17370 markings/sec, 245 secs
lola: sara is running 250 secs || 4590124 markings, 5451816 edges, 17396 markings/sec, 250 secs
lola: sara is running 255 secs || 4677081 markings, 5556185 edges, 17391 markings/sec, 255 secs
lola: sara is running 260 secs || 4764043 markings, 5659946 edges, 17392 markings/sec, 260 secs
lola: sara is running 265 secs || 4849860 markings, 5763422 edges, 17163 markings/sec, 265 secs
lola: sara is running 270 secs || 4937753 markings, 5868610 edges, 17579 markings/sec, 270 secs
lola: sara is running 275 secs || 5026156 markings, 5973552 edges, 17681 markings/sec, 275 secs
lola: sara is running 280 secs || 5114569 markings, 6078575 edges, 17683 markings/sec, 280 secs
lola: sara is running 285 secs || 5202905 markings, 6184446 edges, 17667 markings/sec, 285 secs
lola: sara is running 290 secs || 5291423 markings, 6290035 edges, 17704 markings/sec, 290 secs
lola: sara is running 295 secs || 5379764 markings, 6395176 edges, 17668 markings/sec, 295 secs
lola: sara is running 300 secs || 5468315 markings, 6500809 edges, 17710 markings/sec, 300 secs
lola: sara is running 305 secs || 5556501 markings, 6605660 edges, 17637 markings/sec, 305 secs
lola: sara is running 310 secs || 5644928 markings, 6711779 edges, 17685 markings/sec, 310 secs
lola: sara is running 315 secs || 5733276 markings, 6817000 edges, 17670 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P_1160_7 + P_1160_6 + P_1160_5 + P_1160_4 + P_1160_3 + P_1160_2 + P_1160_1 + P_1160_8 <= 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 + Try_Check_Sources_E_7 + Try_Check_Sources_E_8)))
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 2544 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-S02J06T08-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S02J06T08-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 78898 markings, 95098 edges, 15780 markings/sec, 0 secs
lola: sara is running 5 secs || 161760 markings, 197086 edges, 16572 markings/sec, 5 secs
lola: sara is running 10 secs || 244366 markings, 299484 edges, 16521 markings/sec, 10 secs
lola: sara is running 15 secs || 326753 markings, 401162 edges, 16477 markings/sec, 15 secs
lola: sara is running 20 secs || 409198 markings, 501678 edges, 16489 markings/sec, 20 secs
lola: sara is running 25 secs || 491294 markings, 602679 edges, 16419 markings/sec, 25 secs
lola: sara is running 30 secs || 573131 markings, 704695 edges, 16367 markings/sec, 30 secs
lola: sara is running 35 secs || 654272 markings, 805350 edges, 16228 markings/sec, 35 secs
lola: sara is running 40 secs || 735863 markings, 907475 edges, 16318 markings/sec, 40 secs
lola: sara is running 45 secs || 817057 markings, 1007450 edges, 16239 markings/sec, 45 secs
lola: sara is running 50 secs || 898640 markings, 1108999 edges, 16317 markings/sec, 50 secs
lola: sara is running 55 secs || 979972 markings, 1211543 edges, 16266 markings/sec, 55 secs
lola: sara is running 60 secs || 1061381 markings, 1312344 edges, 16282 markings/sec, 60 secs
lola: sara is running 65 secs || 1142270 markings, 1413270 edges, 16178 markings/sec, 65 secs
lola: sara is running 70 secs || 1223431 markings, 1514440 edges, 16232 markings/sec, 70 secs
lola: sara is running 75 secs || 1304569 markings, 1614980 edges, 16228 markings/sec, 75 secs
lola: sara is running 80 secs || 1385579 markings, 1715779 edges, 16202 markings/sec, 80 secs
lola: sara is running 85 secs || 1466543 markings, 1817035 edges, 16193 markings/sec, 85 secs
lola: sara is running 90 secs || 1547508 markings, 1917338 edges, 16193 markings/sec, 90 secs
lola: sara is running 95 secs || 1628348 markings, 2018239 edges, 16168 markings/sec, 95 secs
lola: sara is running 100 secs || 1708930 markings, 2119576 edges, 16116 markings/sec, 100 secs
lola: sara is running 105 secs || 1789795 markings, 2219872 edges, 16173 markings/sec, 105 secs
lola: sara is running 110 secs || 1870300 markings, 2319634 edges, 16101 markings/sec, 110 secs
lola: sara is running 115 secs || 1950699 markings, 2419878 edges, 16080 markings/sec, 115 secs
lola: sara is running 120 secs || 2030044 markings, 2519584 edges, 15869 markings/sec, 120 secs
lola: sara is running 125 secs || 2109973 markings, 2619369 edges, 15986 markings/sec, 125 secs
lola: sara is running 130 secs || 2189646 markings, 2718204 edges, 15935 markings/sec, 130 secs
lola: sara is running 135 secs || 2269253 markings, 2817195 edges, 15921 markings/sec, 135 secs
lola: sara is running 140 secs || 2348371 markings, 2916283 edges, 15824 markings/sec, 140 secs
lola: sara is running 145 secs || 2428176 markings, 3015648 edges, 15961 markings/sec, 145 secs
lola: sara is running 150 secs || 2507770 markings, 3114738 edges, 15919 markings/sec, 150 secs
lola: sara is running 155 secs || 2587623 markings, 3214829 edges, 15971 markings/sec, 155 secs
lola: sara is running 160 secs || 2667340 markings, 3314898 edges, 15943 markings/sec, 160 secs
lola: sara is running 165 secs || 2747383 markings, 3416167 edges, 16009 markings/sec, 165 secs
lola: sara is running 170 secs || 2827124 markings, 3515825 edges, 15948 markings/sec, 170 secs
lola: sara is running 175 secs || 2905299 markings, 3614818 edges, 15635 markings/sec, 175 secs
lola: sara is running 180 secs || 2984031 markings, 3713719 edges, 15746 markings/sec, 180 secs
lola: sara is running 185 secs || 3061964 markings, 3811401 edges, 15587 markings/sec, 185 secs
lola: sara is running 190 secs || 3140194 markings, 3910452 edges, 15646 markings/sec, 190 secs
lola: sara is running 195 secs || 3218469 markings, 4008762 edges, 15655 markings/sec, 195 secs
lola: sara is running 200 secs || 3296915 markings, 4107714 edges, 15689 markings/sec, 200 secs
lola: sara is running 205 secs || 3375135 markings, 4206128 edges, 15644 markings/sec, 205 secs
lola: sara is running 210 secs || 3453588 markings, 4305203 edges, 15691 markings/sec, 210 secs
lola: sara is running 215 secs || 3531636 markings, 4403787 edges, 15610 markings/sec, 215 secs
lola: sara is running 220 secs || 3609642 markings, 4501256 edges, 15601 markings/sec, 220 secs
lola: sara is running 225 secs || 3687552 markings, 4598347 edges, 15582 markings/sec, 225 secs
lola: sara is running 230 secs || 3765269 markings, 4695793 edges, 15543 markings/sec, 230 secs
lola: sara is running 235 secs || 3843312 markings, 4792680 edges, 15609 markings/sec, 235 secs
lola: sara is running 240 secs || 3921754 markings, 4890080 edges, 15688 markings/sec, 240 secs
lola: sara is running 245 secs || 4000046 markings, 4988060 edges, 15658 markings/sec, 245 secs
lola: sara is running 250 secs || 4077945 markings, 5086292 edges, 15580 markings/sec, 250 secs
lola: sara is running 255 secs || 4155709 markings, 5184041 edges, 15553 markings/sec, 255 secs
lola: sara is running 260 secs || 4234810 markings, 5283489 edges, 15820 markings/sec, 260 secs
lola: sara is running 265 secs || 4315040 markings, 5384139 edges, 16046 markings/sec, 265 secs
lola: sara is running 270 secs || 4395213 markings, 5485164 edges, 16035 markings/sec, 270 secs
lola: sara is running 275 secs || 4475347 markings, 5586550 edges, 16027 markings/sec, 275 secs
lola: sara is running 280 secs || 4555559 markings, 5686770 edges, 16042 markings/sec, 280 secs
lola: sara is running 285 secs || 4635770 markings, 5787159 edges, 16042 markings/sec, 285 secs
lola: sara is running 290 secs || 4715831 markings, 5887460 edges, 16012 markings/sec, 290 secs
lola: sara is running 295 secs || 4795872 markings, 5987435 edges, 16008 markings/sec, 295 secs
lola: sara is running 300 secs || 4876716 markings, 6086038 edges, 16169 markings/sec, 300 secs
lola: sara is running 305 secs || 4956649 markings, 6186446 edges, 15987 markings/sec, 305 secs
lola: sara is running 310 secs || 5036860 markings, 6287693 edges, 16042 markings/sec, 310 secs
lola: sara is running 315 secs || 5116644 markings, 6387976 edges, 15957 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
Aborted (core dumped)
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S02J06T08-ReachabilityCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-PT-S02J06T08"
export BK_EXAMINATION="ReachabilityCardinality"
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-S02J06T08.tgz
mv PolyORBLF-PT-S02J06T08 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-S02J06T08, examination is ReachabilityCardinality"
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-152673529100166"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;