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 4.1M
-rw-r--r-- 1 mcc users 9.9K 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 54K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 176K 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 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K 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 8.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.6M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is PolyORBLF-PT-S04J04T06, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-smll-152673528500180
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526832962765


BK_STOP 1526833565205

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using PolyORBLF-PT-S04J04T06 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': 2683498, 'Memory': 4215.91, 'Tool': 'lola'}, {'Time': 2684380, 'Memory': 4189.64, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'gspn'}].
ReachabilityCardinality lola PolyORBLF-PT-S04J04T06...

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


checking for too many tokens
===========================================================================================
PolyORBLF-PT-S04J04T06: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ PolyORBLF-PT-S04J04T06 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3552/65536 symbol table entries, 872 collisions
lola: preprocessing...
lola: finding significant places
lola: 554 places, 2998 transitions, 504 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1821 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-PT-S04J04T06-ReachabilityCardinality.task
lola: A (G ((((RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) OR (1 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6) OR ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) AND (QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 <= P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_2_4 + P_2579_2_3 + P_2579_2_2 + P_2579_2_1 + P_2579_1_4 + P_2579_1_3 + P_2579_1_2 + P_2579_1_1 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4)))))) : E (F ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + 1 <= P_1726))) : A (G (((3 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4) OR (2 <= cJobCnt)))) : E (F ((1 <= SigAbort))) : E (F ((3 <= Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6))) : A (G ((((3 <= RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6) AND (1 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6) AND ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_4_3 + DisablePollingE_4_4 + DisablePollingE_5_1 + DisablePollingE_5_2 + DisablePollingE_5_3 + DisablePollingE_5_4 + DisablePollingE_6_1 + DisablePollingE_6_2 + DisablePollingE_6_3 + DisablePollingE_6_4 + DisablePollingE_2_4 + DisablePollingE_2_3 + DisablePollingE_2_2 + DisablePollingE_2_1 + DisablePollingE_1_4 + DisablePollingE_1_3 + DisablePollingE_1_2 + DisablePollingE_1_1) OR (Check_Sources_B_1 + Check_Sources_B_2 + Check_Sources_B_3 + Check_Sources_B_4 + Check_Sources_B_5 + Check_Sources_B_6 <= 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))) OR (3 <= Idle_1 + Idle_2 + Idle_3 + Idle_4 + Idle_5 + Idle_6)))) : A (G ((BlockedTasks <= cJobCnt))) : E (F (((QueueJobB_1_0 + QueueJobB_1_1 + QueueJobB_1_2 + QueueJobB_1_3 + QueueJobB_1_4 + QueueJobB_2_0 + QueueJobB_2_1 + QueueJobB_2_2 + QueueJobB_2_3 + QueueJobB_2_4 + QueueJobB_3_0 + QueueJobB_3_1 + QueueJobB_3_2 + QueueJobB_3_3 + QueueJobB_3_4 + QueueJobB_4_0 + QueueJobB_4_1 + QueueJobB_4_2 + QueueJobB_4_3 + QueueJobB_4_4 + QueueJobB_5_0 + QueueJobB_5_1 + QueueJobB_5_2 + QueueJobB_5_3 + QueueJobB_5_4 + QueueJobB_6_0 + QueueJobB_6_1 + QueueJobB_6_2 + QueueJobB_6_3 + QueueJobB_6_4 + 1 <= Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_4_3 + Insert_Source_B_4_4 + Insert_Source_B_5_1 + Insert_Source_B_5_2 + Insert_Source_B_5_3 + Insert_Source_B_5_4 + Insert_Source_B_6_1 + Insert_Source_B_6_2 + Insert_Source_B_6_3 + Insert_Source_B_6_4) AND (NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 <= 0) AND (2 <= 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)))) : E (F (((PlaceSources_4 + 1 <= QueueJobB_5_4) AND (2 <= RunB_3) AND (P_1113_1 <= ProcessingEvt_4)))) : A (G (((2 <= P_2579_6_2) OR ((NotifyEventJobQueuedB_1_1 <= ProcessingEvt_6) AND (2 <= cPollingAbort)) OR (Perform_Work_E_6 <= Abort_Check_Sources_B_4) OR (3 <= QueueJobB_6_1) OR (DisablePollingE_6_3 <= P_1158_1)))) : A (G ((((3 <= DisablePollingE_1_1) AND (3 <= NotifyEventJobQueuedE_1)) OR ((1 <= AvailableJobId_4) AND (ScheduleTaskE_Work_6_3 <= TryAllocateOneTaskB_3)) OR (P_1119_5_1 <= 1)))) : E (F (((FetchJobE_4_2 <= P_1095) AND (NotifyEventJobQueuedB_5_4 + 1 <= Check_Sources_E_6) AND ((1 <= Idle_4) OR (SigAbort <= NotifyEventJobQueuedB_3_0) OR ((QueueJobB_2_0 <= AwakeTasks_4) AND (3 <= NotifyEventJobQueuedB_2_4)))))) : A (G (((1 <= ScheduleTaskE_Work_1_4) OR (NotifyEventSourceAddedE_4 <= NotifyEventSourceAddedB_4)))) : A (G (((3 <= Insert_Source_E_2) OR (1 <= IdleTasks_5) OR (1 <= NotifyEventEndOfCheckSourcesE_5) OR (3 <= Insert_Source_B_4_1) OR (((3 <= Insert_Source_B_6_3) OR (DisablePollingE_5_3 <= P_1617_5)) AND (NotifyEventEndOfCheckSourcesE_3 <= 1))))) : E (F (((Try_Check_Sources_E_6 + 1 <= IdleTasks_2) AND (P_1119_5_1 + 1 <= P_2318_2) AND (AvailableJobId_1 <= cIdleTasks)))) : A (G ((((ScheduleTaskE_Work_2_4 + 1 <= P_1119_3_3) OR (P_2318_4 <= 2)) AND ((NotifyEventJobCompletedB_2 <= 1) OR (QueueJobB_5_0 + 1 <= DisablePollingE_2_4)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((RunE_1 + RunE_2 + RunE_3 + RunE_4 + RunE_5 + RunE_6 <= P_1113_5 + P_1113_4 + P_1113_3 + P_1113_2 + P_1113_1 + P_1113_6) OR (1 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6) OR ((NotifyEventJobCompletedE_1 + NotifyEventJobCompletedE_2 + NotifyEventJobCompletedE_3 + NotifyEventJobCompletedE_4 + NotifyEventJobCompletedE_5 + NotifyEventJobCompletedE_6 <= P_1113_5 + P_1113_4 + P_1113_3 + ... (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 2016 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J04T06-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T06-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1098 markings, 1115 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6 + 1 <= P_1726)))
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 2016 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-S04J04T06-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4) OR (2 <= cJobCnt))))
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 2016 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-S04J04T06-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T06-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 33680 markings, 36549 edges, 6736 markings/sec, 0 secs
lola: sara is running 5 secs || 69477 markings, 77634 edges, 7159 markings/sec, 5 secs
lola: sara is running 10 secs || 105205 markings, 118992 edges, 7146 markings/sec, 10 secs
lola: sara is running 15 secs || 140897 markings, 161355 edges, 7138 markings/sec, 15 secs
lola: sara is running 20 secs || 176607 markings, 204376 edges, 7142 markings/sec, 20 secs
lola: sara is running 25 secs || 212091 markings, 247054 edges, 7097 markings/sec, 25 secs
lola: sara is running 30 secs || 247477 markings, 289653 edges, 7077 markings/sec, 30 secs
lola: sara is running 35 secs || 282863 markings, 332309 edges, 7077 markings/sec, 35 secs
lola: sara is running 40 secs || 318203 markings, 376191 edges, 7068 markings/sec, 40 secs
lola: sara is running 45 secs || 353522 markings, 420528 edges, 7064 markings/sec, 45 secs
lola: sara is running 50 secs || 388886 markings, 465145 edges, 7073 markings/sec, 50 secs
lola: sara is running 55 secs || 424123 markings, 509105 edges, 7047 markings/sec, 55 secs
lola: sara is running 60 secs || 459443 markings, 553623 edges, 7064 markings/sec, 60 secs
lola: sara is running 65 secs || 494610 markings, 597908 edges, 7033 markings/sec, 65 secs
lola: sara is running 70 secs || 529817 markings, 641904 edges, 7041 markings/sec, 70 secs
lola: sara is running 75 secs || 565011 markings, 686269 edges, 7039 markings/sec, 75 secs
lola: sara is running 80 secs || 600212 markings, 732024 edges, 7040 markings/sec, 80 secs
lola: sara is running 85 secs || 635497 markings, 776915 edges, 7057 markings/sec, 85 secs
lola: sara is running 90 secs || 670578 markings, 821344 edges, 7016 markings/sec, 90 secs
lola: sara is running 95 secs || 705789 markings, 865921 edges, 7042 markings/sec, 95 secs
lola: sara is running 100 secs || 741050 markings, 911146 edges, 7052 markings/sec, 100 secs
lola: sara is running 105 secs || 776360 markings, 956266 edges, 7062 markings/sec, 105 secs
lola: sara is running 110 secs || 811530 markings, 1001639 edges, 7034 markings/sec, 110 secs
lola: sara is running 115 secs || 846618 markings, 1047455 edges, 7018 markings/sec, 115 secs
lola: sara is running 120 secs || 881089 markings, 1092687 edges, 6894 markings/sec, 120 secs
lola: sara is running 125 secs || 915888 markings, 1137832 edges, 6960 markings/sec, 125 secs
lola: sara is running 130 secs || 951066 markings, 1183653 edges, 7036 markings/sec, 130 secs
lola: sara is running 135 secs || 986223 markings, 1229337 edges, 7031 markings/sec, 135 secs
lola: sara is running 140 secs || 1021289 markings, 1275320 edges, 7013 markings/sec, 140 secs
lola: sara is running 145 secs || 1056409 markings, 1320392 edges, 7024 markings/sec, 145 secs
lola: sara is running 150 secs || 1091256 markings, 1365684 edges, 6969 markings/sec, 150 secs
lola: sara is running 155 secs || 1126464 markings, 1410891 edges, 7042 markings/sec, 155 secs
lola: sara is running 160 secs || 1161404 markings, 1455585 edges, 6988 markings/sec, 160 secs
lola: sara is running 165 secs || 1196312 markings, 1500680 edges, 6982 markings/sec, 165 secs
lola: sara is running 170 secs || 1231320 markings, 1546274 edges, 7002 markings/sec, 170 secs
lola: sara is running 175 secs || 1266264 markings, 1591931 edges, 6989 markings/sec, 175 secs
lola: sara is running 180 secs || 1301235 markings, 1638762 edges, 6994 markings/sec, 180 secs
lola: sara is running 185 secs || 1336209 markings, 1684624 edges, 6995 markings/sec, 185 secs
lola: sara is running 190 secs || 1371161 markings, 1730339 edges, 6990 markings/sec, 190 secs
lola: sara is running 195 secs || 1406001 markings, 1775237 edges, 6968 markings/sec, 195 secs
lola: sara is running 200 secs || 1440869 markings, 1820266 edges, 6974 markings/sec, 200 secs
lola: sara is running 205 secs || 1475602 markings, 1865002 edges, 6947 markings/sec, 205 secs
lola: sara is running 210 secs || 1510464 markings, 1910426 edges, 6972 markings/sec, 210 secs
lola: sara is running 215 secs || 1545266 markings, 1956270 edges, 6960 markings/sec, 215 secs
lola: sara is running 220 secs || 1579944 markings, 2000628 edges, 6936 markings/sec, 220 secs
lola: sara is running 225 secs || 1614589 markings, 2045674 edges, 6929 markings/sec, 225 secs
lola: sara is running 230 secs || 1649390 markings, 2091137 edges, 6960 markings/sec, 230 secs
lola: sara is running 235 secs || 1684066 markings, 2136121 edges, 6935 markings/sec, 235 secs
lola: sara is running 240 secs || 1718336 markings, 2181111 edges, 6854 markings/sec, 240 secs
lola: sara is running 245 secs || 1752469 markings, 2227211 edges, 6827 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= SigAbort)))
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 2016 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-S04J04T06-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T06-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 48 markings, 47 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_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 2016 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-S04J04T06-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T06-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 56200 markings, 60177 edges, 11240 markings/sec, 0 secs
lola: sara is running 5 secs || 113081 markings, 121228 edges, 11376 markings/sec, 5 secs
lola: sara is running 10 secs || 170268 markings, 183708 edges, 11437 markings/sec, 10 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= RunB_1 + RunB_2 + RunB_3 + RunB_4 + RunB_5 + RunB_6) AND (1 <= P_1158_1 + P_1158_2 + P_1158_3 + P_1158_4 + P_1158_5 + P_1158_6) AND ((ScheduleTaskE_Idle_1 + ScheduleTaskE_Idle_2 + ScheduleTaskE_Idle_3 + ScheduleTaskE_Idle_4 + ScheduleTaskE_Idle_5 + ScheduleTaskE_Idle_6 <= DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_3_3 + DisablePollingE_3_4 + DisablePollingE_4_1 + Dis... (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 2016 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to PolyORBLF-PT-S04J04T06-ReachabilityCardinality-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: 57 markings, 56 edges
lola: ========================================
lola: subprocess 6 will run for 327 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((BlockedTasks <= cJobCnt)))
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 2016 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-S04J04T06-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PolyORBLF-PT-S04J04T06-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 35634 markings, 38410 edges, 7127 markings/sec, 0 secs
lola: sara is running 5 secs || 71109 markings, 78380 edges, 7095 markings/sec, 5 secs
lola: sara is running 10 secs || 106581 markings, 118766 edges, 7094 markings/sec, 10 secs
lola: sara is running 15 secs || 141338 markings, 158575 edges, 6951 markings/sec, 15 secs
lola: sara is running 20 secs || 175392 markings, 198882 edges, 6811 markings/sec, 20 secs
lola: sara is running 25 secs || 209285 markings, 238797 edges, 6779 markings/sec, 25 secs
lola: sara is running 30 secs || 243323 markings, 280850 edges, 6808 markings/sec, 30 secs
lola: sara is running 35 secs || 277152 markings, 321033 edges, 6766 markings/sec, 35 secs
lola: sara is running 40 secs || 310999 markings, 362620 edges, 6769 markings/sec, 40 secs
lola: sara is running 45 secs || 344852 markings, 403258 edges, 6771 markings/sec, 45 secs
lola: sara is running 50 secs || 378652 markings, 444454 edges, 6760 markings/sec, 50 secs
lola: sara is running 55 secs || 412349 markings, 485112 edges, 6739 markings/sec, 55 secs
lola: sara is running 60 secs || 446144 markings, 526251 edges, 6759 markings/sec, 60 secs
lola: sara is running 65 secs || 479784 markings, 567845 edges, 6728 markings/sec, 65 secs
lola: sara is running 70 secs || 513540 markings, 609982 edges, 6751 markings/sec, 70 secs
lola: sara is running 75 secs || 547287 markings, 652968 edges, 6749 markings/sec, 75 secs
lola: sara is running 80 secs || 580916 markings, 694660 edges, 6726 markings/sec, 80 secs
lola: sara is running 85 secs || 614496 markings, 736938 edges, 6716 markings/sec, 85 secs
lola: sara is running 90 secs || 647969 markings, 778576 edges, 6695 markings/sec, 90 secs
lola: sara is running 95 secs || 681449 markings, 820768 edges, 6696 markings/sec, 95 secs
lola: sara is running 100 secs || 715005 markings, 862335 edges, 6711 markings/sec, 100 secs
lola: sara is running 105 secs || 748509 markings, 904021 edges, 6701 markings/sec, 105 secs
lola: sara is running 110 secs || 781933 markings, 946235 edges, 6685 markings/sec, 110 secs
lola: sara is running 115 secs || 815438 markings, 989237 edges, 6701 markings/sec, 115 secs
lola: sara is running 120 secs || 848934 markings, 1030761 edges, 6699 markings/sec, 120 secs
lola: sara is running 125 secs || 882392 markings, 1072689 edges, 6692 markings/sec, 125 secs
lola: sara is running 130 secs || 915815 markings, 1115624 edges, 6685 markings/sec, 130 secs
lola: sara is running 135 secs || 949305 markings, 1160204 edges, 6698 markings/sec, 135 secs
lola: sara is running 140 secs || 982651 markings, 1201583 edges, 6669 markings/sec, 140 secs
lola: sara is running 145 secs || 1015983 markings, 1243292 edges, 6666 markings/sec, 145 secs
lola: sara is running 150 secs || 1049360 markings, 1285862 edges, 6675 markings/sec, 150 secs
lola: sara is running 155 secs || 1082678 markings, 1329229 edges, 6664 markings/sec, 155 secs
lola: sara is running 160 secs || 1116109 markings, 1371845 edges, 6686 markings/sec, 160 secs
lola: sara is running 165 secs || 1149382 markings, 1414031 edges, 6655 markings/sec, 165 secs
lola: sara is running 170 secs || 1182847 markings, 1458943 edges, 6693 markings/sec, 170 secs
lola: sara is running 175 secs || 1216158 markings, 1503233 edges, 6662 markings/sec, 175 secs
lola: sara is running 180 secs || 1249488 markings, 1545871 edges, 6666 markings/sec, 180 secs
lola: sara is running 185 secs || 1282753 markings, 1588368 edges, 6653 markings/sec, 185 secs
lola: sara is running 190 secs || 1315989 markings, 1630479 edges, 6647 markings/sec, 190 secs
lola: sara is running 195 secs || 1349289 markings, 1673198 edges, 6660 markings/sec, 195 secs
lola: sara is running 200 secs || 1382503 markings, 1714931 edges, 6643 markings/sec, 200 secs
lola: sara is running 205 secs || 1415734 markings, 1755698 edges, 6646 markings/sec, 205 secs
lola: sara is running 210 secs || 1449667 markings, 1798234 edges, 6787 markings/sec, 210 secs
lola: sara is running 215 secs || 1482988 markings, 1841772 edges, 6664 markings/sec, 215 secs
lola: sara is running 220 secs || 1516201 markings, 1884326 edges, 6643 markings/sec, 220 secs
lola: sara is running 225 secs || 1549078 markings, 1926562 edges, 6575 markings/sec, 225 secs
lola: sara is running 230 secs || 1582230 markings, 1969182 edges, 6630 markings/sec, 230 secs
lola: sara is running 235 secs || 1615463 markings, 2012595 edges, 6647 markings/sec, 235 secs
lola: sara is running 240 secs || 1648551 markings, 2054756 edges, 6618 markings/sec, 240 secs
lola: sara is running 245 secs || 1681782 markings, 2097817 edges, 6646 markings/sec, 245 secs
lola: sara is running 250 secs || 1714956 markings, 2140724 edges, 6635 markings/sec, 250 secs
lola: sara is running 255 secs || 1748286 markings, 2183779 edges, 6666 markings/sec, 255 secs
lola: sara is running 260 secs || 1781322 markings, 2226842 edges, 6607 markings/sec, 260 secs
lola: sara is running 265 secs || 1814405 markings, 2270208 edges, 6617 markings/sec, 265 secs
lola: sara is running 270 secs || 1847537 markings, 2312929 edges, 6626 markings/sec, 270 secs
lola: sara is running 275 secs || 1880641 markings, 2356286 edges, 6621 markings/sec, 275 secs
lola: sara is running 280 secs || 1913734 markings, 2398783 edges, 6619 markings/sec, 280 secs
lola: sara is running 285 secs || 1946855 markings, 2442218 edges, 6624 markings/sec, 285 secs
lola: sara is running 290 secs || 1979975 markings, 2484115 edges, 6624 markings/sec, 290 secs
lola: sara is running 295 secs || 2013237 markings, 2528875 edges, 6652 markings/sec, 295 secs
lola: sara is running 300 secs || 2046373 markings, 2571134 edges, 6627 markings/sec, 300 secs
lola: sara is running 305 secs || 2079550 markings, 2614845 edges, 6635 markings/sec, 305 secs
lola: sara is running 310 secs || 2112643 markings, 2657726 edges, 6619 markings/sec, 310 secs
lola: sara is running 315 secs || 2145751 markings, 2699725 edges, 6622 markings/sec, 315 secs
lola: sara is running 320 secs || 2178755 markings, 2741359 edges, 6601 markings/sec, 320 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '@'
Aborted (core dumped)
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PolyORBLF-PT-S04J04T06-ReachabilityCardinality-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-S04J04T06"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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