fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r094-blw7-152650006200199
Last Updated
June 26, 2018

About the Execution of M4M.full for FlexibleBarrier-PT-18a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13145.440 573122.00 579230.00 216.00 ???????????????? 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 440K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 265K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is FlexibleBarrier-PT-18a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r094-blw7-152650006200199
=====================================================================


--------------------
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 FlexibleBarrier-PT-18a-CTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-18a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527509641367


BK_STOP 1527510214489

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using FlexibleBarrier-PT-18a as instance name.
Using FlexibleBarrier 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': 3524, 'Memory': 319.62, 'Tool': 'itstools'}, {'Time': 7077, 'Memory': 196.95, 'Tool': 'gspn'}, {'Time': 2837640, 'Memory': 15952.45, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 805.2326901248581x far from the best tool itstools.
CTLCardinality lola FlexibleBarrier-PT-18a...

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-18a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ FlexibleBarrier-PT-18a @ 3540 seconds
make: [verify] Error 134 (ignored)
Makefile:222: recipe for target 'verify' failed
----- 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: 1105/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 219 places, 886 transitions, 199 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 634 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-18a-CTLCardinality.task
lola: (((E (G ((p91 <= p140))) AND (p89 <= p3)) AND A (G ((p16 <= p48)))) AND A (F (A (G ((p208 <= p201)))))) : NOT(E (F ((((2 <= p73) AND (p125 <= p175)) OR (p61 + 1 <= p114))))) : (A (G (((p34 <= 1) OR ((p55 <= p6) AND (3 <= p128))))) OR A (G (((2 <= p102) AND (3 <= p33) AND ((1 <= p7) OR (p112 <= p140)))))) : A (G ((E (F ((2 <= p2))) OR A (G ((p14 <= p190)))))) : (A (G ((p81 <= p67))) OR (((p22 <= p41) AND A (G ((p150 <= p18)))) AND E (((p138 <= p113) U (3 <= p83))))) : NOT(A (F (A (G ((p27 <= p77)))))) : E ((((p16 <= p131) AND (1 <= p184) AND (2 <= p152) AND (2 <= p196)) U E (F ((1 <= p193))))) : A (X (A (G ((p149 <= p218))))) : NOT(A (G ((p124 <= p114)))) : E (F (E (X ((p214 + 1 <= p61))))) : NOT(NOT(E (F ((3 <= p31))))) : E ((((p95 <= p210) OR (3 <= p172) OR ((p22 <= p107) AND (p197 <= p18))) U ((p5 + 1 <= p7) AND ((3 <= p2) OR (p198 <= p157))))) : (A (G ((p171 <= p112))) OR (3 <= p105)) : E (F (E (X ((3 <= p46))))) : ((((p175 <= 1) AND (p199 <= 1) AND (3 <= p91)) AND (((p202 + 1 <= p48) AND (p125 <= p97)) AND E (X ((1 <= p162))))) OR (A (G (((p62 <= p132) OR (p82 <= p78)))) AND (p181 <= p137))) : E (F (A (G (((p5 <= p77) OR (2 <= p105))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((p91 <= p140))) AND (p89 <= p3)) AND A (G ((p16 <= p48)))) AND A (F (A (G ((p208 <= p201))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p91 <= p140)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p140 + 1 <= p91)))
lola: processed formula length: 32
lola: 5 rewrites
lola: formula mentions 0 of 219 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 4 markings, 4 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p89 <= p3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p89 <= p3)
lola: processed formula length: 11
lola: 3 rewrites
lola: formula mentions 0 of 219 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18a-CTLCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p16 <= p48)))
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 28 bytes per marking, with 25 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: state equation: write sara problem file to FlexibleBarrier-PT-18a-CTLCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 93 markings, 139 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((((2 <= p73) AND (p125 <= p175)) OR (p61 + 1 <= p114)))))
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 28 bytes per marking, with 25 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 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18a-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 15 markings, 15 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (((p34 <= 1) OR ((p55 <= p6) AND (3 <= p128))))) OR A (G (((2 <= p102) AND (3 <= p33) AND ((1 <= p7) OR (p112 <= p140))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p34 <= 1) OR ((p55 <= p6) AND (3 <= p128)))))
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 28 bytes per marking, with 25 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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18a-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18a-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((2 <= p2))) OR A (G ((p14 <= p190))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (2 <= p2))) AND E(TRUE U (p190 + 1 <= p14)))))
lola: processed formula length: 73
lola: 6 rewrites
lola: formula mentions 0 of 219 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 25 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 660478 markings, 3813237 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1281527 markings, 7627108 edges, 124210 markings/sec, 5 secs
lola: 1937675 markings, 11370076 edges, 131230 markings/sec, 10 secs
lola: 2576520 markings, 15124183 edges, 127769 markings/sec, 15 secs
lola: 3203918 markings, 18797415 edges, 125480 markings/sec, 20 secs
lola: 3790200 markings, 22373509 edges, 117256 markings/sec, 25 secs
lola: 4456531 markings, 26126094 edges, 133266 markings/sec, 30 secs
lola: 5097180 markings, 29858350 edges, 128130 markings/sec, 35 secs
lola: 5725122 markings, 33531325 edges, 125588 markings/sec, 40 secs
lola: 6323003 markings, 37211591 edges, 119576 markings/sec, 45 secs
lola: 6929849 markings, 40957560 edges, 121369 markings/sec, 50 secs
lola: 7580971 markings, 44749099 edges, 130224 markings/sec, 55 secs
lola: 8168283 markings, 48418958 edges, 117462 markings/sec, 60 secs
lola: 8756829 markings, 52083433 edges, 117709 markings/sec, 65 secs
lola: 9369325 markings, 55741776 edges, 122499 markings/sec, 70 secs
lola: 9942366 markings, 59397983 edges, 114608 markings/sec, 75 secs
lola: 10527157 markings, 63043853 edges, 116958 markings/sec, 80 secs
lola: 11119137 markings, 66690905 edges, 118396 markings/sec, 85 secs
lola: 11695261 markings, 70339858 edges, 115225 markings/sec, 90 secs
lola: 12333226 markings, 74078045 edges, 127593 markings/sec, 95 secs
lola: 12921585 markings, 77734436 edges, 117672 markings/sec, 100 secs
lola: 13495110 markings, 81368965 edges, 114705 markings/sec, 105 secs
lola: 14063696 markings, 85004041 edges, 113717 markings/sec, 110 secs
lola: 14631405 markings, 88647824 edges, 113542 markings/sec, 115 secs
lola: 15202146 markings, 92299851 edges, 114148 markings/sec, 120 secs
lola: 15773440 markings, 95914524 edges, 114259 markings/sec, 125 secs
lola: 16354631 markings, 99546997 edges, 116238 markings/sec, 130 secs
lola: 16974755 markings, 103277789 edges, 124025 markings/sec, 135 secs
lola: 17571181 markings, 107000365 edges, 119285 markings/sec, 140 secs
lola: 18187485 markings, 110637608 edges, 123261 markings/sec, 145 secs
lola: 18767823 markings, 114208762 edges, 116068 markings/sec, 150 secs
lola: 19346800 markings, 117810794 edges, 115795 markings/sec, 155 secs
lola: 19898090 markings, 121462008 edges, 110258 markings/sec, 160 secs
lola: 20459812 markings, 125077120 edges, 112344 markings/sec, 165 secs
lola: 20999412 markings, 128691039 edges, 107920 markings/sec, 170 secs
lola: 21587026 markings, 132298952 edges, 117523 markings/sec, 175 secs
lola: 22189536 markings, 135840976 edges, 120502 markings/sec, 180 secs
lola: 22761092 markings, 139430397 edges, 114311 markings/sec, 185 secs
lola: 23306592 markings, 143043764 edges, 109100 markings/sec, 190 secs
lola: 23863693 markings, 146645595 edges, 111420 markings/sec, 195 secs
lola: 24431772 markings, 150234977 edges, 113616 markings/sec, 200 secs
lola: 24984256 markings, 153895232 edges, 110497 markings/sec, 205 secs
lola: 25536896 markings, 157488306 edges, 110528 markings/sec, 210 secs
lola: 26077568 markings, 161139474 edges, 108134 markings/sec, 215 secs
lola: 26622437 markings, 164798447 edges, 108974 markings/sec, 220 secs
lola: 27180156 markings, 168449836 edges, 111544 markings/sec, 225 secs
lola: 27715257 markings, 172107691 edges, 107020 markings/sec, 230 secs
lola: 28248287 markings, 175741697 edges, 106606 markings/sec, 235 secs
lola: 28789054 markings, 179349841 edges, 108153 markings/sec, 240 secs
lola: 29414913 markings, 183109527 edges, 125172 markings/sec, 245 secs
lola: 29944376 markings, 186618775 edges, 105893 markings/sec, 250 secs
lola: 30503613 markings, 190127710 edges, 111847 markings/sec, 255 secs
lola: 31041022 markings, 193682722 edges, 107482 markings/sec, 260 secs
lola: 31577450 markings, 197218994 edges, 107286 markings/sec, 265 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 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((p81 <= p67))) OR (((p22 <= p41) AND A (G ((p150 <= p18)))) AND E (((p138 <= p113) U (3 <= p83)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p81 <= p67)))
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 28 bytes per marking, with 25 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: state equation: write sara problem file to FlexibleBarrier-PT-18a-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18a-CTLCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p22 <= p41)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p22 <= p41)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 219 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18a-CTLCardinality.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 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p150 <= p18)))
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 28 bytes per marking, with 25 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: state equation: write sara problem file to FlexibleBarrier-PT-18a-CTLCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (G ((p27 <= p77))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (p77 + 1 <= p27)))))
lola: processed formula length: 46
lola: 7 rewrites
lola: formula mentions 0 of 219 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 25 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: 653433 markings, 3766390 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1275428 markings, 7589829 edges, 124399 markings/sec, 5 secs
lola: 1932785 markings, 11341017 edges, 131471 markings/sec, 10 secs
lola: 2571949 markings, 15100148 edges, 127833 markings/sec, 15 secs
lola: 3210529 markings, 18837252 edges, 127716 markings/sec, 20 secs
lola: 3833731 markings, 22615735 edges, 124640 markings/sec, 25 secs
lola: 4499631 markings, 26379404 edges, 133180 markings/sec, 30 secs
lola: 5144119 markings, 30111426 edges, 128898 markings/sec, 35 secs
lola: 5771482 markings, 33789567 edges, 125473 markings/sec, 40 secs
lola: 6364382 markings, 37487010 edges, 118580 markings/sec, 45 secs
lola: 6982216 markings, 41255955 edges, 123567 markings/sec, 50 secs
lola: 7605130 markings, 44901304 edges, 124583 markings/sec, 55 secs
lola: 8195322 markings, 48590902 edges, 118038 markings/sec, 60 secs
lola: 8791078 markings, 52284536 edges, 119151 markings/sec, 65 secs
lola: 9402665 markings, 55973691 edges, 122317 markings/sec, 70 secs
lola: 9985041 markings, 59651431 edges, 116475 markings/sec, 75 secs
lola: 10569950 markings, 63320957 edges, 116982 markings/sec, 80 secs
lola: 11167707 markings, 66996304 edges, 119551 markings/sec, 85 secs
lola: 11743525 markings, 70679324 edges, 115164 markings/sec, 90 secs
lola: 12393189 markings, 74443007 edges, 129933 markings/sec, 95 secs
lola: 12985112 markings, 78101185 edges, 118385 markings/sec, 100 secs
lola: 13555725 markings, 81773713 edges, 114123 markings/sec, 105 secs
lola: 14131126 markings, 85424275 edges, 115080 markings/sec, 110 secs
lola: 14702789 markings, 89107670 edges, 114333 markings/sec, 115 secs
lola: 15276598 markings, 92781193 edges, 114762 markings/sec, 120 secs
lola: 15855853 markings, 96416611 edges, 115851 markings/sec, 125 secs
lola: 16444183 markings, 100095015 edges, 117666 markings/sec, 130 secs
lola: 17066601 markings, 103841365 edges, 124484 markings/sec, 135 secs
lola: 17675152 markings, 107575874 edges, 121710 markings/sec, 140 secs
lola: 18280326 markings, 111222758 edges, 121035 markings/sec, 145 secs
lola: 18860190 markings, 114817694 edges, 115973 markings/sec, 150 secs
lola: 19444034 markings, 118450592 edges, 116769 markings/sec, 155 secs
lola: 19998358 markings, 122122199 edges, 110865 markings/sec, 160 secs
lola: 20562344 markings, 125760591 edges, 112797 markings/sec, 165 secs
lola: 21105755 markings, 129406941 edges, 108682 markings/sec, 170 secs
lola: 21714180 markings, 133010240 edges, 121685 markings/sec, 175 secs
lola: 22313516 markings, 136579334 edges, 119867 markings/sec, 180 secs
lola: 22879697 markings, 140208309 edges, 113236 markings/sec, 185 secs
lola: 23427019 markings, 143838248 edges, 109464 markings/sec, 190 secs
lola: 24006054 markings, 147463910 edges, 115807 markings/sec, 195 secs
lola: 24564473 markings, 151080840 edges, 111684 markings/sec, 200 secs
lola: 25120388 markings, 154753333 edges, 111183 markings/sec, 205 secs
lola: 25667964 markings, 158389181 edges, 109515 markings/sec, 210 secs
lola: 26211980 markings, 162068220 edges, 108803 markings/sec, 215 secs
lola: 26766023 markings, 165740471 edges, 110809 markings/sec, 220 secs
lola: 27320665 markings, 169426747 edges, 110928 markings/sec, 225 secs
lola: 27861831 markings, 173096754 edges, 108233 markings/sec, 230 secs
lola: 28399269 markings, 176738877 edges, 107488 markings/sec, 235 secs
lola: 28985880 markings, 180461571 edges, 117322 markings/sec, 240 secs
lola: 29569740 markings, 184119649 edges, 116772 markings/sec, 245 secs
lola: 30116078 markings, 187701938 edges, 109268 markings/sec, 250 secs
lola: 30685094 markings, 191338780 edges, 113803 markings/sec, 255 secs
lola: 31240050 markings, 194954654 edges, 110991 markings/sec, 260 secs
lola: 31781280 markings, 198598927 edges, 108246 markings/sec, 265 secs
lola: 32307997 markings, 202126635 edges, 105343 markings/sec, 270 secs
lola: 32854537 markings, 205659030 edges, 109308 markings/sec, 275 secs
lola: 33428322 markings, 209277646 edges, 114757 markings/sec, 280 secs
lola: 33957993 markings, 212873465 edges, 105934 markings/sec, 285 secs
lola: 34488451 markings, 216366895 edges, 106092 markings/sec, 290 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-18a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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/FlexibleBarrier-PT-18a.tgz
mv FlexibleBarrier-PT-18a 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-full"
echo " Input is FlexibleBarrier-PT-18a, 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 r094-blw7-152650006200199"
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 ;