fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r150-smll-152685548800052
Last Updated
June 26, 2018

About the Execution of Irma.full for RobotManipulation-PT-00200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13790.260 666183.00 629770.00 2671.20 FT?FFTF?FTFFTFTT 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)
....................
/home/mcc/execution
total 180K
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 6 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is RobotManipulation-PT-00200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-152685548800052
=====================================================================


--------------------
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-00200-CTLCardinality-00
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-01
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-02
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-03
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-04
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-05
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-06
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-07
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-08
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-09
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-10
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-11
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-12
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-13
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-14
FORMULA_NAME RobotManipulation-PT-00200-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526898047454


BK_STOP 1526898713637

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using RobotManipulation-PT-00200 as instance name.
Using RobotManipulation as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 1777966, 'Memory': 15934.04, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola RobotManipulation-PT-00200...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
RobotManipulation-PT-00200: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
RobotManipulation-PT-00200: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ RobotManipulation-PT-00200 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 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: 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-00200-CTLCardinality.task
lola: ((2 <= off) OR A (G ((((2 <= r_moving) AND (initialized <= p_i2)) OR (initialized + 1 <= r_stopped))))) : E (((p_rdy <= initialized) U ((3 <= p_rel) AND (3 <= r_moving) AND (p_rel <= p_m)))) : E (F (A (G (((1 <= initialize) OR (3 <= moved)))))) : A (G ((A (G ((p_sc <= p_rdy))) OR ((moved <= 2) OR (p_i1 <= 1))))) : (A (G (((p_rel <= 2) OR (p_m + 1 <= p_i1)))) OR A (G (E (G ((initialized <= r_stopped)))))) : A (F ((1 <= r_active))) : NOT(E (F (A (X ((p_i1 <= initialized)))))) : A (G (E (F ((initialized <= 1))))) : NOT(NOT(((1 <= r_stopped) AND E (G ((initialized <= p_rel)))))) : (E (X (A (X ((moved <= p_rel))))) AND E (F (E (X ((r_stopped <= moved)))))) : A (G ((1 <= p_i1))) : E (X (A (G (((3 <= p_i1) AND (1 <= access)))))) : (E (X (E (F ((r_stopped <= p_i2))))) AND ((p_rel <= move) AND ((3 <= p_rel) OR (initialize <= move)))) : A (G (A (((2 <= r_moving) U (r_moving <= p_i1))))) : A (G (E (F ((off <= 2))))) : A (F (((p_sc <= 0) AND (initialized + 1 <= r_active) AND ((off + 1 <= r_active) OR (moved <= 1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= off) OR A (G ((((2 <= r_moving) AND (initialized <= p_i2)) OR (initialized + 1 <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= off)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= off)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.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: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((2 <= r_moving) AND (initialized <= p_i2)) OR (initialized + 1 <= r_stopped))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 401 markings, 400 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p_rdy <= initialized) U ((3 <= p_rel) AND (3 <= r_moving) AND (p_rel <= p_m))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p_rdy <= initialized) U ((3 <= p_rel) AND (3 <= r_moving) AND (p_rel <= p_m)))
lola: processed formula length: 81
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 93636 markings, 187777 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= initialize) OR (3 <= moved))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((initialize <= 0) AND (moved <= 2)))))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1583029 markings, 5974132 edges, 316606 markings/sec, 0 secs
lola: 2865852 markings, 10988908 edges, 256565 markings/sec, 5 secs
lola: 4114148 markings, 15661128 edges, 249659 markings/sec, 10 secs
lola: 5214581 markings, 20057812 edges, 220087 markings/sec, 15 secs
lola: 6416930 markings, 24564152 edges, 240470 markings/sec, 20 secs
lola: 7603394 markings, 29030859 edges, 237293 markings/sec, 25 secs
lola: 8675734 markings, 33314245 edges, 214468 markings/sec, 30 secs
lola: 9811873 markings, 37714580 edges, 227228 markings/sec, 35 secs
lola: 10928492 markings, 42065166 edges, 223324 markings/sec, 40 secs
lola: 11961661 markings, 46234889 edges, 206634 markings/sec, 45 secs
lola: 13144989 markings, 50692209 edges, 236666 markings/sec, 50 secs
lola: 14301154 markings, 55091733 edges, 231233 markings/sec, 55 secs
lola: 15347465 markings, 59265665 edges, 209262 markings/sec, 60 secs
lola: 16356308 markings, 63344125 edges, 201769 markings/sec, 65 secs
lola: 17518386 markings, 67729812 edges, 232416 markings/sec, 70 secs
lola: 18519797 markings, 71781237 edges, 200282 markings/sec, 75 secs
lola: 19527019 markings, 75846172 edges, 201444 markings/sec, 80 secs
lola: 20556876 markings, 79931216 edges, 205971 markings/sec, 85 secs
lola: 21632993 markings, 84069479 edges, 215223 markings/sec, 90 secs
lola: 22600674 markings, 87986550 edges, 193536 markings/sec, 95 secs
lola: 23570469 markings, 91901804 edges, 193959 markings/sec, 100 secs
lola: 24531090 markings, 95788610 edges, 192124 markings/sec, 105 secs
lola: 25486807 markings, 99659608 edges, 191143 markings/sec, 110 secs
lola: 26434141 markings, 103501110 edges, 189467 markings/sec, 115 secs
lola: 27387111 markings, 107360097 edges, 190594 markings/sec, 120 secs
lola: 28338657 markings, 111213749 edges, 190309 markings/sec, 125 secs
lola: 29282198 markings, 115045618 edges, 188708 markings/sec, 130 secs
lola: 30219650 markings, 118849102 edges, 187490 markings/sec, 135 secs
lola: 31164340 markings, 122674223 edges, 188938 markings/sec, 140 secs
lola: 32101275 markings, 126477333 edges, 187387 markings/sec, 145 secs
lola: 33203852 markings, 130648889 edges, 220515 markings/sec, 150 secs
lola: 34144244 markings, 134464430 edges, 188078 markings/sec, 155 secs
lola: 35249824 markings, 138668761 edges, 221116 markings/sec, 160 secs
lola: 36197420 markings, 142493336 edges, 189519 markings/sec, 165 secs
lola: 37127868 markings, 146269404 edges, 186090 markings/sec, 170 secs
lola: 38043754 markings, 149994340 edges, 183177 markings/sec, 175 secs
lola: 38962933 markings, 153729425 edges, 183836 markings/sec, 180 secs
lola: 39893410 markings, 157505601 edges, 186095 markings/sec, 185 secs
lola: 40983740 markings, 161629681 edges, 218066 markings/sec, 190 secs
lola: 41904816 markings, 165368222 edges, 184215 markings/sec, 195 secs
lola: 42898948 markings, 169357823 edges, 198826 markings/sec, 200 secs
lola: 43876869 markings, 173288393 edges, 195584 markings/sec, 205 secs
lola: 44802005 markings, 177036406 edges, 185027 markings/sec, 210 secs
lola: 45716511 markings, 180748132 edges, 182901 markings/sec, 215 secs
lola: 46623735 markings, 184437932 edges, 181445 markings/sec, 220 secs
lola: 47533671 markings, 188137216 edges, 181987 markings/sec, 225 secs
lola: 48432144 markings, 191798455 edges, 179695 markings/sec, 230 secs
lola: 49473213 markings, 195797490 edges, 208214 markings/sec, 235 secs
lola: 50320457 markings, 199179669 edges, 169449 markings/sec, 240 secs
lola: 51212987 markings, 202809034 edges, 178506 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (G ((p_sc <= p_rdy))) OR ((moved <= 2) OR (p_i1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((A (G ((p_sc <= p_rdy))) OR ((moved <= 2) OR (p_i1 <= 1)))))
lola: processed formula: A (G ((A (G ((p_sc <= p_rdy))) OR ((moved <= 2) OR (p_i1 <= 1)))))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 30 unused bits
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: 36372 markings, 68889 edges
lola: ========================================
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p_rel <= 2) OR (p_m + 1 <= p_i1)))) OR A (G (E (G ((initialized <= r_stopped))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_rel <= 2) OR (p_m + 1 <= p_i1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6038 markings, 7245 edges
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((initialized <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (r_stopped + 1 <= initialized))))
lola: processed formula length: 55
lola: 4 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2800 markings, 4005 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= r_active)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= r_active)))
lola: processed formula: A (F ((1 <= r_active)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 31 unused bits
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: 403 markings, 402 edges
lola: ========================================
lola: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (A (X ((p_i1 <= initialized))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX((initialized + 1 <= p_i1)))))
lola: processed formula length: 49
lola: 7 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 401 markings, 400 edges
lola: ========================================
lola: subprocess 7 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((initialized <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (initialized <= 1)))))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1758572 markings, 6554874 edges, 3096157673607921664 markings/sec, 0 secs
lola: 3232483 markings, 12419219 edges, 294782 markings/sec, 5 secs
lola: 4599021 markings, 17821014 edges, 273308 markings/sec, 10 secs
lola: 5871619 markings, 22934023 edges, 254520 markings/sec, 15 secs
lola: 7121022 markings, 27975038 edges, 249881 markings/sec, 20 secs
lola: 8357403 markings, 32967580 edges, 247276 markings/sec, 25 secs
lola: 9582604 markings, 37922620 edges, 245040 markings/sec, 30 secs
lola: 10803392 markings, 42867490 edges, 244158 markings/sec, 35 secs
lola: 12030142 markings, 47839888 edges, 245350 markings/sec, 40 secs
lola: 13246655 markings, 52775674 edges, 243303 markings/sec, 45 secs
lola: 14469220 markings, 57733444 edges, 244513 markings/sec, 50 secs
lola: 15678011 markings, 62637213 edges, 241758 markings/sec, 55 secs
lola: 16881271 markings, 67533451 edges, 240652 markings/sec, 60 secs
lola: 18084057 markings, 72421138 edges, 240557 markings/sec, 65 secs
lola: 19282224 markings, 77288239 edges, 239633 markings/sec, 70 secs
lola: 20478117 markings, 82151034 edges, 239179 markings/sec, 75 secs
lola: 21673685 markings, 87014079 edges, 239114 markings/sec, 80 secs
lola: 22853788 markings, 91820554 edges, 236021 markings/sec, 85 secs
lola: 24041283 markings, 96651817 edges, 237499 markings/sec, 90 secs
lola: 25225641 markings, 101475596 edges, 236872 markings/sec, 95 secs
lola: 26405019 markings, 106276542 edges, 235876 markings/sec, 100 secs
lola: 27577518 markings, 111051215 edges, 234500 markings/sec, 105 secs
lola: 28757073 markings, 115855335 edges, 235911 markings/sec, 110 secs
lola: 29920138 markings, 120596206 edges, 232613 markings/sec, 115 secs
lola: 31087910 markings, 125358471 edges, 233554 markings/sec, 120 secs
lola: 32236018 markings, 130035556 edges, 229622 markings/sec, 125 secs
lola: 33403881 markings, 134800571 edges, 233573 markings/sec, 130 secs
lola: 34467797 markings, 139136978 edges, 212783 markings/sec, 135 secs
lola: 35532615 markings, 143483122 edges, 212964 markings/sec, 140 secs
lola: 36669390 markings, 148121728 edges, 227355 markings/sec, 145 secs
lola: 37807639 markings, 152754363 edges, 227650 markings/sec, 150 secs
lola: 38949379 markings, 157416724 edges, 228348 markings/sec, 155 secs
lola: 40083617 markings, 162048791 edges, 226848 markings/sec, 160 secs
lola: 41214518 markings, 166669291 edges, 226180 markings/sec, 165 secs
lola: 42345484 markings, 171279485 edges, 226193 markings/sec, 170 secs
lola: 43479075 markings, 175907902 edges, 226718 markings/sec, 175 secs
lola: 44622677 markings, 180572530 edges, 228720 markings/sec, 180 secs
lola: 45754196 markings, 185196173 edges, 226304 markings/sec, 185 secs
lola: 46897382 markings, 189858795 edges, 228637 markings/sec, 190 secs
lola: 48024997 markings, 194461370 edges, 225523 markings/sec, 195 secs
lola: 49150274 markings, 199057886 edges, 225055 markings/sec, 200 secs
lola: 50263844 markings, 203615717 edges, 222714 markings/sec, 205 secs
lola: 51378188 markings, 208155079 edges, 222869 markings/sec, 210 secs
lola: 52516564 markings, 212803471 edges, 227675 markings/sec, 215 secs
lola: 53632375 markings, 217357627 edges, 223162 markings/sec, 220 secs
lola: 54753959 markings, 221946405 edges, 224317 markings/sec, 225 secs
lola: 55881945 markings, 226552258 edges, 225597 markings/sec, 230 secs
lola: 56992291 markings, 231095052 edges, 222069 markings/sec, 235 secs
lola: 58101829 markings, 235627450 edges, 221908 markings/sec, 240 secs
lola: 59229446 markings, 240231246 edges, 225523 markings/sec, 245 secs
lola: 60347642 markings, 244799052 edges, 223639 markings/sec, 250 secs
lola: 61462806 markings, 249362115 edges, 223033 markings/sec, 255 secs
lola: 62588031 markings, 253961203 edges, 225045 markings/sec, 260 secs
lola: 63701520 markings, 258506187 edges, 222698 markings/sec, 265 secs
lola: 64814687 markings, 263062944 edges, 222633 markings/sec, 270 secs
lola: 65924113 markings, 267603911 edges, 221885 markings/sec, 275 secs
lola: 67039180 markings, 272161048 edges, 223013 markings/sec, 280 secs
lola: 68152860 markings, 276711038 edges, 222736 markings/sec, 285 secs
lola: 69259347 markings, 281226583 edges, 221297 markings/sec, 290 secs
lola: 70369966 markings, 285780433 edges, 222124 markings/sec, 295 secs
lola: 71474222 markings, 290294113 edges, 220851 markings/sec, 300 secs
lola: 72596375 markings, 294883609 edges, 224431 markings/sec, 305 secs
lola: 73703666 markings, 299411454 edges, 221458 markings/sec, 310 secs
lola: 74805753 markings, 303926234 edges, 220417 markings/sec, 315 secs
lola: 75902677 markings, 308405063 edges, 219385 markings/sec, 320 secs
lola: 77011645 markings, 312943877 edges, 221794 markings/sec, 325 secs
lola: 78124587 markings, 317503960 edges, 222588 markings/sec, 330 secs
lola: 79242553 markings, 322071654 edges, 223593 markings/sec, 335 secs
lola: 80350166 markings, 326598644 edges, 221523 markings/sec, 340 secs
lola: 81449987 markings, 331097740 edges, 219964 markings/sec, 345 secs
lola: 82558171 markings, 335630705 edges, 221637 markings/sec, 350 secs
lola: 83649471 markings, 340094050 edges, 218260 markings/sec, 355 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(((1 <= r_stopped) AND E (G ((initialized <= p_rel))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 365 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= r_stopped)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= r_stopped)
lola: processed formula length: 16
lola: 10 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: processed formula with 1 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: ========================================
lola: subprocess 9 will run for 417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((initialized <= p_rel)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p_rel + 1 <= initialized)))
lola: processed formula length: 41
lola: 12 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 403 markings, 402 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (X ((moved <= p_rel))))) AND E (F (E (X ((r_stopped <= moved))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 417 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((moved <= p_rel)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((moved <= p_rel)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((r_stopped <= moved)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((r_stopped <= moved)))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 801 markings, 800 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p_i1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-00200-CTLCardinality-10.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 402 markings, 401 edges
lola: ========================================
lola: subprocess 11 will run for 584 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (((3 <= p_i1) AND (1 <= access))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U ((p_i1 <= 2) OR (access <= 0)))))
lola: processed formula length: 50
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 399 markings, 398 edges
lola: ========================================
lola: subprocess 12 will run for 730 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((r_stopped <= p_i2))))) AND ((p_rel <= move) AND ((3 <= p_rel) OR (initialize <= move))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 730 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((r_stopped <= p_i2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (r_stopped <= p_i2)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 400 markings, 399 edges
lola: ========================================
lola: subprocess 13 will run for 973 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p_rel <= move) AND ((3 <= p_rel) OR (initialize <= move)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p_rel <= move) AND ((3 <= p_rel) OR (initialize <= move)))
lola: processed formula length: 61
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: processed formula with 3 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 973 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((2 <= r_moving) U (r_moving <= p_i1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((2 <= r_moving) U (r_moving <= p_i1)))))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2003 markings, 4005 edges
lola: ========================================
lola: subprocess 14 will run for 1460 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((off <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (off <= 2)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 643202 markings, 2159423 edges
lola: ========================================
lola: subprocess 15 will run for 2919 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p_sc <= 0) AND (initialized + 1 <= r_active) AND ((off + 1 <= r_active) OR (moved <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p_sc <= 0) AND (initialized + 1 <= r_active) AND ((off + 1 <= r_active) OR (moved <= 1)))))
lola: processed formula: A (F (((p_sc <= 0) AND (initialized + 1 <= r_active) AND ((off + 1 <= r_active) OR (moved <= 1)))))
lola: processed formula length: 100
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 31 unused bits
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: 1202 markings, 1201 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown no no yes no unknown no yes no no yes no yes yes
FORMULA RobotManipulation-PT-00200-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00200-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished 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-00200"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-full"
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

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00200.tgz
mv RobotManipulation-PT-00200 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-full"
echo " Input is RobotManipulation-PT-00200, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-152685548800052"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;