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.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K 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 16K 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 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 23K 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.1K 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 mcc4mcc-structural
Input is RobotManipulation-PT-00100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266800477
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527495942671


BK_STOP 1527496310618

--------------------
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 RobotManipulation-PT-00100 as instance name.
Using RobotManipulation 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': 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': 497, 'Memory': 107.48, 'Tool': 'lola'}, {'Time': 3510769, 'Memory': 7918.48, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola RobotManipulation-PT-00100...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-00100: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ RobotManipulation-PT-00100 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 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-00100-LTLCardinality.task
lola: A (F ((F ((access <= p_i2)) U F ((1 <= initialize))))) : A (X (G (G (X ((2 <= p_i1)))))) : A ((p_i2 <= initialize)) : A (X ((G ((3 <= p_m)) U G ((p_sc <= initialize))))) : A (F ((initialized <= moved))) : A (F (G (X (X ((r_moving <= r_active)))))) : A (X (X (X (F ((off <= initialized)))))) : A (X (G (X (F ((2 <= initialized)))))) : A ((p_rel <= p_m)) : A (F ((off <= r_stopped))) : A ((3 <= r_stopped)) : A ((p_rel <= p_i1)) : A (F (G (X (G ((2 <= off)))))) : A (G (G (F (X ((r_stopped <= moved)))))) : A ((1 <= r_moving)) : A (F (F (((access <= r_stopped) U (1 <= r_stopped)))))
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 ((access <= p_i2)) U F ((1 <= initialize)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((access <= p_i2)) U F ((1 <= initialize)))))
lola: processed formula: A (F ((F ((access <= p_i2)) U F ((1 <= initialize)))))
lola: processed formula length: 54
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G (X ((2 <= p_i1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G (X ((2 <= p_i1))))))
lola: processed formula: A (X (G (G (X ((2 <= p_i1))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 29 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: 1203 markings, 1203 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p_i2 <= initialize))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_i2 <= initialize)
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((3 <= p_m)) U G ((p_sc <= initialize)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((3 <= p_m)) U G ((p_sc <= initialize)))))
lola: processed formula: A (X ((G ((3 <= p_m)) U G ((p_sc <= initialize)))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 29 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: 1023 markings, 1029 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((initialized <= moved)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((initialized <= moved)))
lola: processed formula: A (F ((initialized <= moved)))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (X ((r_moving <= r_active))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (X ((r_moving <= r_active))))))
lola: processed formula: A (F (G (X (X ((r_moving <= r_active))))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 1706906 markings, 5565854 edges, 341381 markings/sec, 0 secs
lola: 3142607 markings, 10773722 edges, 287140 markings/sec, 5 secs
lola: 4469720 markings, 15744445 edges, 265423 markings/sec, 10 secs
lola: 5773223 markings, 20710523 edges, 260701 markings/sec, 15 secs
lola: 7028141 markings, 25631845 edges, 250984 markings/sec, 20 secs
lola: 8281684 markings, 30524010 edges, 250709 markings/sec, 25 secs
lola: 9488962 markings, 35335911 edges, 241456 markings/sec, 30 secs
lola: 10694941 markings, 40115411 edges, 241196 markings/sec, 35 secs
lola: 11848201 markings, 44803449 edges, 230652 markings/sec, 40 secs
lola: 12981930 markings, 49460245 edges, 226746 markings/sec, 45 secs
lola: 14123912 markings, 54099814 edges, 228396 markings/sec, 50 secs
lola: 15257066 markings, 58717148 edges, 226631 markings/sec, 55 secs
lola: 16371954 markings, 63264733 edges, 222978 markings/sec, 60 secs
lola: 17465225 markings, 67783608 edges, 218654 markings/sec, 65 secs
lola: 18550036 markings, 72281166 edges, 216962 markings/sec, 70 secs
lola: 19613971 markings, 76746735 edges, 212787 markings/sec, 75 secs
lola: 20682541 markings, 81216348 edges, 213714 markings/sec, 80 secs
lola: 21741324 markings, 85657656 edges, 211757 markings/sec, 85 secs
lola: 22765605 markings, 89955939 edges, 204856 markings/sec, 90 secs
lola: 23791821 markings, 94351852 edges, 205243 markings/sec, 95 secs
lola: 24820997 markings, 98739778 edges, 205835 markings/sec, 100 secs
lola: 25857317 markings, 103132679 edges, 207264 markings/sec, 105 secs
lola: 26882714 markings, 107504833 edges, 205079 markings/sec, 110 secs
lola: 27890957 markings, 111837135 edges, 201649 markings/sec, 115 secs
lola: 28940008 markings, 116194756 edges, 209810 markings/sec, 120 secs
lola: 29931861 markings, 120456544 edges, 198371 markings/sec, 125 secs
lola: 30792286 markings, 124216022 edges, 172085 markings/sec, 130 secs
lola: 31771552 markings, 128386539 edges, 195853 markings/sec, 135 secs
lola: 32767862 markings, 132607566 edges, 199262 markings/sec, 140 secs
lola: 33750168 markings, 136833181 edges, 196461 markings/sec, 145 secs
lola: 34752474 markings, 141086232 edges, 200461 markings/sec, 150 secs
lola: 35702014 markings, 145273986 edges, 189908 markings/sec, 155 secs
lola: 36652717 markings, 149452546 edges, 190141 markings/sec, 160 secs
lola: 37614020 markings, 153642661 edges, 192261 markings/sec, 165 secs
lola: 38595994 markings, 157850052 edges, 196395 markings/sec, 170 secs
lola: 39554605 markings, 162026937 edges, 191722 markings/sec, 175 secs
lola: 40516396 markings, 166207563 edges, 192358 markings/sec, 180 secs
lola: 41455408 markings, 170326347 edges, 187802 markings/sec, 185 secs
lola: 42401353 markings, 174431258 edges, 189189 markings/sec, 190 secs
lola: 43310847 markings, 178469930 edges, 181899 markings/sec, 195 secs
lola: 44231369 markings, 182547929 edges, 184104 markings/sec, 200 secs
lola: 45176882 markings, 186670785 edges, 189103 markings/sec, 205 secs
lola: 46113843 markings, 190769303 edges, 187392 markings/sec, 210 secs
lola: 47027679 markings, 194850483 edges, 182767 markings/sec, 215 secs
lola: 47952065 markings, 198929941 edges, 184877 markings/sec, 220 secs
lola: 48895974 markings, 203032208 edges, 188782 markings/sec, 225 secs
lola: 49839503 markings, 207134363 edges, 188706 markings/sec, 230 secs
lola: 50775837 markings, 211221976 edges, 187267 markings/sec, 235 secs
lola: 51671723 markings, 215246387 edges, 179177 markings/sec, 240 secs
lola: 52575441 markings, 219276022 edges, 180744 markings/sec, 245 secs
lola: 53478205 markings, 223295432 edges, 180553 markings/sec, 250 secs
lola: 54399993 markings, 227350197 edges, 184358 markings/sec, 255 secs
lola: 55310421 markings, 231378001 edges, 182086 markings/sec, 260 secs
lola: 56233329 markings, 235410786 edges, 184582 markings/sec, 265 secs
lola: 57144205 markings, 239429230 edges, 182175 markings/sec, 270 secs
lola: 58025441 markings, 243411600 edges, 176247 markings/sec, 275 secs
lola: 58928172 markings, 247419365 edges, 180546 markings/sec, 280 secs
lola: 59810432 markings, 251389407 edges, 176452 markings/sec, 285 secs
lola: 60716386 markings, 255391703 edges, 181191 markings/sec, 290 secs
lola: 61590232 markings, 259345043 edges, 174769 markings/sec, 295 secs
lola: 62463627 markings, 263291665 edges, 174679 markings/sec, 300 secs
lola: 63346784 markings, 267257521 edges, 176631 markings/sec, 305 secs
lola: 64226074 markings, 271212803 edges, 175858 markings/sec, 310 secs
lola: 65123436 markings, 275194951 edges, 179472 markings/sec, 315 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (F ((off <= initialized))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X (F ((off <= initialized))))))
lola: processed formula: A (X (X (X (F ((off <= initialized))))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 29 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: 7 markings, 7 edges
lola: ========================================
lola: subprocess 7 will run for 357 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (F ((2 <= initialized))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (F ((2 <= initialized))))))
lola: processed formula: A (X (G (X (F ((2 <= initialized))))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.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: 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: 1204 markings, 1204 edges
lola: ========================================
lola: subprocess 8 will run for 402 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p_rel <= p_m))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_rel <= p_m)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-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 9 will run for 459 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((off <= r_stopped)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((off <= r_stopped)))
lola: processed formula: A (F ((off <= r_stopped)))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 536 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= r_stopped))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= r_stopped)
lola: processed formula length: 16
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-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 11 will run for 643 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p_rel <= p_i1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p_rel <= p_i1)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-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 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G ((2 <= off))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (G ((2 <= off))))))
lola: processed formula: A (F (G (X (G ((2 <= off))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 29 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: 1006 markings, 1007 edges
lola: ========================================
lola: subprocess 13 will run for 1072 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (X ((r_stopped <= moved))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (F (X ((r_stopped <= moved))))))
lola: processed formula: A (G (G (F (X ((r_stopped <= moved))))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 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: 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: 2595 markings, 2793 edges
lola: ========================================
lola: subprocess 14 will run for 1609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= r_moving))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= r_moving)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-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 15 will run for 3218 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((access <= r_stopped) U (1 <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((access <= r_stopped) U (1 <= r_stopped))))
lola: processed formula: A (F (((access <= r_stopped) U (1 <= r_stopped))))
lola: processed formula length: 50
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00100-LTLCardinality.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: 1 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no yes unknown yes no yes yes yes yes no no no yes
FORMULA RobotManipulation-PT-00100-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00100-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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-00100"
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/RobotManipulation-PT-00100.tgz
mv RobotManipulation-PT-00100 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 RobotManipulation-PT-00100, 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-152732266800477"
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 ;