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 424K
-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.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 259K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DLCround-PT-05a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-152649743800031
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DLCround-PT-05a-CTLCardinality-00
FORMULA_NAME DLCround-PT-05a-CTLCardinality-01
FORMULA_NAME DLCround-PT-05a-CTLCardinality-02
FORMULA_NAME DLCround-PT-05a-CTLCardinality-03
FORMULA_NAME DLCround-PT-05a-CTLCardinality-04
FORMULA_NAME DLCround-PT-05a-CTLCardinality-05
FORMULA_NAME DLCround-PT-05a-CTLCardinality-06
FORMULA_NAME DLCround-PT-05a-CTLCardinality-07
FORMULA_NAME DLCround-PT-05a-CTLCardinality-08
FORMULA_NAME DLCround-PT-05a-CTLCardinality-09
FORMULA_NAME DLCround-PT-05a-CTLCardinality-10
FORMULA_NAME DLCround-PT-05a-CTLCardinality-11
FORMULA_NAME DLCround-PT-05a-CTLCardinality-12
FORMULA_NAME DLCround-PT-05a-CTLCardinality-13
FORMULA_NAME DLCround-PT-05a-CTLCardinality-14
FORMULA_NAME DLCround-PT-05a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526654450692


BK_STOP 1526655131170

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DLCround-PT-05a as instance name.
Using DLCround as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 3211, 'Memory': 286.63, 'Tool': 'itstools'}, {'Time': 9919, 'Memory': 2209.27, 'Tool': 'marcie'}, {'Time': 16741, 'Memory': 476.54, 'Tool': 'gspn'}, {'Time': 2909314, 'Memory': 13971.88, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 906.0460915602616x far from the best tool itstools.
CTLCardinality lola DLCround-PT-05a...

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


checking for too many tokens
===========================================================================================
DLCround-PT-05a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ DLCround-PT-05a @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
make: [verify] Error 2 (ignored)
----- 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: 1222/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 167 places, 1055 transitions, 79 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 906 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-05a-CTLCardinality.task
lola: NOT(E (F (((3 <= p115) AND (1 <= p147))))) : ((((p62 + 1 <= p130) OR ((p110 + 1 <= p67) AND (p21 <= 0))) OR A (((3 <= p0) U (p47 <= p116)))) AND E (F ((2 <= p151)))) : E (F (((p166 + 1 <= p138) AND (p79 <= p41) AND ((p39 + 1 <= p28) OR (p128 <= 2))))) : (((p45 <= p148) AND (p75 <= p63) AND (p86 + 1 <= p83)) OR E (F (A (G ((1 <= p71)))))) : E (F (((p63 + 1 <= p154) AND (p160 + 1 <= p94) AND (2 <= p135)))) : E (F (((2 <= p57) AND (1 <= p148) AND (3 <= p16) AND (p128 + 1 <= p68) AND (p38 <= 2)))) : E (F (A (G ((p34 <= p72))))) : E (F (((p50 <= 1) AND (p128 + 1 <= p56) AND ((p118 + 1 <= p116) OR (p113 + 1 <= p134))))) : (((p48 <= p133) OR (((1 <= p13) OR (2 <= p32) OR (3 <= p117) OR (1 <= p20)) AND A (X ((p38 <= p123))))) AND (E (F ((p1 <= 0))) AND E (F ((p155 + 1 <= p56))))) : E (F (E (((p139 <= p3) U (3 <= p143))))) : A (G (NOT(A (X ((2 <= p47)))))) : NOT(E (F (((p71 + 1 <= p52) AND (p161 <= 2))))) : A (X (A (G (((p1 <= p66) OR (p89 <= p104)))))) : E ((A (F ((1 <= p38))) U E (F ((3 <= p127))))) : NOT(A (G (A (X ((1 <= p131)))))) : E (F (E (F (((3 <= p68) AND (1 <= p14))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((3 <= p115) AND (1 <= p147)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 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: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((p62 + 1 <= p130) OR ((p110 + 1 <= p67) AND (p21 <= 0))) OR A (((3 <= p0) U (p47 <= p116)))) AND E (F ((2 <= p151))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p62 + 1 <= p130) OR ((p110 + 1 <= p67) AND (p21 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p62 + 1 <= p130) OR ((p110 + 1 <= p67) AND (p21 <= 0)))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 167 places; total mentions: 0
lola: closed formula file DLCround-PT-05a-CTLCardinality.task
lola: processed formula with 3 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= p0) U (p47 <= p116)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= p0) U (p47 <= p116)))
lola: processed formula: A (((3 <= p0) U (p47 <= p116)))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 167 places; total mentions: 0
lola: closed formula file DLCround-PT-05a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 15 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p151)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
state equation: write sara problem file to DLCround-PT-05a-CTLCardinality-3.sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p166 + 1 <= p138) AND (p79 <= p41) AND ((p39 + 1 <= p28) OR (p128 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 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: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to DLCround-PT-05a-CTLCardinality-2.sara
lola: 1 markings, 0 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p45 <= p148) AND (p75 <= p63) AND (p86 + 1 <= p83)) OR E (F (A (G ((1 <= p71))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p45 <= p148) AND (p75 <= p63) AND (p86 + 1 <= p83))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p45 <= p148) AND (p75 <= p63) AND (p86 + 1 <= p83))
lola: processed formula length: 53
lola: 0 rewrites
lola: formula mentions 0 of 167 places; total mentions: 0
lola: closed formula file DLCround-PT-05a-CTLCardinality.task
lola: processed formula with 3 atomic propositions
sara: try reading problem file DLCround-PT-05a-CTLCardinality-2.sara.
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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= p71)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (p71 <= 0))))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 167 places; total mentions: 0
lola: closed formula file DLCround-PT-05a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
sara: place or transition ordering is non-deterministic

