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 Philosophers-PT-000100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088500358
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463705169766

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ Philosophers-PT-000100
FORMULA Philosophers-COL-000100-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000100-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: 1000/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 500 places, 500 transitions, 300 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 700 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000100-ReachabilityCardinality.task
lola: read: AG (((Eat_8 + Eat_9 + Eat_6 + Eat_7 + Eat_12 + Eat_13 + Eat_10 + Eat_11 + Eat_1 + Eat_4 + Eat_5 + Eat_2 + Eat_3 + Eat_38 + Eat_39 + Eat_40 + Eat_41 + Eat_42 + Eat_43 + Eat_44 + Eat_45 + Eat_30 + Eat_31 + Eat_32 + Eat_33 + Eat_34 + Eat_35 + Eat_36 + Eat_37 + Eat_23 + Eat_22 + Eat_25 + Eat_24 + Eat_27 + Eat_26 + Eat_29 + Eat_28 + Eat_15 + Eat_14 + Eat_17 + Eat_16 + Eat_19 + Eat_18 + Eat_21 + Eat_20 ... (shortened)
lola: formula length: 75240
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 (((Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + Eat_100 + -Fork_98 + -Fork_97 + -Fork_96 + -Fork_95 + -Fork_94 + -Fork_93 + -Fork_92 + -Fork_91 + -Fork_90 + -Fork_89 + -Fork_88 + -Fork_87 + -Fork_86 + -Fork_85 + -Fork_84 + -Fork_83 + -Fork_82 + -Fork_81 + -Fork_80 + -Fork_79 + -Fork_78 + -Fork_77 + -Fork_76 + -Fork_75 + -Fork_74 + -Fork_73 + -Fork_72 + -Fork_71 + -For... (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 40 bytes per marking, with 20 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_99 + -Think_98 + -Think_97 + -Think_96 + -Think_95 + -Think_94 + -Think_93 + -Think_92 + -Think_91 + -Think_90 + -Think_89 + -Think_88 + -Think_87 + -Think_86 + -Think_85 + -Think_84 + -Think_83 + -Think_82 + -Think_81 + -Think_80 + -Think_79 + -Think_78 + -Think_77 + -Think_76 + -Think_75... (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 40 bytes per marking, with 20 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
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 Philosophers-COL-000100-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 Philosophers-COL-000100-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 294 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 Philosophers-COL-000100-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_99 + -Think_98 + -Think_97 + -Think_96 + -Think_95 + -Think_94 + -Think_93 + -Think_92 + -Think_91 + -Think_90 + -Think_89 + -Think_88 + -Think_87 + -Think_86 + -Think_85 + -Think_84 + -Think_83 + -Think_82 + -Think_81 + -Think_80 + -Think_79 + -Think_78 + -Think_77 + -Think_76 + -Think_75... (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 40 bytes per marking, with 20 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 Philosophers-COL-000100-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file Philosophers-COL-000100-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Catch2_99 + -Catch2_98 + -Catch2_97 + -Catch2_96 + -Catch2_95 + -Catch2_94 + -Catch2_93 + -Catch2_92 + -Catch2_91 + -Catch2_90 + -Catch2_89 + -Catch2_88 + -Catch2_87 + -Catch2_86 + -Catch2_85 + -Catch2_84 + -Catch2_83 + -Catch2_82 + -Catch2_81 + -Catch2_80 + -Catch2_79 + -Catch2_78 + -Catch2_77 + -Catch2_76 + -Catch2_75 + -Catch2_74 + -Catch2_73 + -Catch2_72 + -Catch2_71 + -Catch2_70 + -Catch... (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 40 bytes per marking, with 20 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Catch2_99 + Catch2_98 + Catch2_97 + Catch2_96 + Catch2_95 + Catch2_94 + Catch2_93 + Catch2_92 + Catch2_91 + Catch2_90 + Catch2_89 + Catch2_88 + Catch2_87 + Catch2_86 + Catch2_85 + Catch2_84 + Catch2_83 + Catch2_82 + Catch2_81 + Catch2_80 + Catch2_79 + Catch2_78 + Catch2_77 + Catch2_76 + Catch2_75 + Catch2_74 + Catch2_73 + Catch2_72 + Catch2_71 + Catch2_70 + Catch2_69 + Catch2_68 + Catch2_67 + ... (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 40 bytes per marking, with 20 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_100 + -Eat_99 + -Eat_98 + -Eat_97 + -Eat_96 + -Eat_95 + -Eat_94 + -Eat_93 + -Eat_92 + -Eat_91 + -Eat_90 + -Eat_89 + -Eat_88 + -Eat_87 + -Eat_86 + -Eat_85 + -Eat_84 + -Eat_83 + -Eat_82 + -Eat_81 + -Eat_80 + -Eat_79 + -Eat_78 + -Eat_77 + -Eat_76 + -Eat_75 + -Eat_74 + -Eat_73 + -Eat_72 + -Eat_71 + -Eat_70 + -Ea... (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 40 bytes per marking, with 20 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 Philosophers-COL-000100-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-Catch1_100 + Fork_98 + Fork_97 + Fork_96 + Fork_95 + Fork_94 + Fork_93 + Fork_92 + Fork_91 + Fork_90 + Fork_89 + Fork_88 + Fork_87 + Fork_86 + Fork_85 + Fork_84 + Fork_83 + Fork_82 + Fork_81 + Fork_80 + Fork_79 + Fork_78 + Fork_77 + Fork_76 + Fork_75 + Fork_74 + Fork_73 + Fork_72 + Fork_71 + Fork_70 + Fork_69 + Fork_68 + Fork_67 + Fork_66 + Fork_65 + Fork_64 + Fork_63 + Fork_62 + Fork_61 + Fo... (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 40 bytes per marking, with 20 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 Philosophers-COL-000100-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_99 + -Think_98 + -Think_97 + -Think_96 + -Think_95 + -Think_94 + -Think_93 + -Think_92 + -Think_91 + -Think_90 + -Think_89 + -Think_88 + -Think_87 + -Think_86 + -Think_85 + -Think_84 + -Think_83 + -Think_82 + -Think_81 + -Think_80 + -Think_79 + -Think_78 + -Think_77 + -Think_76 + -Think_75... (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 40 bytes per marking, with 20 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 Philosophers-COL-000100-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_100 + -Eat_99 + -Eat_98 + -Eat_97 + -Eat_96 + -Eat_95 + -Eat_94 + -Eat_93 + -Eat_92 + -Eat_91 + -Eat_90 + -Eat_89 + -Eat_88 + -Eat_87 + -Eat_86 + -Eat_85 + -Eat_84 + -Eat_83 + -Eat_82 + -Eat_81 + -Eat_80 + -Eat_79 + -Eat_78 + -Eat_77 + -Eat_76 + -Eat_75 + -Eat_74 + -Eat_73 + -Eat_72 + -Eat_71 + -Eat_70 + -Ea... (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 40 bytes per marking, with 20 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: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((Think_9 + Think_8 + Think_7 + Think_6 + Think_5 + Think_4 + Think_3 + Think_2 + Think_1 + Think_99 + Think_98 + Think_97 + Think_96 + Think_95 + Think_94 + Think_93 + Think_92 + Think_91 + Think_90 + Think_89 + Think_88 + Think_87 + Think_86 + Think_85 + Think_84 + Think_83 + Think_82 + Think_81 + Think_80 + Think_79 + Think_78 + Think_77 + Think_76 + Think_75 + Think_74 + Think_73 + Think_7... (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 40 bytes per marking, with 20 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: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1178 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_99 + -Think_98 + -Think_97 + -Think_96 + -Think_95 + -Think_94 + -Think_93 + -Think_92 + -Think_91 + -Think_90 + -Think_89 + -Think_88 + -Think_87 + -Think_86 + -Think_85 + -Think_84 + -Think_83 + -Think_82 + -Think_81 + -Think_80 + -Think_79 + -Think_78 + -Think_77 + -Think_76 + -Think_7... (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 40 bytes per marking, with 20 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 Philosophers-COL-000100-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1768 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 Philosophers-COL-000100-ReachabilityCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 3536 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Fork_98 + -Fork_97 + -Fork_96 + -Fork_95 + -Fork_94 + -Fork_93 + -Fork_92 + -Fork_91 + -Fork_90 + -Fork_89 + -Fork_88 + -Fork_87 + -Fork_86 + -Fork_85 + -Fork_84 + -Fork_83 + -Fork_82 + -Fork_81 + -Fork_80 + -Fork_79 + -Fork_78 + -Fork_77 + -Fork_76 + -Fork_75 + -Fork_74 + -Fork_73 + -Fork_72 + -Fork_71 + -Fork_70 + -Fork_69 + -Fork_68 + -Fork_67 + -Fork_66 + -Fork_65 + -Fork_64 + -Fork_63 + ... (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 40 bytes per marking, with 20 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 Philosophers-COL-000100-ReachabilityCardinality-15.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: no no yes yes yes yes yes no yes yes no yes no no yes no

BK_STOP 1463705173151

--------------------
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="Philosophers-PT-000100"
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/Philosophers-PT-000100.tgz
mv Philosophers-PT-000100 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 Philosophers-PT-000100, 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-146369088500358"
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 ;