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 irma4mcc-structural
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 r079-blw3-152649947000439
=====================================================================

--------------------
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 1527096583977


BK_STOP 1527097037120

--------------------
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 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...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ Echo-PT-d02r15 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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 || 1034917 markings, 1065174 edges, 206983 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
sara: try reading problem file Echo-PT-d02r15-ReachabilityCardinality-6.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 || 1271476 markings, 1342853 edges, 254295 markings/sec, 0 secs
lola: sara is running 5 secs || 2231210 markings, 2791106 edges, 191947 markings/sec, 5 secs
lola: sara is running 10 secs || 3157516 markings, 4221747 edges, 185261 markings/sec, 10 secs
lola: sara is running 15 secs || 3962407 markings, 5698648 edges, 160978 markings/sec, 15 secs
lola: sara is running 20 secs || 4814375 markings, 7134632 edges, 170394 markings/sec, 20 secs
lola: sara is running 25 secs || 5753832 markings, 8595069 edges, 187891 markings/sec, 25 secs
lola: sara is running 30 secs || 6758801 markings, 10020319 edges, 200994 markings/sec, 30 secs
lola: sara is running 35 secs || 7802888 markings, 11421146 edges, 208817 markings/sec, 35 secs
lola: sara is running 40 secs || 8762711 markings, 12834121 edges, 191965 markings/sec, 40 secs
lola: sara is running 45 secs || 9743405 markings, 14205944 edges, 196139 markings/sec, 45 secs
lola: sara is running 50 secs || 10668513 markings, 15567477 edges, 185022 markings/sec, 50 secs
lola: sara is running 55 secs || 11544558 markings, 16948501 edges, 175209 markings/sec, 55 secs
lola: sara is running 60 secs || 12795030 markings, 18265196 edges, 250094 markings/sec, 60 secs
lola: sara is running 65 secs || 13607162 markings, 19727894 edges, 162426 markings/sec, 65 secs
lola: sara is running 70 secs || 14557614 markings, 21136283 edges, 190090 markings/sec, 70 secs
lola: sara is running 75 secs || 15494131 markings, 22517190 edges, 187303 markings/sec, 75 secs
lola: sara is running 80 secs || 16304257 markings, 23948800 edges, 162025 markings/sec, 80 secs
lola: sara is running 85 secs || 17177970 markings, 25408151 edges, 174743 markings/sec, 85 secs
lola: sara is running 90 secs || 18273978 markings, 26779623 edges, 219202 markings/sec, 90 secs
lola: sara is running 95 secs || 19235381 markings, 28205276 edges, 192281 markings/sec, 95 secs
lola: sara is running 100 secs || 20367860 markings, 29578255 edges, 226496 markings/sec, 100 secs
lola: sara is running 105 secs || 21370513 markings, 30974323 edges, 200531 markings/sec, 105 secs
lola: sara is running 110 secs || 22403326 markings, 32322742 edges, 206563 markings/sec, 110 secs
lola: sara is running 115 secs || 23426854 markings, 33678459 edges, 204706 markings/sec, 115 secs
lola: sara is running 120 secs || 24426941 markings, 35037834 edges, 200017 markings/sec, 120 secs
lola: sara is running 125 secs || 25289530 markings, 36456969 edges, 172518 markings/sec, 125 secs
lola: sara is running 130 secs || 26213762 markings, 37856354 edges, 184846 markings/sec, 130 secs
lola: sara is running 135 secs || 27072585 markings, 39290849 edges, 171765 markings/sec, 135 secs
lola: sara is running 140 secs || 28030088 markings, 40646632 edges, 191501 markings/sec, 140 secs
lola: sara is running 145 secs || 29010587 markings, 41985100 edges, 196100 markings/sec, 145 secs
lola: sara is running 150 secs || 29819884 markings, 43409579 edges, 161859 markings/sec, 150 secs
lola: sara is running 155 secs || 30517401 markings, 44873247 edges, 139503 markings/sec, 155 secs
lola: sara is running 160 secs || 31163941 markings, 46347294 edges, 129308 markings/sec, 160 secs
lola: sara is running 165 secs || 31792478 markings, 47841361 edges, 125707 markings/sec, 165 secs
lola: sara is running 170 secs || 32431094 markings, 49337948 edges, 127723 markings/sec, 170 secs
lola: sara is running 175 secs || 33186186 markings, 50741214 edges, 151018 markings/sec, 175 secs
lola: sara is running 180 secs || 33971923 markings, 52147190 edges, 157147 markings/sec, 180 secs
lola: sara is running 185 secs || 34697153 markings, 53525556 edges, 145046 markings/sec, 185 secs
lola: sara is running 190 secs || 35457547 markings, 54977465 edges, 152079 markings/sec, 190 secs
lola: sara is running 195 secs || 36205943 markings, 56430109 edges, 149679 markings/sec, 195 secs
lola: sara is running 200 secs || 36687438 markings, 57980970 edges, 96299 markings/sec, 200 secs
lola: sara is running 205 secs || 37143103 markings, 59554874 edges, 91133 markings/sec, 205 secs
lola: sara is running 210 secs || 37565067 markings, 61152605 edges, 84393 markings/sec, 210 secs
lola: sara is running 215 secs || 38012418 markings, 62730116 edges, 89470 markings/sec, 215 secs
lola: sara is running 220 secs || 38423506 markings, 64334569 edges, 82218 markings/sec, 220 secs
lola: sara is running 225 secs || 38876892 markings, 65906532 edges, 90677 markings/sec, 225 secs
lola: sara is running 230 secs || 39279976 markings, 67428487 edges, 80617 markings/sec, 230 secs
lola: sara is running 235 secs || 40084986 markings, 68844623 edges, 161002 markings/sec, 235 secs
lola: sara is running 240 secs || 40787299 markings, 70223441 edges, 140463 markings/sec, 240 secs
lola: sara is running 245 secs || 41696461 markings, 71553477 edges, 181832 markings/sec, 245 secs
lola: sara is running 250 secs || 42589191 markings, 72861899 edges, 178546 markings/sec, 250 secs
lola: sara is running 255 secs || 43337818 markings, 74255466 edges, 149725 markings/sec, 255 secs
lola: sara is running 260 secs || 43866663 markings, 75746492 edges, 105769 markings/sec, 260 secs
lola: sara is running 265 secs || 44397931 markings, 77193011 edges, 106254 markings/sec, 265 secs
lola: sara is running 270 secs || 44812659 markings, 78672705 edges, 82946 markings/sec, 270 secs
lola: sara is running 275 secs || 45580339 markings, 80042119 edges, 153536 markings/sec, 275 secs
lola: sara is running 280 secs || 46173809 markings, 81470739 edges, 118694 markings/sec, 280 secs
lola: sara is running 285 secs || 46807860 markings, 82860332 edges, 126810 markings/sec, 285 secs
lola: sara is running 290 secs || 47467746 markings, 84221438 edges, 131977 markings/sec, 290 secs
lola: sara is running 295 secs || 47958335 markings, 85646606 edges, 98118 markings/sec, 295 secs
lola: sara is running 300 secs || 49055539 markings, 86890207 edges, 219441 markings/sec, 300 secs
lola: sara is running 305 secs || 49986448 markings, 88182050 edges, 186182 markings/sec, 305 secs
lola: sara is running 310 secs || 50814344 markings, 89489368 edges, 165579 markings/sec, 310 secs
lola: sara is running 315 secs || 51583255 markings, 90829809 edges, 153782 markings/sec, 315 secs
lola: sara is running 320 secs || 52658058 markings, 92073589 edges, 214961 markings/sec, 320 secs
lola: sara is running 325 secs || 53683805 markings, 93331001 edges, 205149 markings/sec, 325 secs
lola: sara is running 330 secs || 54686933 markings, 94592655 edges, 200626 markings/sec, 330 secs
lola: sara is running 335 secs || 55744304 markings, 95814449 edges, 211474 markings/sec, 335 secs
lola: sara is running 340 secs || 56659392 markings, 97078767 edges, 183018 markings/sec, 340 secs
lola: sara is running 345 secs || 57635302 markings, 98328165 edges, 195182 markings/sec, 345 secs
lola: sara is running 350 secs || 58060928 markings, 99759451 edges, 85125 markings/sec, 350 secs
lola: sara is running 355 secs || 58360074 markings, 101281482 edges, 59829 markings/sec, 355 secs
lola: sara is running 360 secs || 58731400 markings, 102768440 edges, 74265 markings/sec, 360 secs
lola: sara is running 365 secs || 59398501 markings, 104152706 edges, 133420 markings/sec, 365 secs
lola: sara is running 370 secs || 59933278 markings, 105593910 edges, 106955 markings/sec, 370 secs
lola: sara is running 375 secs || 60733303 markings, 106942719 edges, 160005 markings/sec, 375 secs
lola: sara is running 380 secs || 61515477 markings, 108267664 edges, 156435 markings/sec, 380 secs
lola: sara is running 385 secs || 62241324 markings, 109601019 edges, 145169 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: ========================================
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: 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)
state equation: write sara problem file to Echo-PT-d02r15-ReachabilityCardinality-10.sara
lola: ========================================
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.
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: state equation: calling and running 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 stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d02r15"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/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 irma4mcc-structural"
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 r079-blw3-152649947000439"
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 '' ReachabilityCardinality.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 ;