About the Execution of 2018-Gold for RobotManipulation-PT-00500
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
394.640 | 5778.00 | 5537.00 | 32.30 | TFTFTFFFTTTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2019-input.r154-ebro-155286414400074.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is RobotManipulation-PT-00500, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-ebro-155286414400074
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 4.1K Feb 12 14:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 12 14:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 8 16:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 8 16:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 113 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 351 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.7K Feb 5 01:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 01:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.2K Feb 4 22:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 4 16:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 4 16:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 1 13:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 13:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 6.4K Mar 10 17:31 model.pnml
--------------------
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 RobotManipulation-PT-00500-LTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00500-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1553211415041
info: Time: 3600 - MCC
===========================================================================================
prep: translating RobotManipulation-PT-00500 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RobotManipulation-PT-00500 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ RobotManipulation-PT-00500 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-00500-LTLCardinality.task
lola: LP says that atomic proposition is always true: (move <= p_m)
lola: A (TRUE) : A ((((3 <= move) U (p_i1 <= p_rdy)) U F (X ((3 <= initialize))))) : A (X (F ((r_stopped <= p_i1)))) : A ((G ((2 <= initialized)) U G (F ((3 <= p_i2))))) : A ((G ((move <= p_i1)) U ((r_stopped <= off) U (2 <= r_stopped)))) : A ((((r_stopped <= off) U (access <= p_i2)) U G (G ((p_rel <= initialize))))) : A (G (X (F ((1 <= r_stopped))))) : A ((X (X ((2 <= p_i1))) U F (G ((r_stopped <= p_m))))) : A (F ((initialize <= p_i1))) : A (((3 <= access) U X ((move <= p_rel)))) : A (X ((1 <= access))) : A (F ((F ((move <= moved)) U X ((1 <= p_rel))))) : A (X (G (((3 <= p_rdy) U (1 <= initialize))))) : A ((2 <= p_rdy)) : A (G (G (F (G ((3 <= p_m)))))) : A ((1 <= move))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (2 <= p_rdy)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p_rdy)
lola: processed formula length: 12
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= move)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= move)
lola: processed formula length: 11
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= access) U X ((move <= p_rel))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((3 <= access) U X ((move <= p_rel))))
lola: processed formula length: 41
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= access)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= access)))
lola: processed formula length: 21
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
FORMULA RobotManipulation-PT-00500-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((1 <= p_rel))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((1 <= p_rel))))
lola: processed formula length: 24
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1960649 markings, 3411774 edges, 392130 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 2007005 markings, 3505505 edges
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((1 <= initialize)) AND ((3 <= p_rdy) OR (1 <= initialize))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((1 <= initialize)) AND ((3 <= p_rdy) OR (1 <= initialize))))))
lola: processed formula length: 75
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 11177 markings, 13303 edges
FORMULA RobotManipulation-PT-00500-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((3 <= move) U (p_i1 <= p_rdy)) U X (F ((3 <= initialize)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((3 <= move) U (p_i1 <= p_rdy)) U X (F ((3 <= initialize)))))
lola: processed formula length: 65
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6004 markings, 6004 edges
FORMULA RobotManipulation-PT-00500-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((r_stopped <= p_i1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((r_stopped <= p_i1))))
lola: processed formula length: 31
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((initialize <= p_i1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (p_i1 + 1 <= initialize)
lola: processed formula length: 24
lola: 22 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= p_m))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= p_m))))
lola: processed formula length: 22
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 4007 markings, 4008 edges
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= r_stopped))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= r_stopped))))
lola: processed formula length: 28
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5005 markings, 5005 edges
FORMULA RobotManipulation-PT-00500-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((3 <= p_i2))) OR G (((2 <= initialized) AND F ((3 <= p_i2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G (F ((3 <= p_i2))) OR G (((2 <= initialized) AND F ((3 <= p_i2))))))
lola: processed formula length: 73
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6004 markings, 6004 edges
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((r_stopped <= p_m))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((r_stopped <= p_m))))
lola: processed formula length: 30
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 6
lola: add low 5
lola: add low 3
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17046 markings, 19073 edges
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((r_stopped <= off) U (2 <= r_stopped)) OR (G ((move <= p_i1)) AND F ((2 <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((r_stopped <= off) U (2 <= r_stopped)) OR (G ((move <= p_i1)) AND F ((2 <= r_stopped)))))
lola: processed formula length: 94
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3565 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((r_stopped <= off) U (access <= p_i2)) U G ((p_rel <= initialize))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((r_stopped <= off) U (access <= p_i2)) U G ((p_rel <= initialize))))
lola: processed formula length: 73
lola: 20 rewrites
lola: closed formula file RobotManipulation-PT-00500-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5035 markings, 5042 edges
lola: ========================================
FORMULA RobotManipulation-PT-00500-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes no yes no no no yes yes yes no no no no no
lola:
preliminary result: yes no yes no yes no no no yes yes yes no no no no no
lola: memory consumption: 19944 KB
lola: time consumption: 5 seconds
BK_STOP 1553211420819
--------------------
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="RobotManipulation-PT-00500"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
export BK_RESULT_DIR="/tmp/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
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is RobotManipulation-PT-00500, 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 r154-ebro-155286414400074"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00500.tgz
mv RobotManipulation-PT-00500 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
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 ;