fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r139-qhx2-152673581300189
Last Updated
June 26, 2018

About the Execution of Irma.struct for Railroad-PT-020

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1915.330 604756.00 1164612.00 2053.70 FFT??FFFFTTFFFTT 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 420K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 22K 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 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.9K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 249K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is Railroad-PT-020, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-qhx2-152673581300189
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527791673755


BK_STOP 1527792278511

--------------------
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 Railroad-PT-020 as instance name.
Using Railroad as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': False, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': False, 'Reversible': None, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 1180149, 'Memory': 10117.05, 'Tool': 'lola'}, {'Time': 1180185, 'Memory': 10111.4, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
ReachabilityFireability lola Railroad-PT-020...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Railroad-PT-020: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ Railroad-PT-020 @ 3538 seconds
----- Start make result stderr -----
----- 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: 724/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 218 places, 506 transitions, 87 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 132 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-020-ReachabilityFireability.task
lola: A (G (((FIREABLE(tr_T34_28) OR FIREABLE(tr_T47_45) OR NOT FIREABLE(tr_T50_14) OR FIREABLE(tr_T47_414)) AND (NOT FIREABLE(tr_T47_423) OR NOT FIREABLE(tr_T47_298) OR FIREABLE(tr_T47_432) OR (FIREABLE(tr_T47_268) AND FIREABLE(tr_T47_51)))))) : E (F ((FIREABLE(tr_T47_46) AND (FIREABLE(tr_T47_299) OR FIREABLE(tr_T47_217) OR FIREABLE(tr_T47_70) OR FIREABLE(tr_T47_274) OR FIREABLE(tr_T47_155))))) : E (F (((NOT FIREABLE(tr_T47_77) AND FIREABLE(tr_T47_310)) OR ((NOT FIREABLE(tr_T47_93) OR NOT FIREABLE(tr_T47_205)) AND FIREABLE(tr_T47_79))))) : A (G (((NOT FIREABLE(tr_T47_435) AND NOT FIREABLE(tr_T34_30)) OR (NOT FIREABLE(tr_T47_332) AND NOT FIREABLE(tr_T47_133)) OR FIREABLE(tr_T47_298) OR NOT FIREABLE(tr_T47_438)))) : E (F ((FIREABLE(tr_T47_162) AND ((FIREABLE(tr_T47_333) AND FIREABLE(tr_T47_302) AND FIREABLE(tr_T47_78)) OR (FIREABLE(tr_T47_276) AND FIREABLE(tr_T47_304) AND FIREABLE(tr_T47_335) AND FIREABLE(tr_T47_290)))))) : A (G ((FIREABLE(tr_T50_11) OR FIREABLE(tr_T47_386) OR NOT FIREABLE(tr_T47_370)))) : E (F ((NOT FIREABLE(tr_T47_402) AND FIREABLE(tr_T47_341) AND (NOT FIREABLE(tr_T47_316) OR FIREABLE(tr_T51_1)) AND FIREABLE(tr_T47_190)))) : A (G (NOT FIREABLE(tr_T47_188))) : A (G (NOT FIREABLE(tr_T47_427))) : A (G ((NOT FIREABLE(tr_T47_400) OR NOT FIREABLE(tr_T34_25) OR NOT FIREABLE(tr_T47_208) OR FIREABLE(tr_T47_283) OR (NOT FIREABLE(tr_T12_1) AND NOT FIREABLE(tr_T47_305))))) : E (F (FIREABLE(tr_T47_62))) : A (G ((FIREABLE(tr_T47_393) OR NOT FIREABLE(tr_T47_109) OR FIREABLE(tr_T8_1)))) : E (F ((NOT FIREABLE(tr_T47_157) AND NOT FIREABLE(tr_T47_48) AND FIREABLE(tr_T47_273) AND NOT FIREABLE(tr_T47_382) AND NOT FIREABLE(tr_T47_72) AND FIREABLE(tr_T47_239)))) : E (F (((FIREABLE(tr_T47_60) OR FIREABLE(tr_T47_317)) AND FIREABLE(tr_T47_290) AND FIREABLE(tr_T47_350)))) : E (F (FIREABLE(tr_T47_79))) : E (F (FIREABLE(tr_T47_193)))
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 (((FIREABLE(tr_T34_28) OR FIREABLE(tr_T47_45) OR NOT FIREABLE(tr_T50_14) OR FIREABLE(tr_T47_414)) AND (NOT FIREABLE(tr_T47_423) OR NOT FIREABLE(tr_T47_298) OR FIREABLE(tr_T47_432) OR (FIREABLE(tr_T47_268) AND FIREABLE(tr_T47_51))))))
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 348 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 80 literals and 12 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T47_46) AND (FIREABLE(tr_T47_299) OR FIREABLE(tr_T47_217) OR FIREABLE(tr_T47_70) OR FIREABLE(tr_T47_274) OR FIREABLE(tr_T47_155)))))
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 348 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 30 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(tr_T47_77) AND FIREABLE(tr_T47_310)) OR ((NOT FIREABLE(tr_T47_93) OR NOT FIREABLE(tr_T47_205)) AND FIREABLE(tr_T47_79)))))
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 348 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 20 literals and 5 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-2.sara
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(tr_T47_435) AND NOT FIREABLE(tr_T34_30)) OR (NOT FIREABLE(tr_T47_332) AND NOT FIREABLE(tr_T47_133)) OR FIREABLE(tr_T47_298) OR NOT FIREABLE(tr_T47_438))))
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 348 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 80 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 124791 markings, 189088 edges, 24958 markings/sec, 0 secs
lola: sara is running 5 secs || 261240 markings, 405101 edges, 27290 markings/sec, 5 secs
lola: sara is running 10 secs || 397272 markings, 621910 edges, 27206 markings/sec, 10 secs
lola: sara is running 15 secs || 530751 markings, 833739 edges, 26696 markings/sec, 15 secs
lola: sara is running 20 secs || 657158 markings, 1037350 edges, 25281 markings/sec, 20 secs
lola: sara is running 25 secs || 784303 markings, 1240601 edges, 25429 markings/sec, 25 secs
lola: sara is running 30 secs || 911401 markings, 1446315 edges, 25420 markings/sec, 30 secs
lola: sara is running 35 secs || 1038060 markings, 1653336 edges, 25332 markings/sec, 35 secs
lola: sara is running 40 secs || 1165329 markings, 1860704 edges, 25454 markings/sec, 40 secs
lola: sara is running 45 secs || 1291379 markings, 2069967 edges, 25210 markings/sec, 45 secs
lola: sara is running 50 secs || 1417521 markings, 2277858 edges, 25228 markings/sec, 50 secs
lola: sara is running 55 secs || 1543184 markings, 2485408 edges, 25133 markings/sec, 55 secs
lola: sara is running 60 secs || 1669324 markings, 2694159 edges, 25228 markings/sec, 60 secs
lola: sara is running 65 secs || 1795767 markings, 2902711 edges, 25289 markings/sec, 65 secs
lola: sara is running 70 secs || 1921215 markings, 3112742 edges, 25090 markings/sec, 70 secs
lola: sara is running 75 secs || 2045535 markings, 3319739 edges, 24864 markings/sec, 75 secs
lola: sara is running 80 secs || 2170886 markings, 3530358 edges, 25070 markings/sec, 80 secs
lola: sara is running 85 secs || 2297904 markings, 3742561 edges, 25404 markings/sec, 85 secs
lola: sara is running 90 secs || 2424572 markings, 3955454 edges, 25334 markings/sec, 90 secs
lola: sara is running 95 secs || 2549687 markings, 4168549 edges, 25023 markings/sec, 95 secs
lola: sara is running 100 secs || 2684755 markings, 4389013 edges, 27014 markings/sec, 100 secs
lola: sara is running 105 secs || 2821243 markings, 4624063 edges, 27298 markings/sec, 105 secs
lola: sara is running 110 secs || 2957503 markings, 4867616 edges, 27252 markings/sec, 110 secs
lola: sara is running 115 secs || 3090956 markings, 5102853 edges, 26691 markings/sec, 115 secs
lola: sara is running 120 secs || 3223440 markings, 5328916 edges, 26497 markings/sec, 120 secs
lola: sara is running 125 secs || 3359152 markings, 5579068 edges, 27142 markings/sec, 125 secs
lola: sara is running 130 secs || 3493953 markings, 5823760 edges, 26960 markings/sec, 130 secs
lola: sara is running 135 secs || 3629088 markings, 6079169 edges, 27027 markings/sec, 135 secs
lola: sara is running 140 secs || 3763725 markings, 6319698 edges, 26927 markings/sec, 140 secs
lola: sara is running 145 secs || 3890812 markings, 6540400 edges, 25417 markings/sec, 145 secs
lola: sara is running 150 secs || 4017129 markings, 6754492 edges, 25263 markings/sec, 150 secs
lola: sara is running 155 secs || 4153563 markings, 6992058 edges, 27287 markings/sec, 155 secs
lola: sara is running 160 secs || 4297599 markings, 7259434 edges, 28807 markings/sec, 160 secs
lola: sara is running 165 secs || 4433683 markings, 7493845 edges, 27217 markings/sec, 165 secs
lola: sara is running 170 secs || 4565960 markings, 7718569 edges, 26455 markings/sec, 170 secs
lola: sara is running 175 secs || 4697397 markings, 7945271 edges, 26287 markings/sec, 175 secs
lola: sara is running 180 secs || 4832156 markings, 8175129 edges, 26952 markings/sec, 180 secs
lola: sara is running 185 secs || 4965098 markings, 8405798 edges, 26588 markings/sec, 185 secs
lola: sara is running 190 secs || 5098210 markings, 8634220 edges, 26622 markings/sec, 190 secs
lola: sara is running 195 secs || 5241015 markings, 8902992 edges, 28561 markings/sec, 195 secs
lola: sara is running 200 secs || 5383488 markings, 9173328 edges, 28495 markings/sec, 200 secs
lola: sara is running 205 secs || 5519058 markings, 9428622 edges, 27114 markings/sec, 205 secs
lola: sara is running 210 secs || 5652709 markings, 9659620 edges, 26730 markings/sec, 210 secs
lola: sara is running 215 secs || 5784420 markings, 9885507 edges, 26342 markings/sec, 215 secs
lola: sara is running 220 secs || 5916032 markings, 10112434 edges, 26322 markings/sec, 220 secs
lola: sara is running 225 secs || 6054342 markings, 10357740 edges, 27662 markings/sec, 225 secs
lola: sara is running 230 secs || 6195315 markings, 10615320 edges, 28195 markings/sec, 230 secs
lola: sara is running 235 secs || 6336575 markings, 10877591 edges, 28252 markings/sec, 235 secs
lola: sara is running 240 secs || 6481479 markings, 11156296 edges, 28981 markings/sec, 240 secs
lola: sara is running 245 secs || 6626351 markings, 11428557 edges, 28974 markings/sec, 245 secs
lola: sara is running 250 secs || 6770003 markings, 11704193 edges, 28730 markings/sec, 250 secs
lola: sara is running 255 secs || 6915221 markings, 11970861 edges, 29044 markings/sec, 255 secs
lola: sara is running 260 secs || 7059458 markings, 12252148 edges, 28847 markings/sec, 260 secs
lola: sara is running 265 secs || 7202175 markings, 12527927 edges, 28543 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T47_162) AND ((FIREABLE(tr_T47_333) AND FIREABLE(tr_T47_302) AND FIREABLE(tr_T47_78)) OR (FIREABLE(tr_T47_276) AND FIREABLE(tr_T47_304) AND FIREABLE(tr_T47_335) AND FIREABLE(tr_T47_290))))))
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 348 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 27 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 117282 markings, 298884 edges, 23456 markings/sec, 0 secs
lola: sara is running 5 secs || 236219 markings, 636721 edges, 23787 markings/sec, 5 secs
lola: sara is running 10 secs || 357000 markings, 987280 edges, 24156 markings/sec, 10 secs
lola: sara is running 15 secs || 479267 markings, 1348079 edges, 24453 markings/sec, 15 secs
lola: sara is running 20 secs || 602416 markings, 1719633 edges, 24630 markings/sec, 20 secs
lola: sara is running 25 secs || 722142 markings, 2083146 edges, 23945 markings/sec, 25 secs
lola: sara is running 30 secs || 841706 markings, 2445271 edges, 23913 markings/sec, 30 secs
lola: sara is running 35 secs || 958663 markings, 2804077 edges, 23391 markings/sec, 35 secs
lola: sara is running 40 secs || 1075426 markings, 3164904 edges, 23353 markings/sec, 40 secs
lola: sara is running 45 secs || 1189393 markings, 3512057 edges, 22793 markings/sec, 45 secs
lola: sara is running 50 secs || 1302411 markings, 3868738 edges, 22604 markings/sec, 50 secs
lola: sara is running 55 secs || 1423967 markings, 4253612 edges, 24311 markings/sec, 55 secs
lola: sara is running 60 secs || 1545546 markings, 4636600 edges, 24316 markings/sec, 60 secs
lola: sara is running 65 secs || 1668302 markings, 5019491 edges, 24551 markings/sec, 65 secs
lola: sara is running 70 secs || 1790655 markings, 5405138 edges, 24471 markings/sec, 70 secs
lola: sara is running 75 secs || 1912229 markings, 5792176 edges, 24315 markings/sec, 75 secs
lola: sara is running 80 secs || 2032326 markings, 6177363 edges, 24019 markings/sec, 80 secs
lola: sara is running 85 secs || 2144912 markings, 6543380 edges, 22517 markings/sec, 85 secs
lola: sara is running 90 secs || 2259783 markings, 6912181 edges, 22974 markings/sec, 90 secs
lola: sara is running 95 secs || 2373569 markings, 7278449 edges, 22757 markings/sec, 95 secs
lola: sara is running 100 secs || 2489793 markings, 7656888 edges, 23245 markings/sec, 100 secs
lola: sara is running 105 secs || 2603306 markings, 8025312 edges, 22703 markings/sec, 105 secs
lola: sara is running 110 secs || 2716751 markings, 8395269 edges, 22689 markings/sec, 110 secs
lola: sara is running 115 secs || 2829699 markings, 8765955 edges, 22590 markings/sec, 115 secs
lola: sara is running 120 secs || 2942363 markings, 9135303 edges, 22533 markings/sec, 120 secs
lola: sara is running 125 secs || 3054697 markings, 9505429 edges, 22467 markings/sec, 125 secs
lola: sara is running 130 secs || 3166662 markings, 9871774 edges, 22393 markings/sec, 130 secs
lola: sara is running 135 secs || 3278713 markings, 10240064 edges, 22410 markings/sec, 135 secs
lola: sara is running 140 secs || 3390453 markings, 10608818 edges, 22348 markings/sec, 140 secs
lola: sara is running 145 secs || 3502188 markings, 10977530 edges, 22347 markings/sec, 145 secs
lola: sara is running 150 secs || 3618173 markings, 11330678 edges, 23197 markings/sec, 150 secs
lola: sara is running 155 secs || 3731750 markings, 11695326 edges, 22715 markings/sec, 155 secs
lola: sara is running 160 secs || 3844626 markings, 12061290 edges, 22575 markings/sec, 160 secs
lola: sara is running 165 secs || 3958335 markings, 12437849 edges, 22742 markings/sec, 165 secs
lola: sara is running 170 secs || 4071856 markings, 12812101 edges, 22704 markings/sec, 170 secs
lola: sara is running 175 secs || 4179886 markings, 13170057 edges, 21606 markings/sec, 175 secs
lola: sara is running 180 secs || 4287024 markings, 13525912 edges, 21428 markings/sec, 180 secs
lola: sara is running 185 secs || 4393812 markings, 13882065 edges, 21358 markings/sec, 185 secs
lola: sara is running 190 secs || 4500991 markings, 14238005 edges, 21436 markings/sec, 190 secs
lola: sara is running 195 secs || 4607824 markings, 14595508 edges, 21367 markings/sec, 195 secs
lola: sara is running 200 secs || 4715013 markings, 14950060 edges, 21438 markings/sec, 200 secs
lola: sara is running 205 secs || 4825449 markings, 15319323 edges, 22087 markings/sec, 205 secs
lola: sara is running 210 secs || 4940006 markings, 15706619 edges, 22911 markings/sec, 210 secs
lola: sara is running 215 secs || 5056032 markings, 16091368 edges, 23205 markings/sec, 215 secs
lola: sara is running 220 secs || 5170859 markings, 16475733 edges, 22965 markings/sec, 220 secs
lola: sara is running 225 secs || 5286539 markings, 16862054 edges, 23136 markings/sec, 225 secs
lola: sara is running 230 secs || 5401172 markings, 17246256 edges, 22927 markings/sec, 230 secs
lola: sara is running 235 secs || 5515486 markings, 17629627 edges, 22863 markings/sec, 235 secs
lola: sara is running 240 secs || 5632227 markings, 18017017 edges, 23348 markings/sec, 240 secs
lola: sara is running 245 secs || 5747493 markings, 18402714 edges, 23053 markings/sec, 245 secs
lola: sara is running 250 secs || 5862046 markings, 18786601 edges, 22911 markings/sec, 250 secs
lola: sara is running 255 secs || 5979917 markings, 19176698 edges, 23574 markings/sec, 255 secs
lola: sara is running 260 secs || 6097358 markings, 19568389 edges, 23488 markings/sec, 260 secs
lola: sara is running 265 secs || 6211191 markings, 19953711 edges, 22767 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(tr_T50_11) OR FIREABLE(tr_T47_386) OR NOT FIREABLE(tr_T47_370))))
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 348 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40 markings, 39 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(tr_T47_402) AND FIREABLE(tr_T47_341) AND (NOT FIREABLE(tr_T47_316) OR FIREABLE(tr_T51_1)) AND FIREABLE(tr_T47_190))))
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 348 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
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-5.sara.
lola: state equation: Generated DNF with 34 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic
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 7 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(tr_T47_188)))
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 348 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 8 will run for 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(tr_T47_427)))
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 348 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 Railroad-PT-020-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 46 markings, 45 edges
lola: ========================================
lola: subprocess 9 will run for 427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T47_400) OR NOT FIREABLE(tr_T34_25) OR NOT FIREABLE(tr_T47_208) OR FIREABLE(tr_T47_283) OR (NOT FIREABLE(tr_T12_1) AND NOT FIREABLE(tr_T47_305)))))
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 348 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 50 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: subprocess 10 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T47_62)))
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 348 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: ========================================
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 11 will run for 597 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(tr_T47_393) OR NOT FIREABLE(tr_T47_109) OR FIREABLE(tr_T8_1))))
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 348 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)
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-10.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 30 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-11.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: 19 markings, 18 edges
lola: ========================================
lola: subprocess 12 will run for 746 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(tr_T47_157) AND NOT FIREABLE(tr_T47_48) AND FIREABLE(tr_T47_273) AND NOT FIREABLE(tr_T47_382) AND NOT FIREABLE(tr_T47_72) AND FIREABLE(tr_T47_239))))
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 348 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: Generated DNF with 160 literals and 16 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 995 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(tr_T47_60) OR FIREABLE(tr_T47_317)) AND FIREABLE(tr_T47_290) AND FIREABLE(tr_T47_350))))
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 348 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 18 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-020-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-020-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic

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 14 will run for 1493 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T47_79)))
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 348 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 Railroad-PT-020-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 15 will run for 2986 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T47_193)))
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 348 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 Railroad-PT-020-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 29 markings, 28 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes unknown unknown no no no no yes yes no no no yes yes
FORMULA Railroad-PT-020-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-020-ReachabilityFireability-15 TRUE 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="Railroad-PT-020"
export BK_EXAMINATION="ReachabilityFireability"
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/Railroad-PT-020.tgz
mv Railroad-PT-020 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 Railroad-PT-020, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r139-qhx2-152673581300189"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;