fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r046-smll-152646362600187
Last Updated
June 26, 2018

About the Execution of M4M.full for ClientsAndServers-PT-N5000P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15901.290 604370.00 507726.00 2980.70 TFF?FTFTTTFFT?TT 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 172K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K 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.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K 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 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.2K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is ClientsAndServers-PT-N5000P0, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-152646362600187
=====================================================================


--------------------
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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality-00
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-01
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-02
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-03
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-04
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-05
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-06
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-07
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-08
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-09
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-10
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-11
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-12
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-13
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-14
FORMULA_NAME ClientsAndServers-PT-N5000P0-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1526571702157


BK_STOP 1526572306527

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using ClientsAndServers-PT-N5000P0 as instance name.
Using ClientsAndServers 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 2985, 'Memory': 254.59, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola ClientsAndServers-PT-N5000P0...

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


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N5000P0: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityCardinality @ ClientsAndServers-PT-N5000P0 @ 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: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N5000P0-ReachabilityCardinality.task
lola: E (F ((((2 <= SA) AND (Uf <= 1)) OR ((SG <= Uf) AND (2 <= MwU) AND (2 <= MpA))))) : A (G ((SpA <= Ci))) : A (G ((CF <= 2))) : A (G ((MpA + 1 <= Mi))) : A (G (((((1 <= StR) OR (3 <= CwA)) AND ((SF <= Cb) OR (SpG <= Ci))) OR (SF <= Si)))) : E (F ((Ci <= StF))) : A (G (((SF <= SwG) OR (3 <= StF) OR ((CA <= StF) AND (Cb <= SpG)) OR (SpA <= CR)))) : A (G (((MpG <= CwG) OR (Uf + 1 <= Si)))) : E (F (((Si + 1 <= CF) AND (StF <= 0) AND (CG <= SG)))) : E (F (((1 <= Mi) AND (3 <= MwU) AND (CG <= StF) AND (2 <= SwA)))) : E (F (((MpA + 1 <= Uf) AND (Mi <= 1) AND (CwG + 1 <= SpG) AND (MwU <= 0)))) : E (F ((Mi <= 0))) : E (F (((SG + 1 <= MtF) AND (CR + 1 <= SA) AND (Uf + 1 <= Cb)))) : A (G (((MwU <= Mi) OR (1 <= Cb) OR (SwG + 1 <= Uf) OR ((StF <= SwA) AND (3 <= SwG)) OR (SF + 1 <= CG)))) : E (F ((3 <= SpA))) : A (G (((SG <= SwG) OR (StR <= SG) OR ((CR <= SwG) AND (SR <= SpG)) OR (1 <= CG))))
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 ((((2 <= SA) AND (Uf <= 1)) OR ((SG <= Uf) AND (2 <= MwU) AND (2 <= MpA)))))
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 68 bytes per marking, with 0 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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 560304 markings, 560422 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((SpA <= Ci)))
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 68 bytes per marking, with 0 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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 40016 markings, 40015 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((CF <= 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 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 31 markings, 30 edges
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2.sara
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((MpA + 1 <= Mi)))
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 68 bytes per marking, with 0 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: lola: ========================================
RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 2207569 markings, 4515768 edges, 441514 markings/sec, 0 secs
lola: sara is running 5 secs || 3871698 markings, 8639358 edges, 332826 markings/sec, 5 secs
lola: sara is running 10 secs || 5571014 markings, 12868801 edges, 339863 markings/sec, 10 secs
lola: sara is running 15 secs || 7253825 markings, 17098591 edges, 336562 markings/sec, 15 secs
lola: sara is running 20 secs || 8868808 markings, 21169604 edges, 322997 markings/sec, 20 secs
lola: sara is running 25 secs || 10353776 markings, 24911254 edges, 296994 markings/sec, 25 secs
lola: sara is running 30 secs || 11902385 markings, 28829013 edges, 309722 markings/sec, 30 secs
lola: sara is running 35 secs || 13468485 markings, 32787286 edges, 313220 markings/sec, 35 secs
lola: sara is running 40 secs || 15134462 markings, 36932167 edges, 333195 markings/sec, 40 secs
lola: sara is running 45 secs || 16713615 markings, 40856291 edges, 315831 markings/sec, 45 secs
lola: sara is running 50 secs || 18280724 markings, 44803145 edges, 313422 markings/sec, 50 secs
lola: sara is running 55 secs || 19784522 markings, 48647346 edges, 300760 markings/sec, 55 secs
lola: sara is running 60 secs || 21266595 markings, 52394015 edges, 296415 markings/sec, 60 secs
lola: sara is running 65 secs || 22846701 markings, 56396797 edges, 316021 markings/sec, 65 secs
lola: sara is running 70 secs || 24395998 markings, 60357321 edges, 309859 markings/sec, 70 secs
lola: sara is running 75 secs || 25920178 markings, 64275622 edges, 304836 markings/sec, 75 secs
lola: sara is running 80 secs || 27428559 markings, 68121432 edges, 301676 markings/sec, 80 secs
lola: sara is running 85 secs || 28925407 markings, 71926150 edges, 299370 markings/sec, 85 secs
lola: sara is running 90 secs || 30310594 markings, 75468525 edges, 277037 markings/sec, 90 secs
lola: sara is running 95 secs || 31752409 markings, 79171518 edges, 288363 markings/sec, 95 secs
lola: sara is running 100 secs || 33269558 markings, 83032855 edges, 303430 markings/sec, 100 secs
lola: sara is running 105 secs || 34771886 markings, 86878308 edges, 300466 markings/sec, 105 secs
lola: sara is running 110 secs || 36300236 markings, 90751198 edges, 305670 markings/sec, 110 secs
lola: sara is running 115 secs || 37695182 markings, 94382736 edges, 278989 markings/sec, 115 secs
lola: sara is running 120 secs || 39149428 markings, 98065272 edges, 290849 markings/sec, 120 secs
lola: sara is running 125 secs || 40643715 markings, 101880240 edges, 298857 markings/sec, 125 secs
lola: sara is running 130 secs || 42039606 markings, 105531902 edges, 279178 markings/sec, 130 secs
lola: sara is running 135 secs || 43533985 markings, 109343154 edges, 298876 markings/sec, 135 secs
lola: sara is running 140 secs || 44956667 markings, 113032152 edges, 284536 markings/sec, 140 secs
lola: sara is running 145 secs || 46411761 markings, 116764687 edges, 291019 markings/sec, 145 secs
lola: sara is running 150 secs || 47798343 markings, 120290445 edges, 277316 markings/sec, 150 secs
lola: sara is running 155 secs || 49148151 markings, 123737265 edges, 269962 markings/sec, 155 secs
lola: sara is running 160 secs || 50458282 markings, 127148518 edges, 262026 markings/sec, 160 secs
lola: sara is running 165 secs || 51856872 markings, 130785345 edges, 279718 markings/sec, 165 secs
lola: sara is running 170 secs || 53306466 markings, 134499459 edges, 289919 markings/sec, 170 secs
lola: sara is running 175 secs || 54738204 markings, 138167235 edges, 286348 markings/sec, 175 secs
lola: sara is running 180 secs || 56104468 markings, 141709093 edges, 273253 markings/sec, 180 secs
lola: sara is running 185 secs || 57465829 markings, 145258262 edges, 272272 markings/sec, 185 secs
lola: sara is running 190 secs || 58807544 markings, 148782550 edges, 268343 markings/sec, 190 secs
lola: sara is running 195 secs || 60194869 markings, 152364629 edges, 277465 markings/sec, 195 secs
lola: sara is running 200 secs || 61546348 markings, 155889321 edges, 270296 markings/sec, 200 secs
lola: sara is running 205 secs || 62917319 markings, 159460914 edges, 274194 markings/sec, 205 secs
lola: sara is running 210 secs || 64344002 markings, 163109693 edges, 285337 markings/sec, 210 secs
lola: sara is running 215 secs || 65744511 markings, 166734492 edges, 280102 markings/sec, 215 secs
lola: sara is running 220 secs || 67106542 markings, 170283339 edges, 272406 markings/sec, 220 secs
lola: sara is running 225 secs || 68557312 markings, 173992846 edges, 290154 markings/sec, 225 secs
lola: sara is running 230 secs || 69912146 markings, 177531160 edges, 270967 markings/sec, 230 secs
lola: sara is running 235 secs || 71336663 markings, 181178999 edges, 284903 markings/sec, 235 secs
lola: sara is running 240 secs || 72647482 markings, 184642305 edges, 262164 markings/sec, 240 secs
lola: sara is running 245 secs || 73988385 markings, 188132436 edges, 268181 markings/sec, 245 secs
lola: sara is running 250 secs || 75319959 markings, 191635792 edges, 266315 markings/sec, 250 secs
lola: sara is running 255 secs || 76689307 markings, 195183515 edges, 273870 markings/sec, 255 secs
lola: sara is running 260 secs || 78068236 markings, 198762034 edges, 275786 markings/sec, 260 secs
lola: sara is running 265 secs || 79508209 markings, 202454965 edges, 287995 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((1 <= StR) OR (3 <= CwA)) AND ((SF <= Cb) OR (SpG <= Ci))) OR (SF <= Si))))
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 68 bytes per marking, with 0 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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 270017 markings, 310023 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Ci <= StF)))
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 68 bytes per marking, with 0 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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 40001 markings, 40000 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((SF <= SwG) OR (3 <= StF) OR ((CA <= StF) AND (Cb <= SpG)) OR (SpA <= CR))))
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 68 bytes per marking, with 0 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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-6.sara.

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((MpG <= CwG) OR (Uf + 1 <= Si))))
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 68 bytes per marking, with 0 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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-7.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Si + 1 <= CF) AND (StF <= 0) AND (CG <= SG))))
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 68 bytes per marking, with 0 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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 20011 markings, 20010 edges
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= Mi) AND (3 <= MwU) AND (CG <= StF) AND (2 <= SwA))))
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 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 37 markings, 36 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((MpA + 1 <= Uf) AND (Mi <= 1) AND (CwG + 1 <= SpG) AND (MwU <= 0))))
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 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N5000P0-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-9.sara.
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-10.sara.


lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Mi <= 0)))
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 68 bytes per marking, with 0 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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-11.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((SG + 1 <= MtF) AND (CR + 1 <= SA) AND (Uf + 1 <= Cb))))
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 68 bytes per marking, with 0 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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 180036 markings, 180035 edges
lola: ========================================
lola: subprocess 13 will run for 1088 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((MwU <= Mi) OR (1 <= Cb) OR (SwG + 1 <= Uf) OR ((StF <= SwA) AND (3 <= SwG)) OR (SF + 1 <= CG))))
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 68 bytes per marking, with 0 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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 4116338 markings, 4680021 edges, 823268 markings/sec, 0 secs
lola: sara is running 5 secs || 7691973 markings, 8770325 edges, 715127 markings/sec, 5 secs
lola: sara is running 10 secs || 11218401 markings, 12750807 edges, 705286 markings/sec, 10 secs
lola: sara is running 15 secs || 14549423 markings, 16705379 edges, 666204 markings/sec, 15 secs
lola: sara is running 20 secs || 17883979 markings, 20746572 edges, 666911 markings/sec, 20 secs
lola: sara is running 25 secs || 21031375 markings, 24452297 edges, 629479 markings/sec, 25 secs
lola: sara is running 30 secs || 24334012 markings, 28244239 edges, 660527 markings/sec, 30 secs
lola: sara is running 35 secs || 27328279 markings, 31848928 edges, 598853 markings/sec, 35 secs
lola: sara is running 40 secs || 30329969 markings, 35586060 edges, 600338 markings/sec, 40 secs
lola: sara is running 45 secs || 33299730 markings, 39119656 edges, 593952 markings/sec, 45 secs
lola: sara is running 50 secs || 36320138 markings, 42696005 edges, 604082 markings/sec, 50 secs
lola: sara is running 55 secs || 39265429 markings, 46139891 edges, 589058 markings/sec, 55 secs
lola: sara is running 60 secs || 42546258 markings, 49984162 edges, 656166 markings/sec, 60 secs
lola: sara is running 65 secs || 45724723 markings, 53713338 edges, 635693 markings/sec, 65 secs
lola: sara is running 70 secs || 48895230 markings, 57485493 edges, 634101 markings/sec, 70 secs
lola: sara is running 75 secs || 51950712 markings, 61106048 edges, 611096 markings/sec, 75 secs
lola: sara is running 80 secs || 54998863 markings, 64766845 edges, 609630 markings/sec, 80 secs
lola: sara is running 85 secs || 58088173 markings, 68619698 edges, 617862 markings/sec, 85 secs
lola: sara is running 90 secs || 61136333 markings, 72293097 edges, 609632 markings/sec, 90 secs
lola: sara is running 95 secs || 64232393 markings, 75969271 edges, 619212 markings/sec, 95 secs
lola: sara is running 100 secs || 67278500 markings, 79669416 edges, 609221 markings/sec, 100 secs
lola: sara is running 105 secs || 70326846 markings, 83290887 edges, 609669 markings/sec, 105 secs
lola: sara is running 110 secs || 73289617 markings, 86887731 edges, 592554 markings/sec, 110 secs
lola: sara is running 115 secs || 76331809 markings, 90492329 edges, 608438 markings/sec, 115 secs
lola: sara is running 120 secs || 79431056 markings, 94125496 edges, 619849 markings/sec, 120 secs
lola: sara is running 125 secs || 82486405 markings, 97757003 edges, 611070 markings/sec, 125 secs
lola: sara is running 130 secs || 85664330 markings, 101480896 edges, 635585 markings/sec, 130 secs
lola: sara is running 135 secs || 88568704 markings, 105058264 edges, 580875 markings/sec, 135 secs
lola: sara is running 140 secs || 91574796 markings, 108573216 edges, 601218 markings/sec, 140 secs
lola: sara is running 145 secs || 94564898 markings, 112097085 edges, 598020 markings/sec, 145 secs
lola: sara is running 150 secs || 97044995 markings, 115433217 edges, 496019 markings/sec, 150 secs
lola: sara is running 155 secs || 99770170 markings, 118684563 edges, 545035 markings/sec, 155 secs
lola: sara is running 160 secs || 102489468 markings, 121901167 edges, 543860 markings/sec, 160 secs
lola: sara is running 165 secs || 105111064 markings, 124974402 edges, 524319 markings/sec, 165 secs
lola: sara is running 170 secs || 107881612 markings, 128342295 edges, 554110 markings/sec, 170 secs
lola: sara is running 175 secs || 110769489 markings, 131740761 edges, 577575 markings/sec, 175 secs
lola: sara is running 180 secs || 113336005 markings, 134954292 edges, 513303 markings/sec, 180 secs
lola: sara is running 185 secs || 116076695 markings, 138220644 edges, 548138 markings/sec, 185 secs
lola: sara is running 190 secs || 118858836 markings, 141534115 edges, 556428 markings/sec, 190 secs
lola: sara is running 195 secs || 121618180 markings, 144909239 edges, 551869 markings/sec, 195 secs
lola: sara is running 200 secs || 124339045 markings, 148101857 edges, 544173 markings/sec, 200 secs
lola: sara is running 205 secs || 126836817 markings, 151209806 edges, 499554 markings/sec, 205 secs
lola: sara is running 210 secs || 128906977 markings, 153697439 edges, 414032 markings/sec, 210 secs
lola: sara is running 215 secs || 128918713 markings, 153709289 edges, 2347 markings/sec, 215 secs
lola: sara is running 220 secs || 128926924 markings, 153717500 edges, 1642 markings/sec, 220 secs
lola: sara is running 225 secs || 128931019 markings, 153721595 edges, 819 markings/sec, 225 secs
lola: sara is running 230 secs || 128934167 markings, 153726620 edges, 630 markings/sec, 230 secs
lola: sara is running 235 secs || 128934186 markings, 153726650 edges, 4 markings/sec, 235 secs
lola: sara is running 240 secs || 128936983 markings, 153730987 edges, 559 markings/sec, 240 secs
lola: sara is running 245 secs || 128936995 markings, 153731006 edges, 2 markings/sec, 245 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1491 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= SpA)))
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 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 49 markings, 48 edges
lola: ========================================
lola: subprocess 15 will run for 2982 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((SG <= SwG) OR (StR <= SG) OR ((CR <= SwG) AND (SR <= SpG)) OR (1 <= CG))))
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 68 bytes per marking, with 0 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 ClientsAndServers-PT-N5000P0-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N5000P0-ReachabilityCardinality-15.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no unknown no yes no yes yes yes no no yes unknown yes yes
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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="ClientsAndServers-PT-N5000P0"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N5000P0.tgz
mv ClientsAndServers-PT-N5000P0 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is ClientsAndServers-PT-N5000P0, 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 r046-smll-152646362600187"
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 ;