About the Execution of Irma.struct for DNAwalker-PT-17redondantChoiceL
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
1597.150 | 439061.00 | 399541.00 | 1715.70 | FFFTFFF?FTFFFTFF | 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 380K
-rw-r--r-- 1 mcc users 3.6K 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.9K 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 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11K 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.9K 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 19 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 211K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DNAwalker-PT-17redondantChoiceL, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732261800259
=====================================================================
--------------------
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 DNAwalker-PT-17redondantChoiceL-LTLCardinality-00
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-01
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-02
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-03
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-04
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-05
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-06
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-07
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-08
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-09
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-10
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-11
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-12
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-13
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-14
FORMULA_NAME DNAwalker-PT-17redondantChoiceL-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527417709723
BK_STOP 1527418148784
--------------------
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 DNAwalker-PT-17redondantChoiceL as instance name.
Using DNAwalker 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': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 869408, 'Memory': 15951.41, 'Tool': 'lola'}, {'Time': 874481, 'Memory': 15947.69, 'Tool': 'lola'}, {'Time': 3507858, 'Memory': 11484.22, 'Tool': 'itstools'}, {'Time': 3508080, 'Memory': 11521.44, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola DNAwalker-PT-17redondantChoiceL...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DNAwalker-PT-17redondantChoiceL: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
DNAwalker-PT-17redondantChoiceL: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ DNAwalker-PT-17redondantChoiceL @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 533/65536 symbol table entries, 8 collisions
lola: preprocessing...
lola: finding significant places
lola: 43 places, 490 transitions, 43 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 284 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: A (X (X ((A24 <= A26)))) : A (F ((3 <= A31))) : A (F (G (X ((1 <= A11))))) : A (((A23 <= B21) U F (F ((B18 <= A28))))) : A (X ((3 <= A12))) : A (X (((B9 <= A5) U X ((3 <= A5))))) : A (X (X (F (F ((A6 <= A26)))))) : A (G (G (((A24 <= A11) U (B18 <= A31))))) : A (F (G ((A19 <= B19)))) : A ((1 <= A14)) : A (G (F (X (X ((1 <= A8)))))) : A ((1 <= A21)) : A (G (X (((3 <= A27) U (2 <= A8))))) : A ((A8 <= A12)) : A ((X ((A20 <= A29)) U X (G ((A32 <= A22))))) : A (F (G ((1 <= A7))))
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 (X (X ((A24 <= A26))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X ((A24 <= A26))))
lola: processed formula: A (X (X ((A24 <= A26))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 24 markings, 24 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= A31)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= A31)))
lola: processed formula: A (F ((3 <= A31)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 19 markings, 19 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X ((1 <= A11)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X ((1 <= A11)))))
lola: processed formula: A (F (G (X ((1 <= A11)))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 69 markings, 96 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((A23 <= B21) U F (F ((B18 <= A28)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((A23 <= B21) U F ((B18 <= A28))))
lola: processed formula: A (((A23 <= B21) U F ((B18 <= A28))))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= A12)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= A12)))
lola: processed formula: A (X ((3 <= A12)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((B9 <= A5) U X ((3 <= A5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((B9 <= A5) U X ((3 <= A5)))))
lola: processed formula: A (X (((B9 <= A5) U X ((3 <= A5)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (F ((A6 <= A26))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F ((A6 <= A26)))))
lola: processed formula: A (X (X (F ((A6 <= A26)))))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (((A24 <= A11) U (B18 <= A31)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (((A24 <= A11) U (B18 <= A31)))))
lola: processed formula: A (G (G (((A24 <= A11) U (B18 <= A31)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 117642 markings, 291406 edges, 23528 markings/sec, 0 secs
lola: 242387 markings, 601019 edges, 24949 markings/sec, 5 secs
lola: 362756 markings, 921826 edges, 24074 markings/sec, 10 secs
lola: 475823 markings, 1251145 edges, 22613 markings/sec, 15 secs
lola: 580375 markings, 1571464 edges, 20910 markings/sec, 20 secs
lola: 684722 markings, 1888834 edges, 20869 markings/sec, 25 secs
lola: 784935 markings, 2200865 edges, 20043 markings/sec, 30 secs
lola: 892912 markings, 2508102 edges, 21595 markings/sec, 35 secs
lola: 1000959 markings, 2813527 edges, 21609 markings/sec, 40 secs
lola: 1090257 markings, 3138070 edges, 17860 markings/sec, 45 secs
lola: 1171810 markings, 3424759 edges, 16311 markings/sec, 50 secs
lola: 1256789 markings, 3722044 edges, 16996 markings/sec, 55 secs
lola: 1349919 markings, 4047967 edges, 18626 markings/sec, 60 secs
lola: 1434351 markings, 4367364 edges, 16886 markings/sec, 65 secs
lola: 1518514 markings, 4698132 edges, 16833 markings/sec, 70 secs
lola: 1611624 markings, 5041348 edges, 18622 markings/sec, 75 secs
lola: 1693365 markings, 5363940 edges, 16348 markings/sec, 80 secs
lola: 1781329 markings, 5698139 edges, 17593 markings/sec, 85 secs
lola: 1862857 markings, 6021974 edges, 16306 markings/sec, 90 secs
lola: 1943107 markings, 6346831 edges, 16050 markings/sec, 95 secs
lola: 2023603 markings, 6666873 edges, 16099 markings/sec, 100 secs
lola: 2101568 markings, 6988221 edges, 15593 markings/sec, 105 secs
lola: 2188690 markings, 7302853 edges, 17424 markings/sec, 110 secs
lola: 2302445 markings, 7612632 edges, 22751 markings/sec, 115 secs
lola: 2404864 markings, 7946707 edges, 20484 markings/sec, 120 secs
lola: 2503429 markings, 8277697 edges, 19713 markings/sec, 125 secs
lola: 2600367 markings, 8616328 edges, 19388 markings/sec, 130 secs
lola: 2698812 markings, 8944311 edges, 19689 markings/sec, 135 secs
lola: 2801572 markings, 9267410 edges, 20552 markings/sec, 140 secs
lola: 2902102 markings, 9587075 edges, 20106 markings/sec, 145 secs
lola: 3000958 markings, 9902480 edges, 19771 markings/sec, 150 secs
lola: 3092565 markings, 10225616 edges, 18321 markings/sec, 155 secs
lola: 3181779 markings, 10546850 edges, 17843 markings/sec, 160 secs
lola: 3268537 markings, 10879099 edges, 17352 markings/sec, 165 secs
lola: 3349165 markings, 11239868 edges, 16126 markings/sec, 170 secs
lola: 3428053 markings, 11534877 edges, 15778 markings/sec, 175 secs
lola: 3506966 markings, 11849511 edges, 15783 markings/sec, 180 secs
lola: 3587312 markings, 12198237 edges, 16069 markings/sec, 185 secs
lola: 3671373 markings, 12523250 edges, 16812 markings/sec, 190 secs
lola: 3756827 markings, 12843844 edges, 17091 markings/sec, 195 secs
lola: 3839687 markings, 13164414 edges, 16572 markings/sec, 200 secs
lola: 3922069 markings, 13486404 edges, 16476 markings/sec, 205 secs
lola: 4003640 markings, 13807334 edges, 16314 markings/sec, 210 secs
lola: 4089729 markings, 14134564 edges, 17218 markings/sec, 215 secs
lola: 4173111 markings, 14458992 edges, 16676 markings/sec, 220 secs
lola: 4254328 markings, 14789722 edges, 16243 markings/sec, 225 secs
lola: 4335422 markings, 15139586 edges, 16219 markings/sec, 230 secs
lola: 4420857 markings, 15460680 edges, 17087 markings/sec, 235 secs
lola: 4498732 markings, 15777739 edges, 15575 markings/sec, 240 secs
lola: 4586850 markings, 16117330 edges, 17624 markings/sec, 245 secs
lola: 4665111 markings, 16431618 edges, 15652 markings/sec, 250 secs
lola: 4745231 markings, 16759231 edges, 16024 markings/sec, 255 secs
lola: 4824517 markings, 17066871 edges, 15857 markings/sec, 260 secs
lola: 4902240 markings, 17384805 edges, 15545 markings/sec, 265 secs
lola: 4978369 markings, 17695204 edges, 15226 markings/sec, 270 secs
lola: 5053059 markings, 18002276 edges, 14938 markings/sec, 275 secs
lola: 5136957 markings, 18328067 edges, 16780 markings/sec, 280 secs
lola: 5220441 markings, 18641542 edges, 16697 markings/sec, 285 secs
lola: 5301770 markings, 18950350 edges, 16266 markings/sec, 290 secs
lola: 5382857 markings, 19257342 edges, 16217 markings/sec, 295 secs
lola: 5461020 markings, 19562834 edges, 15633 markings/sec, 300 secs
lola: 5543434 markings, 19881139 edges, 16483 markings/sec, 305 secs
lola: 5624035 markings, 20186107 edges, 16120 markings/sec, 310 secs
lola: 5705462 markings, 20495231 edges, 16285 markings/sec, 315 secs
lola: 5785462 markings, 20804722 edges, 16000 markings/sec, 320 secs
lola: 5862147 markings, 21108196 edges, 15337 markings/sec, 325 secs
lola: 5947772 markings, 21430923 edges, 17125 markings/sec, 330 secs
lola: 6031444 markings, 21737182 edges, 16734 markings/sec, 335 secs
lola: 6114869 markings, 22045672 edges, 16685 markings/sec, 340 secs
lola: 6203610 markings, 22344739 edges, 17748 markings/sec, 345 secs
lola: 6286264 markings, 22692234 edges, 16531 markings/sec, 350 secs
lola: 6369377 markings, 23052424 edges, 16623 markings/sec, 355 secs
lola: 6451631 markings, 23408632 edges, 16451 markings/sec, 360 secs
lola: 6533933 markings, 23778030 edges, 16460 markings/sec, 365 secs
lola: 6615145 markings, 24151318 edges, 16242 markings/sec, 370 secs
lola: 6691892 markings, 24496795 edges, 15349 markings/sec, 375 secs
lola: 6772453 markings, 24837750 edges, 16112 markings/sec, 380 secs
lola: 6853606 markings, 25148130 edges, 16231 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((A19 <= B19))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((A19 <= B19))))
lola: processed formula: A (F (G ((A19 <= B19))))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 16 markings, 17 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= A14))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= A14)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-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 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (X (X ((1 <= A8))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F (X (X ((1 <= A8))))))
lola: processed formula: A (G (F (X (X ((1 <= A8))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 47 markings, 47 edges
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= A21))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= A21)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-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 12 will run for 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (((3 <= A27) U (2 <= A8)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (((3 <= A27) U (2 <= A8)))))
lola: processed formula: A (G (X (((3 <= A27) U (2 <= A8)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 13 will run for 1049 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A8 <= A12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (A8 <= A12)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-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 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((A20 <= A29)) U X (G ((A32 <= A22)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((A20 <= A29) U G ((A32 <= A22)))))
lola: processed formula: A (X (((A20 <= A29) U G ((A32 <= A22)))))
lola: processed formula length: 41
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 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: 16 markings, 17 edges
lola: ========================================
lola: subprocess 15 will run for 3147 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= A7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((1 <= A7))))
lola: processed formula: A (F (G ((1 <= A7))))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-17redondantChoiceL-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 17 markings, 18 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no unknown no yes no no no yes no no
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-17redondantChoiceL-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="DNAwalker-PT-17redondantChoiceL"
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/DNAwalker-PT-17redondantChoiceL.tgz
mv DNAwalker-PT-17redondantChoiceL 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 DNAwalker-PT-17redondantChoiceL, 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-152732261800259"
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 ;