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 184K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.9K 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.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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 lola
Input is ClientsAndServers-PT-N2000P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r040-smll-152646357300178
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526569653037

info: Time: 3600 - MCC
===========================================================================================
prep: translating ClientsAndServers-PT-N2000P0 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating ClientsAndServers-PT-N2000P0 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ ClientsAndServers-PT-N2000P0 @ 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-N2000P0-CTLCardinality.task
lola: LP says that atomic proposition is always true: (MtF <= SwA)
lola: LP says that atomic proposition is always true: (SG <= SwG)
lola: always true
lola: always true
lola: LP says that atomic proposition is always true: (MtF <= SwA)
lola: NOT(A ((TRUE U (CR + 1 <= SpG)))) : (E (((2 <= CwA) U ((Cb <= SpA) AND (2 <= CwG)))) OR A (G (A (G (TRUE))))) : A (G ((E (F ((MwU <= Uf))) AND (CG <= 2)))) : A (G (A (((3 <= SpG) U (2 <= Si))))) : (A (G (E (F ((SpA <= CG))))) AND E ((((Mi <= SwG) OR (Cb <= StR)) U (3 <= MwU)))) : (E (F (((3 <= MtF) AND (CwG <= SwG) AND (1 <= SpG)))) AND (MwU <= CR)) : ((E (G (((SwG <= SF) AND (SR <= CwA)))) AND ((SF <= CG) OR E (G ((3 <= SF))))) OR A (F (((SwA + 1 <= SwG) OR ((MpG <= MpA) AND (1 <= MpA)))))) : (A (G (E (F ((CG <= SF))))) OR ((((3 <= CwG) AND (StF + 1 <= MpG)) OR ((SpA + 1 <= SA) AND (CA <= 2))) AND E (F ((SR + 1 <= MwU))))) : E (G ((A (F ((MwU <= Cb))) AND (MwU <= Ci)))) : A (X (E (((SwG <= MtF) U (2 <= Cb))))) : E (F ((A (X ((SpA <= SR))) AND ((SA <= Ci) AND (Si <= SpA) AND (1 <= CG))))) : NOT(A (F (((MwU + 1 <= Cb) AND (CwG <= 2))))) : NOT(((E (X ((SwA <= SwG))) OR ((1 <= MpA) AND ((2 <= SpG) OR (SpG <= SwA)))) AND A (F (((2 <= MtF) OR (1 <= CA)))))) : A (G ((A (X ((1 <= Si))) OR ((CF <= 0) OR (SwA <= 2))))) : NOT(A (G ((SF <= 2)))) : NOT(A (G ((3 <= Uf))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:545
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-CTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-1 TRUE 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: ...considering subproblem: A (X (E (((SwG <= MtF) U (2 <= Cb)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(E((SwG <= MtF) U (2 <= Cb)))
lola: processed formula length: 31
lola: 32 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 3437985 markings, 5144978 edges, 687597 markings/sec, 0 secs
lola: 6789001 markings, 10171503 edges, 670203 markings/sec, 5 secs
lola: 10161215 markings, 15229823 edges, 674443 markings/sec, 10 secs
lola: 13516095 markings, 20262143 edges, 670976 markings/sec, 15 secs
lola: 16666308 markings, 24987462 edges, 630043 markings/sec, 20 secs
lola: 19860244 markings, 29778366 edges, 638787 markings/sec, 25 secs
lola: 23000000 markings, 34487999 edges, 627951 markings/sec, 30 secs
lola: 26196639 markings, 39282958 edges, 639328 markings/sec, 35 secs
lola: 29416041 markings, 44112062 edges, 643880 markings/sec, 40 secs
lola: 32630085 markings, 48933128 edges, 642809 markings/sec, 45 secs
lola: 36094925 markings, 54130387 edges, 692968 markings/sec, 50 secs
lola: 39480645 markings, 59208968 edges, 677144 markings/sec, 55 secs
lola: 42871033 markings, 64294550 edges, 678078 markings/sec, 60 secs
lola: 46241092 markings, 69349638 edges, 674012 markings/sec, 65 secs
lola: 49579655 markings, 74357483 edges, 667713 markings/sec, 70 secs
lola: 53005455 markings, 79496182 edges, 685160 markings/sec, 75 secs
lola: 56357545 markings, 84524319 edges, 670418 markings/sec, 80 secs
lola: 59722392 markings, 89571589 edges, 672969 markings/sec, 85 secs
lola: 63047889 markings, 94559833 edges, 665099 markings/sec, 90 secs
lola: 66422973 markings, 99622459 edges, 675017 markings/sec, 95 secs
lola: 69969835 markings, 104942752 edges, 709372 markings/sec, 100 secs
lola: 73423340 markings, 110123011 edges, 690701 markings/sec, 105 secs
lola: 76898678 markings, 115336017 edges, 695068 markings/sec, 110 secs
lola: 80286186 markings, 120417279 edges, 677502 markings/sec, 115 secs
lola: 83733853 markings, 125588780 edges, 689533 markings/sec, 120 secs
lola: 87176495 markings, 130752743 edges, 688528 markings/sec, 125 secs
lola: 90553362 markings, 135818043 edges, 675373 markings/sec, 130 secs
lola: 93957723 markings, 140924584 edges, 680872 markings/sec, 135 secs
lola: 97349328 markings, 146011992 edges, 678321 markings/sec, 140 secs
lola: 100957755 markings, 151424632 edges, 721685 markings/sec, 145 secs
lola: 104642728 markings, 156952093 edges, 736995 markings/sec, 150 secs
lola: 108368718 markings, 162541077 edges, 745198 markings/sec, 155 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 112020000 markings, 168017999 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((SpA <= SR))) AND ((SA <= Ci) AND (Si <= SpA) AND (1 <= CG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: processed formula: E(TRUE U (AX((SpA <= SR)) AND ((SA <= Ci) AND (Si <= SpA) AND (1 <= CG))))
lola: processed formula length: 74
lola: 32 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 480047 markings, 796056 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (X ((SwG + 1 <= SwA))) AND ((MpA <= 0) OR ((SpG <= 1) AND (SwA + 1 <= SpG)))) OR E (G (((MtF <= 1) AND (CA <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((MpA <= 0) OR ((SpG <= 1) AND (SwA + 1 <= SpG)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((MpA <= 0) OR ((SpG <= 1) AND (SwA + 1 <= SpG)))
lola: processed formula length: 50
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-CTLCardinality.task
lola: processed formula with 3 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 4 will run for 283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((MtF <= 1) AND (CA <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((MtF <= 1) AND (CA <= 0))))
lola: processed formula length: 34
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 5366572 markings, 5366572 edges, 1073314 markings/sec, 0 secs
lola: 10403096 markings, 10403095 edges, 1007305 markings/sec, 5 secs
lola: 15287298 markings, 15287299 edges, 976840 markings/sec, 10 secs
lola: 20153405 markings, 20153405 edges, 973221 markings/sec, 15 secs
lola: 24926520 markings, 24926520 edges, 954623 markings/sec, 20 secs
lola: 29680340 markings, 29680339 edges, 950764 markings/sec, 25 secs
lola: 34418842 markings, 34418842 edges, 947700 markings/sec, 30 secs
lola: 39132792 markings, 39132792 edges, 942790 markings/sec, 35 secs
lola: 43780279 markings, 43780279 edges, 929497 markings/sec, 40 secs
lola: 48386421 markings, 48386421 edges, 921228 markings/sec, 45 secs
lola: 53008965 markings, 53008965 edges, 924509 markings/sec, 50 secs
lola: 57578437 markings, 57578437 edges, 913894 markings/sec, 55 secs
lola: 62150648 markings, 62150647 edges, 914442 markings/sec, 60 secs
lola: 66861026 markings, 66861025 edges, 942076 markings/sec, 65 secs
lola: 71662786 markings, 71662786 edges, 960352 markings/sec, 70 secs
lola: 76396229 markings, 76396229 edges, 946689 markings/sec, 75 secs
lola: 81129630 markings, 81129630 edges, 946680 markings/sec, 80 secs
lola: 85760023 markings, 85760024 edges, 926079 markings/sec, 85 secs
lola: 90437831 markings, 90437830 edges, 935562 markings/sec, 90 secs
lola: 95254687 markings, 95254686 edges, 963371 markings/sec, 95 secs
lola: 99464552 markings, 99971373 edges, 841973 markings/sec, 100 secs
lola: 103456496 markings, 104577595 edges, 798389 markings/sec, 105 secs
lola: 107419588 markings, 109150494 edges, 792618 markings/sec, 110 secs
lola: 111296485 markings, 113623917 edges, 775379 markings/sec, 115 secs
lola: 115192967 markings, 118119928 edges, 779296 markings/sec, 120 secs
lola: 119145303 markings, 122680382 edges, 790467 markings/sec, 125 secs
lola: 122921925 markings, 127038080 edges, 755324 markings/sec, 130 secs
lola: 126700899 markings, 131398487 edges, 755795 markings/sec, 135 secs
lola: 130472514 markings, 135750400 edges, 754323 markings/sec, 140 secs
lola: 134335139 markings, 140207325 edges, 772525 markings/sec, 145 secs
lola: 138166566 markings, 144628248 edges, 766285 markings/sec, 150 secs
lola: 142049471 markings, 149108567 edges, 776581 markings/sec, 155 secs
lola: 145957616 markings, 153618006 edges, 781629 markings/sec, 160 secs
lola: 149914490 markings, 158183672 edges, 791375 markings/sec, 165 secs
lola: 153739672 markings, 162597383 edges, 765036 markings/sec, 170 secs
lola: 157580086 markings, 167028666 edges, 768083 markings/sec, 175 secs
lola: 161456990 markings, 171502054 edges, 775381 markings/sec, 180 secs
lola: 165330635 markings, 175971680 edges, 774729 markings/sec, 185 secs
lola: 169246065 markings, 180489519 edges, 783086 markings/sec, 190 secs
lola: 173174699 markings, 185022593 edges, 785727 markings/sec, 195 secs
lola: 177118303 markings, 189572939 edges, 788721 markings/sec, 200 secs
lola: 181066100 markings, 194128122 edges, 789559 markings/sec, 205 secs
lola: 185001068 markings, 198668501 edges, 786994 markings/sec, 210 secs
lola: 188945578 markings, 203219891 edges, 788902 markings/sec, 215 secs
lola: 192936213 markings, 207824500 edges, 798127 markings/sec, 220 secs
lola: 196847291 markings, 212337312 edges, 782216 markings/sec, 225 secs
lola: 200622457 markings, 216693297 edges, 755033 markings/sec, 230 secs
lola: 204390717 markings, 221041290 edges, 753652 markings/sec, 235 secs
lola: 208202587 markings, 225439600 edges, 762374 markings/sec, 240 secs
lola: 211974044 markings, 229791282 edges, 754291 markings/sec, 245 secs
lola: 215758570 markings, 234158043 edges, 756905 markings/sec, 250 secs
lola: 219554994 markings, 238538531 edges, 759285 markings/sec, 255 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown no yes unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: unknown yes unknown unknown unknown unknown unknown unknown unknown no yes unknown unknown unknown unknown unknown
lola: memory consumption: 23928 KB
lola: time consumption: 427 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((A (X ((1 <= Si))) OR ((CF <= 0) OR (SwA <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(E(TRUE U (NOT(AX((1 <= Si))) AND ((1 <= CF) AND (3 <= SwA)))))
lola: processed formula length: 66
lola: 34 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 1816018 markings, 4242175 edges, 363204 markings/sec, 0 secs
lola: 3515567 markings, 8564883 edges, 339910 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4016977 markings, 9945963 edges

FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 284 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= SF)))
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 ((3 <= SF)))
lola: processed formula length: 17
lola: 31 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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:625
lola: formula 0: (3 <= SF)
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: 37 markings, 36 edges
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-CTLCardinality-5-0.sara
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 313 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((Uf <= 2)))
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 ((Uf <= 2)))
lola: processed formula length: 17
lola: 31 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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:625
lola: formula 0: (Uf <= 2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-CTLCardinality-6-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N2000P0-CTLCardinality-6-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 51985 markings, 51984 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 347 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((SpG <= CR)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((SpG <= CR)))
lola: processed formula length: 19
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 100001 markings, 100000 edges
lola:
========================================
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((Cb <= MwU) OR (3 <= CwG))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((Cb <= MwU) OR (3 <= CwG))))
lola: processed formula length: 36
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 16020 markings, 16020 edges
lola:
FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 9 will run for 447 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (A (((3 <= SpG) U (2 <= Si)))))
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((3 <= SpG) U (2 <= Si)))))
lola: processed formula length: 45
lola: 32 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 35992 markings, 71983 edges
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 521 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((MwU <= Cb))) AND (MwU <= Ci))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (MwU <= Cb))) OR (Ci + 1 <= MwU))))
lola: processed formula length: 62
lola: 34 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: 4247868 markings, 4270507 edges, 849574 markings/sec, 0 secs
lola: 8659346 markings, 8684893 edges, 882296 markings/sec, 5 secs
lola: 13116292 markings, 13144067 edges, 891389 markings/sec, 10 secs
lola: 17585704 markings, 17615355 edges, 893882 markings/sec, 15 secs
lola: 22057254 markings, 22088553 edges, 894310 markings/sec, 20 secs
lola: 26386429 markings, 26424577 edges, 865835 markings/sec, 25 secs
lola: 30734254 markings, 30776752 edges, 869565 markings/sec, 30 secs
lola: 35116916 markings, 35162454 edges, 876532 markings/sec, 35 secs
lola: 39445361 markings, 39493344 edges, 865689 markings/sec, 40 secs
lola: 43843100 markings, 43893228 edges, 879548 markings/sec, 45 secs
lola: 48094320 markings, 48146308 edges, 850244 markings/sec, 50 secs
lola: 52645155 markings, 52705833 edges, 910167 markings/sec, 55 secs
lola: 57159384 markings, 57223652 edges, 902846 markings/sec, 60 secs
lola: 61667538 markings, 61734556 edges, 901631 markings/sec, 65 secs
lola: 66190829 markings, 66260177 edges, 904658 markings/sec, 70 secs
lola: 70637944 markings, 70709312 edges, 889423 markings/sec, 75 secs
lola: 75035629 markings, 75114577 edges, 879537 markings/sec, 80 secs
lola: 79475477 markings, 79558535 edges, 887970 markings/sec, 85 secs
lola: 83917815 markings, 84003823 edges, 888468 markings/sec, 90 secs
lola: 88310597 markings, 88399015 edges, 878556 markings/sec, 95 secs
lola: 92764567 markings, 92855105 edges, 890794 markings/sec, 100 secs
lola: 97023726 markings, 97119549 edges, 851832 markings/sec, 105 secs
lola: 101480547 markings, 101581975 edges, 891364 markings/sec, 110 secs
lola: 105935282 markings, 106040055 edges, 890947 markings/sec, 115 secs
lola: 110341295 markings, 110448673 edges, 881203 markings/sec, 120 secs
lola: 114766902 markings, 114876515 edges, 885121 markings/sec, 125 secs
lola: 119106517 markings, 119218075 edges, 867923 markings/sec, 130 secs
lola: 123466887 markings, 123586315 edges, 872074 markings/sec, 135 secs
lola: 127814273 markings, 127937566 edges, 869477 markings/sec, 140 secs
lola: 132179822 markings, 132305975 edges, 873110 markings/sec, 145 secs
lola: 136503785 markings, 136632288 edges, 864793 markings/sec, 150 secs
lola: 140890033 markings, 141020621 edges, 877250 markings/sec, 155 secs
lola: 145114180 markings, 145250158 edges, 844829 markings/sec, 160 secs
lola: 149485731 markings, 149627144 edges, 874310 markings/sec, 165 secs
lola: 153904610 markings, 154049348 edges, 883776 markings/sec, 170 secs
lola: 158336680 markings, 158484043 edges, 886414 markings/sec, 175 secs
lola: 162818302 markings, 162967930 edges, 896324 markings/sec, 180 secs
lola: 167182445 markings, 167334028 edges, 872829 markings/sec, 185 secs
lola: 171460487 markings, 171619885 edges, 855608 markings/sec, 190 secs
lola: 175736486 markings, 175899709 edges, 855200 markings/sec, 195 secs
lola: 180053948 markings, 180220016 edges, 863492 markings/sec, 200 secs
lola: 184372434 markings, 184540862 edges, 863697 markings/sec, 205 secs
lola: 188754972 markings, 188925489 edges, 876508 markings/sec, 210 secs
lola: 192914464 markings, 193089951 edges, 831898 markings/sec, 215 secs
lola: 197200016 markings, 197381154 edges, 857110 markings/sec, 220 secs
lola: 201492210 markings, 201676663 edges, 858439 markings/sec, 225 secs
lola: 205800263 markings, 205987326 edges, 861611 markings/sec, 230 secs
lola: 209162566 markings, 209351384 edges, 672461 markings/sec, 235 secs
lola: 209612414 markings, 209801451 edges, 89970 markings/sec, 240 secs
lola: 209640348 markings, 209829401 edges, 5587 markings/sec, 245 secs
lola: 209649038 markings, 209838096 edges, 1738 markings/sec, 250 secs
lola: 209659428 markings, 209848491 edges, 2078 markings/sec, 255 secs
lola: 209665472 markings, 209854540 edges, 1209 markings/sec, 260 secs
lola: 209675150 markings, 209864217 edges, 1936 markings/sec, 265 secs
lola: 209681549 markings, 209870622 edges, 1280 markings/sec, 270 secs
lola: 209684125 markings, 209873198 edges, 515 markings/sec, 275 secs
lola: 209692060 markings, 209881138 edges, 1587 markings/sec, 280 secs
lola: 209711330 markings, 209900418 edges, 3854 markings/sec, 285 secs
lola: 209716369 markings, 209905457 edges, 1008 markings/sec, 290 secs
lola: 209727001 markings, 209916098 edges, 2126 markings/sec, 295 secs
lola: 209751560 markings, 209940667 edges, 4912 markings/sec, 300 secs
lola: 209757791 markings, 209946903 edges, 1246 markings/sec, 305 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= MtF) AND (CwG <= SwG) AND (1 <= SpG)))) AND (MwU <= CR))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 562 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (MwU <= CR)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MwU <= CR)
lola: processed formula length: 11
lola: 30 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-CTLCardinality.task
lola: processed formula with 1 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 12 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= MtF) AND (CwG <= SwG) AND (1 <= SpG))))
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 (((3 <= MtF) AND (CwG <= SwG) AND (1 <= SpG))))
lola: processed formula length: 52
lola: 31 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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:625
lola: formula 0: ((3 <= MtF) AND (CwG <= SwG) AND (1 <= SpG))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-CTLCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N2000P0-CTLCardinality-12-0.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((MwU <= Uf))))) AND A (G ((CG <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((CG <= 2)))
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 ((CG <= 2)))
lola: processed formula length: 17
lola: 32 rewrites
lola: closed formula file ClientsAndServers-PT-N2000P0-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: (3 <= CG)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N2000P0-CTLCardinality-12-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: 25 markings, 24 edges
state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA ClientsAndServers-PT-N2000P0-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 937 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (E (F ((SpA <= CG))))) AND E ((((Mi <= SwG) OR (Cb <= StR)) U (3 <= MwU))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
sara: try reading problem file ClientsAndServers-PT-N2000P0-CTLCardinality-12-0.sara.

lola: local time limit reached - aborting
lola:
preliminary result: yes yes no no unknown no unknown unknown unknown no yes yes unknown no yes yes
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 21160 KB
lola: time consumption: 1694 seconds
lola: time limit reached - aborting
lola:
preliminary result: yes yes no no unknown no unknown unknown unknown no yes yes unknown no yes yes
lola:
preliminary result: yes yes no no unknown no unknown unknown unknown no yes yes unknown no yes yes
lola: memory consumption: 21160 KB
lola: time consumption: 3570 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
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-N2000P0"
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-N2000P0.tgz
mv ClientsAndServers-PT-N2000P0 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-N2000P0, 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-152646357300178"
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 ;