fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r148-csrt-149443432800072
Last Updated
June 27, 2017

About the Execution of LoLA for S_Railroad-PT-100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
456.610 541639.00 1082558.00 40.10 T?FFTTFTTFF?TTTT 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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_Railroad-PT-100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432800072
=====================================================================


--------------------
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-100-ReachabilityFireability-0
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-1
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-10
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-11
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-12
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-13
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-14
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-15
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-2
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-3
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-4
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-5
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-6
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-7
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-8
FORMULA_NAME Railroad-PT-100-ReachabilityFireability-9

=== Now, execution of the tool begins

BK_START 1496439716659


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


checking for too many tokens
===========================================================================================
S_Railroad-PT-100: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_Railroad-PT-100 @ 3540 seconds
----- Start make result stdout -----
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: 11524/65536 symbol table entries, 3643 collisions
lola: preprocessing...
lola: finding significant places
lola: 1018 places, 10506 transitions, 407 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 612 transition conflict sets
lola: TASK
lola: reading formula from Railroad-PT-100-ReachabilityFireability.task
lola: E (F (FIREABLE(tr_T135_5934))) : E (F ((FIREABLE(tr_T135_6258) AND FIREABLE(tr_T135_8136) AND (NOT FIREABLE(tr_T135_5668) OR NOT FIREABLE(tr_T135_9918)) AND (NOT FIREABLE(tr_T135_3703) OR NOT FIREABLE(tr_T135_2393) OR FIREABLE(tr_T135_1273) OR FIREABLE(tr_T135_5808) OR NOT FIREABLE(tr_T135_8960))))) : E (F ((FIREABLE(tr_T135_5498) OR FIREABLE(tr_T135_2194) OR (FIREABLE(tr_T135_7933) AND FIREABLE(tr_T135_8583))))) : A (G (NOT FIREABLE(tr_T135_3412))) : A (G ((NOT FIREABLE(tr_T135_8394) OR FIREABLE(tr_T135_7609) OR (NOT FIREABLE(tr_T135_9616) AND FIREABLE(tr_T135_6864))))) : E (F ((FIREABLE(tr_T83_1) AND ((FIREABLE(tr_T135_9209) AND FIREABLE(tr_T135_1762)) OR FIREABLE(tr_T135_7623)) AND (FIREABLE(tr_T135_3484) OR FIREABLE(tr_T135_1361) OR (NOT FIREABLE(tr_T135_9074) AND FIREABLE(tr_T135_2822)))))) : E (F (FIREABLE(tr_T135_4509))) : E (F ((FIREABLE(tr_T135_2873) OR (FIREABLE(tr_T135_9991) AND FIREABLE(tr_T135_5541) AND (NOT FIREABLE(tr_T135_7350) OR NOT FIREABLE(tr_T135_338)))))) : E (F ((FIREABLE(tr_T135_1066) OR (FIREABLE(tr_T125_117) AND (NOT FIREABLE(tr_T135_4809) OR (FIREABLE(tr_T135_2041) AND FIREABLE(tr_T135_9493))))))) : E (F (FIREABLE(tr_T135_8947))) : A (G ((NOT FIREABLE(tr_T305_1) AND NOT FIREABLE(tr_T135_8627) AND NOT FIREABLE(tr_T51_99) AND NOT FIREABLE(tr_T135_7748)))) : A (G ((NOT FIREABLE(tr_T135_3610) OR FIREABLE(tr_T135_3046) OR FIREABLE(tr_T135_8718)))) : E (F (FIREABLE(tr_T135_2926))) : E (F (FIREABLE(tr_T135_5642))) : A (G (((FIREABLE(tr_T135_1022) AND FIREABLE(tr_T135_8705)) OR NOT FIREABLE(tr_T135_9416)))) : E (F ((FIREABLE(tr_T135_778) OR FIREABLE(tr_T135_1178) OR FIREABLE(tr_T135_952) OR FIREABLE(tr_T135_7007) OR ((FIREABLE(tr_T135_2540) OR FIREABLE(tr_T135_6296)) AND FIREABLE(tr_T135_3949)) OR FIREABLE(tr_T135_9122))))
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 (FIREABLE(tr_T135_5934)))
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 1628 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-100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T135_6258) AND FIREABLE(tr_T135_8136) AND (NOT FIREABLE(tr_T135_5668) OR NOT FIREABLE(tr_T135_9918)) AND (NOT FIREABLE(tr_T135_3703) OR NOT FIREABLE(tr_T135_2393) OR FIREABLE(tr_T135_1273) OR FIREABLE(tr_T135_5808) OR NOT FIREABLE(tr_T135_8960)))))
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 1628 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 272 literals and 32 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability.sara.
lola: sara is running 0 secs || 4630 markings, 5803 edges, 926 markings/sec, 0 secs
lola: sara is running 5 secs || 8997 markings, 11742 edges, 873 markings/sec, 5 secs
lola: sara is running 10 secs || 13186 markings, 17762 edges, 838 markings/sec, 10 secs
lola: sara is running 15 secs || 17489 markings, 23695 edges, 861 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 21746 markings, 29647 edges, 851 markings/sec, 20 secs
lola: sara is running 25 secs || 25949 markings, 35829 edges, 841 markings/sec, 25 secs
lola: sara is running 30 secs || 30296 markings, 41659 edges, 869 markings/sec, 30 secs
lola: sara is running 35 secs || 34651 markings, 47467 edges, 871 markings/sec, 35 secs
lola: sara is running 40 secs || 38979 markings, 53291 edges, 866 markings/sec, 40 secs
lola: sara is running 45 secs || 43315 markings, 59074 edges, 867 markings/sec, 45 secs
lola: sara is running 50 secs || 47714 markings, 65176 edges, 880 markings/sec, 50 secs
lola: sara is running 55 secs || 51978 markings, 71273 edges, 853 markings/sec, 55 secs
lola: sara is running 60 secs || 56229 markings, 77322 edges, 850 markings/sec, 60 secs
lola: sara is running 65 secs || 60452 markings, 83357 edges, 845 markings/sec, 65 secs
lola: sara is running 70 secs || 64722 markings, 89285 edges, 854 markings/sec, 70 secs
lola: sara is running 75 secs || 68828 markings, 95344 edges, 821 markings/sec, 75 secs
lola: sara is running 80 secs || 72963 markings, 101456 edges, 827 markings/sec, 80 secs
lola: sara is running 85 secs || 77023 markings, 107579 edges, 812 markings/sec, 85 secs
lola: sara is running 90 secs || 81176 markings, 114022 edges, 831 markings/sec, 90 secs
lola: sara is running 95 secs || 85267 markings, 120033 edges, 818 markings/sec, 95 secs
lola: sara is running 100 secs || 89450 markings, 126094 edges, 837 markings/sec, 100 secs
lola: sara is running 105 secs || 93709 markings, 131992 edges, 852 markings/sec, 105 secs
lola: sara is running 110 secs || 97984 markings, 138246 edges, 855 markings/sec, 110 secs
lola: sara is running 115 secs || 102152 markings, 144222 edges, 834 markings/sec, 115 secs
lola: sara is running 120 secs || 106298 markings, 150184 edges, 829 markings/sec, 120 secs
lola: sara is running 125 secs || 110347 markings, 156268 edges, 810 markings/sec, 125 secs
lola: sara is running 130 secs || 114378 markings, 162168 edges, 806 markings/sec, 130 secs
lola: sara is running 135 secs || 118505 markings, 168378 edges, 825 markings/sec, 135 secs
lola: sara is running 140 secs || 122642 markings, 174416 edges, 827 markings/sec, 140 secs
lola: sara is running 145 secs || 126739 markings, 180591 edges, 819 markings/sec, 145 secs
lola: sara is running 150 secs || 130755 markings, 186709 edges, 803 markings/sec, 150 secs
lola: sara is running 155 secs || 134998 markings, 192779 edges, 849 markings/sec, 155 secs
lola: sara is running 160 secs || 139258 markings, 198868 edges, 852 markings/sec, 160 secs
lola: sara is running 165 secs || 143469 markings, 205203 edges, 842 markings/sec, 165 secs
lola: sara is running 170 secs || 147853 markings, 211612 edges, 877 markings/sec, 170 secs
lola: sara is running 175 secs || 152428 markings, 217702 edges, 915 markings/sec, 175 secs
lola: sara is running 180 secs || 156913 markings, 223708 edges, 897 markings/sec, 180 secs
lola: sara is running 185 secs || 161117 markings, 229727 edges, 841 markings/sec, 185 secs
lola: sara is running 190 secs || 165312 markings, 235569 edges, 839 markings/sec, 190 secs
lola: sara is running 195 secs || 169467 markings, 241553 edges, 831 markings/sec, 195 secs
lola: sara is running 200 secs || 173615 markings, 247778 edges, 830 markings/sec, 200 secs
lola: sara is running 205 secs || 177853 markings, 253807 edges, 848 markings/sec, 205 secs
lola: sara is running 210 secs || 182156 markings, 259914 edges, 861 markings/sec, 210 secs
lola: sara is running 215 secs || 186549 markings, 265929 edges, 879 markings/sec, 215 secs
lola: sara is running 220 secs || 190900 markings, 271957 edges, 870 markings/sec, 220 secs
lola: sara is running 225 secs || 195122 markings, 277572 edges, 844 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T135_5498) OR FIREABLE(tr_T135_2194) OR (FIREABLE(tr_T135_7933) AND FIREABLE(tr_T135_8583)))))
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 1628 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(tr_T135_3412)))
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 1628 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-100-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T135_8394) OR FIREABLE(tr_T135_7609) OR (NOT FIREABLE(tr_T135_9616) AND FIREABLE(tr_T135_6864)))))
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 1628 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 34 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T83_1) AND ((FIREABLE(tr_T135_9209) AND FIREABLE(tr_T135_1762)) OR FIREABLE(tr_T135_7623)) AND (FIREABLE(tr_T135_3484) OR FIREABLE(tr_T135_1361) OR (NOT FIREABLE(tr_T135_9074) AND FIREABLE(tr_T135_2822))))))
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 1628 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-100-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-5.sara.
lola: sara is running 0 secs || 4229 markings, 5417 edges, 846 markings/sec, 0 secs
lola: sara is running 5 secs || 8930 markings, 11428 edges, 940 markings/sec, 5 secs
lola: sara is running 10 secs || 13512 markings, 17448 edges, 916 markings/sec, 10 secs
lola: sara is running 15 secs || 18036 markings, 23511 edges, 905 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 22722 markings, 29952 edges, 937 markings/sec, 20 secs
lola: sara is running 25 secs || 27367 markings, 36257 edges, 929 markings/sec, 25 secs
lola: sara is running 30 secs || 31776 markings, 41823 edges, 882 markings/sec, 30 secs
lola: sara is running 35 secs || 36269 markings, 47525 edges, 899 markings/sec, 35 secs
lola: sara is running 40 secs || 40773 markings, 53302 edges, 901 markings/sec, 40 secs
lola: sara is running 45 secs || 45382 markings, 59504 edges, 922 markings/sec, 45 secs
lola: sara is running 50 secs || 49878 markings, 65283 edges, 899 markings/sec, 50 secs
lola: sara is running 55 secs || 54580 markings, 71494 edges, 940 markings/sec, 55 secs
lola: sara is running 60 secs || 59347 markings, 77854 edges, 953 markings/sec, 60 secs
lola: sara is running 65 secs || 63837 markings, 83870 edges, 898 markings/sec, 65 secs
lola: sara is running 70 secs || 68284 markings, 89889 edges, 889 markings/sec, 70 secs
lola: sara is running 75 secs || 72838 markings, 95853 edges, 911 markings/sec, 75 secs
lola: sara is running 80 secs || 77226 markings, 101729 edges, 878 markings/sec, 80 secs
lola: sara is running 85 secs || 81689 markings, 107563 edges, 893 markings/sec, 85 secs
lola: sara is running 90 secs || 86145 markings, 113578 edges, 891 markings/sec, 90 secs
lola: sara is running 95 secs || 90585 markings, 119656 edges, 888 markings/sec, 95 secs
lola: sara is running 100 secs || 94973 markings, 125671 edges, 878 markings/sec, 100 secs
lola: sara is running 105 secs || 99512 markings, 132016 edges, 908 markings/sec, 105 secs
lola: sara is running 110 secs || 103758 markings, 137659 edges, 849 markings/sec, 110 secs
lola: sara is running 115 secs || 108159 markings, 143439 edges, 880 markings/sec, 115 secs
lola: sara is running 120 secs || 112550 markings, 149500 edges, 878 markings/sec, 120 secs
lola: sara is running 125 secs || 116881 markings, 155486 edges, 866 markings/sec, 125 secs
lola: sara is running 130 secs || 121302 markings, 161196 edges, 884 markings/sec, 130 secs
lola: sara is running 135 secs || 125588 markings, 166614 edges, 857 markings/sec, 135 secs
lola: sara is running 140 secs || 129939 markings, 172257 edges, 870 markings/sec, 140 secs
lola: sara is running 145 secs || 134471 markings, 178346 edges, 906 markings/sec, 145 secs
lola: sara is running 150 secs || 138908 markings, 184074 edges, 887 markings/sec, 150 secs
lola: sara is running 155 secs || 143757 markings, 190550 edges, 970 markings/sec, 155 secs
lola: sara is running 160 secs || 148597 markings, 197067 edges, 968 markings/sec, 160 secs
lola: sara is running 165 secs || 153332 markings, 203611 edges, 947 markings/sec, 165 secs
lola: sara is running 170 secs || 157959 markings, 209587 edges, 925 markings/sec, 170 secs
lola: sara is running 175 secs || 162677 markings, 215971 edges, 944 markings/sec, 175 secs
lola: sara is running 180 secs || 167419 markings, 222296 edges, 948 markings/sec, 180 secs
lola: sara is running 185 secs || 171970 markings, 228361 edges, 910 markings/sec, 185 secs
lola: sara is running 190 secs || 176517 markings, 234276 edges, 909 markings/sec, 190 secs
lola: sara is running 195 secs || 180931 markings, 240312 edges, 883 markings/sec, 195 secs
lola: sara is running 200 secs || 185537 markings, 246736 edges, 921 markings/sec, 200 secs
lola: sara is running 205 secs || 190120 markings, 253056 edges, 917 markings/sec, 205 secs
lola: sara is running 210 secs || 194583 markings, 259215 edges, 893 markings/sec, 210 secs
lola: sara is running 215 secs || 199397 markings, 265875 edges, 963 markings/sec, 215 secs
lola: sara is running 220 secs || 204067 markings, 272112 edges, 934 markings/sec, 220 secs
lola: sara is running 225 secs || 208428 markings, 277912 edges, 872 markings/sec, 225 secs
lola: sara is running 230 secs || 212844 markings, 283797 edges, 883 markings/sec, 230 secs
lola: sara is running 235 secs || 217298 markings, 289908 edges, 891 markings/sec, 235 secs
lola: sara is running 240 secs || 221938 markings, 296036 edges, 928 markings/sec, 240 secs
lola: sara is running 245 secs || 226675 markings, 302730 edges, 947 markings/sec, 245 secs
lola: sara is running 250 secs || 231253 markings, 309042 edges, 916 markings/sec, 250 secs
lola: sara is running 255 secs || 235811 markings, 315152 edges, 912 markings/sec, 255 secs
lola: sara is running 260 secs || 240390 markings, 321457 edges, 916 markings/sec, 260 secs
lola: sara is running 265 secs || 245120 markings, 328100 edges, 946 markings/sec, 265 secs
lola: sara is running 270 secs || 249721 markings, 334632 edges, 920 markings/sec, 270 secs
lola: sara is running 275 secs || 254435 markings, 341070 edges, 943 markings/sec, 275 secs
lola: sara is running 280 secs || 259260 markings, 347695 edges, 965 markings/sec, 280 secs
lola: sara is running 285 secs || 264082 markings, 354545 edges, 964 markings/sec, 285 secs
lola: sara is running 290 secs || 268713 markings, 360862 edges, 926 markings/sec, 290 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 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_4509)))
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 1628 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-100-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 333 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T135_2873) OR (FIREABLE(tr_T135_9991) AND FIREABLE(tr_T135_5541) AND (NOT FIREABLE(tr_T135_7350) OR NOT FIREABLE(tr_T135_338))))))
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 1628 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 31 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 375 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T135_1066) OR (FIREABLE(tr_T125_117) AND (NOT FIREABLE(tr_T135_4809) OR (FIREABLE(tr_T135_2041) AND FIREABLE(tr_T135_9493)))))))
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 1628 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-100-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 428 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_8947)))
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 1628 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-100-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T305_1) AND NOT FIREABLE(tr_T135_8627) AND NOT FIREABLE(tr_T51_99) AND NOT FIREABLE(tr_T135_7748))))
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 1628 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 11 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 600 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(tr_T135_3610) OR FIREABLE(tr_T135_3046) OR FIREABLE(tr_T135_8718))))
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 1628 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-100-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 750 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_2926)))
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 1628 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-100-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1000 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(tr_T135_5642)))
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 1628 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-100-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1499 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(tr_T135_1022) AND FIREABLE(tr_T135_8705)) OR NOT FIREABLE(tr_T135_9416))))
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 1628 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2999 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(tr_T135_778) OR FIREABLE(tr_T135_1178) OR FIREABLE(tr_T135_952) OR FIREABLE(tr_T135_7007) OR ((FIREABLE(tr_T135_2540) OR FIREABLE(tr_T135_6296)) AND FIREABLE(tr_T135_3949)) OR FIREABLE(tr_T135_9122))))
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 1628 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 7 conjunctive subformulas
lola: state equation: write sara problem file to Railroad-PT-100-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Railroad-PT-100-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown yes no no unknown yes yes yes yes no no yes yes no yes
FORMULA Railroad-PT-100-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Railroad-PT-100-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496440258298

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_Railroad-PT-100"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="lola"
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/S_Railroad-PT-100.tgz
mv S_Railroad-PT-100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_Railroad-PT-100, 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 r148-csrt-149443432800072"
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 ;