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

About the Execution of Irma.struct for ClientsAndServers-PT-N5000P0

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15919.040 472804.00 315386.00 2297.20 TFFFTTFF??FFFFFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
....................
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.0K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.2K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is ClientsAndServers-PT-N5000P0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r211-smll-152732261500053
=====================================================================


--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N5000P0-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527383130204


BK_STOP 1527383603008

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using ClientsAndServers-PT-N5000P0 as instance name.
Using ClientsAndServers as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': None, 'Reversible': None, 'Quasi Live': True, 'Live': None}.
Known tools are: [{'Time': 502861, 'Memory': 14538.94, 'Tool': 'lola'}, {'Time': 914341, 'Memory': 2223.98, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola ClientsAndServers-PT-N5000P0...

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


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N5000P0: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ ClientsAndServers-PT-N5000P0 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N5000P0-LTLCardinality.task
lola: A (F ((StF <= MpA))) : A ((Ci <= CA)) : A ((2 <= SR)) : A (X (((2 <= CG) U F ((Uf <= SR))))) : A ((SwG <= Ci)) : A (X ((Cb <= MpA))) : A ((F (X ((SwA <= Uf))) U X ((Mi <= CG)))) : A ((2 <= CF)) : A (G ((F ((3 <= Uf)) U X ((CF <= CwA))))) : A (F ((F ((3 <= CwA)) U F ((1 <= SF))))) : A ((F (X ((Si <= SpA))) U (3 <= SG))) : A (X (G (X (G ((3 <= SG)))))) : A ((1 <= CR)) : A (((2 <= SA) U X (X ((2 <= SwA))))) : A (X (X (X (X ((3 <= CF)))))) : A ((MwU <= SpG))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((StF <= MpA)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((StF <= MpA)))
lola: processed formula: A (F ((StF <= MpA)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((Ci <= CA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Ci <= CA)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= SR))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= SR)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (((2 <= CG) U F ((Uf <= SR)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((2 <= CG) U F ((Uf <= SR)))))
lola: processed formula: A (X (((2 <= CG) U F ((Uf <= SR)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 260013 markings, 260013 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((SwG <= Ci))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SwG <= Ci)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Cb <= MpA)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((Cb <= MpA)))
lola: processed formula: A (X ((Cb <= MpA)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((SwA <= Uf))) U X ((Mi <= CG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((SwA <= Uf))) U X ((Mi <= CG))))
lola: processed formula: A ((F (X ((SwA <= Uf))) U X ((Mi <= CG))))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 500001 markings, 500002 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= CF))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= CF)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F ((3 <= Uf)) U X ((CF <= CwA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((F ((3 <= Uf)) U X ((CF <= CwA)))))
lola: processed formula: A (G ((F ((3 <= Uf)) U X ((CF <= CwA)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3810130 markings, 6706578 edges, 762026 markings/sec, 0 secs
lola: 6610224 markings, 13732161 edges, 560019 markings/sec, 5 secs
lola: 9372611 markings, 20626592 edges, 552477 markings/sec, 10 secs
lola: 11814128 markings, 27833945 edges, 488303 markings/sec, 15 secs
lola: 14574116 markings, 34096277 edges, 551998 markings/sec, 20 secs
lola: 16941522 markings, 40598472 edges, 473481 markings/sec, 25 secs
lola: 19399796 markings, 46842887 edges, 491655 markings/sec, 30 secs
lola: 21815966 markings, 53296088 edges, 483234 markings/sec, 35 secs
lola: 24478954 markings, 59779750 edges, 532598 markings/sec, 40 secs
lola: 27407940 markings, 67253703 edges, 585797 markings/sec, 45 secs
lola: 29985727 markings, 74500044 edges, 515557 markings/sec, 50 secs
lola: 32602145 markings, 80959345 edges, 523284 markings/sec, 55 secs
lola: 35354126 markings, 87586156 edges, 550396 markings/sec, 60 secs
lola: 37561202 markings, 93958925 edges, 441415 markings/sec, 65 secs
lola: 39789422 markings, 100296674 edges, 445644 markings/sec, 70 secs
lola: 42613444 markings, 107083731 edges, 564804 markings/sec, 75 secs
lola: 44525822 markings, 113255489 edges, 382476 markings/sec, 80 secs
lola: 46839149 markings, 119465648 edges, 462665 markings/sec, 85 secs
lola: 49876868 markings, 125687847 edges, 607544 markings/sec, 90 secs
lola: 52070975 markings, 131817233 edges, 438821 markings/sec, 95 secs
lola: 54204047 markings, 138445371 edges, 426614 markings/sec, 100 secs
lola: 56449067 markings, 145543975 edges, 449004 markings/sec, 105 secs
lola: 58661933 markings, 152064708 edges, 442573 markings/sec, 110 secs
lola: 61129299 markings, 158728053 edges, 493473 markings/sec, 115 secs
lola: 63320944 markings, 164704278 edges, 438329 markings/sec, 120 secs
lola: 66023558 markings, 171508935 edges, 540523 markings/sec, 125 secs
lola: 68239976 markings, 177557771 edges, 443284 markings/sec, 130 secs
lola: 70342508 markings, 183897754 edges, 420506 markings/sec, 135 secs
lola: 72209819 markings, 190531805 edges, 373462 markings/sec, 140 secs
lola: 74612091 markings, 196878324 edges, 480454 markings/sec, 145 secs
lola: 76908549 markings, 202931652 edges, 459292 markings/sec, 150 secs
lola: 79374899 markings, 208965498 edges, 493270 markings/sec, 155 secs
lola: 81475048 markings, 215819481 edges, 420030 markings/sec, 160 secs
lola: 83655429 markings, 222308879 edges, 436076 markings/sec, 165 secs
lola: 85459691 markings, 228877984 edges, 360852 markings/sec, 170 secs
lola: 87745142 markings, 235246084 edges, 457090 markings/sec, 175 secs
lola: 89872523 markings, 241703909 edges, 425476 markings/sec, 180 secs
lola: 92138558 markings, 248063827 edges, 453207 markings/sec, 185 secs
lola: 94139046 markings, 254512899 edges, 400098 markings/sec, 190 secs
lola: 96226796 markings, 260856666 edges, 417550 markings/sec, 195 secs
lola: 97235468 markings, 264049130 edges, 201734 markings/sec, 200 secs
lola: 97237182 markings, 264054639 edges, 343 markings/sec, 205 secs
lola: 97243622 markings, 264075404 edges, 1288 markings/sec, 210 secs
lola: 97243683 markings, 264075597 edges, 12 markings/sec, 215 secs
lola: 97248485 markings, 264091079 edges, 960 markings/sec, 220 secs
lola: 97248515 markings, 264091159 edges, 6 markings/sec, 225 secs
lola: 97248539 markings, 264091252 edges, 5 markings/sec, 230 secs
lola: 97250201 markings, 264096597 edges, 332 markings/sec, 235 secs
lola: 97250212 markings, 264096634 edges, 2 markings/sec, 240 secs
lola: 97250231 markings, 264096666 edges, 4 markings/sec, 245 secs
lola: 97250237 markings, 264096707 edges, 1 markings/sec, 250 secs
lola: 97250252 markings, 264096758 edges, 3 markings/sec, 255 secs
lola: 97250267 markings, 264096810 edges, 3 markings/sec, 260 secs
lola: 97250285 markings, 264096844 edges, 4 markings/sec, 265 secs
lola: 97250290 markings, 264096867 edges, 1 markings/sec, 270 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 458 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F ((3 <= CwA)) U F ((1 <= SF)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((F ((3 <= CwA)) U F ((1 <= SF)))))
lola: processed formula: A (F ((F ((3 <= CwA)) U F ((1 <= SF)))))
lola: processed formula length: 40
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 5207618 markings, 5207618 edges, 1041524 markings/sec, 0 secs
lola: 10595372 markings, 10595372 edges, 1077551 markings/sec, 5 secs
lola: 15951048 markings, 15951047 edges, 1071135 markings/sec, 10 secs
lola: 21172976 markings, 21172975 edges, 1044386 markings/sec, 15 secs
lola: 26237376 markings, 26237376 edges, 1012880 markings/sec, 20 secs
lola: 31179110 markings, 31179110 edges, 988347 markings/sec, 25 secs
lola: 36308869 markings, 36308869 edges, 1025952 markings/sec, 30 secs
lola: 41149239 markings, 41149239 edges, 968074 markings/sec, 35 secs
lola: 45932130 markings, 45932130 edges, 956578 markings/sec, 40 secs
lola: 50425329 markings, 50425328 edges, 898640 markings/sec, 45 secs
lola: 54626090 markings, 54626090 edges, 840152 markings/sec, 50 secs
lola: 58979774 markings, 58979774 edges, 870737 markings/sec, 55 secs
lola: 63314389 markings, 63314389 edges, 866923 markings/sec, 60 secs
lola: 67489759 markings, 67489759 edges, 835074 markings/sec, 65 secs
lola: 71401382 markings, 71401382 edges, 782325 markings/sec, 70 secs
lola: 75468311 markings, 75468311 edges, 813386 markings/sec, 75 secs
lola: 79355572 markings, 79355572 edges, 777452 markings/sec, 80 secs
lola: 83099681 markings, 83099681 edges, 748822 markings/sec, 85 secs
lola: 86740241 markings, 86740241 edges, 728112 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 518 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (X ((Si <= SpA))) U (3 <= SG)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (X ((Si <= SpA))) U (3 <= SG)))
lola: processed formula: A ((F (X ((Si <= SpA))) U (3 <= SG)))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 509981 markings, 509982 edges
lola: ========================================
lola: subprocess 11 will run for 622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (X (G ((3 <= SG))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (X (G ((3 <= SG))))))
lola: processed formula: A (X (G (X (G ((3 <= SG))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 250001 markings, 250001 edges
lola: ========================================
lola: subprocess 12 will run for 778 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= CR))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= CR)
lola: processed formula length: 9
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.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 13 will run for 1037 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((2 <= SA) U X (X ((2 <= SwA)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= SA) U X (X ((2 <= SwA)))))
lola: processed formula: A (((2 <= SA) U X (X ((2 <= SwA)))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 250001 markings, 250001 edges
lola: ========================================
lola: subprocess 14 will run for 1556 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X ((3 <= CF))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X (X ((3 <= CF))))))
lola: processed formula: A (X (X (X (X ((3 <= CF))))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 250001 markings, 250001 edges
lola: ========================================
lola: subprocess 15 will run for 3112 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((MwU <= SpG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (MwU <= SpG)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N5000P0-LTLCardinality.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: RESULT
lola:
SUMMARY: yes no no no yes yes no no unknown unknown no no no no no yes
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N5000P0-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is ClientsAndServers-PT-N5000P0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-smll-152732261500053"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;