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 S_PolyORBNT-PT-S10J60, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170kn-ebro-146433135501528
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464532222883

bkconf 3600
===========================================================================================
===========================================================================================
S_PolyORBNT-PT-S10J60: translating formula ReachabilityCardinality into LoLA format
S_PolyORBNT-PT-S10J60: translating Petri net model.pnml into LoLA format
===========================================================================================
===========================================================================================
/home/mcc/BenchKit/bin/formula2lola.py ReachabilityCardinality.xml
/home/mcc/BenchKit/bin/pnml2lola.py model.pnml > model.pnml.lola
touch formulae;


in benchkit_head lolaszeit 3214
ReachabilityCardinality @ S_PolyORBNT-PT-S10J60
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-0 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-1 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-2 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-5 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-8 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-10 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-13 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-14 CANNOT_COMPUTE
FORMULA PolyORBNT-COL-S10J60-ReachabilityCardinality-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
lola: LoLA will run for 3214 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 14154/65536 symbol table entries, 4750 collisions
lola: preprocessing...
lola: finding significant places
lola: 1234 places, 12920 transitions, 1082 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3498 transition conflict sets
lola: TASK
lola: reading formula from PolyORBNT-COL-S10J60-ReachabilityCardinality.task
lola: read: EF ((!((NotifyEventEndOfCheckSourcesE_1 <= Try_Check_Sources_B_1 AND 1 <= place_787_1)) AND 2 <= Check_Sources_B_1)) : EF (!(mo3 <= Check_Sources_B_1)) : EF (3 <= NotifyEventEndOfCheckSourcesE_1) : AG (mi1 <= mo1) : AG (2 <= TheSour_4 + TheSour_3 + TheSour_10 + TheSour_1 + TheSour_9 + TheSour_2 + TheSour_8 + TheSour_7 + TheSour_6 + TheSour_5) : AG (!((1 <= place_521_1 AND !(place_462 <= NotifyEven... (shortened)
lola: formula length: 10513
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 200 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((NotifyEventEndOfCheckSourcesE_1 + -Try_Check_Sources_B_1 > 0 OR -place_787_1 > -1) AND -Check_Sources_B_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 4328 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-S10J60-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityCardinality.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 1 will run for 200 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (mo3 + -Check_Sources_B_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 4328 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-S10J60-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityCardinality.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 2 will run for 200 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-NotifyEventEndOfCheckSourcesE_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 4328 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-S10J60-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityCardinality-2.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 3 will run for 201 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-mo1 + mi1 <= 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 4328 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-S10J60-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityCardinality-3.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 4 will run for 201 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-TheSour_10 + -TheSour_9 + -TheSour_8 + -TheSour_7 + -TheSour_6 + -TheSour_5 + -TheSour_4 + -TheSour_3 + -TheSour_2 + -TheSour_1 <= -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 4328 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-S10J60-ReachabilityCardinality-4.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-place_521_1 > -1 OR place_462 + -NotifyEventJobQueuedE_1 <= 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 4328 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 2 literals
lola: write sara problem file to PolyORBNT-COL-S10J60-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-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 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-JobCnt <= -1 OR -NotifyEventJobQueuedE_1 > -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 4328 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 2 literals
lola: write sara problem file to PolyORBNT-COL-S10J60-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-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 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-TheSour_10 + -TheSour_9 + -TheSour_8 + -TheSour_7 + -TheSour_6 + -TheSour_5 + -TheSour_4 + -TheSour_3 + -TheSour_2 + -TheSour_1 <= -3)
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 4328 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-S10J60-ReachabilityCardinality-7.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-place_462 + NotifyEventJobQueuedE_1 > 0 AND (-mo3 <= -2 AND (-f3_9 + -f3_8 + -f3_7 + -f3_6 + -f3_5 + -f3_4 + -f3_3 + -f3_2 + -f3_1 + -f3_0 + -f3_60 + -f3_59 + -f3_58 + -f3_57 + -f3_56 + -f3_55 + -f3_54 + -f3_53 + -f3_52 + -f3_51 + -f3_50 + -f3_49 + -f3_48 + -f3_47 + -f3_46 + -f3_45 + -f3_44 + -f3_43 + -f3_42 + -f3_41 + -f3_40 + -f3_39 + -f3_38 + -f3_37 + -f3_36 + -f3_35 + -f3_34 + -f3_33 + -... (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 4328 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-S10J60-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-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 246 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Perform_Work_E_1 <= -1 AND -DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 + -DataOnSrc_6 + -DataOnSrc_7 + -DataOnSrc_8 + -DataOnSrc_9 + -DataOnSrc_10 <= -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 4328 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 2 literals
lola: write sara problem file to PolyORBNT-COL-S10J60-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-mo2 > -2 AND -Perform_Work_B_1_60 + -Perform_Work_B_1_59 + -Perform_Work_B_1_58 + -Perform_Work_B_1_57 + -Perform_Work_B_1_56 + -Perform_Work_B_1_55 + -Perform_Work_B_1_54 + -Perform_Work_B_1_53 + -Perform_Work_B_1_52 + -Perform_Work_B_1_51 + -Perform_Work_B_1_50 + -Perform_Work_B_1_49 + -Perform_Work_B_1_48 + -Perform_Work_B_1_47 + -Perform_Work_B_1_46 + -Perform_Work_B_1_45 + -Perform_Wor... (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 4328 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 6 literals
lola: write sara problem file to PolyORBNT-COL-S10J60-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityCardinality-10.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 11 will run for 258 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-place_520_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 4328 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-S10J60-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Perform_Work_B_1_60 + -Perform_Work_B_1_59 + -Perform_Work_B_1_58 + -Perform_Work_B_1_57 + -Perform_Work_B_1_56 + -Perform_Work_B_1_55 + -Perform_Work_B_1_54 + -Perform_Work_B_1_53 + -Perform_Work_B_1_52 + -Perform_Work_B_1_51 + -Perform_Work_B_1_50 + -Perform_Work_B_1_49 + -Perform_Work_B_1_48 + -Perform_Work_B_1_47 + -Perform_Work_B_1_46 + -Perform_Work_B_1_45 + -Perform_Work_B_1_44 + -Perf... (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 4328 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-S10J60-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityCardinality-12.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-DataOnSrc_1 + -DataOnSrc_2 + -DataOnSrc_3 + -DataOnSrc_4 + -DataOnSrc_5 + -DataOnSrc_6 + -DataOnSrc_7 + -DataOnSrc_8 + -DataOnSrc_9 + -DataOnSrc_10 + place_458 <= 0 OR (-NotifyEventJobQueuedB_1_9 + -NotifyEventJobQueuedB_1_8 + -NotifyEventJobQueuedB_1_7 + -NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB... (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 4328 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 3 literals
lola: write sara problem file to PolyORBNT-COL-S10J60-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-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 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-place_523_1 > -1 OR (-f1_60 + -f1_59 + -f1_58 + -f1_57 + -f1_56 + -f1_55 + -f1_54 + -f1_53 + -f1_52 + -f1_51 + -f1_50 + -f1_49 + -f1_48 + -f1_47 + -f1_46 + -f1_45 + -f1_44 + -f1_43 + -f1_42 + -f1_41 + -f1_40 + -f1_39 + -f1_38 + -f1_37 + -f1_36 + -f1_35 + -f1_34 + -f1_33 + -f1_32 + -f1_31 + -f1_30 + -f1_29 + -f1_28 + -f1_27 + -f1_26 + -f1_25 + -f1_24 + -f1_23 + -f1_22 + -f1_21 + -f1_20 + -f1_... (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 4328 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 3 literals
lola: write sara problem file to PolyORBNT-COL-S10J60-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-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 352 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-place_482_1_9 + -place_482_1_8 + -place_482_1_7 + -place_482_1_6 + -place_482_1_5 + -place_482_1_4 + -place_482_1_3 + -place_482_1_2 + -place_482_1_1 + block + -place_482_1_10 <= 0 AND (-QueueJobB_1_60 + -QueueJobB_1_59 + -QueueJobB_1_58 + -QueueJobB_1_57 + -QueueJobB_1_56 + -QueueJobB_1_55 + -QueueJobB_1_54 + -QueueJobB_1_53 + -QueueJobB_1_52 + -QueueJobB_1_51 + -QueueJobB_1_50 + -QueueJobB... (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 4328 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-S10J60-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file PolyORBNT-COL-S10J60-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: unknown unknown unknown unknown no unknown unknown no unknown yes unknown yes yes unknown unknown yes

BK_STOP 1464535411484

--------------------
content from stderr:

parsing of model.pnml complete

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_PolyORBNT-PT-S10J60"
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/S_PolyORBNT-PT-S10J60.tgz
mv S_PolyORBNT-PT-S10J60 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 S_PolyORBNT-PT-S10J60, 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 r170kn-ebro-146433135501528"
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 ;