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-2979
Executing tool lola
Input is PolyORBNT-PT-S05J40, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369089200934
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463742491332

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PolyORBNT-PT-S05J40
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-5 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-7 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-8 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-14 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S05J40-ReachabilityCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 2219/65536 symbol table entries, 162 collisions
lola: preprocessing...
lola: finding significant places
lola: 629 places, 1590 transitions, 527 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1168 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S05J40-ReachabilityCardinality.task
lola: read: AG ((!(!(1 <= f3_2 + f3_20 + f3_8 + f3_28 + f3_21 + f3_36 + f3_1 + f3_15 + f3_22 + f3_37 + f3_9 + f3_27 + f3_0 + f3_14 + f3_23 + f3_34 + f3_26 + f3_6 + f3_16 + f3_7 + f3_35 + f3_25 + f3_4 + f3_39 + f3_11 + f3_31 + f3_5 + f3_17 + f3_24 + f3_38 + f3_33 + f3_10 + f3_32 + f3_18 + f3_13 + f3_30 + f3_19 + f3_29 + f3_12 + f3_3 + f3_40)) OR (3 <= AvailableJobId_14 + AvailableJobId_5 + AvailableJobId_24 + ... (shortened)
lola: formula length: 20166
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-f3_9 + -f3_8 + -f3_7 + -f3_6 + -f3_5 + -f3_4 + -f3_3 + -f3_2 + -f3_1 + -f3_0 + -f3_40 + -f3_39 + -f3_38 + -f3_37 + -f3_36 + -f3_35 + -f3_34 + -f3_33 + -f3_32 + -f3_31 + -f3_30 + -f3_29 + -f3_28 + -f3_27 + -f3_26 + -f3_25 + -f3_24 + -f3_23 + -f3_22 + -f3_21 + -f3_20 + -f3_19 + -f3_18 + -f3_17 + -f3_16 + -f3_15 + -f3_14 + -f3_13 + -f3_12 + -f3_11 + -f3_10 <= -1 OR (-AvailableJobId_16 + -Availa... (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 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-place_522_1 <= -1 AND ((-DataOnSrc_5 + -DataOnSrc_4 + -DataOnSrc_3 + -DataOnSrc_2 + -DataOnSrc_1 + block <= 0 AND -place_460 <= -1) OR -place_523_1 + NotifyEventJobQueuedE_1 <= 0)))
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 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 5 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PolyORBNT-COL-S05J40-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PolyORBNT-COL-S05J40-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-Schedule_Task_E_1_PerformWork_9 + -Schedule_Task_E_1_PerformWork_8 + -Schedule_Task_E_1_PerformWork_7 + -Schedule_Task_E_1_PerformWork_6 + -Schedule_Task_E_1_PerformWork_5 + -Schedule_Task_E_1_PerformWork_4 + -Schedule_Task_E_1_PerformWork_3 + -Schedule_Task_E_1_PerformWork_2 + -Schedule_Task_E_1_PerformWork_1 + -Schedule_Task_E_1_PerformWork_0 + -Schedule_Task_E_1_CheckSource_0 + -Schedule... (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 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 8 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Perform_Work_E_1 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((mo2 + -ModifiedSrc_5 + -ModifiedSrc_3 + -ModifiedSrc_2 + -ModifiedSrc_1 + -ModifiedSrc_4 <= 0 OR (-cSources <= -2 OR (-Perform_Work_B_1_40 + -Perform_Work_B_1_39 + -Perform_Work_B_1_38 + -Perform_Work_B_1_37 + -Perform_Work_B_1_36 + -Perform_Work_B_1_35 + -Perform_Work_B_1_34 + -Perform_Work_B_1_33 + -Perform_Work_B_1_32 + -Perform_Work_B_1_31 + -Perform_Work_B_1_30 + -Perform_Work_B_1_29 + -... (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 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 12 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-place_520_1 <= -3)
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 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-CreatedJobs_15_5 + -CreatedJobs_15_4 + -CreatedJobs_15_3 + -CreatedJobs_15_2 + -CreatedJobs_15_1 + -CreatedJobs_35_5 + -CreatedJobs_22_5 + -CreatedJobs_36_5 + -CreatedJobs_23_5 + -CreatedJobs_10_5 + -CreatedJobs_37_5 + -CreatedJobs_24_5 + -CreatedJobs_11_5 + -CreatedJobs_28_5 + -CreatedJobs_14_5 + -CreatedJobs_38_5 + -CreatedJobs_27_5 + -CreatedJobs_25_5 + -CreatedJobs_12_5 + -CreatedJobs_39... (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 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 7 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file PolyORBNT-COL-S05J40-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 344 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-place_522_1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 413 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-DataOnSrc_5 + -DataOnSrc_4 + -DataOnSrc_3 + -DataOnSrc_2 + -DataOnSrc_1 + QueueJobE_1 > 0)
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 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 516 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Try_Check_Sources_E_1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality-12.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Schedule_Task_E_1_PerformWork_9 + -Schedule_Task_E_1_PerformWork_8 + -Schedule_Task_E_1_PerformWork_7 + -Schedule_Task_E_1_PerformWork_6 + -Schedule_Task_E_1_PerformWork_5 + -Schedule_Task_E_1_PerformWork_4 + -Schedule_Task_E_1_PerformWork_3 + -Schedule_Task_E_1_PerformWork_2 + -Schedule_Task_E_1_PerformWork_1 + -Schedule_Task_E_1_PerformWork_0 + -Schedule_Task_E_1_CheckSource_0 + -Schedule_T... (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 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-FetchJobB_1 > -3 OR (-Schedule_Task_E_1_PerformWork_9 + -Schedule_Task_E_1_PerformWork_8 + -Schedule_Task_E_1_PerformWork_7 + -Schedule_Task_E_1_PerformWork_6 + -Schedule_Task_E_1_PerformWork_5 + -Schedule_Task_E_1_PerformWork_4 + -Schedule_Task_E_1_PerformWork_3 + -Schedule_Task_E_1_PerformWork_2 + -Schedule_Task_E_1_PerformWork_1 + -Schedule_Task_E_1_PerformWork_0 + -Schedule_Task_E_1_Chec... (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 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 9 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 688 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-NotifyEventJobQueuedB_1_9 + -NotifyEventJobQueuedB_1_8 + -NotifyEventJobQueuedB_1_7 + -NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_1_40 + -NotifyEventJobQueuedB_1_10 + -NotifyEventJobQueuedB_1_11 + -NotifyEventJob... (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 2108 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to PolyORBNT-COL-S05J40-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S05J40-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola: summary: no yes yes yes unknown unknown unknown unknown unknown no yes yes yes unknown unknown no

BK_STOP 1463745350809

--------------------
content from 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="PolyORBNT-PT-S05J40"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/PolyORBNT-PT-S05J40.tgz
mv PolyORBNT-PT-S05J40 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is PolyORBNT-PT-S05J40, 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 r086kn-ebro-146369089200934"
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 ;