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 496K
-rw-r--r-- 1 mcc users 3.9K 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 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.9K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K 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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 325K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DLCround-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266400175
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527443596538


BK_STOP 1527443877660

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DLCround-PT-06a as instance name.
Using DLCround as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 4532, 'Memory': 348.75, 'Tool': 'itstools'}, {'Time': 1870757, 'Memory': 15941.57, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 412.7883936451898x far from the best tool itstools.
LTLCardinality lola DLCround-PT-06a...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DLCround-PT-06a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DLCround-PT-06a: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ DLCround-PT-06a @ 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: 1510/65536 symbol table entries, 6 collisions
lola: preprocessing...
lola: finding significant places
lola: 197 places, 1313 transitions, 88 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1136 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-06a-LTLCardinality.task
lola: A (F (F ((1 <= p22)))) : A (X (G (X (X ((p185 <= p144)))))) : A ((F ((p122 <= p150)) U G (X ((p158 <= p35))))) : A (((p133 <= p0) U X ((1 <= p159)))) : A ((p56 <= p194)) : A (F (X (F (X ((1 <= p63)))))) : A ((p53 <= p170)) : A (X (F (((p14 <= p27) U (3 <= p192))))) : A (F ((p62 <= p185))) : A (F (F (((2 <= p192) U (p106 <= p93))))) : A (F (X (X (G ((3 <= p63)))))) : A (X (X ((p141 <= p118)))) : A ((1 <= p71)) : A (X ((G ((1 <= p34)) U X ((p45 <= p111))))) : A ((((p93 <= p182) U (p181 <= p5)) U ((3 <= p8) U (1 <= p126)))) : A ((1 <= p96))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F ((1 <= p22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= p22)))
lola: processed formula: A (F ((1 <= p22)))
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 7 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (X ((p185 <= p144))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (X ((p185 <= p144))))))
lola: processed formula: A (X (G (X (X ((p185 <= p144))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 296456 markings, 5990192 edges, 59291 markings/sec, 0 secs
lola: 610631 markings, 12215206 edges, 62835 markings/sec, 5 secs
lola: 908930 markings, 18618407 edges, 59660 markings/sec, 10 secs
lola: 1179017 markings, 24798693 edges, 54017 markings/sec, 15 secs
lola: 1464103 markings, 31195092 edges, 57017 markings/sec, 20 secs
lola: 1744236 markings, 37543538 edges, 56027 markings/sec, 25 secs
lola: 2006176 markings, 43783403 edges, 52388 markings/sec, 30 secs
lola: 2261105 markings, 49955024 edges, 50986 markings/sec, 35 secs
lola: 2539703 markings, 56060523 edges, 55720 markings/sec, 40 secs
lola: 2793010 markings, 62153167 edges, 50661 markings/sec, 45 secs
lola: 3067359 markings, 68415662 edges, 54870 markings/sec, 50 secs
lola: 3356493 markings, 74735939 edges, 57827 markings/sec, 55 secs
lola: 3606037 markings, 81129025 edges, 49909 markings/sec, 60 secs
lola: 3859774 markings, 87514873 edges, 50747 markings/sec, 65 secs
lola: 4099372 markings, 93910281 edges, 47920 markings/sec, 70 secs
lola: 4315479 markings, 100357184 edges, 43221 markings/sec, 75 secs
lola: 4597212 markings, 106372137 edges, 56347 markings/sec, 80 secs
lola: 4848994 markings, 112527375 edges, 50356 markings/sec, 85 secs
lola: 5053414 markings, 118909997 edges, 40884 markings/sec, 90 secs
lola: 5322787 markings, 125657420 edges, 53875 markings/sec, 95 secs
lola: 5538098 markings, 132473201 edges, 43062 markings/sec, 100 secs
lola: 5745698 markings, 139202082 edges, 41520 markings/sec, 105 secs
lola: 5959807 markings, 145940938 edges, 42822 markings/sec, 110 secs
lola: 6215652 markings, 152427937 edges, 51169 markings/sec, 115 secs
lola: 6415452 markings, 158925510 edges, 39960 markings/sec, 120 secs
lola: 6596403 markings, 165522589 edges, 36190 markings/sec, 125 secs
lola: 6848995 markings, 171592139 edges, 50518 markings/sec, 130 secs
lola: 7050831 markings, 178029306 edges, 40367 markings/sec, 135 secs
lola: 7284206 markings, 184221025 edges, 46675 markings/sec, 140 secs
lola: 7500468 markings, 190504362 edges, 43252 markings/sec, 145 secs
lola: 7712799 markings, 196711196 edges, 42466 markings/sec, 150 secs
lola: 7970750 markings, 202887885 edges, 51590 markings/sec, 155 secs
lola: 8249200 markings, 208763928 edges, 55690 markings/sec, 160 secs
lola: 8511338 markings, 214996515 edges, 52428 markings/sec, 165 secs
lola: 8726362 markings, 221230103 edges, 43005 markings/sec, 170 secs
lola: 8918526 markings, 227537116 edges, 38433 markings/sec, 175 secs
lola: 9114639 markings, 233703884 edges, 39223 markings/sec, 180 secs
lola: 9291705 markings, 239991040 edges, 35413 markings/sec, 185 secs
lola: 9488351 markings, 246103922 edges, 39329 markings/sec, 190 secs
lola: 9684604 markings, 252202968 edges, 39251 markings/sec, 195 secs
lola: 9872781 markings, 258397456 edges, 37635 markings/sec, 200 secs
lola: 10032887 markings, 264731152 edges, 32021 markings/sec, 205 secs
lola: 10199327 markings, 270964546 edges, 33288 markings/sec, 210 secs
lola: 10375986 markings, 277099148 edges, 35332 markings/sec, 215 secs
lola: 10565819 markings, 283227593 edges, 37967 markings/sec, 220 secs
lola: 10751134 markings, 289439153 edges, 37063 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((p122 <= p150)) U G (X ((p158 <= p35)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((p122 <= p150)) U G (X ((p158 <= p35)))))
lola: processed formula: A ((F ((p122 <= p150)) U G (X ((p158 <= p35)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6 markings, 7 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p133 <= p0) U X ((1 <= p159))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p133 <= p0) U X ((1 <= p159))))
lola: processed formula: A (((p133 <= p0) U X ((1 <= p159))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p56 <= p194))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p56 <= p194)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.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 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (X ((1 <= p63))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (F (X ((1 <= p63))))))
lola: processed formula: A (F (X (F (X ((1 <= p63))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p53 <= p170))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p53 <= p170)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.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 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (((p14 <= p27) U (3 <= p192)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (((p14 <= p27) U (3 <= p192)))))
lola: processed formula: A (X (F (((p14 <= p27) U (3 <= p192)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p62 <= p185)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p62 <= p185)))
lola: processed formula: A (F ((p62 <= p185)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 7 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((2 <= p192) U (p106 <= p93)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p192) U (p106 <= p93))))
lola: processed formula: A (F (((2 <= p192) U (p106 <= p93))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 7 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (G ((3 <= p63))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (X (X (G ((3 <= p63))))))
lola: processed formula: A (F (X (X (G ((3 <= p63))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((p141 <= p118))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((p141 <= p118))))
lola: processed formula: A (X (X ((p141 <= p118))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 29 markings, 233 edges
lola: ========================================
lola: subprocess 12 will run for 826 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p71))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p71)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((1 <= p34)) U X ((p45 <= p111)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((1 <= p34)) U X ((p45 <= p111)))))
lola: processed formula: A (X ((G ((1 <= p34)) U X ((p45 <= p111)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 83 markings, 697 edges
lola: ========================================
lola: subprocess 14 will run for 1652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p93 <= p182) U (p181 <= p5)) U ((3 <= p8) U (1 <= p126))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p93 <= p182) U (p181 <= p5)) U ((3 <= p8) U (1 <= p126))))
lola: processed formula: A ((((p93 <= p182) U (p181 <= p5)) U ((3 <= p8) U (1 <= p126))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 15 will run for 3304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p96))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p96)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 197 places; total mentions: 0
lola: closed formula file DLCround-PT-06a-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no yes yes no yes no yes yes no yes no yes yes no
FORMULA DLCround-PT-06a-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-06a-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- 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="DLCround-PT-06a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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/DLCround-PT-06a.tgz
mv DLCround-PT-06a 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 mcc4mcc-structural"
echo " Input is DLCround-PT-06a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r215-smll-152732266400175"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.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 ;