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 192K
-rw-r--r-- 1 mcc users 4.0K 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.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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.1K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is ClientsAndServers-PT-N0500P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357300164
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526559871478

info: Time: 3600 - MCC
===========================================================================================
prep: translating ClientsAndServers-PT-N0500P0 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ClientsAndServers-PT-N0500P0 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ ClientsAndServers-PT-N0500P0 @ 3570 seconds
lola: LoLA will run for 3570 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: Size of bit vector: 800
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-N0500P0-CTLCardinality.task
lola: LP says that atomic proposition is always true: (3 <= Mi)
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (2 <= Mi)
lola: A (G (A (((1 <= Ci) U (SwG <= MpA))))) : A (((((2 <= StF) AND (SA <= SF)) OR (3 <= StR)) U E (G ((SwA <= CwG))))) : (E (G ((StF <= SwA))) AND ((((1 <= CG) OR ((1 <= Uf))) AND E (G ((SR <= MwU)))) OR E (G (((2 <= SpA) AND (1 <= Cb)))))) : (E (((CA <= 0) U (Uf + 1 <= MpG))) OR ((E (G ((1 <= MwU))) AND A (F ((SR <= CR)))) OR (Ci <= SR))) : A (F (A (G (((SG <= StR) OR (Cb <= Ci)))))) : E (F (A (G ((CwG <= MtF))))) : (A ((((StF <= Uf)) U (SpG + 1 <= SwG))) AND (A (((SpA <= SF) U (SR <= CwA))) AND (E (F ((SA <= CG))) AND ((SpG + 1 <= SF) OR (CwG <= 2))))) : A (G ((2 <= Si))) : (A (((SpA <= Si) U (CR + 1 <= SpA))) AND (((2 <= StR) OR (StF <= SwA) OR ((2 <= CA) AND (CR <= Uf)) OR ((SF <= CwG) AND (1 <= StR) AND (3 <= CwG))) OR A (X (TRUE)))) : NOT(A (F ((((3 <= SA) AND (2 <= SA)) OR (1 <= StR))))) : A (F (A (G (((SwA <= SwG) OR (3 <= Uf)))))) : NOT(((((CF <= SF) OR ((MtF <= SpA) AND (StR <= MpA))) AND A (G (TRUE))) AND NOT(A (X ((Ci <= SG)))))) : E (X (NOT(E (F ((3 <= CF)))))) : NOT(((E (G ((MpA <= MtF))) AND E (F ((Si <= SwG)))) AND E (F (((2 <= CwG) OR (1 <= Si)))))) : NOT(E (G (A (X ((SA <= MwU)))))) : (E (((CR + 1 <= MpA) U ((SF <= CF) AND (Ci <= CR)))) OR A (F ((1 <= SwG))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:136
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((SF + 1 <= CF) AND ((SpA + 1 <= MtF) OR (MpA + 1 <= StR))) OR A (X ((Ci <= SG))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((SF + 1 <= CF) AND ((SpA + 1 <= MtF) OR (MpA + 1 <= StR)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((SF + 1 <= CF) AND ((SpA + 1 <= MtF) OR (MpA + 1 <= StR)))
lola: processed formula length: 60
lola: 39 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((Ci <= SG)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((Ci <= SG))
lola: processed formula length: 14
lola: 40 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (X (A (G ((CF <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: EX(NOT(E(TRUE U (3 <= CF))))
lola: processed formula length: 28
lola: 42 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9022 markings, 9021 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((MwU + 1 <= SA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U EX((MwU + 1 <= SA)))
lola: processed formula length: 29
lola: 41 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 25001 markings, 25000 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Si)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((2 <= Si)))
lola: processed formula length: 17
lola: 41 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (Si <= 1)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0500P0-CTLCardinality-3-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1999 markings, 1998 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((((SA <= 2) OR (SA <= 1)) AND (StR <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((((SA <= 2) OR (SA <= 1)) AND (StR <= 0))))
lola: processed formula length: 50
lola: 39 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 4001 markings, 4000 edges
lola:
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((CwG <= MtF)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (MtF + 1 <= CwG)
lola: processed formula length: 16
lola: 41 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2139230 markings, 5559544 edges, 427846 markings/sec, 0 secs
lola: 4014859 markings, 11055247 edges, 375126 markings/sec, 5 secs
lola: 5982554 markings, 16757564 edges, 393539 markings/sec, 10 secs
lola: 7812955 markings, 22372459 edges, 366080 markings/sec, 15 secs
lola: 9609326 markings, 27976120 edges, 359274 markings/sec, 20 secs
lola: 11356902 markings, 33428986 edges, 349515 markings/sec, 25 secs
lola: 13076310 markings, 39036886 edges, 343882 markings/sec, 30 secs
lola: 14792611 markings, 44324605 edges, 343260 markings/sec, 35 secs
lola: 16467443 markings, 49649828 edges, 334966 markings/sec, 40 secs
lola: 18173436 markings, 55194293 edges, 341199 markings/sec, 45 secs
lola: 19874964 markings, 60817261 edges, 340306 markings/sec, 50 secs
lola: 21563190 markings, 66254548 edges, 337645 markings/sec, 55 secs
lola: 23119517 markings, 71476448 edges, 311265 markings/sec, 60 secs
lola: 24679914 markings, 76819467 edges, 312079 markings/sec, 65 secs
lola: 26337419 markings, 82202981 edges, 331501 markings/sec, 70 secs
lola: 27875610 markings, 87393833 edges, 307638 markings/sec, 75 secs
lola: 29495601 markings, 92704903 edges, 323998 markings/sec, 80 secs
lola: 30854389 markings, 97332610 edges, 271758 markings/sec, 85 secs
lola: 32389449 markings, 102327963 edges, 307012 markings/sec, 90 secs
lola: 33923820 markings, 107259918 edges, 306874 markings/sec, 95 secs
lola: 35375647 markings, 112245929 edges, 290365 markings/sec, 100 secs
lola: 36832105 markings, 117156807 edges, 291292 markings/sec, 105 secs
lola: 38336229 markings, 122044955 edges, 300825 markings/sec, 110 secs
lola: 39589697 markings, 126426403 edges, 250694 markings/sec, 115 secs
lola: 40932418 markings, 130742192 edges, 268544 markings/sec, 120 secs
lola: 42307603 markings, 135379742 edges, 275037 markings/sec, 125 secs
lola: 43746913 markings, 140345911 edges, 287862 markings/sec, 130 secs
lola: 45153865 markings, 145109675 edges, 281390 markings/sec, 135 secs
lola: 46514103 markings, 149721426 edges, 272048 markings/sec, 140 secs
lola: 47947758 markings, 154506811 edges, 286731 markings/sec, 145 secs
lola: 49388937 markings, 159187221 edges, 288236 markings/sec, 150 secs
lola: 50660855 markings, 163666233 edges, 254384 markings/sec, 155 secs
lola: 52095845 markings, 168510321 edges, 286998 markings/sec, 160 secs
lola: 53607396 markings, 173599202 edges, 302310 markings/sec, 165 secs
lola: 54983868 markings, 178301540 edges, 275294 markings/sec, 170 secs
lola: 56425974 markings, 183186517 edges, 288421 markings/sec, 175 secs
lola: 57849092 markings, 188068460 edges, 284624 markings/sec, 180 secs
lola: 59275506 markings, 193025304 edges, 285283 markings/sec, 185 secs
lola: 60592380 markings, 197723195 edges, 263375 markings/sec, 190 secs
lola: 61929606 markings, 202510637 edges, 267445 markings/sec, 195 secs
lola: 63358494 markings, 207358882 edges, 285778 markings/sec, 200 secs
lola: 64734405 markings, 212052790 edges, 275182 markings/sec, 205 secs
lola: 66118231 markings, 216810265 edges, 276765 markings/sec, 210 secs
lola: 67404524 markings, 221281326 edges, 257259 markings/sec, 215 secs
lola: 68815434 markings, 226106488 edges, 282182 markings/sec, 220 secs
lola: 70099877 markings, 230589222 edges, 256889 markings/sec, 225 secs
lola: 71403159 markings, 235242662 edges, 260656 markings/sec, 230 secs
lola: 72688796 markings, 239745241 edges, 257127 markings/sec, 235 secs
lola: 73997441 markings, 244162068 edges, 261729 markings/sec, 240 secs
lola: 75313756 markings, 248801419 edges, 263263 markings/sec, 245 secs
lola: 76581938 markings, 253280029 edges, 253636 markings/sec, 250 secs
lola: 77916330 markings, 257899097 edges, 266878 markings/sec, 255 secs
lola: 79195856 markings, 262276367 edges, 255905 markings/sec, 260 secs
lola: 80597440 markings, 266895535 edges, 280317 markings/sec, 265 secs
lola: 81853099 markings, 271249218 edges, 251132 markings/sec, 270 secs
lola: 83067258 markings, 275514490 edges, 242832 markings/sec, 275 secs
lola: 84337920 markings, 280005827 edges, 254132 markings/sec, 280 secs
lola: 85578845 markings, 284319673 edges, 248185 markings/sec, 285 secs
lola: 86838163 markings, 288671004 edges, 251864 markings/sec, 290 secs
lola: 88102484 markings, 293158064 edges, 252864 markings/sec, 295 secs
lola: 89393563 markings, 297588317 edges, 258216 markings/sec, 300 secs
lola: 90544864 markings, 301648014 edges, 230260 markings/sec, 305 secs
lola: 91737713 markings, 305759917 edges, 238570 markings/sec, 310 secs
lola: 93143994 markings, 310480349 edges, 281256 markings/sec, 315 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown unknown unknown unknown no unknown no unknown no no unknown no unknown
lola: memory consumption: 9153708 KB
lola: time consumption: 325 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((1 <= Ci) U (SwG <= MpA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(A((1 <= Ci) U (SwG <= MpA)))))
lola: processed formula length: 47
lola: 41 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4003 markings, 8005 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((2 <= StF) AND (SA <= SF)) OR (3 <= StR)) U E (G ((SwA <= CwG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:739
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A((((2 <= StF) AND (SA <= SF)) OR (3 <= StR)) U NOT(A(TRUE U (CwG + 1 <= SwA))))
lola: processed formula length: 81
lola: 42 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 25001 markings, 25001 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((SpA <= Si) U (CR + 1 <= SpA)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((SpA <= Si) U (CR + 1 <= SpA)))
lola: processed formula length: 35
lola: 43 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 25000 markings, 24999 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((SwA <= SwG) OR (3 <= Uf))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((SwG + 1 <= SwA) AND (Uf <= 2))
lola: processed formula length: 32
lola: 41 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 3052592 markings, 4462779 edges, 610518 markings/sec, 0 secs
lola: 5559748 markings, 8075101 edges, 501431 markings/sec, 5 secs
lola: 8135122 markings, 11762597 edges, 515075 markings/sec, 10 secs
lola: 10636977 markings, 15332579 edges, 500371 markings/sec, 15 secs
lola: 12979934 markings, 18681789 edges, 468591 markings/sec, 20 secs
lola: 15401474 markings, 22138456 edges, 484308 markings/sec, 25 secs
lola: 17797181 markings, 25539167 edges, 479141 markings/sec, 30 secs
lola: 20088144 markings, 28802406 edges, 458193 markings/sec, 35 secs
lola: 22536774 markings, 32303043 edges, 489726 markings/sec, 40 secs
lola: 24970840 markings, 35786495 edges, 486813 markings/sec, 45 secs
lola: 27346202 markings, 39178303 edges, 475072 markings/sec, 50 secs
lola: 29701572 markings, 42538109 edges, 471074 markings/sec, 55 secs
lola: 32066581 markings, 45913380 edges, 473002 markings/sec, 60 secs
lola: 34411513 markings, 49254640 edges, 468986 markings/sec, 65 secs
lola: 36772453 markings, 52625909 edges, 472188 markings/sec, 70 secs
lola: 39120071 markings, 55982593 edges, 469524 markings/sec, 75 secs
lola: 41481322 markings, 59378215 edges, 472250 markings/sec, 80 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 43160406 markings, 61784227 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((SG <= StR) OR (Cb <= Ci))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: ((StR + 1 <= SG) AND (Ci + 1 <= Cb))
lola: processed formula length: 36
lola: 41 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 51073 markings, 56087 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((CR + 1 <= MpA) U ((SF <= CF) AND (Ci <= CR)))) OR A (F ((1 <= SwG))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 631 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= SwG)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (SwG <= 0)
lola: processed formula length: 10
lola: 41 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 5001 markings, 5000 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 789 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((MtF + 1 <= MpA))) OR (A (G ((SwG + 1 <= Si))) OR A (G (((CwG <= 1) AND (Si <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 789 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((CwG <= 1) AND (Si <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G (((CwG <= 1) AND (Si <= 0))))
lola: processed formula length: 34
lola: 41 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: ((2 <= CwG) OR (1 <= Si))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 13 will run for 1052 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((SwG + 1 <= Si)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: A (G ((SwG + 1 <= Si)))
lola: processed formula length: 23
lola: 41 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: formula 0: (Si <= SwG)
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: 1501 markings, 1500 edges
lola: lola: subprocess 14 will run for 1578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((MtF + 1 <= MpA)))
lola: state equation: write sara problem file to ClientsAndServers-PT-N0500P0-CTLCardinality-13-0.sara
========================================
lola: SUBTASK
lola: ========================================
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (MpA <= MtF)
lola: processed formula length: 12
lola: 41 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 16008 markings, 16008 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1052 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((CA <= 0) U (Uf + 1 <= MpG))) OR ((E (G ((1 <= MwU))) AND A (F ((SR <= CR)))) OR (Ci <= SR)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1052 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Ci <= SR)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Ci <= SR)
lola: processed formula length: 10
lola: 39 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= MwU)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((1 <= MwU)))
lola: processed formula length: 18
lola: 39 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((CA <= 0) U (Uf + 1 <= MpG)))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((CA <= 0) U (Uf + 1 <= MpG)))
lola: processed formula length: 33
lola: 42 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (Uf + 1 <= MpG)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0500P0-CTLCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N0500P0-CTLCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 17999 markings, 17998 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G ((StF <= SwA))) AND ((((1 <= CG) OR ((1 <= Uf))) AND E (G ((SR <= MwU)))) OR E (G (((2 <= SpA) AND (1 <= Cb))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1578 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= CG) OR ((1 <= Uf)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= CG) OR ((1 <= Uf)))
lola: processed formula length: 27
lola: 39 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= SpA) AND (1 <= Cb))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((2 <= SpA) AND (1 <= Cb))))
lola: processed formula length: 34
lola: 39 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((StF <= SwA)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((StF <= SwA)))
lola: processed formula length: 20
lola: 39 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 25001 markings, 25000 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((StF <= Uf)) U (SpG + 1 <= SwG))) AND (A (((SpA <= SF) U (SR <= CwA))) AND (E (F ((SA <= CG))) AND ((SpG + 1 <= SF) OR (CwG <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3156 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((SpG + 1 <= SF) OR (CwG <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((SpG + 1 <= SF) OR (CwG <= 2))
lola: processed formula length: 32
lola: 39 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((SpA <= SF) U (SR <= CwA)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((SpA <= SF) U (SR <= CwA)))
lola: processed formula length: 31
lola: 43 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 18 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((StF <= Uf)) U (SpG + 1 <= SwG)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((StF <= Uf)) U (SpG + 1 <= SwG)))
lola: processed formula length: 38
lola: 43 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 5001 markings, 5000 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((CwG <= MtF)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: AGEF init
lola: rewrite Frontend/Parser/formula_rewrite.k:636
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (MtF + 1 <= CwG)
lola: processed formula length: 16
lola: 41 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: RUNNING
lola: 2297905 markings, 5970992 edges, 459581 markings/sec, 0 secs
lola: 4380016 markings, 11991497 edges, 416422 markings/sec, 5 secs
lola: 6239162 markings, 17501107 edges, 371829 markings/sec, 10 secs
lola: 8060534 markings, 23063284 edges, 364274 markings/sec, 15 secs
lola: 9755523 markings, 28476488 edges, 338998 markings/sec, 20 secs
lola: 11482522 markings, 33834217 edges, 345400 markings/sec, 25 secs
lola: 13095048 markings, 39094679 edges, 322505 markings/sec, 30 secs
lola: 14679579 markings, 43987301 edges, 316906 markings/sec, 35 secs
lola: 16298196 markings, 49153899 edges, 323723 markings/sec, 40 secs
lola: 17840639 markings, 54131088 edges, 308489 markings/sec, 45 secs
lola: 19538590 markings, 59789881 edges, 339590 markings/sec, 50 secs
lola: 21260393 markings, 65324064 edges, 344361 markings/sec, 55 secs
lola: 22890786 markings, 70700701 edges, 326079 markings/sec, 60 secs
lola: 24313435 markings, 75603505 edges, 284530 markings/sec, 65 secs
lola: 25855319 markings, 80699448 edges, 308377 markings/sec, 70 secs
lola: 27378061 markings, 85726166 edges, 304548 markings/sec, 75 secs
lola: 28917193 markings, 90840372 edges, 307826 markings/sec, 80 secs
lola: 30346414 markings, 95605078 edges, 285844 markings/sec, 85 secs
lola: 31887324 markings, 100723500 edges, 308182 markings/sec, 90 secs
lola: 33348832 markings, 105437823 edges, 292302 markings/sec, 95 secs
lola: 34839489 markings, 110403293 edges, 298131 markings/sec, 100 secs
lola: 36320807 markings, 115452172 edges, 296264 markings/sec, 105 secs
lola: 37877299 markings, 120504888 edges, 311298 markings/sec, 110 secs
lola: 39374825 markings, 125674730 edges, 299505 markings/sec, 115 secs
lola: 40963527 markings, 130840162 edges, 317740 markings/sec, 120 secs
lola: 42337109 markings, 135473303 edges, 274716 markings/sec, 125 secs
lola: 43790033 markings, 140497204 edges, 290585 markings/sec, 130 secs
lola: 45219074 markings, 145283329 edges, 285808 markings/sec, 135 secs
lola: 46591200 markings, 149981285 edges, 274425 markings/sec, 140 secs
lola: 48059851 markings, 154836222 edges, 293730 markings/sec, 145 secs
lola: 49484253 markings, 159541914 edges, 284880 markings/sec, 150 secs
lola: 50834835 markings, 164266071 edges, 270116 markings/sec, 155 secs
lola: 52235242 markings, 168987998 edges, 280081 markings/sec, 160 secs
lola: 53704031 markings, 173923891 edges, 293758 markings/sec, 165 secs
lola: 55039662 markings, 178506962 edges, 267126 markings/sec, 170 secs
lola: 56454024 markings, 183280550 edges, 282872 markings/sec, 175 secs
lola: 57847425 markings, 188062583 edges, 278680 markings/sec, 180 secs
lola: 59241972 markings, 192916105 edges, 278909 markings/sec, 185 secs
lola: 60536772 markings, 197515206 edges, 258960 markings/sec, 190 secs
lola: 61807315 markings, 202111823 edges, 254109 markings/sec, 195 secs
lola: 63211727 markings, 206856930 edges, 280882 markings/sec, 200 secs
lola: 64570950 markings, 211441773 edges, 271845 markings/sec, 205 secs
lola: 65891163 markings, 216037063 edges, 264043 markings/sec, 210 secs
lola: 67146655 markings, 220387667 edges, 251098 markings/sec, 215 secs
lola: 68472661 markings, 224927220 edges, 265201 markings/sec, 220 secs
lola: 69751287 markings, 229392128 edges, 255725 markings/sec, 225 secs
lola: 70958602 markings, 233719227 edges, 241463 markings/sec, 230 secs
lola: 72215517 markings, 238132535 edges, 251383 markings/sec, 235 secs
lola: 73493447 markings, 242502359 edges, 255586 markings/sec, 240 secs
lola: 74735053 markings, 246817702 edges, 248321 markings/sec, 245 secs
lola: 76002239 markings, 251208850 edges, 253437 markings/sec, 250 secs
lola: 77263314 markings, 255676617 edges, 252215 markings/sec, 255 secs
lola: 78457636 markings, 259825988 edges, 238864 markings/sec, 260 secs
lola: 79744146 markings, 264094088 edges, 257302 markings/sec, 265 secs
lola: 81058878 markings, 268538405 edges, 262946 markings/sec, 270 secs
lola: 82238633 markings, 272610436 edges, 235951 markings/sec, 275 secs
lola: 83413144 markings, 276771053 edges, 234902 markings/sec, 280 secs
lola: 84591555 markings, 280906226 edges, 235682 markings/sec, 285 secs
lola: 85842809 markings, 285151242 edges, 250251 markings/sec, 290 secs
lola: 87018742 markings, 289315984 edges, 235187 markings/sec, 295 secs
lola: 88231007 markings, 293582160 edges, 242453 markings/sec, 300 secs
lola: 89439250 markings, 297764198 edges, 241649 markings/sec, 305 secs
lola: 90542156 markings, 301638174 edges, 220581 markings/sec, 310 secs
lola: 91679675 markings, 305560283 edges, 227504 markings/sec, 315 secs
lola: 93008941 markings, 310013329 edges, 265853 markings/sec, 320 secs
lola: 94202570 markings, 314158075 edges, 238726 markings/sec, 325 secs
lola: 95206358 markings, 317901561 edges, 200758 markings/sec, 330 secs
lola: 96357498 markings, 321971874 edges, 230228 markings/sec, 335 secs
lola: 97387298 markings, 325718703 edges, 205960 markings/sec, 340 secs
lola: 98510441 markings, 329624105 edges, 224629 markings/sec, 345 secs
lola: 99591545 markings, 333357099 edges, 216221 markings/sec, 350 secs
lola: 100650619 markings, 337161097 edges, 211815 markings/sec, 355 secs
lola: 101739835 markings, 341134654 edges, 217843 markings/sec, 360 secs
lola: 102814919 markings, 345008724 edges, 215017 markings/sec, 365 secs
lola: 103853577 markings, 348818396 edges, 207732 markings/sec, 370 secs
lola: 104965223 markings, 352675144 edges, 222329 markings/sec, 375 secs
lola: 105987948 markings, 356435901 edges, 204545 markings/sec, 380 secs
lola: 107131450 markings, 360529481 edges, 228700 markings/sec, 385 secs
lola: 108194396 markings, 364263531 edges, 212589 markings/sec, 390 secs
lola: 109233520 markings, 368023489 edges, 207825 markings/sec, 395 secs
lola: 110321366 markings, 371940183 edges, 217569 markings/sec, 400 secs
lola: 111365512 markings, 375722617 edges, 208829 markings/sec, 405 secs
lola: 112474685 markings, 379630302 edges, 221835 markings/sec, 410 secs
lola: 113557332 markings, 383456602 edges, 216529 markings/sec, 415 secs
lola: 114557134 markings, 387098791 edges, 199960 markings/sec, 420 secs
lola: 115560184 markings, 390729102 edges, 200610 markings/sec, 425 secs
lola: 116771110 markings, 394819742 edges, 242185 markings/sec, 430 secs
lola: 117803252 markings, 398551593 edges, 206428 markings/sec, 435 secs
lola: 118898378 markings, 402370554 edges, 219025 markings/sec, 440 secs
lola: 119859044 markings, 405904489 edges, 192133 markings/sec, 445 secs
lola: 120809887 markings, 409318686 edges, 190169 markings/sec, 450 secs
lola: 121832298 markings, 413087458 edges, 204482 markings/sec, 455 secs
lola: 122844305 markings, 416794484 edges, 202401 markings/sec, 460 secs
lola: 123898314 markings, 420540156 edges, 210802 markings/sec, 465 secs
lola: 124994011 markings, 424404316 edges, 219139 markings/sec, 470 secs
lola: 126026764 markings, 428037727 edges, 206551 markings/sec, 475 secs
lola: 127010157 markings, 431620049 edges, 196679 markings/sec, 480 secs
lola: 128074664 markings, 435347010 edges, 212901 markings/sec, 485 secs
lola: 129096803 markings, 438904249 edges, 204428 markings/sec, 490 secs
lola: 130088845 markings, 442492218 edges, 198408 markings/sec, 495 secs
lola: 130947026 markings, 445557851 edges, 171636 markings/sec, 500 secs
lola: 131908406 markings, 449012266 edges, 192276 markings/sec, 505 secs
lola: 132959526 markings, 452852559 edges, 210224 markings/sec, 510 secs
lola: 133962163 markings, 456495922 edges, 200527 markings/sec, 515 secs
lola: 134943192 markings, 460115458 edges, 196206 markings/sec, 520 secs
lola: 135936095 markings, 463702271 edges, 198581 markings/sec, 525 secs
lola: 136923626 markings, 467233799 edges, 197506 markings/sec, 530 secs
lola: 137959432 markings, 470849007 edges, 207161 markings/sec, 535 secs
lola: 139076284 markings, 474908770 edges, 223370 markings/sec, 540 secs
lola: 140052170 markings, 478486818 edges, 195177 markings/sec, 545 secs
lola: 141026412 markings, 481993002 edges, 194848 markings/sec, 550 secs
lola: 141937655 markings, 485401563 edges, 182249 markings/sec, 555 secs
lola: 142868349 markings, 488764104 edges, 186139 markings/sec, 560 secs
lola: 143771700 markings, 492068365 edges, 180670 markings/sec, 565 secs
lola: 144731975 markings, 495639914 edges, 192055 markings/sec, 570 secs
lola: 145694434 markings, 499156617 edges, 192492 markings/sec, 575 secs
lola: 146704979 markings, 502715587 edges, 202109 markings/sec, 580 secs
lola: 147723428 markings, 506275714 edges, 203690 markings/sec, 585 secs
lola: 148716526 markings, 509813542 edges, 198620 markings/sec, 590 secs
lola: 149696327 markings, 513226972 edges, 195960 markings/sec, 595 secs
lola: 150697292 markings, 517024822 edges, 200193 markings/sec, 600 secs
lola: 151688944 markings, 520599559 edges, 198330 markings/sec, 605 secs
lola: 152569055 markings, 523866963 edges, 176022 markings/sec, 610 secs
lola: 153510874 markings, 527279011 edges, 188364 markings/sec, 615 secs
lola: 154502290 markings, 530831166 edges, 198283 markings/sec, 620 secs
lola: 155321694 markings, 533908877 edges, 163881 markings/sec, 625 secs
lola: 156326640 markings, 537560527 edges, 200989 markings/sec, 630 secs
lola: 157299753 markings, 541031874 edges, 194623 markings/sec, 635 secs
lola: 158198541 markings, 544342623 edges, 179758 markings/sec, 640 secs
lola: 159110761 markings, 547782836 edges, 182444 markings/sec, 645 secs
lola: 159939119 markings, 550871984 edges, 165672 markings/sec, 650 secs
lola: 160814448 markings, 553970638 edges, 175066 markings/sec, 655 secs
lola: 161729583 markings, 557315035 edges, 183027 markings/sec, 660 secs
lola: 162626222 markings, 560677003 edges, 179328 markings/sec, 665 secs
lola: 163265983 markings, 563040168 edges, 127952 markings/sec, 670 secs
lola: 163333902 markings, 563287472 edges, 13584 markings/sec, 675 secs
lola: 163344452 markings, 563330296 edges, 2110 markings/sec, 680 secs
lola: 163356471 markings, 563378793 edges, 2404 markings/sec, 685 secs
lola: Child process aborted or communication problem between parent and child process

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (E (G ((StF <= SwA))) AND ((((1 <= CG) OR ((1 <= Uf))) AND E (G ((SR <= MwU)))) OR E (G (((2 <= SpA) AND (1 <= Cb))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= CG) OR ((1 <= Uf)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= CG) OR ((1 <= Uf)))
lola: processed formula length: 27
lola: 39 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= SpA) AND (1 <= Cb))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((2 <= SpA) AND (1 <= Cb))))
lola: processed formula length: 34
lola: 39 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((SR <= MwU)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((SR <= MwU)))
lola: processed formula length: 19
lola: 39 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 5001 markings, 5000 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A ((((StF <= Uf)) U (SpG + 1 <= SwG))) AND (A (((SpA <= SF) U (SR <= CwA))) AND (E (F ((SA <= CG))) AND ((SpG + 1 <= SF) OR (CwG <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((SpG + 1 <= SF) OR (CwG <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((SpG + 1 <= SF) OR (CwG <= 2))
lola: processed formula length: 32
lola: 39 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((SA <= CG)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((SA <= CG)))
lola: processed formula length: 18
lola: 40 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (SA <= CG)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((SpA <= SF) U (SR <= CwA)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((SpA <= SF) U (SR <= CwA)))
lola: processed formula length: 31
lola: 43 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((((StF <= Uf)) U (SpG + 1 <= SwG)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((StF <= Uf)) U (SpG + 1 <= SwG)))
lola: processed formula length: 38
lola: 43 rewrites
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 5001 markings, 5000 edges
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
========================================
lola: ========================================

FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes no unknown yes no no no no no no no no yes
lola:
preliminary result: no yes no yes no unknown yes no no no no no no no no yes
lola: memory consumption: 22908 KB
lola: time consumption: 1111 seconds

BK_STOP 1526560982204

--------------------
content from 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-N0500P0"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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-N0500P0.tgz
mv ClientsAndServers-PT-N0500P0 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 lola"
echo " Input is ClientsAndServers-PT-N0500P0, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r040-smll-152646357300164"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;