fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r048-smll-149440869600153
Last Updated
June 27, 2017

About the Execution of LoLA for PhaseVariation-PT-D30CS100

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
679.550 257031.00 511084.00 747.60 TTTTFTFT?FFTTTFF 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 PhaseVariation-PT-D30CS100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-smll-149440869600153
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494544975968


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ PhaseVariation-PT-D30CS100 @ 3539 seconds
----- Start make result stdout -----
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: 33679/65536 symbol table entries, 10484 collisions
lola: preprocessing...
lola: finding significant places
lola: 2702 places, 30977 transitions, 1801 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D30CS100-ReachabilityFireability.task
lola: E (F (((NOT FIREABLE(division2_replicate_4_8_B_3_7) OR NOT FIREABLE(division2_mutate_8_14_A_8_13) OR FIREABLE(division2_replicate_17_20_B_16_21)) AND FIREABLE(division2_mutate_25_17_A_26_17)))) : E (F (FIREABLE(division2_replicate_7_1_A_6_2))) : E (F ((NOT FIREABLE(division2_replicate_9_10_A_8_11) AND (FIREABLE(division1_mutate_11_8_A) OR FIREABLE(division2_mutate_20_17_A_21_18)) AND NOT FIREABLE(division2_replicate_23_20_B_22_20) AND NOT FIREABLE(division2_mutate_6_12_B_5_12) AND FIREABLE(division2_replicate_26_9_A_27_8)))) : A (G ((FIREABLE(division2_mutate_12_11_A_11_12) OR FIREABLE(division2_mutate_15_4_B_15_5) OR FIREABLE(division2_replicate_20_6_B_21_6) OR ((NOT FIREABLE(division2_replicate_17_20_B_17_19) OR NOT FIREABLE(division2_replicate_7_3_B_6_2)) AND (NOT FIREABLE(division2_mutate_19_19_B_19_20) OR NOT FIREABLE(division2_replicate_11_13_B_11_14)))))) : A (G ((FIREABLE(division2_replicate_12_2_A_11_2) OR FIREABLE(division2_replicate_10_29_A_9_28) OR (NOT FIREABLE(division2_replicate_23_10_A_24_10) AND NOT FIREABLE(division2_replicate_10_2_A_9_2)) OR FIREABLE(division1_mutate_26_15_B)))) : E (F ((NOT FIREABLE(division2_replicate_23_3_A_23_4) AND FIREABLE(division2_mutate_2_5_A_1_6)))) : E (F ((FIREABLE(division2_mutate_15_21_A_14_20) OR (NOT FIREABLE(division1_replicate_12_24_B) AND NOT FIREABLE(division2_mutate_11_19_A_10_20) AND (FIREABLE(division2_replicate_15_13_A_16_13) OR FIREABLE(division2_replicate_4_12_B_4_11)) AND FIREABLE(division2_mutate_24_8_A_23_8))))) : E (F (FIREABLE(division2_replicate_6_1_B_5_1))) : A (G (((NOT FIREABLE(division2_mutate_13_6_A_14_7) AND FIREABLE(division2_mutate_8_7_B_7_8)) OR (FIREABLE(division2_mutate_4_6_A_5_5) AND FIREABLE(division2_replicate_21_16_B_20_15) AND (FIREABLE(division2_replicate_17_8_A_18_8) OR FIREABLE(division2_mutate_8_29_B_8_28))) OR FIREABLE(division2_mutate_7_1_B_6_2) OR NOT FIREABLE(division2_replicate_6_26_B_5_26) OR FIREABLE(division2_replicate_19_11_B_19_10)))) : A (G ((NOT FIREABLE(division2_replicate_6_2_B_6_1) OR NOT FIREABLE(division2_replicate_11_6_A_10_7) OR NOT FIREABLE(division2_mutate_10_12_B_10_11) OR NOT FIREABLE(division2_mutate_8_28_A_7_28) OR (FIREABLE(division2_replicate_27_21_B_26_22) AND NOT FIREABLE(division1_mutate_1_1_A) AND ((FIREABLE(division2_mutate_18_6_B_18_5) AND FIREABLE(division2_mutate_5_19_B_5_18)) OR (FIREABLE(division2_mutate_2_25_B_3_24) AND FIREABLE(division2_mutate_27_4_A_28_4))))))) : E (F ((FIREABLE(division2_mutate_17_1_A_17_2) AND (NOT FIREABLE(division2_mutate_6_30_B_5_30) OR NOT FIREABLE(division2_mutate_24_10_A_24_9) OR (FIREABLE(division2_replicate_18_24_A_19_25) AND FIREABLE(division2_replicate_22_5_B_22_6)))))) : E (F (FIREABLE(division2_replicate_13_3_B_12_4))) : A (G ((FIREABLE(division2_replicate_27_8_A_26_8) OR FIREABLE(division2_mutate_21_29_A_20_30) OR NOT FIREABLE(division2_mutate_13_16_A_14_17) OR NOT FIREABLE(division2_replicate_12_12_B_12_13) OR NOT FIREABLE(division2_replicate_10_17_B_10_16) OR (FIREABLE(division2_replicate_6_25_B_7_24) AND FIREABLE(division2_replicate_19_28_A_20_28) AND NOT FIREABLE(division2_mutate_1_21_B_2_20) AND FIREABLE(division2_replicate_5_13_A_5_14))))) : E (F (FIREABLE(division2_replicate_27_21_B_28_20))) : A (G ((NOT FIREABLE(division2_mutate_13_9_A_14_9) AND (NOT FIREABLE(division2_mutate_10_8_A_11_8) OR NOT FIREABLE(division2_replicate_15_2_A_16_3) OR NOT FIREABLE(division2_mutate_14_13_B_15_14))))) : E (F ((((FIREABLE(division2_replicate_18_3_B_19_2) AND FIREABLE(division2_mutate_13_22_B_12_23) AND NOT FIREABLE(division2_replicate_16_16_A_17_15)) OR ((FIREABLE(division2_replicate_16_21_B_16_22) OR FIREABLE(division2_mutate_7_7_A_8_8)) AND (FIREABLE(division2_replicate_6_17_B_6_18) OR FIREABLE(division2_replicate_25_19_A_25_20)))) AND NOT FIREABLE(division2_replicate_4_12_A_3_11))))
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 (((NOT FIREABLE(division2_replicate_4_8_B_3_7) OR NOT FIREABLE(division2_mutate_8_14_A_8_13) OR FIREABLE(division2_replicate_17_20_B_16_21)) AND FIREABLE(division2_mutate_25_17_A_26_17))))
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 7204 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 22 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_7_1_A_6_2)))
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 7204 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 PhaseVariation-PT-D30CS100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(division2_replicate_9_10_A_8_11) AND (FIREABLE(division1_mutate_11_8_A) OR FIREABLE(division2_mutate_20_17_A_21_18)) AND NOT FIREABLE(division2_replicate_23_20_B_22_20) AND NOT FIREABLE(division2_mutate_6_12_B_5_12) AND FIREABLE(division2_replicate_26_9_A_27_8))))
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 7204 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 144 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-2.sara.
lola: sara is running 0 secs || 367 markings, 1153 edges, 73 markings/sec, 0 secs
lola: sara is running 5 secs || 615 markings, 2145 edges, 50 markings/sec, 5 secs
lola: sara is running 10 secs || 857 markings, 3172 edges, 48 markings/sec, 10 secs
lola: sara is running 15 secs || 1099 markings, 4261 edges, 48 markings/sec, 15 secs
lola: sara is running 20 secs || 1313 markings, 5224 edges, 43 markings/sec, 20 secs
lola: sara is running 25 secs || 1448 markings, 5716 edges, 27 markings/sec, 25 secs
lola: sara is running 30 secs || 1644 markings, 5912 edges, 39 markings/sec, 30 secs
lola: sara is running 35 secs || 3822 markings, 25186 edges, 436 markings/sec, 35 secs
lola: sara is running 40 secs || 6111 markings, 49633 edges, 458 markings/sec, 40 secs
lola: sara is running 45 secs || 8380 markings, 74819 edges, 454 markings/sec, 45 secs
lola: sara is running 50 secs || 10552 markings, 103699 edges, 434 markings/sec, 50 secs
lola: sara is running 55 secs || 12924 markings, 126540 edges, 474 markings/sec, 55 secs
lola: sara is running 60 secs || 15160 markings, 150722 edges, 447 markings/sec, 60 secs
lola: sara is running 65 secs || 17369 markings, 174977 edges, 442 markings/sec, 65 secs
lola: sara is running 70 secs || 19495 markings, 203251 edges, 425 markings/sec, 70 secs
lola: sara is running 75 secs || 21667 markings, 229953 edges, 434 markings/sec, 75 secs
lola: sara is running 80 secs || 23808 markings, 258331 edges, 428 markings/sec, 80 secs
lola: sara is running 85 secs || 25942 markings, 287114 edges, 427 markings/sec, 85 secs
lola: sara is running 90 secs || 27980 markings, 319848 edges, 408 markings/sec, 90 secs
lola: sara is running 95 secs || 30301 markings, 341952 edges, 464 markings/sec, 95 secs
lola: sara is running 100 secs || 32572 markings, 366396 edges, 454 markings/sec, 100 secs
lola: sara is running 105 secs || 34827 markings, 391307 edges, 451 markings/sec, 105 secs
lola: sara is running 110 secs || 37000 markings, 419464 edges, 435 markings/sec, 110 secs
lola: sara is running 115 secs || 39311 markings, 442581 edges, 462 markings/sec, 115 secs
lola: sara is running 120 secs || 41580 markings, 467305 edges, 454 markings/sec, 120 secs
lola: sara is running 125 secs || 43847 markings, 492001 edges, 453 markings/sec, 125 secs
lola: sara is running 130 secs || 46012 markings, 520411 edges, 433 markings/sec, 130 secs
lola: sara is running 135 secs || 48256 markings, 549595 edges, 449 markings/sec, 135 secs
lola: sara is running 140 secs || 50503 markings, 578705 edges, 449 markings/sec, 140 secs
lola: sara is running 145 secs || 52711 markings, 609173 edges, 442 markings/sec, 145 secs
lola: sara is running 150 secs || 54872 markings, 640857 edges, 432 markings/sec, 150 secs
lola: sara is running 155 secs || 57128 markings, 669300 edges, 451 markings/sec, 155 secs
lola: sara is running 160 secs || 59390 markings, 696903 edges, 452 markings/sec, 160 secs
lola: sara is running 165 secs || 61582 markings, 725833 edges, 438 markings/sec, 165 secs
lola: sara is running 170 secs || 63760 markings, 756058 edges, 436 markings/sec, 170 secs
lola: sara is running 175 secs || 66089 markings, 784925 edges, 466 markings/sec, 175 secs
lola: sara is running 180 secs || 68414 markings, 813870 edges, 465 markings/sec, 180 secs
lola: sara is running 185 secs || 70688 markings, 844225 edges, 455 markings/sec, 185 secs
lola: sara is running 190 secs || 72895 markings, 876867 edges, 441 markings/sec, 190 secs
lola: sara is running 195 secs || 75054 markings, 909264 edges, 432 markings/sec, 195 secs
lola: sara is running 200 secs || 77211 markings, 941868 edges, 431 markings/sec, 200 secs
lola: sara is running 205 secs || 79335 markings, 975421 edges, 425 markings/sec, 205 secs
lola: sara is running 210 secs || 81557 markings, 1006162 edges, 444 markings/sec, 210 secs
lola: sara is running 215 secs || 84010 markings, 1032231 edges, 491 markings/sec, 215 secs
lola: sara is running 220 secs || 86451 markings, 1058533 edges, 488 markings/sec, 220 secs
lola: sara is running 225 secs || 88867 markings, 1087852 edges, 483 markings/sec, 225 secs
lola: sara is running 230 secs || 91333 markings, 1113607 edges, 493 markings/sec, 230 secs
lola: sara is running 235 secs || 93757 markings, 1139737 edges, 485 markings/sec, 235 secs
lola: sara is running 240 secs || 96195 markings, 1166727 edges, 488 markings/sec, 240 secs
lola: sara is running 245 secs || 98500 markings, 1196925 edges, 461 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: A (G ((FIREABLE(division2_mutate_12_11_A_11_12) OR FIREABLE(division2_mutate_15_4_B_15_5) OR FIREABLE(division2_replicate_20_6_B_21_6) OR ((NOT FIREABLE(division2_replicate_17_20_B_17_19) OR NOT FIREABLE(division2_replicate_7_3_B_6_2)) AND (NOT FIREABLE(division2_mutate_19_19_B_19_20) OR NOT FIREABLE(division2_replicate_11_13_B_11_14))))))
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 7204 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 144 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-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 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(division2_replicate_12_2_A_11_2) OR FIREABLE(division2_replicate_10_29_A_9_28) OR (NOT FIREABLE(division2_replicate_23_10_A_24_10) AND NOT FIREABLE(division2_replicate_10_2_A_9_2)) OR FIREABLE(division1_mutate_26_15_B))))
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 7204 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 96 literals and 16 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-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 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(division2_replicate_23_3_A_23_4) AND FIREABLE(division2_mutate_2_5_A_1_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 7204 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_15_21_A_14_20) OR (NOT FIREABLE(division1_replicate_12_24_B) AND NOT FIREABLE(division2_mutate_11_19_A_10_20) AND (FIREABLE(division2_replicate_15_13_A_16_13) OR FIREABLE(division2_replicate_4_12_B_4_11)) AND FIREABLE(division2_mutate_24_8_A_23_8)))))
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 7204 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 67 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-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 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_6_1_B_5_1)))
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 7204 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 PhaseVariation-PT-D30CS100-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-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 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(division2_mutate_13_6_A_14_7) AND FIREABLE(division2_mutate_8_7_B_7_8)) OR (FIREABLE(division2_mutate_4_6_A_5_5) AND FIREABLE(division2_replicate_21_16_B_20_15) AND (FIREABLE(division2_replicate_17_8_A_18_8) OR FIREABLE(division2_mutate_8_29_B_8_28))) OR FIREABLE(division2_mutate_7_1_B_6_2) OR NOT FIREABLE(division2_replicate_6_26_B_5_26) OR FIREABLE(division2_replicate_1... (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 7204 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 784 literals and 96 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 469 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_replicate_6_2_B_6_1) OR NOT FIREABLE(division2_replicate_11_6_A_10_7) OR NOT FIREABLE(division2_mutate_10_12_B_10_11) OR NOT FIREABLE(division2_mutate_8_28_A_7_28) OR (FIREABLE(division2_replicate_27_21_B_26_22) AND NOT FIREABLE(division1_mutate_1_1_A) AND ((FIREABLE(division2_mutate_18_6_B_18_5) AND FIREABLE(division2_mutate_5_19_B_5_18)) OR (FIREABLE(division2_... (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 7204 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 265 literals and 19 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(division2_mutate_17_1_A_17_2) AND (NOT FIREABLE(division2_mutate_6_30_B_5_30) OR NOT FIREABLE(division2_mutate_24_10_A_24_9) OR (FIREABLE(division2_replicate_18_24_A_19_25) AND FIREABLE(division2_replicate_22_5_B_22_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 7204 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 25 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 656 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_13_3_B_12_4)))
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 7204 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 PhaseVariation-PT-D30CS100-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 820 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(division2_replicate_27_8_A_26_8) OR FIREABLE(division2_mutate_21_29_A_20_30) OR NOT FIREABLE(division2_mutate_13_16_A_14_17) OR NOT FIREABLE(division2_replicate_12_12_B_12_13) OR NOT FIREABLE(division2_replicate_10_17_B_10_16) OR (FIREABLE(division2_replicate_6_25_B_7_24) AND FIREABLE(division2_replicate_19_28_A_20_28) AND NOT FIREABLE(division2_mutate_1_21_B_2_20) AND FIREABL... (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 7204 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 344 literals and 28 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1094 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(division2_replicate_27_21_B_28_20)))
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 7204 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 PhaseVariation-PT-D30CS100-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-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 1641 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(division2_mutate_13_9_A_14_9) AND (NOT FIREABLE(division2_mutate_10_8_A_11_8) OR NOT FIREABLE(division2_replicate_15_2_A_16_3) OR NOT FIREABLE(division2_mutate_14_13_B_15_14)))))
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 7204 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 2 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-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 3283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(division2_replicate_18_3_B_19_2) AND FIREABLE(division2_mutate_13_22_B_12_23) AND NOT FIREABLE(division2_replicate_16_16_A_17_15)) OR ((FIREABLE(division2_replicate_16_21_B_16_22) OR FIREABLE(division2_mutate_7_7_A_8_8)) AND (FIREABLE(division2_replicate_6_17_B_6_18) OR FIREABLE(division2_replicate_25_19_A_25_20)))) AND NOT FIREABLE(division2_replicate_4_12_A_3_11))))
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 7204 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 88 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D30CS100-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D30CS100-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes unknown no no yes yes yes no no yes yes no yes no yes
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D30CS100-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494545232999

--------------------
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="PhaseVariation-PT-D30CS100"
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/PhaseVariation-PT-D30CS100.tgz
mv PhaseVariation-PT-D30CS100 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 PhaseVariation-PT-D30CS100, 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 r048-smll-149440869600153"
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 ;