About the Execution of LoLa for Peterson-PT-7
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2881.290 | 3052726.00 | 3066953.00 | 360.20 | T??T???TTF??TTT? | 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 Peterson-PT-7, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088100104
=====================================================================
--------------------
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 Peterson-COL-7-LTLCardinality-0
FORMULA_NAME Peterson-COL-7-LTLCardinality-1
FORMULA_NAME Peterson-COL-7-LTLCardinality-10
FORMULA_NAME Peterson-COL-7-LTLCardinality-11
FORMULA_NAME Peterson-COL-7-LTLCardinality-12
FORMULA_NAME Peterson-COL-7-LTLCardinality-13
FORMULA_NAME Peterson-COL-7-LTLCardinality-14
FORMULA_NAME Peterson-COL-7-LTLCardinality-15
FORMULA_NAME Peterson-COL-7-LTLCardinality-2
FORMULA_NAME Peterson-COL-7-LTLCardinality-3
FORMULA_NAME Peterson-COL-7-LTLCardinality-4
FORMULA_NAME Peterson-COL-7-LTLCardinality-5
FORMULA_NAME Peterson-COL-7-LTLCardinality-6
FORMULA_NAME Peterson-COL-7-LTLCardinality-7
FORMULA_NAME Peterson-COL-7-LTLCardinality-8
FORMULA_NAME Peterson-COL-7-LTLCardinality-9
=== Now, execution of the tool begins
BK_START 1463695153227
bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ Peterson-PT-7
FORMULA Peterson-COL-7-LTLCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-LTLCardinality-1 CANNOT_COMPUTE
FORMULA Peterson-COL-7-LTLCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-LTLCardinality-4 CANNOT_COMPUTE
FORMULA Peterson-COL-7-LTLCardinality-5 CANNOT_COMPUTE
FORMULA Peterson-COL-7-LTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-LTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-LTLCardinality-9 CANNOT_COMPUTE
FORMULA Peterson-COL-7-LTLCardinality-10 CANNOT_COMPUTE
FORMULA Peterson-COL-7-LTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-7-LTLCardinality-12 CANNOT_COMPUTE
FORMULA Peterson-COL-7-LTLCardinality-13 CANNOT_COMPUTE
FORMULA Peterson-COL-7-LTLCardinality-14 CANNOT_COMPUTE
FORMULA Peterson-COL-7-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: 5088/65536 symbol table entries, 17 collisions
lola: preprocessing...
lola: finding significant places
lola: 1992 places, 3096 transitions, 1961 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4784 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-7-LTLCardinality.task
lola: read: AX (X (IsEndLoop_0_0_0 + IsEndLoop_1_0_0 + IsEndLoop_2_0_0 + IsEndLoop_3_0_0 + IsEndLoop_4_0_0 + IsEndLoop_5_0_0 + IsEndLoop_6_0_0 + IsEndLoop_7_0_0 + IsEndLoop_0_1_0 + IsEndLoop_1_1_0 + IsEndLoop_2_1_0 + IsEndLoop_3_1_0 + IsEndLoop_4_1_0 + IsEndLoop_6_1_0 + IsEndLoop_5_1_0 + IsEndLoop_0_2_0 + IsEndLoop_7_1_0 + IsEndLoop_2_2_0 + IsEndLoop_1_2_0 + IsEndLoop_4_2_0 + IsEndLoop_3_2_0 + IsEndLoop_6_2_0... (shortened)
lola: formula length: 96598
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 219 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (IsEndLoop_5_2_7 + IsEndLoop_2_4_7 + IsEndLoop_2_4_6 + IsEndLoop_2_4_5 + IsEndLoop_2_4_4 + IsEndLoop_2_4_3 + IsEndLoop_2_4_2 + IsEndLoop_2_4_1 + IsEndLoop_2_4_0 + IsEndLoop_5_2_6 + IsEndLoop_5_2_5 + IsEndLoop_5_2_4 + IsEndLoop_5_2_3 + IsEndLoop_5_2_2 + IsEndLoop_5_2_1 + IsEndLoop_5_2_0 + IsEndLoop_7_6_7 + IsEndLoop_7_6_6 + IsEndLoop_7_6_5 + IsEndLoop_7_6_4 + IsEndLoop_7_6_3 + IsEndLoop_7_6_2... (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 248 bytes per marking, with 23 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 1 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (G (F (-EndTurn_0_6 + -EndTurn_0_0 + -EndTurn_0_1 + -EndTurn_0_2 + -EndTurn_0_3 + -EndTurn_0_4 + -EndTurn_0_5 + -EndTurn_7_6 + -EndTurn_7_5 + -EndTurn_7_4 + -EndTurn_7_3 + -EndTurn_7_2 + -EndTurn_7_1 + -EndTurn_7_0 + -EndTurn_6_6 + -EndTurn_6_5 + -EndTurn_6_4 + -EndTurn_6_3 + -EndTurn_6_2 + -EndTurn_6_1 + -EndTurn_6_0 + -EndTurn_5_6 + -EndTurn_5_5 + -EndTurn_5_4 + -EndTurn_5_3 + -EndTurn_5_2... (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 248 bytes per marking, with 23 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 2 will run for 234 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((F (-EndTurn_0_6 + -EndTurn_0_0 + -EndTurn_0_1 + -EndTurn_0_2 + -EndTurn_0_3 + -EndTurn_0_4 + -EndTurn_0_5 + -EndTurn_7_6 + -EndTurn_7_5 + -EndTurn_7_4 + -EndTurn_7_3 + -EndTurn_7_2 + -EndTurn_7_1 + -EndTurn_7_0 + -EndTurn_6_6 + -EndTurn_6_5 + -EndTurn_6_4 + -EndTurn_6_3 + -EndTurn_6_2 + -EndTurn_6_1 + -EndTurn_6_0 + -EndTurn_5_6 + -EndTurn_5_5 + -EndTurn_5_4 + -EndTurn_5_3 + -EndTurn_5_2 + -E... (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 248 bytes per marking, with 23 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 3 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -IsEndLoop_5_2_7 + -IsEndLoop_2_4_7 + -IsEndLoop_2_4_6 + -IsEndLoop_2_4_5 + -IsEndLoop_2_4_4 + -IsEndLoop_2_4_3 + -IsEndLoop_2_4_2 + -IsEndLoop_2_4_1 + -IsEndLoop_2_4_0 + -IsEndLoop_5_2_6 + -IsEndLoop_5_2_5 + -IsEndLoop_5_2_4 + -IsEndLoop_5_2_3 + -IsEndLoop_5_2_2 + -IsEndLoop_5_2_1 + -IsEndLoop_5_2_0 + -IsEndLoop_7_6_7 + -IsEndLoop_7_6_6 + -IsEndLoop_7_6_5 + -IsEndLoop_7_6_4 + -IsEndLoop_7_6_3 + -... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Peterson-COL-7-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (-AskForSection_4_6 + -AskForSection_4_5 + -AskForSection_4_4 + -AskForSection_4_3 + -AskForSection_4_2 + -AskForSection_4_1 + -AskForSection_4_0 + -AskForSection_3_6 + -AskForSection_3_5 + -AskForSection_3_4 + -AskForSection_3_3 + -AskForSection_3_2 + -AskForSection_3_1 + -AskForSection_3_0 + -AskForSection_2_6 + -AskForSection_2_5 + -AskForSection_2_4 + -AskForSection_2_3 + -AskForSection_... (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 248 bytes per marking, with 23 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 5 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (Turn_2_7 + Turn_3_7 + Turn_4_7 + Turn_5_7 + Turn_6_7 + Turn_0_7 + Turn_1_7 + -BeginLoop_1_4_7 + -BeginLoop_1_4_6 + -BeginLoop_1_4_5 + -BeginLoop_1_4_4 + -BeginLoop_1_4_3 + -BeginLoop_1_4_2 + -BeginLoop_1_4_1 + -BeginLoop_1_4_0 + Turn_1_6 + Turn_1_5 + Turn_1_4 + Turn_1_3 + Turn_1_2 + Turn_1_1 + Turn_1_0 + -BeginLoop_4_2_7 + -BeginLoop_4_2_6 + -BeginLoop_4_2_5 + -BeginLoop_4_2_4 + -BeginLoop_... (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 248 bytes per marking, with 23 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 6 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (-EndTurn_0_6 + BeginLoop_1_4_7 + BeginLoop_1_4_6 + BeginLoop_1_4_5 + BeginLoop_1_4_4 + BeginLoop_1_4_3 + BeginLoop_1_4_2 + BeginLoop_1_4_1 + BeginLoop_1_4_0 + BeginLoop_4_2_7 + BeginLoop_4_2_6 + BeginLoop_4_2_5 + BeginLoop_4_2_4 + BeginLoop_4_2_3 + BeginLoop_4_2_2 + BeginLoop_4_2_1 + BeginLoop_4_2_0 + BeginLoop_7_0_7 + BeginLoop_7_0_6 + BeginLoop_7_0_5 + BeginLoop_7_0_4 + BeginLoop_7_0_3 + ... (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 248 bytes per marking, with 23 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 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T + -WantSection_3_F + -WantSection_3_T + -WantSection_4_F + -WantSection_4_T + -WantSection_5_F + -WantSection_5_T + -WantSection_6_F + -WantSection_6_T + -WantSection_7_F + -WantSection_7_T <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Peterson-COL-7-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 341 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T + -WantSection_3_F + -WantSection_3_T + -WantSection_4_F + -WantSection_4_T + -WantSection_5_F + -WantSection_5_T + -WantSection_6_F + -WantSection_6_T + -WantSection_7_F + -WantSection_7_T + Idle_7 + Idle_6 + Idle_5 + Idle_4 + Idle_3 + Idle_2 + Idle_1 + Idle_0 <= 0 U X (-WantSectio... (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 248 bytes per marking, with 23 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 9 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G (G (G (-CS_7 + -CS_6 + -CS_5 + -CS_4 + -CS_3 + -CS_2 + -CS_1 + -CS_0 <= -1))))
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 248 bytes per marking, with 23 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 10 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(F (G (-WantSection_0_F + -WantSection_0_T + -WantSection_1_F + -WantSection_1_T + -WantSection_2_F + -WantSection_2_T + -WantSection_3_F + -WantSection_3_T + -WantSection_4_F + -WantSection_4_T + -WantSection_5_F + -WantSection_5_T + -WantSection_6_F + -WantSection_6_T + -WantSection_7_F + -WantSection_7_T <= -2)) U F (X (-CS_7 + -CS_6 + -CS_5 + -CS_4 + -CS_3 + -CS_2 + -CS_1 + -CS_0 <= -2)))
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 248 bytes per marking, with 23 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 11 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -EndTurn_0_6 + AskForSection_4_6 + AskForSection_4_5 + AskForSection_4_4 + AskForSection_4_3 + AskForSection_4_2 + AskForSection_4_1 + AskForSection_4_0 + AskForSection_3_6 + AskForSection_3_5 + AskForSection_3_4 + AskForSection_3_3 + AskForSection_3_2 + AskForSection_3_1 + AskForSection_3_0 + -EndTurn_0_0 + -EndTurn_0_1 + AskForSection_2_6 + AskForSection_2_5 + AskForSection_2_4 + AskForSection_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file Peterson-COL-7-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-TestIdentity_3_4_7 + -TestIdentity_6_2_7 + -TestIdentity_6_2_0 + -TestIdentity_6_2_1 + -TestIdentity_6_2_2 + -TestIdentity_6_2_3 + -TestIdentity_0_5_7 + -TestIdentity_0_5_6 + -TestIdentity_0_5_5 + -TestIdentity_0_5_4 + -TestIdentity_0_5_3 + -TestIdentity_0_5_2 + -TestIdentity_0_5_1 + -TestIdentity_0_5_0 + -TestIdentity_3_3_7 + -TestIdentity_3_3_6 + -TestIdentity_3_3_5 + -TestIdentity_3_3_4 + -... (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 248 bytes per marking, with 23 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 13 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((X (-TestIdentity_3_4_7 + -TestIdentity_6_2_7 + -TestIdentity_6_2_0 + -TestIdentity_6_2_1 + -TestIdentity_6_2_2 + -TestIdentity_6_2_3 + -TestIdentity_0_5_7 + -TestIdentity_0_5_6 + -TestIdentity_0_5_5 + -TestIdentity_0_5_4 + -TestIdentity_0_5_3 + -TestIdentity_0_5_2 + -TestIdentity_0_5_1 + -TestIdentity_0_5_0 + -TestIdentity_3_3_7 + -TestIdentity_3_3_6 + -TestIdentity_3_3_5 + -TestIdentity_3_3_... (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 248 bytes per marking, with 23 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 14 will run for 487 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (G (G (-IsEndLoop_5_2_7 + -IsEndLoop_2_4_7 + -IsEndLoop_2_4_6 + -IsEndLoop_2_4_5 + -IsEndLoop_2_4_4 + -IsEndLoop_2_4_3 + -IsEndLoop_2_4_2 + -IsEndLoop_2_4_1 + -IsEndLoop_2_4_0 + -IsEndLoop_5_2_6 + -IsEndLoop_5_2_5 + -IsEndLoop_5_2_4 + -IsEndLoop_5_2_3 + -IsEndLoop_5_2_2 + -IsEndLoop_5_2_1 + -IsEndLoop_5_2_0 + -IsEndLoop_7_6_7 + -IsEndLoop_7_6_6 + -IsEndLoop_7_6_5 + -IsEndLoop_7_6_4 + -IsEndL... (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 248 bytes per marking, with 23 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 15 will run for 488 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(-TestIdentity_3_4_7 + -TestIdentity_6_2_7 + -TestIdentity_6_2_0 + -TestIdentity_6_2_1 + -TestIdentity_6_2_2 + -TestIdentity_6_2_3 + -TestIdentity_0_5_7 + -TestIdentity_0_5_6 + -TestIdentity_0_5_5 + -TestIdentity_0_5_4 + -TestIdentity_0_5_3 + -TestIdentity_0_5_2 + -TestIdentity_0_5_1 + -TestIdentity_0_5_0 + -TestIdentity_3_3_7 + -TestIdentity_3_3_6 + -TestIdentity_3_3_5 + -TestIdentity_3_3_4 + -T... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(-TestIdentity_3_4_7 + -TestIdentity_6_2_7 + -TestIdentity_6_2_0 + -TestIdentity_6_2_1 + -TestIdentity_6_2_2 + -TestIdentity_6_2_3 + -TestIdentity_0_5_7 + -TestIdentity_0_5_6 + -TestIdentity_0_5_5 + -TestIdentity_0_5_4 + -TestIdentity_0_5_3 + -TestIdentity_0_5_2 + -TestIdentity_0_5_1 + -TestIdentity_0_5_0 + -TestIdentity_3_3_7 + -TestIdentity_3_3_6 + -TestIdentity_3_3_5 + -TestIdentity_3_3_4 + -T... (shortened)
lola: processed formula length: 10595
lola: 1601142 rewrites
lola: formula mentions 512 of 1992 places; total mentions: 512
lola: closed formula file Peterson-COL-7-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 248 bytes per marking, with 23 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: RESULT
lola: summary: yes unknown yes no unknown unknown yes yes yes unknown unknown yes unknown unknown unknown yes
lola: ========================================
BK_STOP 1463698205953
--------------------
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="Peterson-PT-7"
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/Peterson-PT-7.tgz
mv Peterson-PT-7 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 Peterson-PT-7, 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-146369088100104"
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 ;