fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r098-ebro-149488455700329
Last Updated
June 27, 2017

About the Execution of LoLA for S_DES-PT-50b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6352.310 491076.00 493602.00 90.20 F?FTTFFFT?TTFFFT 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)
....................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_DES-PT-50b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455700329
=====================================================================


--------------------
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 DES-PT-50b-LTLCardinality-0
FORMULA_NAME DES-PT-50b-LTLCardinality-1
FORMULA_NAME DES-PT-50b-LTLCardinality-10
FORMULA_NAME DES-PT-50b-LTLCardinality-11
FORMULA_NAME DES-PT-50b-LTLCardinality-12
FORMULA_NAME DES-PT-50b-LTLCardinality-13
FORMULA_NAME DES-PT-50b-LTLCardinality-14
FORMULA_NAME DES-PT-50b-LTLCardinality-15
FORMULA_NAME DES-PT-50b-LTLCardinality-2
FORMULA_NAME DES-PT-50b-LTLCardinality-3
FORMULA_NAME DES-PT-50b-LTLCardinality-4
FORMULA_NAME DES-PT-50b-LTLCardinality-5
FORMULA_NAME DES-PT-50b-LTLCardinality-6
FORMULA_NAME DES-PT-50b-LTLCardinality-7
FORMULA_NAME DES-PT-50b-LTLCardinality-8
FORMULA_NAME DES-PT-50b-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496456825994


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


