About the Execution of M4M.struct for DES-PT-50b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8934.190 | 440479.00 | 1009114.00 | 1350.40 | F?FFFFFFFTTFFFFT | 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 300K
-rw-r--r-- 1 mcc users 3.9K 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.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.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 8.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K 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 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 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 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K 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 127K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DES-PT-50b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r059-smll-152646386400278
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-00
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-01
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-02
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-03
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-04
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-05
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-06
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-07
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-08
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-09
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-10
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-11
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-12
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-13
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-14
FORMULA_NAME DES-PT-50b-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1526615004865
BK_STOP 1526615445344
--------------------
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 DES-PT-50b as instance name.
Using DES 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': None, 'Source Transition': False, 'Sink Transition': None, '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': 125024, 'Memory': 2168.53, 'Tool': 'itstools'}, {'Time': 126370, 'Memory': 2188.41, 'Tool': 'itstools'}, {'Time': 251680, 'Memory': 2085.49, 'Tool': 'lola'}, {'Time': 251928, 'Memory': 1943.04, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 2.013053493729204x far from the best tool itstools.
ReachabilityCardinality lola DES-PT-50b...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DES-PT-50b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
DES-PT-50b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ DES-PT-50b @ 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: 909/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 479 places, 430 transitions, 414 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 527 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-50b-ReachabilityCardinality.task
lola: E (F ((((1 <= p91) AND (2 <= p158)) OR ((3 <= p206) AND (p149 <= p194)) OR ((2 <= p66) AND (p99 <= p274) AND ((p452 <= p111) OR (2 <= p81)))))) : A (G (((p33 <= 0) OR ((p266 <= p457) AND (2 <= p27)) OR (p137 <= p297)))) : A (G (((p314 <= p416) OR ((p193 <= p282) AND (p142 <= p136) AND (p252 + 1 <= p79))))) : A (G (((p318 <= p294) OR (p234 + 1 <= p8) OR (3 <= p298)))) : E (F ((3 <= p120))) : A (G (((p296 <= p86) OR (p159 <= p218)))) : E (F (((p162 <= p261) AND (2 <= p139)))) : A (G (((((2 <= p122) OR (p303 <= p32)) AND (p92 <= 2)) OR (p477 <= p85)))) : E (F (((p359 + 1 <= p322) AND (p343 <= 2) AND (2 <= p388) AND (3 <= p383) AND ((p73 <= p153) OR (2 <= p273))))) : A (G (((p138 <= 2) OR (p144 + 1 <= p10) OR (p184 <= 1) OR ((3 <= p428) AND (p154 <= p389))))) : A (G (((p211 <= 0) OR (p417 + 1 <= p31) OR (p176 <= p408)))) : A (G (((3 <= p24) OR (p122 <= p466)))) : A (G (((1 <= p11) OR ((p46 <= p130) AND (p172 <= p156)) OR ((p226 + 1 <= p218) AND (p178 + 1 <= p44))))) : E (F ((2 <= p152))) : E (F ((3 <= p224))) : E (F (((1 <= p90) AND (p338 <= p373))))
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 ((((1 <= p91) AND (2 <= p158)) OR ((3 <= p206) AND (p149 <= p194)) OR ((2 <= p66) AND (p99 <= p274) AND ((p452 <= p111) OR (2 <= p81))))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-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 (((p33 <= 0) OR ((p266 <= p457) AND (2 <= p27)) OR (p137 <= p297))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1318410 markings, 1677719 edges, 263682 markings/sec, 0 secs
lola: sara is running 5 secs || 2523281 markings, 3335651 edges, 240974 markings/sec, 5 secs
lola: sara is running 10 secs || 3726777 markings, 4976698 edges, 240699 markings/sec, 10 secs
lola: sara is running 15 secs || 4857118 markings, 6591705 edges, 226068 markings/sec, 15 secs
lola: sara is running 20 secs || 5946827 markings, 8109605 edges, 217942 markings/sec, 20 secs
lola: sara is running 25 secs || 6751208 markings, 9853943 edges, 160876 markings/sec, 25 secs
lola: sara is running 30 secs || 7579532 markings, 11561690 edges, 165665 markings/sec, 30 secs
lola: sara is running 35 secs || 8402092 markings, 13254497 edges, 164512 markings/sec, 35 secs
lola: sara is running 40 secs || 9258437 markings, 15022475 edges, 171269 markings/sec, 40 secs
lola: sara is running 45 secs || 10117643 markings, 16796487 edges, 171841 markings/sec, 45 secs
lola: sara is running 50 secs || 10973534 markings, 18568220 edges, 171178 markings/sec, 50 secs
lola: sara is running 55 secs || 11834757 markings, 20347784 edges, 172245 markings/sec, 55 secs
lola: sara is running 60 secs || 12690496 markings, 22114433 edges, 171148 markings/sec, 60 secs
lola: sara is running 65 secs || 13552902 markings, 23898545 edges, 172481 markings/sec, 65 secs
lola: sara is running 70 secs || 14380470 markings, 25601044 edges, 165514 markings/sec, 70 secs
lola: sara is running 75 secs || 15190583 markings, 27264777 edges, 162023 markings/sec, 75 secs
lola: sara is running 80 secs || 16009869 markings, 28943860 edges, 163857 markings/sec, 80 secs
lola: sara is running 85 secs || 16814368 markings, 30650297 edges, 160900 markings/sec, 85 secs
lola: sara is running 90 secs || 17612424 markings, 32386601 edges, 159611 markings/sec, 90 secs
lola: sara is running 95 secs || 18439107 markings, 34150326 edges, 165337 markings/sec, 95 secs
lola: sara is running 100 secs || 19281336 markings, 35884865 edges, 168446 markings/sec, 100 secs
lola: sara is running 105 secs || 20125660 markings, 37625693 edges, 168865 markings/sec, 105 secs
lola: sara is running 110 secs || 20972867 markings, 39375546 edges, 169441 markings/sec, 110 secs
lola: sara is running 115 secs || 21836500 markings, 41156637 edges, 172727 markings/sec, 115 secs
lola: sara is running 120 secs || 22813767 markings, 43000248 edges, 195453 markings/sec, 120 secs
lola: sara is running 125 secs || 23665503 markings, 44859574 edges, 170347 markings/sec, 125 secs
lola: sara is running 130 secs || 24671346 markings, 46832435 edges, 201169 markings/sec, 130 secs
lola: sara is running 135 secs || 25629982 markings, 48744152 edges, 191727 markings/sec, 135 secs
lola: sara is running 140 secs || 26798704 markings, 50318363 edges, 233744 markings/sec, 140 secs
lola: sara is running 145 secs || 28045551 markings, 51791322 edges, 249369 markings/sec, 145 secs
lola: sara is running 150 secs || 29158259 markings, 53532055 edges, 222542 markings/sec, 150 secs
lola: sara is running 155 secs || 30302579 markings, 55192252 edges, 228864 markings/sec, 155 secs
lola: sara is running 160 secs || 31441243 markings, 57023053 edges, 227733 markings/sec, 160 secs
lola: sara is running 165 secs || 32610340 markings, 58723545 edges, 233819 markings/sec, 165 secs
lola: sara is running 170 secs || 33881428 markings, 60278399 edges, 254218 markings/sec, 170 secs
lola: sara is running 175 secs || 35199915 markings, 61857845 edges, 263697 markings/sec, 175 secs
lola: sara is running 180 secs || 36397805 markings, 63575683 edges, 239578 markings/sec, 180 secs
lola: sara is running 185 secs || 37527056 markings, 65311624 edges, 225850 markings/sec, 185 secs
lola: sara is running 190 secs || 38713928 markings, 67124060 edges, 237374 markings/sec, 190 secs
lola: sara is running 195 secs || 39854296 markings, 68829705 edges, 228074 markings/sec, 195 secs
lola: sara is running 200 secs || 41105658 markings, 70364127 edges, 250272 markings/sec, 200 secs
lola: sara is running 205 secs || 42364714 markings, 71923389 edges, 251811 markings/sec, 205 secs
lola: sara is running 210 secs || 43578997 markings, 73498879 edges, 242857 markings/sec, 210 secs
lola: sara is running 215 secs || 44634193 markings, 75279079 edges, 211039 markings/sec, 215 secs
lola: sara is running 220 secs || 45828858 markings, 77037841 edges, 238933 markings/sec, 220 secs
lola: sara is running 225 secs || 46991010 markings, 78782549 edges, 232430 markings/sec, 225 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p314 <= p416) OR ((p193 <= p282) AND (p142 <= p136) AND (p252 + 1 <= p79)))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: lola: The predicate is not invariant.state equation: calling and running sara
lola: 37 markings, 36 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p318 <= p294) OR (p234 + 1 <= p8) OR (3 <= p298))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-2.sara.
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-3.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 32 markings, 31 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p120)))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-4.sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-3.sara.
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p296 <= p86) OR (p159 <= p218))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 847148 markings, 2033235 edges, 169430 markings/sec, 0 secs
lola: sara is running 5 secs || 1690579 markings, 4046169 edges, 168686 markings/sec, 5 secs
lola: sara is running 10 secs || 2544837 markings, 6085817 edges, 170852 markings/sec, 10 secs
lola: sara is running 15 secs || 3418774 markings, 8168644 edges, 174787 markings/sec, 15 secs
lola: sara is running 20 secs || 4290580 markings, 10247318 edges, 174361 markings/sec, 20 secs
lola: sara is running 25 secs || 5183265 markings, 12223282 edges, 178537 markings/sec, 25 secs
lola: sara is running 30 secs || 6108530 markings, 13875700 edges, 185053 markings/sec, 30 secs
lola: sara is running 35 secs || 7019544 markings, 15548021 edges, 182203 markings/sec, 35 secs
lola: sara is running 40 secs || 7932131 markings, 17250387 edges, 182517 markings/sec, 40 secs
lola: sara is running 45 secs || 8838632 markings, 18909244 edges, 181300 markings/sec, 45 secs
lola: sara is running 50 secs || 9749033 markings, 20552314 edges, 182080 markings/sec, 50 secs
lola: sara is running 55 secs || 10658791 markings, 22241885 edges, 181952 markings/sec, 55 secs
lola: sara is running 60 secs || 11557249 markings, 23974269 edges, 179692 markings/sec, 60 secs
lola: sara is running 65 secs || 12456543 markings, 25554434 edges, 179859 markings/sec, 65 secs
lola: sara is running 70 secs || 13355132 markings, 27224457 edges, 179718 markings/sec, 70 secs
lola: sara is running 75 secs || 14250178 markings, 28871364 edges, 179009 markings/sec, 75 secs
lola: sara is running 80 secs || 15132100 markings, 30580456 edges, 176384 markings/sec, 80 secs
lola: sara is running 85 secs || 16027307 markings, 32135618 edges, 179041 markings/sec, 85 secs
lola: sara is running 90 secs || 16916760 markings, 33796197 edges, 177891 markings/sec, 90 secs
lola: sara is running 95 secs || 17828139 markings, 35289611 edges, 182276 markings/sec, 95 secs
lola: sara is running 100 secs || 18724121 markings, 37108243 edges, 179196 markings/sec, 100 secs
lola: sara is running 105 secs || 19662421 markings, 38853346 edges, 187660 markings/sec, 105 secs
lola: sara is running 110 secs || 20611974 markings, 40613620 edges, 189911 markings/sec, 110 secs
lola: sara is running 115 secs || 21563210 markings, 42378120 edges, 190247 markings/sec, 115 secs
lola: sara is running 120 secs || 22514692 markings, 44149569 edges, 190296 markings/sec, 120 secs
lola: sara is running 125 secs || 23465242 markings, 45882692 edges, 190110 markings/sec, 125 secs
lola: sara is running 130 secs || 24413605 markings, 47604199 edges, 189673 markings/sec, 130 secs
lola: sara is running 135 secs || 25366619 markings, 49356126 edges, 190603 markings/sec, 135 secs
lola: sara is running 140 secs || 26313351 markings, 51113376 edges, 189346 markings/sec, 140 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27201473 markings, 52781721 edges
lola: ========================================
lola: subprocess 6 will run for 315 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p162 <= p261) AND (2 <= p139))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-6.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 7 will run for 350 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((2 <= p122) OR (p303 <= p32)) AND (p92 <= 2)) OR (p477 <= p85))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-7.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 8 will run for 394 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p359 + 1 <= p322) AND (p343 <= 2) AND (2 <= p388) AND (3 <= p383) AND ((p73 <= p153) OR (2 <= p273)))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-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 450 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p138 <= 2) OR (p144 + 1 <= p10) OR (p184 <= 1) OR ((3 <= p428) AND (p154 <= p389)))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-9.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: subprocess 10 will run for 525 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p211 <= 0) OR (p417 + 1 <= p31) OR (p176 <= p408))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 328 markings, 499 edges
lola: ========================================
lola: subprocess 11 will run for 630 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p24) OR (p122 <= p466))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 787 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p11) OR ((p46 <= p130) AND (p172 <= p156)) OR ((p226 + 1 <= p218) AND (p178 + 1 <= p44)))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-12.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: 2179 markings, 3056 edges
lola: ========================================
lola: subprocess 13 will run for 1050 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p152)))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-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 1575 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p224)))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-14.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 15 will run for 3151 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p90) AND (p338 <= p373))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1492630 markings, 1820673 edges, 298526 markings/sec, 0 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no no no no no no no yes yes no no no no yes
FORMULA DES-PT-50b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-15 TRUE 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="DES-PT-50b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is DES-PT-50b, 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 r059-smll-152646386400278"
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 ;