About the Execution of Irma.struct for DLCshifumi-PT-2b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3964.060 | 283177.00 | 243967.00 | 1403.00 | T?FFFFFTFFFTFFFF | 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 896K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.6K 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 8.7K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 107 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 345 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K 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.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 729K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DLCshifumi-PT-2b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732261700209
=====================================================================
--------------------
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 DLCshifumi-PT-2b-LTLCardinality-00
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-01
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-02
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-03
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-04
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-05
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-06
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-07
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-08
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-09
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-10
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-11
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-12
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-13
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-14
FORMULA_NAME DLCshifumi-PT-2b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527410683694
BK_STOP 1527410966871
--------------------
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 DLCshifumi-PT-2b as instance name.
Using DLCshifumi 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': 900933, 'Memory': 3996.38, 'Tool': 'lola'}, {'Time': 900942, 'Memory': 3977.5, 'Tool': 'lola'}, {'Time': 2967676, 'Memory': 15925.51, 'Tool': 'itstools'}, {'Time': 2993075, 'Memory': 15948.51, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola DLCshifumi-PT-2b...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DLCshifumi-PT-2b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
DLCshifumi-PT-2b: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ DLCshifumi-PT-2b @ 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: 5666/65536 symbol table entries, 573 collisions
lola: preprocessing...
lola: finding significant places
lola: 2483 places, 3183 transitions, 2404 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3873 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-2b-LTLCardinality.task
lola: A (F ((p2436 <= p1228))) : A ((X ((1 <= p2197)) U F (G ((p19 <= p9))))) : A (((1 <= p1970) U G (F ((3 <= p307))))) : A (G (X ((p2468 <= p911)))) : A (G (F (((1 <= p283) U (2 <= p1797))))) : A (X (F ((3 <= p2203)))) : A (F ((3 <= p1886))) : A ((p2183 <= p952)) : A (G (X (X (F ((1 <= p504)))))) : A ((F ((3 <= p1561)) U F (F ((3 <= p245))))) : A (G ((3 <= p2107))) : A (X ((G ((p522 <= p44)) U (p857 <= p2123)))) : A ((2 <= p1816)) : A ((2 <= p1473)) : A (G ((p602 <= p1280))) : A (F (F (((1 <= p704) U (1 <= p829)))))
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 ((p2436 <= p1228)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p2436 <= p1228)))
lola: processed formula: A (F ((p2436 <= p1228)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 27 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((1 <= p2197)) U F (G ((p19 <= p9)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((1 <= p2197)) U F (G ((p19 <= p9)))))
lola: processed formula: A ((X ((1 <= p2197)) U F (G ((p19 <= p9)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 26 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 337049 markings, 475269 edges, 67410 markings/sec, 0 secs
lola: 689385 markings, 972509 edges, 70467 markings/sec, 5 secs
lola: 1047151 markings, 1485345 edges, 71553 markings/sec, 10 secs
lola: 1410151 markings, 2004787 edges, 72600 markings/sec, 15 secs
lola: 1771812 markings, 2520696 edges, 72332 markings/sec, 20 secs
lola: 2149102 markings, 3029148 edges, 75458 markings/sec, 25 secs
lola: 2514340 markings, 3536804 edges, 73048 markings/sec, 30 secs
lola: 2871579 markings, 4036940 edges, 71448 markings/sec, 35 secs
lola: 3225172 markings, 4539279 edges, 70719 markings/sec, 40 secs
lola: 3580990 markings, 5037411 edges, 71164 markings/sec, 45 secs
lola: 3940468 markings, 5536607 edges, 71896 markings/sec, 50 secs
lola: 4278226 markings, 6025075 edges, 67552 markings/sec, 55 secs
lola: 4625636 markings, 6524324 edges, 69482 markings/sec, 60 secs
lola: 4977948 markings, 7023023 edges, 70462 markings/sec, 65 secs
lola: 5329759 markings, 7527090 edges, 70362 markings/sec, 70 secs
lola: 5685137 markings, 8032276 edges, 71076 markings/sec, 75 secs
lola: 6045165 markings, 8533882 edges, 72006 markings/sec, 80 secs
lola: 6405171 markings, 9044144 edges, 72001 markings/sec, 85 secs
lola: 6768251 markings, 9544747 edges, 72616 markings/sec, 90 secs
lola: 7121653 markings, 10037768 edges, 70680 markings/sec, 95 secs
lola: 7472212 markings, 10532254 edges, 70112 markings/sec, 100 secs
lola: 7828352 markings, 11032430 edges, 71228 markings/sec, 105 secs
lola: 8183527 markings, 11520031 edges, 71035 markings/sec, 110 secs
lola: 8529082 markings, 12009629 edges, 69111 markings/sec, 115 secs
lola: 8876794 markings, 12501519 edges, 69542 markings/sec, 120 secs
lola: 9226335 markings, 13001356 edges, 69908 markings/sec, 125 secs
lola: 9585166 markings, 13504680 edges, 71766 markings/sec, 130 secs
lola: 9941523 markings, 14005234 edges, 71271 markings/sec, 135 secs
lola: 10289609 markings, 14499887 edges, 69617 markings/sec, 140 secs
lola: 10633951 markings, 14991293 edges, 68868 markings/sec, 145 secs
lola: 10979352 markings, 15479046 edges, 69080 markings/sec, 150 secs
lola: 11326278 markings, 15979283 edges, 69385 markings/sec, 155 secs
lola: 11676025 markings, 16473868 edges, 69949 markings/sec, 160 secs
lola: 12045651 markings, 16973197 edges, 73925 markings/sec, 165 secs
lola: 12392276 markings, 17470161 edges, 69325 markings/sec, 170 secs
lola: 12743830 markings, 17970140 edges, 70311 markings/sec, 175 secs
lola: 13086863 markings, 18459880 edges, 68607 markings/sec, 180 secs
lola: 13431104 markings, 18956709 edges, 68848 markings/sec, 185 secs
lola: 13772621 markings, 19453283 edges, 68303 markings/sec, 190 secs
lola: 14112305 markings, 19940393 edges, 67937 markings/sec, 195 secs
lola: 14455452 markings, 20429859 edges, 68629 markings/sec, 200 secs
lola: 14792149 markings, 20922342 edges, 67339 markings/sec, 205 secs
lola: 15138140 markings, 21412468 edges, 69198 markings/sec, 210 secs
lola: 15480336 markings, 21902258 edges, 68439 markings/sec, 215 secs
lola: 15826375 markings, 22389227 edges, 69208 markings/sec, 220 secs
lola: 16170525 markings, 22878898 edges, 68830 markings/sec, 225 secs
lola: 16516994 markings, 23366538 edges, 69294 markings/sec, 230 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 (((1 <= p1970) U G (F ((3 <= p307)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= p1970) U G (F ((3 <= p307)))))
lola: processed formula: A (((1 <= p1970) U G (F ((3 <= p307)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 25 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: 455 markings, 455 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X ((p2468 <= p911))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X ((p2468 <= p911))))
lola: processed formula: A (G (X ((p2468 <= p911))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 26 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: 70514 markings, 82680 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (((1 <= p283) U (2 <= p1797)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (((1 <= p283) U (2 <= p1797)))))
lola: processed formula: A (G (F (((1 <= p283) U (2 <= p1797)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 26 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: 448 markings, 448 edges
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F ((3 <= p2203))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F ((3 <= p2203))))
lola: processed formula: A (X (F ((3 <= p2203))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 26 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: 48 markings, 48 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p1886)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p1886)))
lola: processed formula: A (F ((3 <= p1886)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 27 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: 456 markings, 456 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p2183 <= p952))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p2183 <= p952)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-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 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (X (F ((1 <= p504))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (X (F ((1 <= p504))))))
lola: processed formula: A (G (X (X (F ((1 <= p504))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 26 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: 48 markings, 48 edges
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((3 <= p1561)) U F (F ((3 <= p245)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((3 <= p1561)) U F ((3 <= p245))))
lola: processed formula: A ((F ((3 <= p1561)) U F ((3 <= p245))))
lola: processed formula length: 40
lola: 1 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 27 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: 446 markings, 446 edges
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p2107)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 28 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((p522 <= p44)) U (p857 <= p2123))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((p522 <= p44)) U (p857 <= p2123))))
lola: processed formula: A (X ((G ((p522 <= p44)) U (p857 <= p2123))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 25 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 12 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p1816))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p1816)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-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 ((2 <= p1473))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p1473)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-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 14 will run for 1651 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p602 <= p1280)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 28 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 235 markings, 245 edges
lola: ========================================
lola: subprocess 15 will run for 3303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((1 <= p704) U (1 <= p829)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((1 <= p704) U (1 <= p829))))
lola: processed formula: A (F (((1 <= p704) U (1 <= p829))))
lola: processed formula length: 35
lola: 1 rewrites
lola: formula mentions 0 of 2483 places; total mentions: 0
lola: closed formula file DLCshifumi-PT-2b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 304 bytes per marking, with 27 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: 456 markings, 456 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown no no no no no yes no no no yes no no no no
FORMULA DLCshifumi-PT-2b-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-2b-LTLCardinality-15 FALSE 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="DLCshifumi-PT-2b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-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/DLCshifumi-PT-2b.tgz
mv DLCshifumi-PT-2b 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-structural"
echo " Input is DLCshifumi-PT-2b, 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 r211-smll-152732261700209"
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 '
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 ;