lola: 241039 markings, 7730336 edges, 48195 markings/sec, 0 secs
lola: 434696 markings, 15654095 edges, 38731 markings/sec, 5 secs
lola: 666845 markings, 23162552 edges, 46430 markings/sec, 10 secs
lola: 873163 markings, 30265197 edges, 41264 markings/sec, 15 secs
lola: 1102751 markings, 37539920 edges, 45918 markings/sec, 20 secs
lola: 1329113 markings, 44966752 edges, 45272 markings/sec, 25 secs
lola: 1550580 markings, 52425063 edges, 44293 markings/sec, 30 secs
lola: 1789858 markings, 59773023 edges, 47856 markings/sec, 35 secs
lola: 2016332 markings, 67218634 edges, 45295 markings/sec, 40 secs
lola: 2237203 markings, 74539961 edges, 44174 markings/sec, 45 secs
lola: 2463896 markings, 81926688 edges, 45339 markings/sec, 50 secs
lola: 2682428 markings, 89177982 edges, 43706 markings/sec, 55 secs
lola: 2895864 markings, 96154966 edges, 42687 markings/sec, 60 secs
lola: 3106621 markings, 103441128 edges, 42151 markings/sec, 65 secs
lola: 3322096 markings, 110667472 edges, 43095 markings/sec, 70 secs
lola: 3533773 markings, 117875724 edges, 42335 markings/sec, 75 secs
lola: 3741715 markings, 125440781 edges, 41588 markings/sec, 80 secs
lola: 3938441 markings, 132546122 edges, 39345 markings/sec, 85 secs
lola: 4156376 markings, 139758904 edges, 43587 markings/sec, 90 secs
lola: 4380297 markings, 146742392 edges, 44784 markings/sec, 95 secs
lola: 4586194 markings, 153783783 edges, 41179 markings/sec, 100 secs
lola: 4777622 markings, 160426017 edges, 38286 markings/sec, 105 secs
lola: 4977568 markings, 167352881 edges, 39989 markings/sec, 110 secs
lola: 5193944 markings, 174464552 edges, 43275 markings/sec, 115 secs
lola: 5410273 markings, 181680784 edges, 43266 markings/sec, 120 secs
lola: 5614415 markings, 188634930 edges, 40828 markings/sec, 125 secs
lola: 5818387 markings, 195789899 edges, 40794 markings/sec, 130 secs
lola: 6015465 markings, 202610598 edges, 39416 markings/sec, 135 secs
lola: 6206816 markings, 209380815 edges, 38270 markings/sec, 140 secs
lola: 6418371 markings, 216408117 edges, 42311 markings/sec, 145 secs
lola: 6628302 markings, 223495093 edges, 41986 markings/sec, 150 secs
lola: 6854303 markings, 231062040 edges, 45200 markings/sec, 155 secs
lola: 7059329 markings, 238223438 edges, 41005 markings/sec, 160 secs
lola: 7252612 markings, 245233784 edges, 38657 markings/sec, 165 secs
lola: 7416138 markings, 252177913 edges, 32705 markings/sec, 170 secs
lola: 7617869 markings, 259161630 edges, 40346 markings/sec, 175 secs
lola: 7817069 markings, 265976056 edges, 39840 markings/sec, 180 secs
lola: 8012702 markings, 272722245 edges, 39127 markings/sec, 185 secs
lola: 8211813 markings, 279695855 edges, 39822 markings/sec, 190 secs
lola: 8404106 markings, 286515808 edges, 38459 markings/sec, 195 secs
lola: 8605018 markings, 293317109 edges, 40182 markings/sec, 200 secs
lola: 8801565 markings, 300186393 edges, 39309 markings/sec, 205 secs
lola: 9026467 markings, 307632622 edges, 44980 markings/sec, 210 secs
lola: 9253378 markings, 314946509 edges, 45382 markings/sec, 215 secs
lola: 9474509 markings, 322308555 edges, 44226 markings/sec, 220 secs
lola: 9638766 markings, 329459251 edges, 32851 markings/sec, 225 secs
lola: 9826480 markings, 336188802 edges, 37543 markings/sec, 230 secs
lola: 10013326 markings, 342888340 edges, 37369 markings/sec, 235 secs
lola: 10215201 markings, 349555638 edges, 40375 markings/sec, 240 secs
lola: 10422336 markings, 356647166 edges, 41427 markings/sec, 245 secs
lola: 10624544 markings, 363466519 edges, 40442 markings/sec, 250 secs
lola: 10837892 markings, 370336720 edges, 42670 markings/sec, 255 secs
lola: 11036289 markings, 377193200 edges, 39679 markings/sec, 260 secs
lola: 11249440 markings, 384326243 edges, 42630 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p63 + 1 <= p154) AND (p160 + 1 <= p94) AND (2 <= p135))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 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: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to DLCround-PT-05a-CTLCardinality-4.sara
lola: 2 markings, 1 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p57) AND (1 <= p148) AND (3 <= p16) AND (p128 + 1 <= p68) AND (p38 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 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: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
sara: try reading problem file DLCround-PT-05a-CTLCardinality-4.sara.
lola: state equation: write sara problem file to DLCround-PT-05a-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-05a-CTLCardinality-5.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((p34 <= p72)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (p72 + 1 <= p34))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 167 places; total mentions: 0
lola: closed formula file DLCround-PT-05a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 136545 markings, 7471525 edges, 3689329903141912576 markings/sec, 0 secs
lola: 256243 markings, 15353092 edges, 23940 markings/sec, 5 secs
lola: 408836 markings, 23028606 edges, 30519 markings/sec, 10 secs
lola: 558405 markings, 30325647 edges, 29914 markings/sec, 15 secs
lola: 705835 markings, 37743261 edges, 29486 markings/sec, 20 secs
lola: 851995 markings, 44835382 edges, 29232 markings/sec, 25 secs
lola: 1006052 markings, 52019821 edges, 30811 markings/sec, 30 secs
lola: 1160733 markings, 59453943 edges, 30936 markings/sec, 35 secs
lola: 1306947 markings, 66532827 edges, 29243 markings/sec, 40 secs
lola: 1453893 markings, 73671881 edges, 29389 markings/sec, 45 secs
lola: 1607462 markings, 80771208 edges, 30714 markings/sec, 50 secs
lola: 1760121 markings, 87758814 edges, 30532 markings/sec, 55 secs
lola: 1912958 markings, 94716349 edges, 30567 markings/sec, 60 secs
lola: 2057268 markings, 102038660 edges, 28862 markings/sec, 65 secs
lola: 2202677 markings, 108934476 edges, 29082 markings/sec, 70 secs
lola: 2351790 markings, 116199713 edges, 29823 markings/sec, 75 secs
lola: 2509449 markings, 123303499 edges, 31532 markings/sec, 80 secs
lola: 2670038 markings, 130250677 edges, 32118 markings/sec, 85 secs
lola: 2820527 markings, 137110655 edges, 30098 markings/sec, 90 secs
lola: 2966971 markings, 144253134 edges, 29289 markings/sec, 95 secs
lola: 3111532 markings, 151182658 edges, 28912 markings/sec, 100 secs
lola: 3255032 markings, 158123144 edges, 28700 markings/sec, 105 secs
lola: 3404668 markings, 165026867 edges, 29927 markings/sec, 110 secs
lola: 3546105 markings, 171952882 edges, 28287 markings/sec, 115 secs
lola: 3700745 markings, 179228092 edges, 30928 markings/sec, 120 secs
lola: 3846212 markings, 186197948 edges, 29093 markings/sec, 125 secs
lola: 3991496 markings, 193144159 edges, 29057 markings/sec, 130 secs
lola: 4142158 markings, 200036484 edges, 30132 markings/sec, 135 secs
lola: 4293515 markings, 206840485 edges, 30271 markings/sec, 140 secs
lola: 4442694 markings, 213436208 edges, 29836 markings/sec, 145 secs
lola: 4588650 markings, 220242638 edges, 29191 markings/sec, 150 secs
lola: 4732364 markings, 227119532 edges, 28743 markings/sec, 155 secs
lola: 4877217 markings, 233858363 edges, 28971 markings/sec, 160 secs
lola: 5024431 markings, 240775286 edges, 29443 markings/sec, 165 secs
lola: 5183181 markings, 247699957 edges, 31750 markings/sec, 170 secs
lola: 5331470 markings, 254554329 edges, 29658 markings/sec, 175 secs
lola: 5481449 markings, 261385124 edges, 29996 markings/sec, 180 secs
lola: 5625388 markings, 268224631 edges, 28788 markings/sec, 185 secs
lola: 5770691 markings, 275139909 edges, 29061 markings/sec, 190 secs
lola: 5914568 markings, 281838869 edges, 28775 markings/sec, 195 secs
lola: 6055061 markings, 288375125 edges, 28099 markings/sec, 200 secs
lola: 6200766 markings, 294938292 edges, 29141 markings/sec, 205 secs
lola: 6351398 markings, 301801680 edges, 30126 markings/sec, 210 secs
lola: 6501734 markings, 308576912 edges, 30067 markings/sec, 215 secs
lola: 6651343 markings, 315431455 edges, 29922 markings/sec, 220 secs
lola: 6773161 markings, 322936852 edges, 24364 markings/sec, 225 secs
lola: 6910025 markings, 330119073 edges, 27373 markings/sec, 230 secs
lola: 7047483 markings, 336965691 edges, 27492 markings/sec, 235 secs
lola: 7192339 markings, 343676795 edges, 28971 markings/sec, 240 secs
lola: 7341351 markings, 350641822 edges, 29802 markings/sec, 245 secs
lola: 7486574 markings, 357279523 edges, 29045 markings/sec, 250 secs
lola: 7631898 markings, 364095441 edges, 29065 markings/sec, 255 secs
lola: 7774200 markings, 370704574 edges, 28460 markings/sec, 260 secs
lola: 7917207 markings, 377285020 edges, 28601 markings/sec, 265 secs
lola: 8059208 markings, 383907438 edges, 28400 markings/sec, 270 secs
lola: 8203311 markings, 390643323 edges, 28821 markings/sec, 275 secs
lola: 8343769 markings, 397233931 edges, 28092 markings/sec, 280 secs
lola: 8488235 markings, 403883186 edges, 28893 markings/sec, 285 secs
lola: 8629160 markings, 410336143 edges, 28185 markings/sec, 290 secs
lola: 8772158 markings, 416938388 edges, 28600 markings/sec, 295 secs
lola: 8909740 markings, 423961771 edges, 27516 markings/sec, 300 secs
lola: 9050337 markings, 431130786 edges, 28119 markings/sec, 305 secs
lola: 9193848 markings, 438209650 edges, 28702 markings/sec, 310 secs
lola: 9339053 markings, 445174914 edges, 29041 markings/sec, 315 secs
lola: 9486824 markings, 452143972 edges, 29554 markings/sec, 320 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: memory allocation failed
lola:
preliminary result: yes no no unknown no no unknown
FORMULA DLCround-PT-05a-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-05a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DLCround-PT-05a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/DLCround-PT-05a.tgz
mv DLCround-PT-05a execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is DLCround-PT-05a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r071-smll-152649743800031"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;