About the Execution of LoLa for Philosophers-PT-000050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15937.570 | 829521.00 | 834204.00 | 404.50 | ?TTT?FTT?FFFTTFF | 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-2979
Executing tool lola
Input is Philosophers-PT-000050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088500347
=====================================================================
--------------------
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-000050-LTLCardinality-0
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-1
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-15
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-2
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-3
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-4
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-5
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-6
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-7
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-8
FORMULA_NAME Philosophers-COL-000050-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463704250652
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ Philosophers-PT-000050
FORMULA Philosophers-COL-000050-LTLCardinality-0 CANNOT_COMPUTE
FORMULA Philosophers-COL-000050-LTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-LTLCardinality-2 CANNOT_COMPUTE
FORMULA Philosophers-COL-000050-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-LTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-LTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-LTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-LTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-LTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-LTLCardinality-12 CANNOT_COMPUTE
FORMULA Philosophers-COL-000050-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-LTLCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Philosophers-COL-000050-LTLCardinality-15 TRUE 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: 500/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 250 places, 250 transitions, 150 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 350 transition conflict sets
lola: TASK
lola: reading formula from Philosophers-COL-000050-LTLCardinality.task
lola: read: AG (G (G (G (Eat_1 + Eat_2 + Eat_3 + Eat_4 + Eat_5 + Eat_6 + Eat_7 + Eat_8 + Eat_9 + Eat_10 + Eat_11 + Eat_12 + Eat_13 + Eat_15 + Eat_14 + Eat_17 + Eat_16 + Eat_19 + Eat_18 + Eat_21 + Eat_20 + Eat_23 + Eat_22 + Eat_25 + Eat_24 + Eat_27 + Eat_26 + Eat_29 + Eat_28 + Eat_32 + Eat_33 + Eat_30 + Eat_31 + Eat_36 + Eat_37 + Eat_34 + Eat_35 + Eat_40 + Eat_41 + Eat_38 + Eat_39 + Eat_44 + Eat_45 + Eat_42 + ... (shortened)
lola: formula length: 16031
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 (G (G (G (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_50 + -Think_49 + -Think_48 + -Think_47 + -Think_46 + -Think_45 + -Think_44 + -Think_43 + -Think_42 + -Think_41 + -Think_40 + -Think_39 + -Think_38 + -Think_37 + -Think_36 + -Think_35 + -Think_34 + -Think_33 + -Think_32 + -Think_31 + -Think_30 + -Think_29 + -Think_28 + -Think_27 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((X (-Catch2_50 + -Catch2_49 + -Catch2_48 + -Catch2_47 + -Catch2_46 + -Catch2_45 + -Catch2_44 + -Catch2_43 + -Catch2_42 + -Catch2_41 + -Catch2_40 + -Catch2_39 + -Catch2_38 + -Catch2_37 + -Catch2_36 + -Catch2_35 + -Catch2_34 + -Catch2_33 + -Catch2_32 + -Catch2_31 + -Catch2_30 + -Catch2_29 + -Catch2_28 + -Catch2_27 + -Catch2_26 + -Catch2_25 + -Catch2_24 + -Catch2_23 + -Catch2_22 + -Catch2_21 + -C... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G ((-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_50 + -Think_49 + -Think_48 + -Think_47 + -Think_46 + -Think_45 + -Think_44 + -Think_43 + -Think_42 + -Think_41 + -Think_40 + -Think_39 + -Think_38 + -Think_37 + -Think_36 + -Think_35 + -Think_34 + -Think_33 + -Think_32 + -Think_31 + -Think_30 + -Think_29 + -Think_28 + -Think_27 + -Thin... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-Catch2_50 + -Catch2_49 + -Catch2_48 + -Catch2_47 + -Catch2_46 + -Catch2_45 + -Catch2_44 + -Catch2_43 + -Catch2_42 + -Catch2_41 + -Catch2_40 + -Catch2_39 + -Catch2_38 + -Catch2_37 + -Catch2_36 + -Catch2_35 + -Catch2_34 + -Catch2_33 + -Catch2_32 + -Catch2_31 + -Catch2_30 + -Catch2_29 + -Catch2_28 + -Catch2_27 + -Catch2_26 + -Catch2_25 + -Catch2_24 + -Catch2_23 + -Catch2_22 + -Catch2_21 + -Catch... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-Catch2_50 + -Catch2_49 + -Catch2_48 + -Catch2_47 + -Catch2_46 + -Catch2_45 + -Catch2_44 + -Catch2_43 + -Catch2_42 + -Catch2_41 + -Catch2_40 + -Catch2_39 + -Catch2_38 + -Catch2_37 + -Catch2_36 + -Catch2_35 + -Catch2_34 + -Catch2_33 + -Catch2_32 + -Catch2_31 + -Catch2_30 + -Catch2_29 + -Catch2_28 + -Catch2_27 + -Catch2_26 + -Catch2_25 + -Catch2_24 + -Catch2_23 + -Catch2_22 + -Catch2_21 + -Catch2... (shortened)
lola: processed formula length: 648
lola: 58348 rewrites
lola: formula mentions 50 of 250 places; total mentions: 50
lola: closed formula file Philosophers-COL-000050-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (-Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_50 + -Catch1_49 + -Catch1_48 + -Catch1_47 + -Catch1_46 + -Catch1_45 + -Catch1_44 + -Catch1_43 + -Catch1_42 + -Catch1_41 + -Catch1_40 + -Catch1_39 + -Catch1_38 + -Catch1_37 + -Catch1_36 + -Catch1_35 + -Catch1_34 + -Catch1_33 + -Catch1_32 + -Catch1_31 + -Catch1_30 + -Catch1_29 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 5 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G ((-Catch2_50 + -Catch2_49 + -Catch2_48 + -Catch2_47 + -Catch2_46 + -Catch2_45 + -Catch2_44 + -Catch2_43 + -Catch2_42 + -Catch2_41 + -Catch2_40 + -Catch2_39 + -Catch2_38 + -Catch2_37 + -Catch2_36 + -Catch2_35 + -Catch2_34 + -Catch2_33 + -Catch2_32 + -Catch2_31 + -Catch2_30 + -Catch2_29 + -Catch2_28 + -Catch2_27 + -Catch2_26 + -Catch2_25 + -Catch2_24 + -Catch2_23 + -Catch2_22 + -Catch2_21 + -C... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((Catch2_50 + Catch2_49 + Catch2_48 + Catch2_47 + Catch2_46 + Catch2_45 + Catch2_44 + Catch2_43 + Catch2_42 + Catch2_41 + Catch2_40 + Catch2_39 + Catch2_38 + Catch2_37 + Catch2_36 + Catch2_35 + Catch2_34 + Catch2_33 + Catch2_32 + Catch2_31 + Catch2_30 + Catch2_29 + Catch2_28 + Catch2_27 + Catch2_26 + Catch2_25 + Catch2_24 + Catch2_23 + Catch2_22 + Catch2_21 + Catch2_20 + Catch2_19 + Catch2_18 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 7 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-Catch2_50 + -Catch2_49 + -Catch2_48 + -Catch2_47 + -Catch2_46 + -Catch2_45 + -Catch2_44 + -Catch2_43 + -Catch2_42 + -Catch2_41 + -Catch2_40 + -Catch2_39 + -Catch2_38 + -Catch2_37 + -Catch2_36 + -Catch2_35 + -Catch2_34 + -Catch2_33 + -Catch2_32 + -Catch2_31 + -Catch2_30 + -Catch2_29 + -Catch2_28 + -Catch2_27 + -Catch2_26 + -Catch2_25 + -Catch2_24 + -Catch2_23 + -Catch2_22 + -Catch2_21 + -Catch... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -Catch2_50 + -Catch2_49 + -Catch2_48 + -Catch2_47 + -Catch2_46 + -Catch2_45 + -Catch2_44 + -Catch2_43 + -Catch2_42 + -Catch2_41 + -Catch2_40 + -Catch2_39 + -Catch2_38 + -Catch2_37 + -Catch2_36 + -Catch2_35 + -Catch2_34 + -Catch2_33 + -Catch2_32 + -Catch2_31 + -Catch2_30 + -Catch2_29 + -Catch2_28 + -Catch2_27 + -Catch2_26 + -Catch2_25 + -Catch2_24 + -Catch2_23 + -Catch2_22 + -Catch2_21 + -... (shortened)
lola: processed formula length: 1094
lola: 58348 rewrites
lola: formula mentions 100 of 250 places; total mentions: 100
lola: closed formula file Philosophers-COL-000050-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (-Catch2_50 + -Catch2_49 + -Catch2_48 + -Catch2_47 + -Catch2_46 + -Catch2_45 + -Catch2_44 + -Catch2_43 + -Catch2_42 + -Catch2_41 + -Catch2_40 + -Catch2_39 + -Catch2_38 + -Catch2_37 + -Catch2_36 + -Catch2_35 + -Catch2_34 + -Catch2_33 + -Catch2_32 + -Catch2_31 + -Catch2_30 + -Catch2_29 + -Catch2_28 + -Catch2_27 + -Catch2_26 + -Catch2_25 + -Catch2_24 + -Catch2_23 + -Catch2_22 + -Catch2_21 + -Ca... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (-Catch1_9 + -Catch1_8 + -Catch1_7 + -Catch1_6 + -Catch1_5 + -Catch1_4 + -Catch1_3 + -Catch1_2 + -Catch1_1 + -Catch1_50 + -Catch1_49 + -Catch1_48 + -Catch1_47 + -Catch1_46 + -Catch1_45 + -Catch1_44 + -Catch1_43 + -Catch1_42 + -Catch1_41 + -Catch1_40 + -Catch1_39 + -Catch1_38 + -Catch1_37 + -Catch1_36 + -Catch1_35 + -Catch1_34 + -Catch1_33 + -Catch1_32 + -Catch1_31 + -Catch1_30 + -Catch1_29 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_50 + -Think_49 + -Think_48 + -Think_47 + -Think_46 + -Think_45 + -Think_44 + -Think_43 + -Think_42 + -Think_41 + -Think_40 + -Think_39 + -Think_38 + -Think_37 + -Think_36 + -Think_35 + -Think_34 + -Think_33 + -Think_32 + -Think_31 + -Think_30 + -Think_29 + -Think_28 + -Think_27 + -Think... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 11 will run for 616 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_50 + -Think_49 + -Think_48 + -Think_47 + -Think_46 + -Think_45 + -Think_44 + -Think_43 + -Think_42 + -Think_41 + -Think_40 + -Think_39 + -Think_38 + -Think_37 + -Think_36 + -Think_35 + -Think_34 + -Think_33 + -Think_32 + -Think_31 + -Think_30 + -Think_29 + -Think_28 + -Think_27 + -Think_26... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -Think_9 + -Think_8 + -Think_7 + -Think_6 + -Think_5 + -Think_4 + -Think_3 + -Think_2 + -Think_1 + -Think_50 + -Think_49 + -Think_48 + -Think_47 + -Think_46 + -Think_45 + -Think_44 + -Think_43 + -Think_42 + -Think_41 + -Think_40 + -Think_39 + -Think_38 + -Think_37 + -Think_36 + -Think_35 + -Think_34 + -Think_33 + -Think_32 + -Think_31 + -Think_30 + -Think_29 + -Think_28 + -Think_27 + -Thi... (shortened)
lola: processed formula length: 604
lola: 58348 rewrites
lola: formula mentions 50 of 250 places; total mentions: 50
lola: closed formula file Philosophers-COL-000050-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 12 will run for 770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (Eat_9 + Eat_8 + Eat_7 + Eat_6 + Eat_5 + Eat_4 + Eat_3 + Eat_2 + Eat_1 + -Fork_50 + -Fork_49 + -Fork_48 + -Fork_47 + -Fork_46 + -Fork_45 + -Fork_44 + -Fork_43 + -Fork_42 + -Fork_41 + -Fork_40 + -Fork_39 + -Fork_38 + -Fork_37 + -Fork_36 + -Fork_35 + -Fork_34 + -Fork_33 + -Fork_32 + -Fork_31 + -Fork_30 + -Fork_29 + -Fork_28 + -Fork_27 + -Fork_26 + -Fork_25 + -Fork_24 + -Fork_23 + -Fork_22 + -F... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 903 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Eat_9 + -Eat_8 + -Eat_7 + -Eat_6 + -Eat_5 + -Eat_4 + -Eat_3 + -Eat_2 + -Eat_1 + -Eat_50 + -Eat_49 + -Eat_48 + -Eat_47 + -Eat_46 + -Eat_45 + -Eat_44 + -Eat_43 + -Eat_42 + -Eat_41 + -Eat_40 + -Eat_39 + -Eat_38 + -Eat_37 + -Eat_36 + -Eat_35 + -Eat_34 + -Eat_33 + -Eat_32 + -Eat_31 + -Eat_30 + -Eat_29 + -Eat_28 + -Eat_27 + -Eat_26 + -Eat_25 + -Eat_24 + -Eat_23 + -Eat_22 + -Eat_21 + -Eat_20 + -Eat_19 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Philosophers-COL-000050-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Catch2_50 + -Catch2_49 + -Catch2_48 + -Catch2_47 + -Catch2_46 + -Catch2_45 + -Catch2_44 + -Catch2_43 + -Catch2_42 + -Catch2_41 + -Catch2_40 + -Catch2_39 + -Catch2_38 + -Catch2_37 + -Catch2_36 + -Catch2_35 + -Catch2_34 + -Catch2_33 + -Catch2_32 + -Catch2_31 + -Catch2_30 + -Catch2_29 + -Catch2_28 + -Catch2_27 + -Catch2_26 + -Catch2_25 + -Catch2_24 + -Catch2_23 + -Catch2_22 + -Catch2_21 + -Catch2_20... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Philosophers-COL-000050-LTLCardinality.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 2711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (-Fork_50 + -Fork_49 + -Fork_48 + -Fork_47 + -Fork_46 + -Fork_45 + -Fork_44 + -Fork_43 + -Fork_42 + -Fork_41 + -Fork_40 + -Fork_39 + -Fork_38 + -Fork_37 + -Fork_36 + -Fork_35 + -Fork_34 + -Fork_33 + -Fork_32 + -Fork_31 + -Fork_30 + -Fork_29 + -Fork_28 + -Fork_27 + -Fork_26 + -Fork_25 + -Fork_24 + -Fork_23 + -Fork_22 + -Fork_21 + -Fork_20 + -Fork_19 + -Fork_18 + -Fork_17 + -Fork_16 + -Fork_15... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: RESULT
lola: summary: unknown yes unknown no no no yes yes no no yes yes unknown no yes yes
BK_STOP 1463705080173
--------------------
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-000050"
export BK_EXAMINATION="LTLCardinality"
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-000050.tgz
mv Philosophers-PT-000050 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-000050, examination is LTLCardinality"
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-146369088500347"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
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 ;