checking for too many tokens
===========================================================================================
S_DES-PT-50b: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_DES-PT-50b @ 3540 seconds
----- 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: 909/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 479 places, 430 transitions, 414 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 527 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-50b-LTLCardinality.task
lola: A (F (G (((3 <= p66) U (1 <= p116))))) : A (F (G (X (X ((p202 <= p326)))))) : A ((X ((p385 <= p194)) U ((p207 <= p237) U (p437 <= p59)))) : A (G (F (F ((p214 <= p272))))) : A ((p307 <= p117)) : A (F ((X ((3 <= p168)) U F ((p2 <= p450))))) : A (G ((3 <= p380))) : A (F (G (F ((2 <= p129))))) : A (X (X (F (G ((2 <= p125)))))) : A ((p264 <= p220)) : A (G ((2 <= p159))) : A ((F ((p209 <= p93)) U X (F ((p212 <= p173))))) : A (F (X (X (F ((p185 <= p329)))))) : A (F (G (F (G ((2 <= p12)))))) : A (X (X ((3 <= p390)))) : A (G (((p88 <= p57) U G ((2 <= p273)))))
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 (G (((3 <= p66) U (1 <= p116)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((3 <= p66) U (1 <= p116)))))
lola: processed formula: A (F (G (((3 <= p66) U (1 <= p116)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 0 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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (X ((p202 <= p326))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (X (X ((p202 <= p326))))))
lola: processed formula: A (F (G (X (X ((p202 <= p326))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 366000 markings, 1733757 edges, 73200 markings/sec, 0 secs
lola: 673664 markings, 3446884 edges, 61533 markings/sec, 5 secs
lola: 984766 markings, 5179361 edges, 62220 markings/sec, 10 secs
lola: 1296826 markings, 6914078 edges, 62412 markings/sec, 15 secs
lola: 1608745 markings, 8651256 edges, 62384 markings/sec, 20 secs
lola: 1924021 markings, 10384729 edges, 63055 markings/sec, 25 secs
lola: 2244321 markings, 12116082 edges, 64060 markings/sec, 30 secs
lola: 2527180 markings, 13794264 edges, 56572 markings/sec, 35 secs
lola: 2817491 markings, 15494741 edges, 58062 markings/sec, 40 secs
lola: 3112497 markings, 17204354 edges, 59001 markings/sec, 45 secs
lola: 3371164 markings, 18897958 edges, 51733 markings/sec, 50 secs
lola: 3629213 markings, 20586916 edges, 51610 markings/sec, 55 secs
lola: 3887825 markings, 22282582 edges, 51722 markings/sec, 60 secs
lola: 4144833 markings, 23978432 edges, 51402 markings/sec, 65 secs
lola: 4401974 markings, 25677389 edges, 51428 markings/sec, 70 secs
lola: 4661706 markings, 27374363 edges, 51946 markings/sec, 75 secs
lola: 4921493 markings, 29076476 edges, 51957 markings/sec, 80 secs
lola: 5179189 markings, 30748445 edges, 51539 markings/sec, 85 secs
lola: 5413955 markings, 32407105 edges, 46953 markings/sec, 90 secs
lola: 5688626 markings, 34099856 edges, 54934 markings/sec, 95 secs
lola: 5965623 markings, 35789615 edges, 55399 markings/sec, 100 secs
lola: 6222347 markings, 37470274 edges, 51345 markings/sec, 105 secs
lola: 6479210 markings, 39150403 edges, 51373 markings/sec, 110 secs
lola: 6736169 markings, 40831926 edges, 51392 markings/sec, 115 secs
lola: 6993238 markings, 42512984 edges, 51414 markings/sec, 120 secs
lola: 7250199 markings, 44196827 edges, 51392 markings/sec, 125 secs
lola: 7508414 markings, 45884607 edges, 51643 markings/sec, 130 secs
lola: 7772867 markings, 47581360 edges, 52891 markings/sec, 135 secs
lola: 8013139 markings, 49233027 edges, 48054 markings/sec, 140 secs
lola: 8247872 markings, 50891472 edges, 46947 markings/sec, 145 secs
lola: 8544958 markings, 52551298 edges, 59417 markings/sec, 150 secs
lola: 8825158 markings, 54201420 edges, 56040 markings/sec, 155 secs
lola: 9106341 markings, 55856732 edges, 56237 markings/sec, 160 secs
lola: 9388051 markings, 57515755 edges, 56342 markings/sec, 165 secs
lola: 9666910 markings, 59150281 edges, 55772 markings/sec, 170 secs
lola: 9931415 markings, 60767363 edges, 52901 markings/sec, 175 secs
lola: 10180745 markings, 62399342 edges, 49866 markings/sec, 180 secs
lola: 10416858 markings, 64024278 edges, 47223 markings/sec, 185 secs
lola: 10654563 markings, 65655769 edges, 47541 markings/sec, 190 secs
lola: 10890516 markings, 67293245 edges, 47191 markings/sec, 195 secs
lola: 11135291 markings, 68932104 edges, 48955 markings/sec, 200 secs
lola: 11356414 markings, 70530372 edges, 44225 markings/sec, 205 secs
lola: 11613282 markings, 72162441 edges, 51374 markings/sec, 210 secs
lola: 11845792 markings, 73774693 edges, 46502 markings/sec, 215 secs
lola: 12081510 markings, 75392176 edges, 47144 markings/sec, 220 secs
lola: 12315664 markings, 77018101 edges, 46831 markings/sec, 225 secs
lola: 12553467 markings, 78649863 edges, 47561 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 ((X ((p385 <= p194)) U ((p207 <= p237) U (p437 <= p59))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((p385 <= p194)) U ((p207 <= p237) U (p437 <= p59))))
lola: processed formula: A ((X ((p385 <= p194)) U ((p207 <= p237) U (p437 <= p59))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 31 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: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F ((p214 <= p272)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p214 <= p272))))
lola: processed formula: A (G (F ((p214 <= p272))))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 892322 markings, 1048054 edges, 178464 markings/sec, 0 secs
lola: 1691282 markings, 2048935 edges, 159792 markings/sec, 5 secs
lola: 2476308 markings, 3033907 edges, 157005 markings/sec, 10 secs
lola: 3264149 markings, 4021488 edges, 157568 markings/sec, 15 secs
lola: 4054202 markings, 5012465 edges, 158011 markings/sec, 20 secs
lola: 4846824 markings, 6005816 edges, 158524 markings/sec, 25 secs
lola: 5640016 markings, 7001380 edges, 158638 markings/sec, 30 secs
lola: 6580967 markings, 8111713 edges, 188190 markings/sec, 35 secs
lola: 7504022 markings, 9167919 edges, 184611 markings/sec, 40 secs
lola: 8468900 markings, 10273163 edges, 192976 markings/sec, 45 secs
lola: 9387881 markings, 11319893 edges, 183796 markings/sec, 50 secs
lola: 10332608 markings, 12364307 edges, 188945 markings/sec, 55 secs
lola: 11281094 markings, 13374413 edges, 189697 markings/sec, 60 secs
lola: 12226504 markings, 14417278 edges, 189082 markings/sec, 65 secs
lola: 13058097 markings, 15465958 edges, 166319 markings/sec, 70 secs
lola: 13827059 markings, 16465765 edges, 153792 markings/sec, 75 secs
lola: 14690828 markings, 17489902 edges, 172754 markings/sec, 80 secs
lola: 15557743 markings, 18491255 edges, 173383 markings/sec, 85 secs
lola: 16409456 markings, 19476406 edges, 170343 markings/sec, 90 secs
lola: 17259965 markings, 20463429 edges, 170102 markings/sec, 95 secs
lola: 18175290 markings, 21517502 edges, 183065 markings/sec, 100 secs
lola: 18942554 markings, 22439118 edges, 153453 markings/sec, 105 secs
lola: 19714536 markings, 23360578 edges, 154396 markings/sec, 110 secs
lola: 20490781 markings, 24282034 edges, 155249 markings/sec, 115 secs
lola: 21325046 markings, 25276374 edges, 166853 markings/sec, 120 secs
lola: 22185022 markings, 26267773 edges, 171995 markings/sec, 125 secs
lola: 22998858 markings, 27200727 edges, 162767 markings/sec, 130 secs
lola: 23813357 markings, 28173943 edges, 162900 markings/sec, 135 secs
lola: 24747051 markings, 29224272 edges, 186739 markings/sec, 140 secs
lola: 25616536 markings, 30212716 edges, 173897 markings/sec, 145 secs
lola: 26388889 markings, 31176852 edges, 154471 markings/sec, 150 secs
lola: 27164232 markings, 32132800 edges, 155069 markings/sec, 155 secs
lola: 28087650 markings, 33153512 edges, 184684 markings/sec, 160 secs
lola: 29032241 markings, 34156635 edges, 188918 markings/sec, 165 secs
lola: 29879315 markings, 35118281 edges, 169415 markings/sec, 170 secs
lola: 30780756 markings, 36092396 edges, 180288 markings/sec, 175 secs
lola: 31513628 markings, 37016744 edges, 146574 markings/sec, 180 secs
lola: 32424156 markings, 38011517 edges, 182106 markings/sec, 185 secs
lola: 33318872 markings, 39015730 edges, 178943 markings/sec, 190 secs
lola: 34152962 markings, 40006333 edges, 166818 markings/sec, 195 secs
lola: 34891358 markings, 40955534 edges, 147679 markings/sec, 200 secs
lola: 35564927 markings, 41920868 edges, 134714 markings/sec, 205 secs
lola: 36415918 markings, 42890884 edges, 170198 markings/sec, 210 secs
lola: 37313506 markings, 43872407 edges, 179518 markings/sec, 215 secs
lola: 38102147 markings, 44786153 edges, 157728 markings/sec, 220 secs
lola: 38930683 markings, 45779331 edges, 165707 markings/sec, 225 secs
lola: 39696672 markings, 46780097 edges, 153198 markings/sec, 230 secs
lola: 40638474 markings, 47828441 edges, 188360 markings/sec, 235 secs
lola: 41588627 markings, 48849049 edges, 190031 markings/sec, 240 secs
lola: 42434531 markings, 49863061 edges, 169181 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p307 <= p117))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p307 <= p117)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-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: ========================================
lola: subprocess 5 will run for 277 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((3 <= p168)) U F ((p2 <= p450)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((3 <= p168)) U F ((p2 <= p450)))))
lola: processed formula: A (F ((X ((3 <= p168)) U F ((p2 <= p450)))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 1 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: ========================================
lola: subprocess 6 will run for 305 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= p380)))
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 52 bytes per marking, with 2 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: ========================================
lola: subprocess 7 will run for 338 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F ((2 <= p129)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= p129))))
lola: processed formula: A (G (F ((2 <= p129))))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 0 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: ========================================
lola: subprocess 8 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (G ((2 <= p125))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F (G ((2 <= p125))))))
lola: processed formula: A (X (X (F (G ((2 <= p125))))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 31 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: ========================================
lola: subprocess 9 will run for 435 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p264 <= p220))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p264 <= p220)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-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: ========================================
lola: subprocess 10 will run for 508 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p159)))
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 52 bytes per marking, with 2 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: ========================================
lola: subprocess 11 will run for 610 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F ((p209 <= p93)) U X (F ((p212 <= p173)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F ((p209 <= p93)) U X (F ((p212 <= p173)))))
lola: processed formula: A ((F ((p209 <= p93)) U X (F ((p212 <= p173)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 0 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: ========================================
lola: subprocess 12 will run for 762 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (X (F ((p185 <= p329))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (X (F ((p185 <= p329))))))
lola: processed formula: A (F (X (X (F ((p185 <= p329))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 0 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: ========================================
lola: subprocess 13 will run for 1016 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (G ((2 <= p12))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= p12))))
lola: processed formula: A (F (G ((2 <= p12))))
lola: processed formula length: 22
lola: 2 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 0 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: ========================================
lola: subprocess 14 will run for 1524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X ((3 <= p390))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((3 <= p390))))
lola: processed formula: A (X (X ((3 <= p390))))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 bytes per marking, with 31 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: ========================================
lola: subprocess 15 will run for 3049 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p88 <= p57) U G ((2 <= p273)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((p88 <= p57) U G ((2 <= p273)))))
lola: processed formula: A (G (((p88 <= p57) U G ((2 <= p273)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 479 places; total mentions: 0
lola: closed formula file DES-PT-50b-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 56 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: RESULT
lola:
SUMMARY: no unknown yes unknown yes yes no no no yes no yes yes no no no
lola: ========================================
FORMULA DES-PT-50b-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496457317070

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_DES-PT-50b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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/S_DES-PT-50b.tgz
mv S_DES-PT-50b execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_DES-PT-50b, 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 r098-ebro-149488455700329"
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 ;