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 LamportFastMutEx-PT-8, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484700196
=====================================================================

--------------------
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 1494629084038


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ LamportFastMutEx-PT-8 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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 28 bytes per marking, with 10 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 || 248495 markings, 985834 edges, 49699 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 28 bytes per marking, with 10 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: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
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: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)lola:
lola: state equation: calling and running sara
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
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality.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
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 237774 markings, 1147688 edges, 47555 markings/sec, 0 secs
lola: sara is running 5 secs || 468095 markings, 2324126 edges, 46064 markings/sec, 5 secs
lola: sara is running 10 secs || 705257 markings, 3523007 edges, 47432 markings/sec, 10 secs
lola: sara is running 15 secs || 940884 markings, 4683466 edges, 47125 markings/sec, 15 secs
lola: sara is running 20 secs || 1173958 markings, 5869312 edges, 46615 markings/sec, 20 secs
lola: sara is running 25 secs || 1405580 markings, 7091851 edges, 46324 markings/sec, 25 secs
lola: sara is running 30 secs || 1637206 markings, 8296111 edges, 46325 markings/sec, 30 secs
lola: sara is running 35 secs || 1865372 markings, 9515566 edges, 45633 markings/sec, 35 secs
lola: sara is running 40 secs || 2093121 markings, 10715217 edges, 45550 markings/sec, 40 secs
lola: sara is running 45 secs || 2318855 markings, 11917296 edges, 45147 markings/sec, 45 secs
lola: sara is running 50 secs || 2545712 markings, 13123990 edges, 45371 markings/sec, 50 secs
lola: sara is running 55 secs || 2770987 markings, 14310893 edges, 45055 markings/sec, 55 secs
lola: sara is running 60 secs || 2995791 markings, 15536907 edges, 44961 markings/sec, 60 secs
lola: sara is running 65 secs || 3222295 markings, 16727806 edges, 45301 markings/sec, 65 secs
lola: sara is running 70 secs || 3446960 markings, 17904683 edges, 44933 markings/sec, 70 secs
lola: sara is running 75 secs || 3670162 markings, 19112397 edges, 44640 markings/sec, 75 secs
lola: sara is running 80 secs || 3892481 markings, 20322727 edges, 44464 markings/sec, 80 secs
lola: sara is running 85 secs || 4114635 markings, 21528988 edges, 44431 markings/sec, 85 secs
lola: sara is running 90 secs || 4339544 markings, 22744886 edges, 44982 markings/sec, 90 secs
lola: sara is running 95 secs || 4559711 markings, 23984749 edges, 44033 markings/sec, 95 secs
lola: sara is running 100 secs || 4782629 markings, 25194752 edges, 44584 markings/sec, 100 secs
lola: sara is running 105 secs || 5008702 markings, 26390068 edges, 45215 markings/sec, 105 secs
lola: sara is running 110 secs || 5236642 markings, 27600793 edges, 45588 markings/sec, 110 secs
lola: sara is running 115 secs || 5456693 markings, 28820745 edges, 44010 markings/sec, 115 secs
lola: sara is running 120 secs || 5676326 markings, 30038880 edges, 43927 markings/sec, 120 secs
lola: sara is running 125 secs || 5898773 markings, 31229507 edges, 44489 markings/sec, 125 secs
lola: sara is running 130 secs || 6122354 markings, 32432950 edges, 44716 markings/sec, 130 secs
lola: sara is running 135 secs || 6339603 markings, 33636439 edges, 43450 markings/sec, 135 secs
lola: sara is running 140 secs || 6553625 markings, 34780841 edges, 42804 markings/sec, 140 secs
lola: sara is running 145 secs || 6775587 markings, 35949772 edges, 44392 markings/sec, 145 secs
lola: sara is running 150 secs || 6992790 markings, 37177510 edges, 43441 markings/sec, 150 secs
lola: sara is running 155 secs || 7208390 markings, 38390253 edges, 43120 markings/sec, 155 secs
lola: sara is running 160 secs || 7425150 markings, 39656107 edges, 43352 markings/sec, 160 secs
lola: sara is running 165 secs || 7641034 markings, 40887871 edges, 43177 markings/sec, 165 secs
lola: sara is running 170 secs || 7856720 markings, 42164454 edges, 43137 markings/sec, 170 secs
lola: sara is running 175 secs || 8076056 markings, 43342669 edges, 43867 markings/sec, 175 secs
lola: sara is running 180 secs || 8291922 markings, 44542500 edges, 43173 markings/sec, 180 secs
lola: sara is running 185 secs || 8509430 markings, 45797269 edges, 43502 markings/sec, 185 secs
lola: sara is running 190 secs || 8722200 markings, 47040598 edges, 42554 markings/sec, 190 secs
lola: sara is running 195 secs || 8936943 markings, 48312448 edges, 42949 markings/sec, 195 secs
lola: sara is running 200 secs || 9157225 markings, 49536640 edges, 44056 markings/sec, 200 secs
lola: sara is running 205 secs || 9372818 markings, 50736851 edges, 43119 markings/sec, 205 secs
lola: sara is running 210 secs || 9598202 markings, 51929837 edges, 45077 markings/sec, 210 secs
lola: sara is running 215 secs || 9816939 markings, 53172266 edges, 43747 markings/sec, 215 secs
lola: sara is running 220 secs || 10037269 markings, 54391374 edges, 44066 markings/sec, 220 secs
lola: sara is running 225 secs || 10254063 markings, 55658567 edges, 43359 markings/sec, 225 secs
lola: sara is running 230 secs || 10474463 markings, 56849815 edges, 44080 markings/sec, 230 secs
lola: sara is running 235 secs || 10692073 markings, 58095252 edges, 43522 markings/sec, 235 secs
lola: sara is running 240 secs || 10911910 markings, 59312479 edges, 43967 markings/sec, 240 secs
lola: sara is running 245 secs || 11136110 markings, 60492215 edges, 44840 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 28 bytes per marking, with 10 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: ========================================
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 28 bytes per marking, with 10 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: ========================================
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 28 bytes per marking, with 10 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: 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 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 28 bytes per marking, with 10 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 28 bytes per marking, with 10 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 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 28 bytes per marking, with 10 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-8.sara
lola: subprocess 9 will run for 469 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: ========================================
lola: state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 10 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
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 28 bytes per marking, with 10 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
sara: try reading problem file LamportFastMutEx-COL-8-ReachabilityCardinality-8.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 28 bytes per marking, with 10 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: ========================================
lola: subprocess 12 will run for 820 seconds at most (--localtimelimit=-1)
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 28 bytes per marking, with 10 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 || 231741 markings, 1102560 edges, 46348 markings/sec, 0 secs
lola: sara is running 5 secs || 458828 markings, 2235050 edges, 45417 markings/sec, 5 secs
lola: sara is running 10 secs || 684256 markings, 3353744 edges, 45086 markings/sec, 10 secs
lola: sara is running 15 secs || 906911 markings, 4476424 edges, 44531 markings/sec, 15 secs
lola: sara is running 20 secs || 1130665 markings, 5562005 edges, 44751 markings/sec, 20 secs
lola: sara is running 25 secs || 1353939 markings, 6647963 edges, 44655 markings/sec, 25 secs
lola: sara is running 30 secs || 1577700 markings, 7724734 edges, 44752 markings/sec, 30 secs
lola: sara is running 35 secs || 1795708 markings, 8852860 edges, 43602 markings/sec, 35 secs
lola: sara is running 40 secs || 2016726 markings, 9975819 edges, 44204 markings/sec, 40 secs
lola: sara is running 45 secs || 2236580 markings, 11076605 edges, 43971 markings/sec, 45 secs
lola: sara is running 50 secs || 2453817 markings, 12217219 edges, 43447 markings/sec, 50 secs
lola: sara is running 55 secs || 2669405 markings, 13384546 edges, 43118 markings/sec, 55 secs
lola: sara is running 60 secs || 2893566 markings, 14467254 edges, 44832 markings/sec, 60 secs
lola: sara is running 65 secs || 3114198 markings, 15584278 edges, 44126 markings/sec, 65 secs
lola: sara is running 70 secs || 3337201 markings, 16679043 edges, 44601 markings/sec, 70 secs
lola: sara is running 75 secs || 3557785 markings, 17783373 edges, 44117 markings/sec, 75 secs
lola: sara is running 80 secs || 3774656 markings, 18892134 edges, 43374 markings/sec, 80 secs
lola: sara is running 85 secs || 3989208 markings, 20026700 edges, 42910 markings/sec, 85 secs
lola: sara is running 90 secs || 4212891 markings, 21092329 edges, 44737 markings/sec, 90 secs
lola: sara is running 95 secs || 4435019 markings, 22175756 edges, 44426 markings/sec, 95 secs
lola: sara is running 100 secs || 4659493 markings, 23281330 edges, 44895 markings/sec, 100 secs
lola: sara is running 105 secs || 4878486 markings, 24389230 edges, 43799 markings/sec, 105 secs
lola: sara is running 110 secs || 5098879 markings, 25518073 edges, 44079 markings/sec, 110 secs
lola: sara is running 115 secs || 5317741 markings, 26678397 edges, 43772 markings/sec, 115 secs
lola: sara is running 120 secs || 5531528 markings, 27836552 edges, 42757 markings/sec, 120 secs
lola: sara is running 125 secs || 5746358 markings, 28934105 edges, 42966 markings/sec, 125 secs
lola: sara is running 130 secs || 5964537 markings, 30037751 edges, 43636 markings/sec, 130 secs
lola: sara is running 135 secs || 6179053 markings, 31178927 edges, 42903 markings/sec, 135 secs
lola: sara is running 140 secs || 6391746 markings, 32321943 edges, 42539 markings/sec, 140 secs
lola: sara is running 145 secs || 6607777 markings, 33401808 edges, 43206 markings/sec, 145 secs
lola: sara is running 150 secs || 6826380 markings, 34520871 edges, 43721 markings/sec, 150 secs
lola: sara is running 155 secs || 7040901 markings, 35659249 edges, 42904 markings/sec, 155 secs
lola: sara is running 160 secs || 7262411 markings, 36790423 edges, 44302 markings/sec, 160 secs
lola: sara is running 165 secs || 7479372 markings, 37951851 edges, 43392 markings/sec, 165 secs
lola: sara is running 170 secs || 7699493 markings, 39082704 edges, 44024 markings/sec, 170 secs
lola: sara is running 175 secs || 7915400 markings, 40201135 edges, 43181 markings/sec, 175 secs
lola: sara is running 180 secs || 8132398 markings, 41344087 edges, 43400 markings/sec, 180 secs
lola: sara is running 185 secs || 8350772 markings, 42428160 edges, 43675 markings/sec, 185 secs
lola: sara is running 190 secs || 8566275 markings, 43524467 edges, 43101 markings/sec, 190 secs
lola: sara is running 195 secs || 8781349 markings, 44618016 edges, 43015 markings/sec, 195 secs
lola: sara is running 200 secs || 8993120 markings, 45741602 edges, 42354 markings/sec, 200 secs
lola: sara is running 205 secs || 9203785 markings, 46860480 edges, 42133 markings/sec, 205 secs
lola: sara is running 210 secs || 9416075 markings, 48023496 edges, 42458 markings/sec, 210 secs
lola: sara is running 215 secs || 9637767 markings, 49096610 edges, 44338 markings/sec, 215 secs
lola: sara is running 220 secs || 9861223 markings, 50164428 edges, 44691 markings/sec, 220 secs
lola: sara is running 225 secs || 10081730 markings, 51265146 edges, 44101 markings/sec, 225 secs
lola: sara is running 230 secs || 10294313 markings, 52386345 edges, 42517 markings/sec, 230 secs
lola: sara is running 235 secs || 10512726 markings, 53538897 edges, 43683 markings/sec, 235 secs
lola: sara is running 240 secs || 10726018 markings, 54700831 edges, 42658 markings/sec, 240 secs
lola: sara is running 245 secs || 10942371 markings, 55811258 edges, 43271 markings/sec, 245 secs
lola: sara is running 250 secs || 11164820 markings, 56952148 edges, 44490 markings/sec, 250 secs
lola: sara is running 255 secs || 11380611 markings, 58090287 edges, 43158 markings/sec, 255 secs
lola: sara is running 260 secs || 11596609 markings, 59268291 edges, 43200 markings/sec, 260 secs
lola: sara is running 265 secs || 11809646 markings, 60421131 edges, 42607 markings/sec, 265 secs
lola: sara is running 270 secs || 12022271 markings, 61515261 edges, 42525 markings/sec, 270 secs
lola: sara is running 275 secs || 12236592 markings, 62607392 edges, 42864 markings/sec, 275 secs
lola: sara is running 280 secs || 12450319 markings, 63760149 edges, 42745 markings/sec, 280 secs
lola: sara is running 285 secs || 12666633 markings, 64943730 edges, 43263 markings/sec, 285 secs
lola: sara is running 290 secs || 12875046 markings, 66125919 edges, 41683 markings/sec, 290 secs
lola: sara is running 295 secs || 13091727 markings, 67184126 edges, 43336 markings/sec, 295 secs
lola: sara is running 300 secs || 13304426 markings, 68334936 edges, 42540 markings/sec, 300 secs
lola: sara is running 305 secs || 13517430 markings, 69419204 edges, 42601 markings/sec, 305 secs
lola: sara is running 310 secs || 13731611 markings, 70544135 edges, 42836 markings/sec, 310 secs
lola: sara is running 315 secs || 13952674 markings, 71680983 edges, 44213 markings/sec, 315 secs
lola: sara is running 320 secs || 14166495 markings, 72845181 edges, 42764 markings/sec, 320 secs
lola: sara is running 325 secs || 14387606 markings, 73973663 edges, 44222 markings/sec, 325 secs
lola: sara is running 330 secs || 14605143 markings, 75032207 edges, 43507 markings/sec, 330 secs
lola: sara is running 335 secs || 14818454 markings, 76145155 edges, 42662 markings/sec, 335 secs
lola: sara is running 340 secs || 15033210 markings, 77189733 edges, 42951 markings/sec, 340 secs
lola: sara is running 345 secs || 15240930 markings, 78361173 edges, 41544 markings/sec, 345 secs
lola: sara is running 350 secs || 15450908 markings, 79472320 edges, 41996 markings/sec, 350 secs
lola: sara is running 355 secs || 15665263 markings, 80581573 edges, 42871 markings/sec, 355 secs
lola: sara is running 360 secs || 15881892 markings, 81644915 edges, 43326 markings/sec, 360 secs
lola: sara is running 365 secs || 16097165 markings, 82809704 edges, 43055 markings/sec, 365 secs
lola: sara is running 370 secs || 16304734 markings, 83976416 edges, 41514 markings/sec, 370 secs
lola: sara is running 375 secs || 16505316 markings, 85103644 edges, 40116 markings/sec, 375 secs
lola: sara is running 380 secs || 16716436 markings, 86225196 edges, 42224 markings/sec, 380 secs
lola: sara is running 385 secs || 16929750 markings, 87285865 edges, 42663 markings/sec, 385 secs
lola: sara is running 390 secs || 17136643 markings, 88375036 edges, 41379 markings/sec, 390 secs
lola: sara is running 395 secs || 17351343 markings, 89465472 edges, 42940 markings/sec, 395 secs
lola: sara is running 400 secs || 17564016 markings, 90565277 edges, 42535 markings/sec, 400 secs
lola: sara is running 405 secs || 17767157 markings, 91616311 edges, 40628 markings/sec, 405 secs
lola: sara is running 410 secs || 17979339 markings, 92746634 edges, 42436 markings/sec, 410 secs
lola: sara is running 415 secs || 18195352 markings, 93827874 edges, 43203 markings/sec, 415 secs
lola: sara is running 420 secs || 18406440 markings, 94917304 edges, 42218 markings/sec, 420 secs
lola: sara is running 425 secs || 18625722 markings, 95978213 edges, 43856 markings/sec, 425 secs
lola: sara is running 430 secs || 18840753 markings, 97139227 edges, 43006 markings/sec, 430 secs
lola: sara is running 435 secs || 19058355 markings, 98223998 edges, 43520 markings/sec, 435 secs
lola: sara is running 440 secs || 19276751 markings, 99275863 edges, 43679 markings/sec, 440 secs
lola: sara is running 445 secs || 19495547 markings, 100388204 edges, 43759 markings/sec, 445 secs
lola: sara is running 450 secs || 19710193 markings, 101547660 edges, 42929 markings/sec, 450 secs
lola: sara is running 455 secs || 19919687 markings, 102652031 edges, 41899 markings/sec, 455 secs
lola: sara is running 460 secs || 20133035 markings, 103727302 edges, 42670 markings/sec, 460 secs
lola: sara is running 465 secs || 20351307 markings, 104740111 edges, 43654 markings/sec, 465 secs
lola: sara is running 470 secs || 20565927 markings, 105811979 edges, 42924 markings/sec, 470 secs
lola: sara is running 475 secs || 20777854 markings, 106929009 edges, 42385 markings/sec, 475 secs
lola: sara is running 480 secs || 20993300 markings, 108122341 edges, 43089 markings/sec, 480 secs
lola: sara is running 485 secs || 21212720 markings, 109196061 edges, 43884 markings/sec, 485 secs
lola: sara is running 490 secs || 21433565 markings, 110293802 edges, 44169 markings/sec, 490 secs
lola: sara is running 495 secs || 21652027 markings, 111387463 edges, 43692 markings/sec, 495 secs
lola: sara is running 500 secs || 21853613 markings, 112531351 edges, 40317 markings/sec, 500 secs
lola: sara is running 505 secs || 22066543 markings, 113630887 edges, 42586 markings/sec, 505 secs
lola: sara is running 510 secs || 22274785 markings, 114796810 edges, 41648 markings/sec, 510 secs
lola: sara is running 515 secs || 22486920 markings, 115929336 edges, 42427 markings/sec, 515 secs
lola: sara is running 520 secs || 22702201 markings, 117004482 edges, 43056 markings/sec, 520 secs
lola: sara is running 525 secs || 22915910 markings, 118114805 edges, 42742 markings/sec, 525 secs
lola: sara is running 530 secs || 23129953 markings, 119220931 edges, 42809 markings/sec, 530 secs
lola: sara is running 535 secs || 23340602 markings, 120361343 edges, 42130 markings/sec, 535 secs
lola: sara is running 540 secs || 23557287 markings, 121563155 edges, 43337 markings/sec, 540 secs
lola: sara is running 545 secs || 23772639 markings, 122683525 edges, 43070 markings/sec, 545 secs
lola: sara is running 550 secs || 23985391 markings, 123836029 edges, 42550 markings/sec, 550 secs
lola: sara is running 555 secs || 24194358 markings, 125036159 edges, 41793 markings/sec, 555 secs
lola: sara is running 560 secs || 24406324 markings, 126267511 edges, 42393 markings/sec, 560 secs
lola: sara is running 565 secs || 24441679 markings, 126440713 edges, 7071 markings/sec, 565 secs
lola: sara is running 570 secs || 24442812 markings, 126446848 edges, 227 markings/sec, 570 secs
lola: sara is running 575 secs || 24449432 markings, 126481050 edges, 1324 markings/sec, 575 secs
lola: sara is running 580 secs || 24452380 markings, 126497217 edges, 590 markings/sec, 580 secs
lola: sara is running 585 secs || 24458536 markings, 126530695 edges, 1231 markings/sec, 585 secs
lola: sara is running 590 secs || 24461228 markings, 126542867 edges, 538 markings/sec, 590 secs
lola: sara is running 595 secs || 24461288 markings, 126543129 edges, 12 markings/sec, 595 secs
lola: sara is running 600 secs || 24461342 markings, 126543348 edges, 11 markings/sec, 600 secs
lola: sara is running 605 secs || 24466858 markings, 126572114 edges, 1103 markings/sec, 605 secs
lola: sara is running 610 secs || 24473775 markings, 126609896 edges, 1383 markings/sec, 610 secs
lola: sara is running 615 secs || 24475434 markings, 126621209 edges, 332 markings/sec, 615 secs
lola: sara is running 620 secs || 24475639 markings, 126622770 edges, 41 markings/sec, 620 secs
lola: sara is running 625 secs || 24475673 markings, 126623006 edges, 7 markings/sec, 625 secs
lola: sara is running 630 secs || 24478278 markings, 126639062 edges, 521 markings/sec, 630 secs
lola: sara is running 635 secs || 24485258 markings, 126676544 edges, 1396 markings/sec, 635 secs
lola: sara is running 640 secs || 24489057 markings, 126700802 edges, 760 markings/sec, 640 secs
lola: sara is running 645 secs || 24489705 markings, 126705280 edges, 130 markings/sec, 645 secs
lola: sara is running 650 secs || 24490344 markings, 126708319 edges, 128 markings/sec, 650 secs
lola: sara is running 655 secs || 24491355 markings, 126714211 edges, 202 markings/sec, 655 secs
lola: sara is running 660 secs || 24494191 markings, 126730341 edges, 567 markings/sec, 660 secs
lola: sara is running 665 secs || 24495800 markings, 126739058 edges, 322 markings/sec, 665 secs
lola: sara is running 670 secs || 24496971 markings, 126746557 edges, 234 markings/sec, 670 secs
lola: sara is running 675 secs || 24500559 markings, 126768339 edges, 718 markings/sec, 675 secs
lola: sara is running 680 secs || 24509077 markings, 126815939 edges, 1704 markings/sec, 680 secs
lola: sara is running 685 secs || 24517074 markings, 126858937 edges, 1599 markings/sec, 685 secs
lola: sara is running 690 secs || 24715394 markings, 127926898 edges, 39664 markings/sec, 690 secs
lola: sara is running 695 secs || 24924433 markings, 129050689 edges, 41808 markings/sec, 695 secs
lola: sara is running 700 secs || 25132788 markings, 130144398 edges, 41671 markings/sec, 700 secs
lola: sara is running 705 secs || 25340147 markings, 131288685 edges, 41472 markings/sec, 705 secs
lola: sara is running 710 secs || 25555852 markings, 132356039 edges, 43141 markings/sec, 710 secs
lola: sara is running 715 secs || 25765160 markings, 133501583 edges, 41862 markings/sec, 715 secs
lola: sara is running 720 secs || 25980260 markings, 134609815 edges, 43020 markings/sec, 720 secs
lola: sara is running 725 secs || 26194275 markings, 135768496 edges, 42803 markings/sec, 725 secs
lola: sara is running 730 secs || 26411419 markings, 136915658 edges, 43429 markings/sec, 730 secs
lola: sara is running 735 secs || 26620784 markings, 138061825 edges, 41873 markings/sec, 735 secs
lola: sara is running 740 secs || 26836074 markings, 139200507 edges, 43058 markings/sec, 740 secs
lola: sara is running 745 secs || 27049410 markings, 140322765 edges, 42667 markings/sec, 745 secs
lola: sara is running 750 secs || 27259961 markings, 141409062 edges, 42110 markings/sec, 750 secs
lola: sara is running 755 secs || 27470833 markings, 142530549 edges, 42174 markings/sec, 755 secs
lola: sara is running 760 secs || 27679030 markings, 143646681 edges, 41639 markings/sec, 760 secs
lola: sara is running 765 secs || 27888080 markings, 144778308 edges, 41810 markings/sec, 765 secs
lola: sara is running 770 secs || 28095901 markings, 145897618 edges, 41564 markings/sec, 770 secs
lola: sara is running 775 secs || 28311188 markings, 147058985 edges, 43057 markings/sec, 775 secs
lola: sara is running 780 secs || 28531127 markings, 148052576 edges, 43988 markings/sec, 780 secs
lola: sara is running 785 secs || 28747747 markings, 149145011 edges, 43324 markings/sec, 785 secs
lola: sara is running 790 secs || 28963495 markings, 150345539 edges, 43150 markings/sec, 790 secs
lola: sara is running 795 secs || 29180474 markings, 151452919 edges, 43396 markings/sec, 795 secs
lola: sara is running 800 secs || 29391485 markings, 152556569 edges, 42202 markings/sec, 800 secs
lola: sara is running 805 secs || 29598192 markings, 153709024 edges, 41341 markings/sec, 805 secs
lola: sara is running 810 secs || 29809114 markings, 154823748 edges, 42184 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 821 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 28 bytes per marking, with 10 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: state equation: write sara problem file to LamportFastMutEx-COL-8-ReachabilityCardinality-13.sara
lola: ========================================
lola: subprocess 14 will run for 1231 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: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 10 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-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 2463 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 28 bytes per marking, with 10 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: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: RESULT
lola:
SUMMARY: yes yes unknown no no no yes no yes yes yes yes unknown no no no
lola: ========================================
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 1494630162005

--------------------
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="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/LamportFastMutEx-PT-8.tgz
mv 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 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 r038-blw7-149440484700196"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;