About the Execution of Irma.full for BridgeAndVehicles-COL-V04P05N02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
429.050 | 44715.00 | 5252.00 | 248.50 | FFFFFTFFFTFTFFFF | 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 224K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K 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:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_pt
-rw-r--r-- 1 mcc users 10 May 15 18:49 instance
-rw-r--r-- 1 mcc users 5 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 37K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is BridgeAndVehicles-COL-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-ebro-152646308100115
=====================================================================
--------------------
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 BridgeAndVehicles-COL-V04P05N02-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526747890094
BK_STOP 1526747934809
--------------------
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 BridgeAndVehicles-COL-V04P05N02 as instance name.
Using BridgeAndVehicles as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 234, 'Memory': 111.39, 'Tool': 'lola'}, {'Time': 244, 'Memory': 111.86, 'Tool': 'lola'}, {'Time': 424, 'Memory': 101.23, 'Tool': 'gspn'}, {'Time': 2511, 'Memory': 166.59, 'Tool': 'gspn'}, {'Time': 4410, 'Memory': 311.7, 'Tool': 'itstools'}, {'Time': 4582, 'Memory': 303.89, 'Tool': 'itstools'}, {'Time': 12745, 'Memory': 7538.88, 'Tool': 'marcie'}, {'Time': 13236, 'Memory': 7538.73, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola BridgeAndVehicles-COL-V04P05N02...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
BridgeAndVehicles-COL-V04P05N02: translating COL Petri net model.pnml into LoLA format
===========================================================================================
translating COL Petri net complete
checking for too many tokens
===========================================================================================
BridgeAndVehicles-COL-V04P05N02: translating COL formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ BridgeAndVehicles-COL-V04P05N02 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 80/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 28 places, 52 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 85 transition conflict sets
lola: TASK
lola: reading formula from BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: ((((((p9 <= p25 + p24 + p23 + p22 + p26) OR (p11 + p12 <= p21))) OR ((p4 <= p15 + p16 + p17 + p18 + p19) AND (2 <= p27) AND (p13 + p14 <= p11 + p12))) AND (((p5 + p6 + 1 <= p0) AND (p25 + p24 + p23 + p22 + p26 <= p21)) AND E (X ((3 <= p11 + p12))))) OR NOT((E (G ((p9 <= p1 + p2 + p3))) AND (p13 + p14 <= p5 + p6)))) : A (G (A (F ((p0 <= 2))))) : (E (X (A (F ((3 <= p15 + p16 + p17 + p18 + p19))))) OR ((((p11 + p12 <= 0) AND (p4 <= 0)) OR ((p0 + 1 <= p27) AND (p10 <= 2))) AND (p8 <= 1))) : E (F (E (G ((p7 + 1 <= p13 + p14))))) : NOT(NOT((A (F ((3 <= p1 + p2 + p3))) OR (3 <= p10)))) : (E (G (A (F ((p13 + p14 <= p4))))) AND ((p10 + 1 <= p25 + p24 + p23 + p22 + p26) AND (p13 + p14 <= 1))) : E (F ((3 <= p5 + p6))) : A (G (A (F ((p1 + p2 + p3 <= p21))))) : A ((E (F ((2 <= p13 + p14))) U (((1 <= p13 + p14) AND (1 <= p13 + p14)) OR ((p0 <= p10) AND (p21 <= p20))))) : E (X (A (G ((p11 + p12 <= 1))))) : ((((p15 + p16 + p17 + p18 + p19 <= p1 + p2 + p3) OR (3 <= p11 + p12)) AND ((p1 + p2 + p3 <= p27) OR (1 <= p0)) AND (2 <= p8) AND ((p10 <= p4) OR (1 <= p21))) AND ((E (F ((3 <= p1 + p2 + p3))) OR A (F ((3 <= p1 + p2 + p3)))) OR (E (F ((2 <= p1 + p2 + p3))) AND (p10 <= p9)))) : (A (F ((1 <= p10))) AND NOT((((p1 + p2 + p3 <= p9) AND (p11 + p12 <= p0) AND ((p5 + p6 <= p0) OR (3 <= p15 + p16 + p17 + p18 + p19))) AND E (X ((1 <= p11 + p12)))))) : A (F ((3 <= p11 + p12))) : A ((A (X ((p21 <= p0))) U ((2 <= p21) OR (p15 + p16 + p17 + p18 + p19 + 1 <= p1 + p2 + p3)))) : A (G ((E (F ((1 <= p13 + p14))) OR (3 <= p9)))) : (((2 <= p10) OR A (F ((2 <= p13 + p14)))) AND E (F (E (G ((p7 <= p27))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((((p9 <= p25 + p24 + p23 + p22 + p26) OR (p11 + p12 <= p21))) OR ((p4 <= p15 + p16 + p17 + p18 + p19) AND (2 <= p27) AND (p13 + p14 <= p11 + p12))) AND (((p5 + p6 + 1 <= p0) AND (p25 + p24 + p23 + p22 + p26 <= p21)) AND E (X ((3 <= p11 + p12))))) OR NOT((E (G ((p9 <= p1 + p2 + p3))) AND (p13 + p14 <= p5 + p6))))
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: ((((p9 <= p25 + p24 + p23 + p22 + p26) OR (p11 + p12 <= p21))) OR ((p4 <= p15 + p16 + p17 + p18 + p19) AND (2 <= p27) AND (p13 + p14 <= p11 + p12)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((p9 <= p25 + p24 + p23 + p22 + p26) OR (p11 + p12 <= p21))) OR ((p4 <= p15 + p16 + p17 + p18 + p19) AND (2 <= p27) AND (p13 + p14 <= p11 + p12)))
lola: processed formula length: 150
lola: 5 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: processed formula with 5 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p5 + p6 + 1 <= p0) AND (p25 + p24 + p23 + p22 + p26 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p5 + p6 + 1 <= p0) AND (p25 + p24 + p23 + p22 + p26 <= p21))
lola: processed formula length: 62
lola: 5 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: processed formula with 2 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p1 + p2 + p3 + 1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p1 + p2 + p3 + 1 <= p9)))
lola: processed formula: A (F ((p1 + p2 + p3 + 1 <= p9)))
lola: processed formula length: 32
lola: 5 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p5 + p6 + 1 <= p13 + p14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p5 + p6 + 1 <= p13 + p14)
lola: processed formula length: 26
lola: 5 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p0 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p0 <= 2)))))
lola: processed formula length: 39
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 45 markings, 45 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (A (F ((3 <= p15 + p16 + p17 + p18 + p19))))) OR ((((p11 + p12 <= 0) AND (p4 <= 0)) OR ((p0 + 1 <= p27) AND (p10 <= 2))) AND (p8 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((3 <= p15 + p16 + p17 + p18 + p19)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (3 <= p15 + p16 + p17 + p18 + p19)))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 86 markings, 86 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p11 + p12 <= 0) AND (p4 <= 0)) OR ((p0 + 1 <= p27) AND (p10 <= 2))) AND (p8 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((p11 + p12 <= 0) AND (p4 <= 0)) OR ((p0 + 1 <= p27) AND (p10 <= 2))) AND (p8 <= 1))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: processed formula with 5 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p7 + 1 <= p13 + p14)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p13 + p14 <= p7))))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 2728 markings, 9795 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((A (F ((3 <= p1 + p2 + p3))) OR (3 <= p10))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p1 + p2 + p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p1 + p2 + p3)))
lola: processed formula: A (F ((3 <= p1 + p2 + p3)))
lola: processed formula length: 27
lola: 10 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p10)
lola: processed formula length: 10
lola: 10 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((p13 + p14 <= p4))))) AND ((p10 + 1 <= p25 + p24 + p23 + p22 + p26) AND (p13 + p14 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p13 + p14 <= p4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p13 + p14 <= p4)))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 69 markings, 118 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p10 + 1 <= p25 + p24 + p23 + p22 + p26) AND (p13 + p14 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p10 + 1 <= p25 + p24 + p23 + p22 + p26) AND (p13 + p14 <= 1))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: processed formula with 2 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p5 + p6)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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 BridgeAndVehicles-COL-V04P05N02-CTLCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1743 markings, 3298 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p1 + p2 + p3 <= p21)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p1 + p2 + p3 <= p21)))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 652 markings, 1380 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((2 <= p13 + p14))) U (((1 <= p13 + p14) AND (1 <= p13 + p14)) OR ((p0 <= p10) AND (p21 <= p20)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (2 <= p13 + p14)) U (((1 <= p13 + p14) AND (1 <= p13 + p14)) OR ((p0 <= p10) AND (p21 <= p20))))
lola: processed formula length: 108
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 2874 markings, 7161 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((p11 + p12 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (2 <= p11 + p12))))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 2849 markings, 7095 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p15 + p16 + p17 + p18 + p19 <= p1 + p2 + p3) OR (3 <= p11 + p12)) AND ((p1 + p2 + p3 <= p27) OR (1 <= p0)) AND (2 <= p8) AND ((p10 <= p4) OR (1 <= p21))) AND ((E (F ((3 <= p1 + p2 + p3))) OR A (F ((3 <= p1 + p2 + p3)))) OR (E (F ((2 <= p1 + p2 + p3))) AND (p10 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p15 + p16 + p17 + p18 + p19 <= p1 + p2 + p3) OR (3 <= p11 + p12)) AND ((p1 + p2 + p3 <= p27) OR (1 <= p0)) AND (2 <= p8) AND ((p10 <= p4) OR (1 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p15 + p16 + p17 + p18 + p19 <= p1 + p2 + p3) OR (3 <= p11 + p12)) AND ((p1 + p2 + p3 <= p27) OR (1 <= p0)) AND (2 <= p8) AND ((p10 <= p4) OR (1 <= p21)))
lola: processed formula length: 159
lola: 1 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: processed formula with 7 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1 + p2 + p3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p1 + p2 + p3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p1 + p2 + p3)))
lola: processed formula: A (F ((3 <= p1 + p2 + p3)))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p1 + p2 + p3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to BridgeAndVehicles-COL-V04P05N02-CTLCardinality-13.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((1 <= p10))) AND NOT((((p1 + p2 + p3 <= p9) AND (p11 + p12 <= p0) AND ((p5 + p6 <= p0) OR (3 <= p15 + p16 + p17 + p18 + p19))) AND E (X ((1 <= p11 + p12))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= p10)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p10)))
lola: processed formula: A (F ((1 <= p10)))
lola: processed formula length: 18
lola: 5 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: 692 markings, 1229 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p9 + 1 <= p1 + p2 + p3) OR (p0 + 1 <= p11 + p12) OR ((p0 + 1 <= p5 + p6) AND (p15 + p16 + p17 + p18 + p19 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p9 + 1 <= p1 + p2 + p3) OR (p0 + 1 <= p11 + p12) OR ((p0 + 1 <= p5 + p6) AND (p15 + p16 + p17 + p18 + p19 <= 2)))
lola: processed formula length: 117
lola: 5 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: processed formula with 4 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 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p11 + p12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p11 + p12)))
lola: processed formula: A (F ((3 <= p11 + p12)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 45 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (X ((p21 <= p0))) U ((2 <= p21) OR (p15 + p16 + p17 + p18 + p19 + 1 <= p1 + p2 + p3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(AX((p21 <= p0)) U ((2 <= p21) OR (p15 + p16 + p17 + p18 + p19 + 1 <= p1 + p2 + p3)))
lola: processed formula length: 87
lola: 2 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 45 markings, 44 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((1 <= p13 + p14))) OR (3 <= p9))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (1 <= p13 + p14))) AND (p9 <= 2))))
lola: processed formula length: 62
lola: 4 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 45 markings, 123 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p10) OR A (F ((2 <= p13 + p14)))) AND E (F (E (G ((p7 <= p27))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p10)
lola: processed formula length: 10
lola: 0 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((p7 <= p27)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (p27 + 1 <= p7))))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 28 places; total mentions: 0
lola: closed formula file BridgeAndVehicles-COL-V04P05N02-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 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: 2728 markings, 13212 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no no no yes no yes no no no no
----- Kill lola and sara stderr -----
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----
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="BridgeAndVehicles-COL-V04P05N02"
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/BridgeAndVehicles-COL-V04P05N02.tgz
mv BridgeAndVehicles-COL-V04P05N02 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 BridgeAndVehicles-COL-V04P05N02, 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 r030-ebro-152646308100115"
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 '
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 ;