About the Execution of M4M.full for Echo-PT-d02r15
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6750.180 | 452659.00 | 827480.00 | 371.60 | FTFFFFT?FFTFFFTF | 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 964K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 7.9K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 105 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 343 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 804K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Echo-PT-d02r15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-blw3-152649949800439
=====================================================================
--------------------
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 Echo-PT-d02r15-ReachabilityCardinality-00
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-01
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-02
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-03
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-04
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-05
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-06
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-07
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-08
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-09
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-10
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-11
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-12
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-13
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-14
FORMULA_NAME Echo-PT-d02r15-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1527424928897
BK_STOP 1527425381556
--------------------
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 Echo-PT-d02r15 as instance name.
Using Echo as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 10804, 'Memory': 186.16, 'Tool': 'lola'}, {'Time': 11142, 'Memory': 659.4, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola Echo-PT-d02r15...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
Echo-PT-d02r15: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
Echo-PT-d02r15: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ Echo-PT-d02r15 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 3801/65536 symbol table entries, 7 collisions
lola: preprocessing...
lola: finding significant places
lola: 2127 places, 1674 transitions, 1062 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3336 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d02r15-ReachabilityCardinality.task
lola: E (F ((((3 <= p628) AND ((3 <= p508) OR (3 <= p1940))) OR ((3 <= p524) AND (2 <= p445) AND ((1 <= p1139) OR (1 <= p414)))))) : A (G ((((p1615 <= p571) AND (2 <= p623)) OR ((p1617 <= p1350) AND (p64 <= p1259)) OR ((p89 <= 1) AND (p1766 <= 2))))) : A (G ((p619 <= 0))) : A (G (((p1324 <= p310) AND (p1081 <= p1618)))) : A (G ((p1703 <= p881))) : A (G ((p637 <= p1691))) : E (F ((p1273 + 1 <= p1513))) : E (F ((((p1433 <= p1003) OR (p305 <= p2081)) AND (p189 + 1 <= p1143) AND (p2049 + 1 <= p1059)))) : E (F ((3 <= p160))) : E (F ((3 <= p1097))) : A (G (((p709 + 1 <= p182) OR (p918 + 1 <= p1867) OR (p1933 <= 1)))) : A (G (((p2010 + 1 <= p1009) OR (p1729 + 1 <= p2017)))) : E (F (((2 <= p2042) AND (3 <= p533) AND (p1354 <= p1829) AND ((1 <= p715) OR (p1549 <= p1459) OR (p1314 <= p1822))))) : E (F ((2 <= p1133))) : E (F ((((p1517 <= p829) OR (p699 <= p1946)) AND (p970 <= p1382) AND (1 <= p121)))) : E (F (((p1153 <= p1859) AND (2 <= p96))))
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 (F ((((3 <= p628) AND ((3 <= p508) OR (3 <= p1940))) OR ((3 <= p524) AND (2 <= p445) AND ((1 <= p1139) OR (1 <= p414))))))
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 136 bytes per marking, with 26 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 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r15-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r15-ReachabilityCardinality.sara.
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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p1615 <= p571) AND (2 <= p623)) OR ((p1617 <= p1350) AND (p64 <= p1259)) OR ((p89 <= 1) AND (p1766 <= 2)))))
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 136 bytes per marking, with 26 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 24 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r15-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r15-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1012778 markings, 1042654 edges, 202556 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p619 <= 0)))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 12 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1324 <= p310) AND (p1081 <= p1618))))
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 136 bytes per marking, with 26 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r15-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 33 markings, 32 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1703 <= p881)))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-ReachabilityCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 16 markings, 15 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p637 <= p1691)))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r15-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 60 markings, 59 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1273 + 1 <= p1513)))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 12 markings, 11 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1433 <= p1003) OR (p305 <= p2081)) AND (p189 + 1 <= p1143) AND (p2049 + 1 <= p1059))))
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 136 bytes per marking, with 26 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: state equation: write sara problem file to Echo-PT-d02r15-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r15-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1204387 markings, 1273745 edges, 240877 markings/sec, 0 secs
lola: sara is running 5 secs || 2153797 markings, 2663243 edges, 189882 markings/sec, 5 secs
lola: sara is running 10 secs || 3060364 markings, 4068627 edges, 181313 markings/sec, 10 secs
lola: sara is running 15 secs || 3863727 markings, 5482767 edges, 160673 markings/sec, 15 secs
lola: sara is running 20 secs || 4677983 markings, 6915110 edges, 162851 markings/sec, 20 secs
lola: sara is running 25 secs || 5588875 markings, 8321280 edges, 182178 markings/sec, 25 secs
lola: sara is running 30 secs || 6605308 markings, 9687347 edges, 203287 markings/sec, 30 secs
lola: sara is running 35 secs || 7544378 markings, 11071091 edges, 187814 markings/sec, 35 secs
lola: sara is running 40 secs || 8497668 markings, 12436684 edges, 190658 markings/sec, 40 secs
lola: sara is running 45 secs || 9470301 markings, 13764597 edges, 194527 markings/sec, 45 secs
lola: sara is running 50 secs || 10327546 markings, 15115304 edges, 171449 markings/sec, 50 secs
lola: sara is running 55 secs || 11271577 markings, 16457712 edges, 188806 markings/sec, 55 secs
lola: sara is running 60 secs || 12347398 markings, 17803360 edges, 215164 markings/sec, 60 secs
lola: sara is running 65 secs || 13268568 markings, 19189406 edges, 184234 markings/sec, 65 secs
lola: sara is running 70 secs || 14202388 markings, 20588111 edges, 186764 markings/sec, 70 secs
lola: sara is running 75 secs || 15135202 markings, 21972643 edges, 186563 markings/sec, 75 secs
lola: sara is running 80 secs || 16000676 markings, 23376226 edges, 173095 markings/sec, 80 secs
lola: sara is running 85 secs || 16818975 markings, 24751884 edges, 163660 markings/sec, 85 secs
lola: sara is running 90 secs || 17723601 markings, 26159436 edges, 180925 markings/sec, 90 secs
lola: sara is running 95 secs || 18847575 markings, 27500788 edges, 224795 markings/sec, 95 secs
lola: sara is running 100 secs || 19830631 markings, 28865874 edges, 196611 markings/sec, 100 secs
lola: sara is running 105 secs || 20855641 markings, 30203857 edges, 205002 markings/sec, 105 secs
lola: sara is running 110 secs || 21791976 markings, 31567819 edges, 187267 markings/sec, 110 secs
lola: sara is running 115 secs || 22846388 markings, 32859818 edges, 210882 markings/sec, 115 secs
lola: sara is running 120 secs || 23776489 markings, 34189903 edges, 186020 markings/sec, 120 secs
lola: sara is running 125 secs || 24728226 markings, 35512436 edges, 190347 markings/sec, 125 secs
lola: sara is running 130 secs || 25571565 markings, 36869756 edges, 168668 markings/sec, 130 secs
lola: sara is running 135 secs || 26443462 markings, 38251543 edges, 174379 markings/sec, 135 secs
lola: sara is running 140 secs || 27358001 markings, 39624913 edges, 182908 markings/sec, 140 secs
lola: sara is running 145 secs || 28274425 markings, 40968172 edges, 183285 markings/sec, 145 secs
lola: sara is running 150 secs || 29203999 markings, 42277435 edges, 185915 markings/sec, 150 secs
lola: sara is running 155 secs || 29955973 markings, 43704148 edges, 150395 markings/sec, 155 secs
lola: sara is running 160 secs || 30607559 markings, 45161799 edges, 130317 markings/sec, 160 secs
lola: sara is running 165 secs || 31322128 markings, 46572107 edges, 142914 markings/sec, 165 secs
lola: sara is running 170 secs || 31852712 markings, 48034493 edges, 106117 markings/sec, 170 secs
lola: sara is running 175 secs || 32553779 markings, 49466082 edges, 140213 markings/sec, 175 secs
lola: sara is running 180 secs || 33251302 markings, 50936689 edges, 139505 markings/sec, 180 secs
lola: sara is running 185 secs || 34087867 markings, 52317627 edges, 167313 markings/sec, 185 secs
lola: sara is running 190 secs || 34846555 markings, 53713954 edges, 151738 markings/sec, 190 secs
lola: sara is running 195 secs || 35554970 markings, 55121388 edges, 141683 markings/sec, 195 secs
lola: sara is running 200 secs || 36252854 markings, 56525941 edges, 139577 markings/sec, 200 secs
lola: sara is running 205 secs || 36710871 markings, 58034207 edges, 91603 markings/sec, 205 secs
lola: sara is running 210 secs || 37148247 markings, 59575985 edges, 87475 markings/sec, 210 secs
lola: sara is running 215 secs || 37562271 markings, 61137999 edges, 82805 markings/sec, 215 secs
lola: sara is running 220 secs || 37998445 markings, 62680790 edges, 87235 markings/sec, 220 secs
lola: sara is running 225 secs || 38393558 markings, 64230292 edges, 79023 markings/sec, 225 secs
lola: sara is running 230 secs || 38835280 markings, 65757507 edges, 88344 markings/sec, 230 secs
lola: sara is running 235 secs || 39240765 markings, 67261655 edges, 81097 markings/sec, 235 secs
lola: sara is running 240 secs || 39991298 markings, 68693233 edges, 150107 markings/sec, 240 secs
lola: sara is running 245 secs || 40705859 markings, 70121987 edges, 142912 markings/sec, 245 secs
lola: sara is running 250 secs || 41663021 markings, 71481604 edges, 191432 markings/sec, 250 secs
lola: sara is running 255 secs || 42558526 markings, 72828875 edges, 179101 markings/sec, 255 secs
lola: sara is running 260 secs || 43317934 markings, 74234273 edges, 151882 markings/sec, 260 secs
lola: sara is running 265 secs || 43869312 markings, 75760869 edges, 110276 markings/sec, 265 secs
lola: sara is running 270 secs || 44441750 markings, 77266644 edges, 114488 markings/sec, 270 secs
lola: sara is running 275 secs || 44832192 markings, 78839298 edges, 78088 markings/sec, 275 secs
lola: sara is running 280 secs || 45633211 markings, 80264532 edges, 160204 markings/sec, 280 secs
lola: sara is running 285 secs || 46306616 markings, 81632544 edges, 134681 markings/sec, 285 secs
lola: sara is running 290 secs || 46989684 markings, 83067942 edges, 136614 markings/sec, 290 secs
lola: sara is running 295 secs || 47546234 markings, 84527173 edges, 111310 markings/sec, 295 secs
lola: sara is running 300 secs || 48245073 markings, 85956510 edges, 139768 markings/sec, 300 secs
lola: sara is running 305 secs || 49352862 markings, 87272193 edges, 221558 markings/sec, 305 secs
lola: sara is running 310 secs || 50270423 markings, 88618550 edges, 183512 markings/sec, 310 secs
lola: sara is running 315 secs || 51152995 markings, 89981735 edges, 176514 markings/sec, 315 secs
lola: sara is running 320 secs || 52074710 markings, 91371954 edges, 184343 markings/sec, 320 secs
lola: sara is running 325 secs || 53201628 markings, 92686176 edges, 225384 markings/sec, 325 secs
lola: sara is running 330 secs || 54239438 markings, 94000660 edges, 207562 markings/sec, 330 secs
lola: sara is running 335 secs || 55276136 markings, 95295127 edges, 207340 markings/sec, 335 secs
lola: sara is running 340 secs || 56319101 markings, 96581092 edges, 208593 markings/sec, 340 secs
lola: sara is running 345 secs || 57339662 markings, 97886837 edges, 204112 markings/sec, 345 secs
lola: sara is running 350 secs || 57935451 markings, 99342548 edges, 119158 markings/sec, 350 secs
lola: sara is running 355 secs || 58299512 markings, 100890792 edges, 72812 markings/sec, 355 secs
lola: sara is running 360 secs || 58585227 markings, 102479828 edges, 57143 markings/sec, 360 secs
lola: sara is running 365 secs || 59281039 markings, 103919244 edges, 139162 markings/sec, 365 secs
lola: sara is running 370 secs || 59842479 markings, 105426932 edges, 112288 markings/sec, 370 secs
lola: sara is running 375 secs || 60680712 markings, 106880208 edges, 167647 markings/sec, 375 secs
lola: sara is running 380 secs || 61509111 markings, 108240962 edges, 165680 markings/sec, 380 secs
lola: sara is running 385 secs || 62258926 markings, 109619402 edges, 149963 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p160)))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r15-ReachabilityCardinality-8.sara.
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 9 will run for 448 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1097)))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r15-ReachabilityCardinality-9.sara.
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: subprocess 10 will run for 522 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p709 + 1 <= p182) OR (p918 + 1 <= p1867) OR (p1933 <= 1))))
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 136 bytes per marking, with 26 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: state equation: write sara problem file to Echo-PT-d02r15-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 627 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2010 + 1 <= p1009) OR (p1729 + 1 <= p2017))))
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 136 bytes per marking, with 26 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: state equation: write sara problem file to Echo-PT-d02r15-ReachabilityCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 784 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p2042) AND (3 <= p533) AND (p1354 <= p1829) AND ((1 <= p715) OR (p1549 <= p1459) OR (p1314 <= p1822)))))
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 136 bytes per marking, with 26 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 12 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r15-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r15-ReachabilityCardinality-12.sara.
lola: ========================================
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 13 will run for 1044 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p1133)))
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 136 bytes per marking, with 26 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 Echo-PT-d02r15-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r15-ReachabilityCardinality-13.sara.
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 14 will run for 1566 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1517 <= p829) OR (p699 <= p1946)) AND (p970 <= p1382) AND (1 <= p121))))
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 136 bytes per marking, with 26 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: state equation: write sara problem file to Echo-PT-d02r15-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 421 markings, 420 edges
lola: ========================================
lola: subprocess 15 will run for 3132 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1153 <= p1859) AND (2 <= p96))))
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 136 bytes per marking, with 26 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: state equation: write sara problem file to Echo-PT-d02r15-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r15-ReachabilityCardinality-15.sara.
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: RESULT
lola:
SUMMARY: no yes no no no no yes unknown no no yes no no no yes no
lola: ========================================
FORMULA Echo-PT-d02r15-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r15-ReachabilityCardinality-15 FALSE 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="Echo-PT-d02r15"
export BK_EXAMINATION="ReachabilityCardinality"
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/Echo-PT-d02r15.tgz
mv Echo-PT-d02r15 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 Echo-PT-d02r15, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r082-blw3-152649949800439"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;