fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r108-blw3-149441612500502
Last Updated
June 27, 2017

About the Execution of LoLA for S_GlobalResAllocation-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
997.860 564605.00 1123495.00 328.40 FTFFTTTT??FFFFFF 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_GlobalResAllocation-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r108-blw3-149441612500502
=====================================================================


--------------------
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 GlobalResAllocation-COL-05-ReachabilityCardinality-0
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-1
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-10
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-11
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-12
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-13
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-14
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-15
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-2
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-3
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-4
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-5
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-6
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-7
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-8
FORMULA_NAME GlobalResAllocation-COL-05-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1496392969272


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


checking for too many tokens
===========================================================================================
S_GlobalResAllocation-PT-05: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_GlobalResAllocation-PT-05 @ 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: 56180/65536 symbol table entries, 36519 collisions
lola: preprocessing...
lola: finding significant places
lola: 75 places, 56105 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2220 transition conflict sets
lola: TASK
lola: reading formula from GlobalResAllocation-COL-05-ReachabilityCardinality.task
lola: A (G (((in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9 + 1 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10) OR (pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 <= 1) OR (in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9 + 1 <= pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1)))) : E (F (((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 <= 2) AND (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 2) AND ((2 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10)) AND ((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (2 <= pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1))))) : A (G (((2 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10)))) : A (G (((in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9 + 1 <= pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1) OR (Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5 <= 2) OR (Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5 <= in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9) OR (1 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)))) : A (G (((in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9 <= 2) OR ((2 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5) AND (3 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10) AND (Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10))))) : A (G (((pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 + 1 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10) OR (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 0) OR (3 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)))) : A (G ((((2 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) AND (1 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)) OR ((3 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) AND (2 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)) OR (2 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5) OR (Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5 <= in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9) OR (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 2)))) : A (G ((1 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5))) : A (G (((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 <= 2) OR (pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 <= 2) OR (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 0)))) : A (G ((2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10))) : A (G ((2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10))) : E (F (())) : E (F (((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 + 1 <= in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9) AND (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) AND ((pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 + 1 <= in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical_s_2_8 + in_critical_s_2_7 + in_critical_s_3_10 + in_critical_s_2_10 + in_critical_s_2_6 + in_critical_s_2_5 + in_critical_s_1_1 + in_critical_s_1_2 + in_critical_s_1_3 + in_critical_s_1_4 + in_critical_s_1_5 + in_critical_s_1_6 + in_critical_s_1_7 + in_critical_s_1_8 + in_critical_s_2_4 + in_critical_s_2_3 + in_critical_s_2_2 + in_critical_s_2_1 + in_critical_s_1_9 + in_critical_s_1_10 + in_critical_s_4_10 + in_critical_s_2_9 + in_critical_s_3_1 + in_critical_s_3_2 + in_critical_s_3_3 + in_critical_s_3_4 + in_critical_s_3_5 + in_critical_s_3_6 + in_critical_s_3_7 + in_critical_s_3_8 + in_critical_s_3_9) OR ((3 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) AND (Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5 <= pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1)))))) : A (G (TRUE)) : E (F (((Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 2) AND ((1 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (3 <= pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1)) AND (3 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5)))) : A (G (()))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical... (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 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 <= 2) AND (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 2) AND ((2 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Reso... (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 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10))))
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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 20 markings, 19 edges, 4 markings/sec, 0 secs
lola: sara is running 5 secs || 117 markings, 176 edges, 19 markings/sec, 5 secs
lola: sara is running 10 secs || 535 markings, 707 edges, 84 markings/sec, 10 secs
lola: sara is running 15 secs || 1036 markings, 1347 edges, 100 markings/sec, 15 secs
lola: sara is running 20 secs || 1501 markings, 1961 edges, 93 markings/sec, 20 secs
lola: sara is running 25 secs || 1980 markings, 2576 edges, 96 markings/sec, 25 secs
lola: sara is running 30 secs || 2486 markings, 3237 edges, 101 markings/sec, 30 secs
lola: sara is running 35 secs || 2965 markings, 3852 edges, 96 markings/sec, 35 secs
lola: sara is running 40 secs || 3441 markings, 4463 edges, 95 markings/sec, 40 secs
lola: sara is running 45 secs || 3969 markings, 5124 edges, 106 markings/sec, 45 secs
lola: sara is running 50 secs || 4414 markings, 5685 edges, 89 markings/sec, 50 secs
lola: sara is running 55 secs || 4857 markings, 6245 edges, 89 markings/sec, 55 secs
lola: sara is running 60 secs || 5323 markings, 6826 edges, 93 markings/sec, 60 secs
lola: sara is running 65 secs || 5777 markings, 7394 edges, 91 markings/sec, 65 secs
lola: sara is running 70 secs || 6264 markings, 8000 edges, 97 markings/sec, 70 secs
lola: sara is running 75 secs || 6706 markings, 8541 edges, 88 markings/sec, 75 secs
lola: sara is running 80 secs || 7174 markings, 9129 edges, 94 markings/sec, 80 secs
lola: sara is running 85 secs || 7652 markings, 9732 edges, 96 markings/sec, 85 secs
lola: sara is running 90 secs || 8105 markings, 10293 edges, 91 markings/sec, 90 secs
lola: sara is running 95 secs || 8610 markings, 10927 edges, 101 markings/sec, 95 secs
lola: sara is running 100 secs || 9082 markings, 11525 edges, 94 markings/sec, 100 secs
lola: sara is running 105 secs || 9573 markings, 12182 edges, 98 markings/sec, 105 secs
lola: sara is running 110 secs || 10065 markings, 12794 edges, 98 markings/sec, 110 secs
lola: sara is running 115 secs || 10523 markings, 13394 edges, 92 markings/sec, 115 secs
lola: sara is running 120 secs || 10980 markings, 13976 edges, 91 markings/sec, 120 secs
lola: sara is running 125 secs || 11448 markings, 14566 edges, 94 markings/sec, 125 secs
lola: sara is running 130 secs || 11967 markings, 15201 edges, 104 markings/sec, 130 secs
lola: sara is running 135 secs || 12477 markings, 15882 edges, 102 markings/sec, 135 secs
lola: sara is running 140 secs || 12944 markings, 16489 edges, 93 markings/sec, 140 secs
lola: sara is running 145 secs || 13436 markings, 17092 edges, 98 markings/sec, 145 secs
lola: sara is running 150 secs || 13927 markings, 17730 edges, 98 markings/sec, 150 secs
lola: sara is running 155 secs || 14427 markings, 18390 edges, 100 markings/sec, 155 secs
lola: sara is running 160 secs || 14920 markings, 19017 edges, 99 markings/sec, 160 secs
lola: sara is running 165 secs || 15386 markings, 19620 edges, 93 markings/sec, 165 secs
lola: sara is running 170 secs || 15865 markings, 20206 edges, 96 markings/sec, 170 secs
lola: sara is running 175 secs || 16283 markings, 20710 edges, 84 markings/sec, 175 secs
lola: sara is running 180 secs || 16745 markings, 21335 edges, 92 markings/sec, 180 secs
lola: sara is running 185 secs || 17288 markings, 22088 edges, 109 markings/sec, 185 secs
lola: sara is running 190 secs || 17748 markings, 22636 edges, 92 markings/sec, 190 secs
lola: sara is running 195 secs || 18275 markings, 23312 edges, 105 markings/sec, 195 secs
lola: sara is running 200 secs || 18739 markings, 23914 edges, 93 markings/sec, 200 secs
lola: sara is running 205 secs || 19229 markings, 24541 edges, 98 markings/sec, 205 secs
lola: sara is running 210 secs || 19736 markings, 25206 edges, 101 markings/sec, 210 secs
lola: sara is running 215 secs || 20239 markings, 25878 edges, 101 markings/sec, 215 secs
lola: sara is running 220 secs || 20728 markings, 26507 edges, 98 markings/sec, 220 secs
lola: sara is running 225 secs || 21216 markings, 27119 edges, 98 markings/sec, 225 secs
lola: sara is running 230 secs || 21704 markings, 27732 edges, 98 markings/sec, 230 secs
lola: sara is running 235 secs || 22212 markings, 28401 edges, 102 markings/sec, 235 secs
lola: sara is running 240 secs || 22693 markings, 29015 edges, 96 markings/sec, 240 secs
lola: sara is running 245 secs || 23156 markings, 29631 edges, 93 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 (((in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical... (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 220 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 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 513 markings, 659 edges, 103 markings/sec, 0 secs
lola: sara is running 5 secs || 1279 markings, 1715 edges, 153 markings/sec, 5 secs
lola: sara is running 10 secs || 2006 markings, 2764 edges, 145 markings/sec, 10 secs
lola: sara is running 15 secs || 2790 markings, 3891 edges, 157 markings/sec, 15 secs
lola: sara is running 20 secs || 3539 markings, 4984 edges, 150 markings/sec, 20 secs
lola: sara is running 25 secs || 4297 markings, 6066 edges, 152 markings/sec, 25 secs
lola: sara is running 30 secs || 5018 markings, 7076 edges, 144 markings/sec, 30 secs
lola: sara is running 35 secs || 5718 markings, 8058 edges, 140 markings/sec, 35 secs
lola: sara is running 40 secs || 6437 markings, 9111 edges, 144 markings/sec, 40 secs
lola: sara is running 45 secs || 7220 markings, 10217 edges, 157 markings/sec, 45 secs
lola: sara is running 50 secs || 7992 markings, 11282 edges, 154 markings/sec, 50 secs
lola: sara is running 55 secs || 8842 markings, 12486 edges, 170 markings/sec, 55 secs
lola: sara is running 60 secs || 9612 markings, 13564 edges, 154 markings/sec, 60 secs
lola: sara is running 65 secs || 10404 markings, 14680 edges, 158 markings/sec, 65 secs
lola: sara is running 70 secs || 11190 markings, 15814 edges, 157 markings/sec, 70 secs
lola: sara is running 75 secs || 12048 markings, 16992 edges, 172 markings/sec, 75 secs
lola: sara is running 80 secs || 12890 markings, 18207 edges, 168 markings/sec, 80 secs
lola: sara is running 85 secs || 13651 markings, 19304 edges, 152 markings/sec, 85 secs
lola: sara is running 90 secs || 14438 markings, 20466 edges, 157 markings/sec, 90 secs
lola: sara is running 95 secs || 15128 markings, 21457 edges, 138 markings/sec, 95 secs
lola: sara is running 100 secs || 15852 markings, 22589 edges, 145 markings/sec, 100 secs
lola: sara is running 105 secs || 16604 markings, 23646 edges, 150 markings/sec, 105 secs
lola: sara is running 110 secs || 17318 markings, 24653 edges, 143 markings/sec, 110 secs
lola: sara is running 115 secs || 18114 markings, 25786 edges, 159 markings/sec, 115 secs
lola: sara is running 120 secs || 18828 markings, 26817 edges, 143 markings/sec, 120 secs
lola: sara is running 125 secs || 19513 markings, 27824 edges, 137 markings/sec, 125 secs
lola: sara is running 130 secs || 20175 markings, 28798 edges, 132 markings/sec, 130 secs
lola: sara is running 135 secs || 20906 markings, 29834 edges, 146 markings/sec, 135 secs
lola: sara is running 140 secs || 21582 markings, 30800 edges, 135 markings/sec, 140 secs
lola: sara is running 145 secs || 22305 markings, 31901 edges, 145 markings/sec, 145 secs
lola: sara is running 150 secs || 23066 markings, 32989 edges, 152 markings/sec, 150 secs
lola: sara is running 155 secs || 23797 markings, 34058 edges, 146 markings/sec, 155 secs
lola: sara is running 160 secs || 24537 markings, 35133 edges, 148 markings/sec, 160 secs
lola: sara is running 165 secs || 25232 markings, 36180 edges, 139 markings/sec, 165 secs
lola: sara is running 170 secs || 26025 markings, 37311 edges, 159 markings/sec, 170 secs
lola: sara is running 175 secs || 26876 markings, 38508 edges, 170 markings/sec, 175 secs
lola: sara is running 180 secs || 27690 markings, 39621 edges, 163 markings/sec, 180 secs
lola: sara is running 185 secs || 28487 markings, 40757 edges, 159 markings/sec, 185 secs
lola: sara is running 190 secs || 29188 markings, 41748 edges, 140 markings/sec, 190 secs
lola: sara is running 195 secs || 30002 markings, 42922 edges, 163 markings/sec, 195 secs
lola: sara is running 200 secs || 30662 markings, 43858 edges, 132 markings/sec, 200 secs
lola: sara is running 205 secs || 31376 markings, 44903 edges, 143 markings/sec, 205 secs
lola: sara is running 210 secs || 32095 markings, 45936 edges, 144 markings/sec, 210 secs
lola: sara is running 215 secs || 32764 markings, 46908 edges, 134 markings/sec, 215 secs
lola: sara is running 220 secs || 33526 markings, 47993 edges, 152 markings/sec, 220 secs
lola: sara is running 225 secs || 34265 markings, 49065 edges, 148 markings/sec, 225 secs
lola: sara is running 230 secs || 35061 markings, 50230 edges, 159 markings/sec, 230 secs
lola: sara is running 235 secs || 35914 markings, 51484 edges, 171 markings/sec, 235 secs
lola: sara is running 240 secs || 36696 markings, 52590 edges, 156 markings/sec, 240 secs
lola: sara is running 245 secs || 37426 markings, 53636 edges, 146 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_critical_s_5_7 + in_critical_s_5_8 + in_critical_s_5_9 + in_critical_s_5_10 + in_critical... (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 220 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 3 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 + 1 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10) OR (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 0) OR (3 <= Processes_1 + Processes_2 + Processes... (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 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-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 302 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) AND (1 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)) OR ((3 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) AND (2 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)) OR (2 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5) OR (Processes_1 + Processes_2 + Proce... (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 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 26 markings, 27 edges, 5 markings/sec, 0 secs
lola: sara is running 5 secs || 94 markings, 119 edges, 14 markings/sec, 5 secs
lola: sara is running 10 secs || 182 markings, 241 edges, 18 markings/sec, 10 secs
lola: sara is running 15 secs || 262 markings, 355 edges, 16 markings/sec, 15 secs
lola: sara is running 20 secs || 343 markings, 462 edges, 16 markings/sec, 20 secs
lola: sara is running 25 secs || 417 markings, 567 edges, 15 markings/sec, 25 secs
lola: sara is running 30 secs || 491 markings, 675 edges, 15 markings/sec, 30 secs
lola: sara is running 35 secs || 591 markings, 828 edges, 20 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Processes_1 + Processes_2 + Processes_3 + Processes_4 + Processes_5)))
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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 372 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 <= 2) OR (pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5 <= 2) OR (Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 0))))
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 220 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10)))
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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10)))
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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 595 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-05-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 744 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1 + 1 <= in_critical_s_4_1 + in_critical_s_4_2 + in_critical_s_4_3 + in_critical_s_4_4 + in_critical_s_4_5 + in_critical_s_4_6 + in_critical_s_4_7 + in_critical_s_4_8 + in_critical_s_4_9 + in_critical_s_5_1 + in_critical_s_5_2 + in_critical_s_5_3 + in_critical_s_5_4 + in_critical_s_5_5 + in_critical_s_5_6 + in_crit... (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 220 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 2 conjunctive subformulas
lola: state equation: write sara problem file to GlobalResAllocation-COL-05-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 992 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 75 places; total mentions: 0
lola: closed formula file GlobalResAllocation-COL-05-ReachabilityCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1488 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Resources_1 + Resources_2 + Resources_3 + Resources_4 + Resources_5 + Resources_6 + Resources_7 + Resources_8 + Resources_9 + Resources_10 <= 2) AND ((1 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5) OR (3 <= pr_released_4 + pr_released_5 + pr_released_3 + pr_released_2 + pr_released_1)) AND (3 <= pr_in_1 + pr_in_2 + pr_in_3 + pr_in_4 + pr_in_5))))
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 220 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 GlobalResAllocation-COL-05-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file GlobalResAllocation-COL-05-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 2976 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
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 220 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: State predicate is contradiction.
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: RESULT
lola:
SUMMARY: no yes unknown unknown no no no no no no no no yes yes yes yes
lola: ========================================
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA GlobalResAllocation-COL-05-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496393533877

--------------------
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_GlobalResAllocation-PT-05"
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_GlobalResAllocation-PT-05.tgz
mv S_GlobalResAllocation-PT-05 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_GlobalResAllocation-PT-05, 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 r108-blw3-149441612500502"
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 ;