About the Execution of LoLA for S_LamportFastMutEx-PT-8
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15671.900 | 1078344.00 | 2159418.00 | 85.00 | TTTT?FFF?FFFTFTT | 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_LamportFastMutEx-PT-8, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650000196
=====================================================================
--------------------
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 LamportFastMutEx-COL-8-ReachabilityCardinality-0
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-1
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-10
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-11
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-12
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-13
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-14
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-15
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-2
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-3
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-4
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-5
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-6
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-7
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-8
FORMULA_NAME LamportFastMutEx-COL-8-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1496360178925
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_LamportFastMutEx-PT-8: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_LamportFastMutEx-PT-8: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_LamportFastMutEx-PT-8 @ 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: 981/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 315 places, 666 transitions, 214 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 947 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-COL-8-ReachabilityCardinality.task
lola: E (F ((((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7 + P-sety_9_8 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8) AND (x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 + P-setbi_24_5 + P-setbi_24_6 + P-setbi_24_7 + P-setbi_24_8) AND ((3 <= P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8) OR (3 <= P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7 + P-ifxi_10_8))) OR (2 <= P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7 + P-sety_9_8)))) : E (F (((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8) AND (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4 + P-start_1_5 + P-start_1_6 + P-start_1_7 + P-start_1_8) AND (1 <= P-wait_5_8 + P-wait_5_7 + P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_0_5 + P-wait_0_6 + P-wait_0_7 + P-wait_0_8 + P-wait_5_3 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_1_5 + P-wait_1_6 + P-wait_1_7 + P-wait_1_8 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_2_5 + P-wait_2_6 + P-wait_2_7 + P-wait_2_8 + P-wait_5_2 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_3_5 + P-wait_3_6 + P-wait_3_7 + P-wait_3_8 + P-wait_5_1 + P-wait_5_0 + P-wait_4_8 + P-wait_4_7 + P-wait_4_6 + P-wait_4_5 + P-wait_4_4 + P-wait_4_3 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_6_0 + P-wait_6_1 + P-wait_6_2 + P-wait_6_3 + P-wait_6_4 + P-wait_6_5 + P-wait_6_6 + P-wait_6_7 + P-wait_6_8 + P-wait_7_0 + P-wait_7_1 + P-wait_7_2 + P-wait_7_3 + P-wait_7_4 + P-wait_7_5 + P-wait_7_6 + P-wait_7_7 + P-wait_7_8 + P-wait_8_0 + P-wait_8_1 + P-wait_8_2 + P-wait_8_3 + P-wait_8_4 + P-wait_8_5 + P-wait_8_6 + P-wait_8_7 + P-wait_8_8) AND ((P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 + P-setbi_24_5 + P-setbi_24_6 + P-setbi_24_7 + P-setbi_24_8 <= 2) OR ((2 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7 + P-setbi_5_8) AND (1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 + P-setbi_24_5 + P-setbi_24_6 + P-setbi_24_7 + P-setbi_24_8)))))) : A (G (((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 + P-setbi_11_8 <= 2) OR (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 + P-setbi_11_8 <= 2)))) : A (G ((((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8 + 1 <= P-b_6_true + P-b_1_true + P-b_5_false + P-b_4_false + P-b_3_false + P-b_2_false + P-b_7_true + P-b_0_false + P-b_8_true + P-b_0_true + P-b_5_true + P-b_2_true + P-b_1_false + P-b_4_true + P-b_6_false + P-b_3_true + P-b_8_false + P-b_7_false) AND (P-wait_5_8 + P-wait_5_7 + P-wait_5_6 + P-wait_5_5 + P-wait_5_4 + P-wait_0_0 + P-wait_0_1 + P-wait_0_2 + P-wait_0_3 + P-wait_0_4 + P-wait_0_5 + P-wait_0_6 + P-wait_0_7 + P-wait_0_8 + P-wait_5_3 + P-wait_1_0 + P-wait_1_1 + P-wait_1_2 + P-wait_1_3 + P-wait_1_4 + P-wait_1_5 + P-wait_1_6 + P-wait_1_7 + P-wait_1_8 + P-wait_2_0 + P-wait_2_1 + P-wait_2_2 + P-wait_2_3 + P-wait_2_4 + P-wait_2_5 + P-wait_2_6 + P-wait_2_7 + P-wait_2_8 + P-wait_5_2 + P-wait_3_0 + P-wait_3_1 + P-wait_3_2 + P-wait_3_3 + P-wait_3_4 + P-wait_3_5 + P-wait_3_6 + P-wait_3_7 + P-wait_3_8 + P-wait_5_1 + P-wait_5_0 + P-wait_4_8 + P-wait_4_7 + P-wait_4_6 + P-wait_4_5 + P-wait_4_4 + P-wait_4_3 + P-wait_4_0 + P-wait_4_1 + P-wait_4_2 + P-wait_6_0 + P-wait_6_1 + P-wait_6_2 + P-wait_6_3 + P-wait_6_4 + P-wait_6_5 + P-wait_6_6 + P-wait_6_7 + P-wait_6_8 + P-wait_7_0 + P-wait_7_1 + P-wait_7_2 + P-wait_7_3 + P-wait_7_4 + P-wait_7_5 + P-wait_7_6 + P-wait_7_7 + P-wait_7_8 + P-wait_8_0 + P-wait_8_1 + P-wait_8_2 + P-wait_8_3 + P-wait_8_4 + P-wait_8_5 + P-wait_8_6 + P-wait_8_7 + P-wait_8_8 <= 0)) OR ((1 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 + P-fordo_12_8) AND (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8 <= P-done_6_0 + P-done_6_1 + P-done_6_2 + P-done_6_3 + P-done_6_4 + P-done_6_5 + P-done_6_6 + P-done_6_7 + P-done_6_8 + P-done_7_0 + P-done_7_1 + P-done_7_2 + P-done_7_3 + P-done_7_4 + P-done_7_5 + P-done_7_6 + P-done_7_7 + P-done_7_8 + P-done_8_0 + P-done_8_1 + P-done_8_2 + P-done_8_3 + P-done_8_4 + P-done_8_5 + P-done_8_6 + P-done_8_7 + P-done_8_8 + P-done_0_8 + P-done_0_7 + P-done_0_6 + P-done_0_5 + P-done_0_4 + P-done_0_3 + P-done_1_0 + P-done_1_1 + P-done_1_2 + P-done_1_3 + P-done_1_4 + P-done_1_5 + P-done_1_6 + P-done_1_7 + P-done_1_8 + P-done_0_2 + P-done_0_1 + P-done_0_0 + P-done_2_0 + P-done_2_1 + P-done_2_2 + P-done_2_3 + P-done_2_4 + P-done_2_5 + P-done_2_6 + P-done_2_7 + P-done_2_8 + P-done_3_0 + P-done_3_1 + P-done_3_2 + P-done_3_3 + P-done_3_4 + P-done_3_5 + P-done_3_6 + P-done_3_7 + P-done_3_8 + P-done_4_0 + P-done_4_1 + P-done_4_2 + P-done_4_3 + P-done_4_4 + P-done_4_5 + P-done_4_6 + P-done_4_7 + P-done_4_8 + P-done_5_0 + P-done_5_1 + P-done_5_2 + P-done_5_3 + P-done_5_4 + P-done_5_5 + P-done_5_6 + P-done_5_7 + P-done_5_8) AND (3 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8) AND (P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7 + P-await_13_8 <= P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7 + P-setbi_5_8))))) : E (F ((2 <= x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8))) : A (G (((P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4 + P-setx_3_5 + P-setx_3_6 + P-setx_3_7 + P-setx_3_8 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8) OR (3 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 + P-fordo_12_8) OR (P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 + P-fordo_12_8) OR ((x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 + P-fordo_12_8) AND (x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8 <= P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4 + P-start_1_5 + P-start_1_6 + P-start_1_7 + P-start_1_8) AND (P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7 + P-ifxi_10_8 + 1 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 + P-setbi_11_8))))) : E (F (((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4 + P-start_1_5 + P-start_1_6 + P-start_1_7 + P-start_1_8 <= 1) AND (P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7 + P-setbi_5_8 + 1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8)))) : A (G ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 + P-setbi_11_8 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7 + P-await_13_8))) : E (F ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 + P-setbi_11_8 + 1 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 + P-fordo_12_8))) : E (F ((1 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7 + P-await_13_8))) : E (F (((P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4 + P-setx_3_5 + P-setx_3_6 + P-setx_3_7 + P-setx_3_8 + 1 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 + P-fordo_12_8)))) : E (F (((((P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4 + P-setx_3_5 + P-setx_3_6 + P-setx_3_7 + P-setx_3_8 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 + P-fordo_12_8) AND (1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 + P-setbi_24_5 + P-setbi_24_6 + P-setbi_24_7 + P-setbi_24_8)) OR ((P-ifxi_10_0 + P-ifxi_10_1 + P-ifxi_10_2 + P-ifxi_10_3 + P-ifxi_10_4 + P-ifxi_10_5 + P-ifxi_10_6 + P-ifxi_10_7 + P-ifxi_10_8 <= P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4 + P-setx_3_5 + P-setx_3_6 + P-setx_3_7 + P-setx_3_8) AND (2 <= x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8))) AND (P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7 + P-sety_9_8 <= 1)))) : A (G ((P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8 <= 2))) : A (G ((P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8 <= 1))) : A (G ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 + P-setbi_11_8))) : A (G (((x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 + P-setbi_24_5 + P-setbi_24_6 + P-setbi_24_7 + P-setbi_24_8) OR (P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7 + P-setbi_5_8 + 1 <= x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((P-sety_9_0 + P-sety_9_1 + P-sety_9_2 + P-sety_9_3 + P-sety_9_4 + P-sety_9_5 + P-sety_9_6 + P-sety_9_7 + P-sety_9_8 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8) AND (x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 + P-setbi_24_5 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 236147 markings, 937999 edges, 47229 markings/sec, 0 secs
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 (((P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8) AND (P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8 <= P-start_1_0 + P-start_1_1 + P-start... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 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 9 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 + P-setbi_11_8 <= 2) OR (P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 + P-setbi_11_8 <= 2))))
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 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 235741 markings, 1136274 edges, 47148 markings/sec, 0 secs
lola: sara is running 5 secs || 458221 markings, 2267332 edges, 44496 markings/sec, 5 secs
lola: sara is running 10 secs || 687312 markings, 3430624 edges, 45818 markings/sec, 10 secs
lola: sara is running 15 secs || 913919 markings, 4555157 edges, 45321 markings/sec, 15 secs
lola: sara is running 20 secs || 1142696 markings, 5706901 edges, 45755 markings/sec, 20 secs
lola: sara is running 25 secs || 1369018 markings, 6902138 edges, 45264 markings/sec, 25 secs
lola: sara is running 30 secs || 1595409 markings, 8068855 edges, 45278 markings/sec, 30 secs
lola: sara is running 35 secs || 1819030 markings, 9266534 edges, 44724 markings/sec, 35 secs
lola: sara is running 40 secs || 2042685 markings, 10434131 edges, 44731 markings/sec, 40 secs
lola: sara is running 45 secs || 2263374 markings, 11627303 edges, 44138 markings/sec, 45 secs
lola: sara is running 50 secs || 2485182 markings, 12793018 edges, 44362 markings/sec, 50 secs
lola: sara is running 55 secs || 2705266 markings, 13959220 edges, 44017 markings/sec, 55 secs
lola: sara is running 60 secs || 2925375 markings, 15146328 edges, 44022 markings/sec, 60 secs
lola: sara is running 65 secs || 3145853 markings, 16329350 edges, 44096 markings/sec, 65 secs
lola: sara is running 70 secs || 3365040 markings, 17477030 edges, 43837 markings/sec, 70 secs
lola: sara is running 75 secs || 3582682 markings, 18644506 edges, 43528 markings/sec, 75 secs
lola: sara is running 80 secs || 3800566 markings, 19806642 edges, 43577 markings/sec, 80 secs
lola: sara is running 85 secs || 4008574 markings, 20978760 edges, 41602 markings/sec, 85 secs
lola: sara is running 90 secs || 4229919 markings, 22130315 edges, 44269 markings/sec, 90 secs
lola: sara is running 95 secs || 4445478 markings, 23326380 edges, 43112 markings/sec, 95 secs
lola: sara is running 100 secs || 4658199 markings, 24540167 edges, 42544 markings/sec, 100 secs
lola: sara is running 105 secs || 4874074 markings, 25683038 edges, 43175 markings/sec, 105 secs
lola: sara is running 110 secs || 5092899 markings, 26859070 edges, 43765 markings/sec, 110 secs
lola: sara is running 115 secs || 5315749 markings, 28021672 edges, 44570 markings/sec, 115 secs
lola: sara is running 120 secs || 5527521 markings, 29225551 edges, 42354 markings/sec, 120 secs
lola: sara is running 125 secs || 5741437 markings, 30407031 edges, 42783 markings/sec, 125 secs
lola: sara is running 130 secs || 5957707 markings, 31554631 edges, 43254 markings/sec, 130 secs
lola: sara is running 135 secs || 6175735 markings, 32723602 edges, 43606 markings/sec, 135 secs
lola: sara is running 140 secs || 6388943 markings, 33903435 edges, 42642 markings/sec, 140 secs
lola: sara is running 145 secs || 6606498 markings, 35065670 edges, 43511 markings/sec, 145 secs
lola: sara is running 150 secs || 6822604 markings, 36220667 edges, 43221 markings/sec, 150 secs
lola: sara is running 155 secs || 7037968 markings, 37402781 edges, 43073 markings/sec, 155 secs
lola: sara is running 160 secs || 7247468 markings, 38608380 edges, 41900 markings/sec, 160 secs
lola: sara is running 165 secs || 7456949 markings, 39851091 edges, 41896 markings/sec, 165 secs
lola: sara is running 170 secs || 7668427 markings, 41052389 edges, 42296 markings/sec, 170 secs
lola: sara is running 175 secs || 7877212 markings, 42278110 edges, 41757 markings/sec, 175 secs
lola: sara is running 180 secs || 8089601 markings, 43418051 edges, 42478 markings/sec, 180 secs
lola: sara is running 185 secs || 8299615 markings, 44580857 edges, 42003 markings/sec, 185 secs
lola: sara is running 190 secs || 8510008 markings, 45801362 edges, 42079 markings/sec, 190 secs
lola: sara is running 195 secs || 8716771 markings, 47008805 edges, 41353 markings/sec, 195 secs
lola: sara is running 200 secs || 8925681 markings, 48239421 edges, 41782 markings/sec, 200 secs
lola: sara is running 205 secs || 9140877 markings, 49427832 edges, 43039 markings/sec, 205 secs
lola: sara is running 210 secs || 9349761 markings, 50612247 edges, 41777 markings/sec, 210 secs
lola: sara is running 215 secs || 9566784 markings, 51770634 edges, 43405 markings/sec, 215 secs
lola: sara is running 220 secs || 9781897 markings, 52956195 edges, 43023 markings/sec, 220 secs
lola: sara is running 225 secs || 9990963 markings, 54152386 edges, 41813 markings/sec, 225 secs
lola: sara is running 230 secs || 10202349 markings, 55379323 edges, 42277 markings/sec, 230 secs
lola: sara is running 235 secs || 10416524 markings, 56531910 edges, 42835 markings/sec, 235 secs
lola: sara is running 240 secs || 10627213 markings, 57740761 edges, 42138 markings/sec, 240 secs
lola: sara is running 245 secs || 10838125 markings, 58926863 edges, 42182 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 ((((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8 + 1 <= P-b_6_true + P-b_1_true + P-b_5_false + P-b_4_false + P-b_3_false + P-b_2_false + P-b_7_true + P-b_0_false + P-b_8_true + P-b_0_true + P-b_5_true + P-b_2_true + P-b_1_false + P-b_4_true + P-b_6_false + P-b_3_true + P-b_8_false + P-b_7_false) AND (P-wait_5_8 + ... (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 856 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 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-3.sara
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_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 856 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is unreachable.
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4 + P-setx_3_5 + P-setx_3_6 + P-setx_3_7 + P-setx_3_8 <= P-ify0_4_0 + P-ify0_4_1 + P-ify0_4_2 + P-ify0_4_3 + P-ify0_4_4 + P-ify0_4_5 + P-ify0_4_6 + P-ify0_4_7 + P-ify0_4_8) OR (3 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 + P-fordo_12_8) OR (P-ifyi_15... (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 856 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 LamportFastMutEx-COL-8-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P-start_1_0 + P-start_1_1 + P-start_1_2 + P-start_1_3 + P-start_1_4 + P-start_1_5 + P-start_1_6 + P-start_1_7 + P-start_1_8 <= 1) AND (P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7 + P-setbi_5_8 + 1 <= P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8)))... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-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: A (G ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 + P-setbi_11_8 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7 + P-await_13_8)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-7.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: ========================================
lola: subprocess 8 will run for 410 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 + P-setbi_11_8 + 1 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 + P-fordo_12_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 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: calling and running sara
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 468 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= P-await_13_0 + P-await_13_1 + P-await_13_2 + P-await_13_3 + P-await_13_4 + P-await_13_5 + P-await_13_6 + P-await_13_7 + P-await_13_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 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-9.sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 547 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4 + P-setx_3_5 + P-setx_3_6 + P-setx_3_7 + P-setx_3_8 + 1 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 + P-fordo_12_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 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-10.sara
lola: state equation: calling and running 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 (((((P-setx_3_0 + P-setx_3_1 + P-setx_3_2 + P-setx_3_3 + P-setx_3_4 + P-setx_3_5 + P-setx_3_6 + P-setx_3_7 + P-setx_3_8 <= P-fordo_12_0 + P-fordo_12_1 + P-fordo_12_2 + P-fordo_12_3 + P-fordo_12_4 + P-fordo_12_5 + P-fordo_12_6 + P-fordo_12_7 + P-fordo_12_8) AND (1 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 + P-setbi_24_5 + P-setbi_24_6 + P-setbi_24_7 + P-setbi_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 12 will run for 820 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((P-CS_21_0 + P-CS_21_1 + P-CS_21_2 + P-CS_21_3 + P-CS_21_4 + P-CS_21_5 + P-CS_21_6 + P-CS_21_7 + P-CS_21_8 <= 2)))
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 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 229460 markings, 1092723 edges, 45892 markings/sec, 0 secs
lola: sara is running 5 secs || 450292 markings, 2194924 edges, 44166 markings/sec, 5 secs
lola: sara is running 10 secs || 670511 markings, 3279071 edges, 44044 markings/sec, 10 secs
lola: sara is running 15 secs || 887650 markings, 4375494 edges, 43428 markings/sec, 15 secs
lola: sara is running 20 secs || 1102629 markings, 5456594 edges, 42996 markings/sec, 20 secs
lola: sara is running 25 secs || 1322478 markings, 6482984 edges, 43970 markings/sec, 25 secs
lola: sara is running 30 secs || 1540567 markings, 7522709 edges, 43618 markings/sec, 30 secs
lola: sara is running 35 secs || 1751408 markings, 8612670 edges, 42168 markings/sec, 35 secs
lola: sara is running 40 secs || 1963806 markings, 9704235 edges, 42480 markings/sec, 40 secs
lola: sara is running 45 secs || 2175629 markings, 10782225 edges, 42365 markings/sec, 45 secs
lola: sara is running 50 secs || 2386293 markings, 11865136 edges, 42133 markings/sec, 50 secs
lola: sara is running 55 secs || 2593083 markings, 12975567 edges, 41358 markings/sec, 55 secs
lola: sara is running 60 secs || 2806676 markings, 14063020 edges, 42719 markings/sec, 60 secs
lola: sara is running 65 secs || 3021512 markings, 15126855 edges, 42967 markings/sec, 65 secs
lola: sara is running 70 secs || 3235938 markings, 16166655 edges, 42885 markings/sec, 70 secs
lola: sara is running 75 secs || 3448727 markings, 17224135 edges, 42558 markings/sec, 75 secs
lola: sara is running 80 secs || 3661609 markings, 18297393 edges, 42576 markings/sec, 80 secs
lola: sara is running 85 secs || 3869200 markings, 19401024 edges, 41518 markings/sec, 85 secs
lola: sara is running 90 secs || 4079510 markings, 20470788 edges, 42062 markings/sec, 90 secs
lola: sara is running 95 secs || 4292075 markings, 21519065 edges, 42513 markings/sec, 95 secs
lola: sara is running 100 secs || 4511062 markings, 22538375 edges, 43797 markings/sec, 100 secs
lola: sara is running 105 secs || 4726186 markings, 23649652 edges, 43025 markings/sec, 105 secs
lola: sara is running 110 secs || 4941945 markings, 24691398 edges, 43152 markings/sec, 110 secs
lola: sara is running 115 secs || 5151620 markings, 25806300 edges, 41935 markings/sec, 115 secs
lola: sara is running 120 secs || 5364351 markings, 26934476 edges, 42546 markings/sec, 120 secs
lola: sara is running 125 secs || 5571223 markings, 28013995 edges, 41374 markings/sec, 125 secs
lola: sara is running 130 secs || 5778269 markings, 29096908 edges, 41409 markings/sec, 130 secs
lola: sara is running 135 secs || 5988323 markings, 30161486 edges, 42011 markings/sec, 135 secs
lola: sara is running 140 secs || 6194622 markings, 31256875 edges, 41260 markings/sec, 140 secs
lola: sara is running 145 secs || 6399976 markings, 32365256 edges, 41071 markings/sec, 145 secs
lola: sara is running 150 secs || 6607963 markings, 33403362 edges, 41597 markings/sec, 150 secs
lola: sara is running 155 secs || 6818794 markings, 34482378 edges, 42166 markings/sec, 155 secs
lola: sara is running 160 secs || 7024187 markings, 35576450 edges, 41079 markings/sec, 160 secs
lola: sara is running 165 secs || 7237936 markings, 36661045 edges, 42750 markings/sec, 165 secs
lola: sara is running 170 secs || 7448516 markings, 37779210 edges, 42116 markings/sec, 170 secs
lola: sara is running 175 secs || 7661467 markings, 38859624 edges, 42590 markings/sec, 175 secs
lola: sara is running 180 secs || 7867225 markings, 39979729 edges, 41152 markings/sec, 180 secs
lola: sara is running 185 secs || 8077846 markings, 41056778 edges, 42124 markings/sec, 185 secs
lola: sara is running 190 secs || 8285873 markings, 42103594 edges, 41605 markings/sec, 190 secs
lola: sara is running 195 secs || 8494356 markings, 43155591 edges, 41697 markings/sec, 195 secs
lola: sara is running 200 secs || 8698438 markings, 44220267 edges, 40816 markings/sec, 200 secs
lola: sara is running 205 secs || 8904299 markings, 45261655 edges, 41172 markings/sec, 205 secs
lola: sara is running 210 secs || 9108119 markings, 46345723 edges, 40764 markings/sec, 210 secs
lola: sara is running 215 secs || 9311452 markings, 47440205 edges, 40667 markings/sec, 215 secs
lola: sara is running 220 secs || 9514869 markings, 48537393 edges, 40683 markings/sec, 220 secs
lola: sara is running 225 secs || 9732158 markings, 49540502 edges, 43458 markings/sec, 225 secs
lola: sara is running 230 secs || 9949273 markings, 50600618 edges, 43423 markings/sec, 230 secs
lola: sara is running 235 secs || 10154731 markings, 51665603 edges, 41092 markings/sec, 235 secs
lola: sara is running 240 secs || 10361172 markings, 52749017 edges, 41288 markings/sec, 240 secs
lola: sara is running 245 secs || 10571094 markings, 53869541 edges, 41984 markings/sec, 245 secs
lola: sara is running 250 secs || 10777470 markings, 54951367 edges, 41275 markings/sec, 250 secs
lola: sara is running 255 secs || 10987092 markings, 56044552 edges, 41924 markings/sec, 255 secs
lola: sara is running 260 secs || 11196928 markings, 57136054 edges, 41967 markings/sec, 260 secs
lola: sara is running 265 secs || 11407516 markings, 58228628 edges, 42118 markings/sec, 265 secs
lola: sara is running 270 secs || 11613920 markings, 59369489 edges, 41281 markings/sec, 270 secs
lola: sara is running 275 secs || 11819684 markings, 60484061 edges, 41153 markings/sec, 275 secs
lola: sara is running 280 secs || 12025569 markings, 61529013 edges, 41177 markings/sec, 280 secs
lola: sara is running 285 secs || 12232122 markings, 62585965 edges, 41311 markings/sec, 285 secs
lola: sara is running 290 secs || 12437054 markings, 63689507 edges, 40986 markings/sec, 290 secs
lola: sara is running 295 secs || 12644734 markings, 64824752 edges, 41536 markings/sec, 295 secs
lola: sara is running 300 secs || 12844596 markings, 65957311 edges, 39972 markings/sec, 300 secs
lola: sara is running 305 secs || 13053507 markings, 66981735 edges, 41782 markings/sec, 305 secs
lola: sara is running 310 secs || 13259486 markings, 68078017 edges, 41196 markings/sec, 310 secs
lola: sara is running 315 secs || 13461516 markings, 69167108 edges, 40406 markings/sec, 315 secs
lola: sara is running 320 secs || 13669509 markings, 70207093 edges, 41599 markings/sec, 320 secs
lola: sara is running 325 secs || 13879712 markings, 71315084 edges, 42041 markings/sec, 325 secs
lola: sara is running 330 secs || 14089876 markings, 72422134 edges, 42033 markings/sec, 330 secs
lola: sara is running 335 secs || 14300626 markings, 73514428 edges, 42150 markings/sec, 335 secs
lola: sara is running 340 secs || 14508733 markings, 74579774 edges, 41621 markings/sec, 340 secs
lola: sara is running 345 secs || 14715351 markings, 75595274 edges, 41324 markings/sec, 345 secs
lola: sara is running 350 secs || 14925657 markings, 76607654 edges, 42061 markings/sec, 350 secs
lola: sara is running 355 secs || 15126386 markings, 77687762 edges, 40146 markings/sec, 355 secs
lola: sara is running 360 secs || 15324895 markings, 78804782 edges, 39702 markings/sec, 360 secs
lola: sara is running 365 secs || 15529683 markings, 79878488 edges, 40958 markings/sec, 365 secs
lola: sara is running 370 secs || 15739901 markings, 80883704 edges, 42044 markings/sec, 370 secs
lola: sara is running 375 secs || 15943341 markings, 81972056 edges, 40688 markings/sec, 375 secs
lola: sara is running 380 secs || 16149225 markings, 83100611 edges, 41177 markings/sec, 380 secs
lola: sara is running 385 secs || 16347883 markings, 84226010 edges, 39732 markings/sec, 385 secs
lola: sara is running 390 secs || 16550586 markings, 85347187 edges, 40541 markings/sec, 390 secs
lola: sara is running 395 secs || 16754429 markings, 86406932 edges, 40769 markings/sec, 395 secs
lola: sara is running 400 secs || 16959184 markings, 87453325 edges, 40951 markings/sec, 400 secs
lola: sara is running 405 secs || 17165719 markings, 88529591 edges, 41307 markings/sec, 405 secs
lola: sara is running 410 secs || 17370888 markings, 89585064 edges, 41034 markings/sec, 410 secs
lola: sara is running 415 secs || 17576847 markings, 90634627 edges, 41192 markings/sec, 415 secs
lola: sara is running 420 secs || 17778691 markings, 91678764 edges, 40369 markings/sec, 420 secs
lola: sara is running 425 secs || 17982911 markings, 92762140 edges, 40844 markings/sec, 425 secs
lola: sara is running 430 secs || 18191212 markings, 93804270 edges, 41660 markings/sec, 430 secs
lola: sara is running 435 secs || 18393391 markings, 94844409 edges, 40436 markings/sec, 435 secs
lola: sara is running 440 secs || 18603890 markings, 95875590 edges, 42100 markings/sec, 440 secs
lola: sara is running 445 secs || 18813964 markings, 97002665 edges, 42015 markings/sec, 445 secs
lola: sara is running 450 secs || 19026299 markings, 98052206 edges, 42467 markings/sec, 450 secs
lola: sara is running 455 secs || 19236944 markings, 99067346 edges, 42129 markings/sec, 455 secs
lola: sara is running 460 secs || 19444841 markings, 100126076 edges, 41579 markings/sec, 460 secs
lola: sara is running 465 secs || 19655560 markings, 101223491 edges, 42144 markings/sec, 465 secs
lola: sara is running 470 secs || 19854005 markings, 102324854 edges, 39689 markings/sec, 470 secs
lola: sara is running 475 secs || 20060354 markings, 103347687 edges, 41270 markings/sec, 475 secs
lola: sara is running 480 secs || 20261195 markings, 104335667 edges, 40168 markings/sec, 480 secs
lola: sara is running 485 secs || 20472080 markings, 105328987 edges, 42177 markings/sec, 485 secs
lola: sara is running 490 secs || 20678482 markings, 106397737 edges, 41280 markings/sec, 490 secs
lola: sara is running 495 secs || 20885495 markings, 107489835 edges, 41403 markings/sec, 495 secs
lola: sara is running 500 secs || 21097864 markings, 108601283 edges, 42474 markings/sec, 500 secs
lola: sara is running 505 secs || 21307463 markings, 109628499 edges, 41920 markings/sec, 505 secs
lola: sara is running 510 secs || 21520637 markings, 110716341 edges, 42635 markings/sec, 510 secs
lola: sara is running 515 secs || 21729124 markings, 111808501 edges, 41697 markings/sec, 515 secs
lola: sara is running 520 secs || 21928855 markings, 112931091 edges, 39946 markings/sec, 520 secs
lola: sara is running 525 secs || 22133894 markings, 113978524 edges, 41008 markings/sec, 525 secs
lola: sara is running 530 secs || 22338659 markings, 115102378 edges, 40953 markings/sec, 530 secs
lola: sara is running 535 secs || 22541976 markings, 116206602 edges, 40663 markings/sec, 535 secs
lola: sara is running 540 secs || 22750148 markings, 117260125 edges, 41634 markings/sec, 540 secs
lola: sara is running 545 secs || 22956826 markings, 118320707 edges, 41336 markings/sec, 545 secs
lola: sara is running 550 secs || 23162415 markings, 119395846 edges, 41118 markings/sec, 550 secs
lola: sara is running 555 secs || 23367970 markings, 120510713 edges, 41111 markings/sec, 555 secs
lola: sara is running 560 secs || 23576328 markings, 121664302 edges, 41672 markings/sec, 560 secs
lola: sara is running 565 secs || 23784860 markings, 122746233 edges, 41706 markings/sec, 565 secs
lola: sara is running 570 secs || 23988712 markings, 123853858 edges, 40770 markings/sec, 570 secs
lola: sara is running 575 secs || 24190030 markings, 125005968 edges, 40264 markings/sec, 575 secs
lola: sara is running 580 secs || 24392544 markings, 126195934 edges, 40503 markings/sec, 580 secs
lola: sara is running 585 secs || 24599462 markings, 127308266 edges, 41384 markings/sec, 585 secs
lola: sara is running 590 secs || 24803881 markings, 128357567 edges, 40884 markings/sec, 590 secs
lola: sara is running 595 secs || 25002107 markings, 129461249 edges, 39645 markings/sec, 595 secs
lola: sara is running 600 secs || 25201611 markings, 130547794 edges, 39901 markings/sec, 600 secs
lola: sara is running 605 secs || 25404126 markings, 131623826 edges, 40503 markings/sec, 605 secs
lola: sara is running 610 secs || 25610327 markings, 132659601 edges, 41240 markings/sec, 610 secs
lola: sara is running 615 secs || 25815367 markings, 133744307 edges, 41008 markings/sec, 615 secs
lola: sara is running 620 secs || 26021564 markings, 134828548 edges, 41239 markings/sec, 620 secs
lola: sara is running 625 secs || 26227547 markings, 135925617 edges, 41197 markings/sec, 625 secs
lola: sara is running 630 secs || 26436208 markings, 137056136 edges, 41732 markings/sec, 630 secs
lola: sara is running 635 secs || 26639130 markings, 138158362 edges, 40584 markings/sec, 635 secs
lola: sara is running 640 secs || 26846755 markings, 139261992 edges, 41525 markings/sec, 640 secs
lola: sara is running 645 secs || 27042927 markings, 140292927 edges, 39234 markings/sec, 645 secs
lola: sara is running 650 secs || 27246727 markings, 141331752 edges, 40760 markings/sec, 650 secs
lola: sara is running 655 secs || 27448122 markings, 142410602 edges, 40279 markings/sec, 655 secs
lola: sara is running 660 secs || 27650230 markings, 143499801 edges, 40422 markings/sec, 660 secs
lola: sara is running 665 secs || 27850440 markings, 144562653 edges, 40042 markings/sec, 665 secs
lola: sara is running 670 secs || 28051217 markings, 145634374 edges, 40155 markings/sec, 670 secs
lola: sara is running 675 secs || 28254228 markings, 146774854 edges, 40602 markings/sec, 675 secs
lola: sara is running 680 secs || 28465616 markings, 147734522 edges, 42278 markings/sec, 680 secs
lola: sara is running 685 secs || 28672552 markings, 148747099 edges, 41387 markings/sec, 685 secs
lola: sara is running 690 secs || 28882167 markings, 149894511 edges, 41923 markings/sec, 690 secs
lola: sara is running 695 secs || 29092473 markings, 150953899 edges, 42061 markings/sec, 695 secs
lola: sara is running 700 secs || 29292730 markings, 152050490 edges, 40051 markings/sec, 700 secs
lola: sara is running 705 secs || 29493511 markings, 153129201 edges, 40156 markings/sec, 705 secs
lola: sara is running 710 secs || 29689033 markings, 154210520 edges, 39104 markings/sec, 710 secs
lola: sara is running 715 secs || 29896550 markings, 155297703 edges, 41503 markings/sec, 715 secs
lola: sara is running 720 secs || 30096632 markings, 156398860 edges, 40016 markings/sec, 720 secs
lola: sara is running 725 secs || 30297696 markings, 157467751 edges, 40213 markings/sec, 725 secs
lola: sara is running 730 secs || 30501953 markings, 158467944 edges, 40851 markings/sec, 730 secs
lola: sara is running 735 secs || 30702885 markings, 159504676 edges, 40186 markings/sec, 735 secs
lola: sara is running 740 secs || 30901929 markings, 160595255 edges, 39809 markings/sec, 740 secs
lola: sara is running 745 secs || 31106421 markings, 161680028 edges, 40898 markings/sec, 745 secs
lola: sara is running 750 secs || 31315985 markings, 162746250 edges, 41913 markings/sec, 750 secs
lola: sara is running 755 secs || 31514793 markings, 163845366 edges, 39762 markings/sec, 755 secs
lola: sara is running 760 secs || 31721673 markings, 164952950 edges, 41376 markings/sec, 760 secs
lola: sara is running 765 secs || 31935432 markings, 166076954 edges, 42752 markings/sec, 765 secs
lola: sara is running 770 secs || 32142339 markings, 167179369 edges, 41381 markings/sec, 770 secs
lola: sara is running 775 secs || 32350359 markings, 168206877 edges, 41604 markings/sec, 775 secs
lola: sara is running 780 secs || 32554285 markings, 169283174 edges, 40785 markings/sec, 780 secs
lola: sara is running 785 secs || 32754123 markings, 170375223 edges, 39968 markings/sec, 785 secs
lola: sara is running 790 secs || 32954598 markings, 171436714 edges, 40095 markings/sec, 790 secs
lola: sara is running 795 secs || 33156599 markings, 172475942 edges, 40400 markings/sec, 795 secs
lola: sara is running 800 secs || 33365107 markings, 173555176 edges, 41702 markings/sec, 800 secs
lola: sara is running 805 secs || 33571579 markings, 174620835 edges, 41294 markings/sec, 805 secs
lola: sara is running 810 secs || 33772859 markings, 175648821 edges, 40256 markings/sec, 810 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 820 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P-awaity_0 + P-awaity_1 + P-awaity_2 + P-awaity_3 + P-awaity_4 + P-awaity_5 + P-awaity_6 + P-awaity_7 + P-awaity_8 <= 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 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 14 will run for 1230 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((P-ifyi_15_0 + P-ifyi_15_1 + P-ifyi_15_2 + P-ifyi_15_3 + P-ifyi_15_4 + P-ifyi_15_5 + P-ifyi_15_6 + P-ifyi_15_7 + P-ifyi_15_8 <= P-setbi_11_0 + P-setbi_11_1 + P-setbi_11_2 + P-setbi_11_3 + P-setbi_11_4 + P-setbi_11_5 + P-setbi_11_6 + P-setbi_11_7 + P-setbi_11_8)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2461 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8 <= P-setbi_24_0 + P-setbi_24_1 + P-setbi_24_2 + P-setbi_24_3 + P-setbi_24_4 + P-setbi_24_5 + P-setbi_24_6 + P-setbi_24_7 + P-setbi_24_8) OR (P-setbi_5_0 + P-setbi_5_1 + P-setbi_5_2 + P-setbi_5_3 + P-setbi_5_4 + P-setbi_5_5 + P-setbi_5_6 + P-setbi_5_7 + P-setbi_5_8 + 1 <= x_0 + x_1 + x_2 + x_3 + x_4 + x_5 + x_6 + x_7 + x_8))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 856 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes unknown no no no yes no yes yes yes yes unknown no no no
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-COL-8-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496361257269
--------------------
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_LamportFastMutEx-PT-8"
export BK_EXAMINATION="ReachabilityCardinality"
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_LamportFastMutEx-PT-8.tgz
mv S_LamportFastMutEx-PT-8 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_LamportFastMutEx-PT-8, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-blw7-149441650000196"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;