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 188K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K 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.2K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is ClientsAndServers-PT-N0010P2, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-152646359400101
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526469553919


BK_STOP 1526473139840

--------------------
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-N0010P2 as instance name.
Using ClientsAndServers as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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': 1181269, 'Memory': 14999.87, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola ClientsAndServers-PT-N0010P2...

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


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0010P2: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ ClientsAndServers-PT-N0010P2 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N0010P2-CTLCardinality.task
lola: A (F (((SA <= 2) AND (CR <= 0) AND (1 <= SA)))) : E (F ((A (G ((3 <= StF))) AND ((SwG + 1 <= CG) OR ((SR <= Si) AND (2 <= SwG)))))) : A (G (A (F (((1 <= CwG) AND (SpG <= MtF)))))) : (((E (F ((SG <= CwA))) OR (SpA <= 0)) AND E (X ((Uf + 1 <= MwU)))) OR A (F (((CA <= 1) AND (Cb + 1 <= SpG))))) : A (G (NOT(E (F ((Uf <= CwG)))))) : E (((StR <= CG) U ((Ci <= 1) AND (MwU + 1 <= StF)))) : E (G (NOT(E (G ((MwU <= StR)))))) : NOT(E (F (E (G ((2 <= SpA)))))) : (E (G (E (G ((SF <= SwG))))) AND A (F (E (G ((StR <= SpA)))))) : NOT(E (((CG <= 1) U (2 <= SpA)))) : (NOT(E (F (((CR <= StR) OR (1 <= Si))))) OR (((StR <= 2) AND (StF <= 0) AND (3 <= MpA)) OR (E (G ((SwA <= SA))) AND ((SpG <= 1) AND (Cb <= 0))))) : ((A (F ((SG + 1 <= Cb))) AND NOT(A (G ((MpG <= SA))))) AND (E (G ((SF <= 0))) OR A (F ((1 <= SwG))))) : E ((E (F ((Ci <= CwG))) U ((2 <= CR) AND (StR + 1 <= SF)))) : A (F (E (((1 <= SwG) U (1 <= MpG))))) : ((() AND (A (F ((CwG <= SF))) AND A (G ((3 <= Ci))))) OR E (X (E (G ((MpG <= CA)))))) : A (G (A (G ((Uf <= Ci)))))
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 (((SA <= 2) AND (CR <= 0) AND (1 <= SA))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((SA <= 2) AND (CR <= 0) AND (1 <= SA))))
lola: processed formula: A (F (((SA <= 2) AND (CR <= 0) AND (1 <= SA))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 645 markings, 645 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((3 <= StF))) AND ((SwG + 1 <= CG) OR ((SR <= Si) AND (2 <= SwG))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(E(TRUE U (StF <= 2))) AND ((SwG + 1 <= CG) OR ((SR <= Si) AND (2 <= SwG)))))
lola: processed formula length: 91
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 1846546 markings, 5274722 edges, 3689348869717491712 markings/sec, 0 secs
lola: 3509176 markings, 9832866 edges, 332526 markings/sec, 5 secs
lola: 5067137 markings, 14076760 edges, 311592 markings/sec, 10 secs
lola: 6571985 markings, 18162846 edges, 300970 markings/sec, 15 secs
lola: 8039313 markings, 22162392 edges, 293466 markings/sec, 20 secs
lola: 9475608 markings, 26072825 edges, 287259 markings/sec, 25 secs
lola: 10894606 markings, 29933079 edges, 283800 markings/sec, 30 secs
lola: 12286177 markings, 33704271 edges, 278314 markings/sec, 35 secs
lola: 13660600 markings, 37445015 edges, 274885 markings/sec, 40 secs
lola: 15028619 markings, 41171547 edges, 273604 markings/sec, 45 secs
lola: 16375450 markings, 44835711 edges, 269366 markings/sec, 50 secs
lola: 17719690 markings, 48484211 edges, 268848 markings/sec, 55 secs
lola: 19036975 markings, 52065451 edges, 263457 markings/sec, 60 secs
lola: 20355234 markings, 55640879 edges, 263652 markings/sec, 65 secs
lola: 21671566 markings, 59220722 edges, 263266 markings/sec, 70 secs
lola: 22972053 markings, 62751837 edges, 260097 markings/sec, 75 secs
lola: 24263957 markings, 66256838 edges, 258381 markings/sec, 80 secs
lola: 25536982 markings, 69707781 edges, 254605 markings/sec, 85 secs
lola: 26826853 markings, 73217908 edges, 257974 markings/sec, 90 secs
lola: 28093897 markings, 76659122 edges, 253409 markings/sec, 95 secs
lola: 29349601 markings, 80065349 edges, 251141 markings/sec, 100 secs
lola: 30607370 markings, 83485021 edges, 251554 markings/sec, 105 secs
lola: 31859739 markings, 86882490 edges, 250474 markings/sec, 110 secs
lola: 33093863 markings, 90241756 edges, 246825 markings/sec, 115 secs
lola: 34330509 markings, 93589321 edges, 247329 markings/sec, 120 secs
lola: 35554567 markings, 96916975 edges, 244812 markings/sec, 125 secs
lola: 36791125 markings, 100286162 edges, 247312 markings/sec, 130 secs
lola: 38010136 markings, 103587010 edges, 243802 markings/sec, 135 secs
lola: 39218689 markings, 106865537 edges, 241711 markings/sec, 140 secs
lola: 40427876 markings, 110155522 edges, 241837 markings/sec, 145 secs
lola: 41628538 markings, 113415966 edges, 240132 markings/sec, 150 secs
lola: 42833114 markings, 116689779 edges, 240915 markings/sec, 155 secs
lola: 44002570 markings, 119873223 edges, 233891 markings/sec, 160 secs
lola: 45196961 markings, 123118036 edges, 238878 markings/sec, 165 secs
lola: 46400608 markings, 126390537 edges, 240729 markings/sec, 170 secs
lola: 47593556 markings, 129632199 edges, 238590 markings/sec, 175 secs
lola: 48779961 markings, 132856853 edges, 237281 markings/sec, 180 secs
lola: 49988153 markings, 136134335 edges, 241638 markings/sec, 185 secs
lola: 51167717 markings, 139348065 edges, 235913 markings/sec, 190 secs
lola: 52343189 markings, 142545227 edges, 235094 markings/sec, 195 secs
lola: 53533350 markings, 145782380 edges, 238032 markings/sec, 200 secs
lola: 54713351 markings, 148990536 edges, 236000 markings/sec, 205 secs
lola: 55884012 markings, 152176745 edges, 234132 markings/sec, 210 secs
lola: 57051189 markings, 155343856 edges, 233435 markings/sec, 215 secs
lola: 58217659 markings, 158515611 edges, 233294 markings/sec, 220 secs
lola: 59369366 markings, 161656263 edges, 230341 markings/sec, 225 secs
lola: 60541230 markings, 164840654 edges, 234373 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((1 <= CwG) AND (SpG <= MtF))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((1 <= CwG) AND (SpG <= MtF))))))
lola: processed formula length: 59
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 872 markings, 1094 edges
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F ((SG <= CwA))) OR (SpA <= 0)) AND E (X ((Uf + 1 <= MwU)))) OR A (F (((CA <= 1) AND (Cb + 1 <= SpG)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((SG <= CwA)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((Uf + 1 <= MwU)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((Uf + 1 <= MwU))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((CA <= 1) AND (Cb + 1 <= SpG))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((CA <= 1) AND (Cb + 1 <= SpG))))
lola: processed formula: A (F (((CA <= 1) AND (Cb + 1 <= SpG))))
lola: processed formula length: 39
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.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: 1075 markings, 1245 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (F ((Uf <= CwG))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 57 markings, 56 edges
lola: state equation: write sara problem file to ClientsAndServers-PT-N0010P2-CTLCardinality-4.sara
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((StR <= CG) U ((Ci <= 1) AND (MwU + 1 <= StF))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((StR <= CG) U ((Ci <= 1) AND (MwU + 1 <= StF)))
lola: processed formula length: 49
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 161 markings, 160 edges
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (G ((MwU <= StR))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (StR + 1 <= MwU)))))
lola: processed formula length: 46
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 728 markings, 730 edges
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (E (G ((2 <= SpA))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (SpA <= 1)))))
lola: processed formula length: 40
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 1163 markings, 2443 edges
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (G ((SF <= SwG))))) AND A (F (E (G ((StR <= SpA))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((SF <= SwG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (SwG + 1 <= SF))))
lola: processed formula length: 40
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 645 markings, 1933 edges
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G ((StR <= SpA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (SpA + 1 <= StR))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 10337 markings, 11320 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((CG <= 1) U (2 <= SpA))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((2 <= CG) R (SpA <= 1)))
lola: processed formula: A (((2 <= CG) R (SpA <= 1)))
lola: processed formula length: 28
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.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: using ltl preserving stubborn set method (--stubborn)
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: 401 markings, 402 edges
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((CR <= StR) OR (1 <= Si))))) OR (((StR <= 2) AND (StF <= 0) AND (3 <= MpA)) OR (E (G ((SwA <= SA))) AND ((SpG <= 1) AND (Cb <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((StR + 1 <= CR) AND (Si <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to ClientsAndServers-PT-N0010P2-CTLCardinality-10.sara
lola: ========================================
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((StR <= 2) AND (StF <= 0) AND (3 <= MpA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((StR <= 2) AND (StF <= 0) AND (3 <= MpA))
lola: processed formula length: 42
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-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 12 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((SwA <= SA)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (SA + 1 <= SwA)))
lola: processed formula length: 30
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 645 markings, 644 edges
lola: ========================================
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((SpG <= 1) AND (Cb <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((SpG <= 1) AND (Cb <= 0))
lola: processed formula length: 26
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((SG + 1 <= Cb))) AND NOT(A (G ((MpG <= SA))))) AND (E (G ((SF <= 0))) OR A (F ((1 <= SwG)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((SG + 1 <= Cb)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((SG + 1 <= Cb)))
lola: processed formula: A (F ((SG + 1 <= Cb)))
lola: processed formula length: 22
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 193 markings, 193 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((Ci <= CwG))) U ((2 <= CR) AND (StR + 1 <= SF))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (Ci <= CwG)) U ((2 <= CR) AND (StR + 1 <= SF)))
lola: processed formula length: 58
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 647 markings, 1332 edges
lola: ========================================
lola: subprocess 13 will run for 1101 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (((1 <= SwG) U (1 <= MpG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E((1 <= SwG) U (1 <= MpG)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 161 markings, 281 edges
lola: ========================================
lola: subprocess 14 will run for 1651 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((() AND (A (F ((CwG <= SF))) AND A (G ((3 <= Ci))))) OR E (X (E (G ((MpG <= CA))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1651 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((CwG <= SF)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((CwG <= SF)))
lola: processed formula: A (F ((CwG <= SF)))
lola: processed formula length: 19
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P2-CTLCardinality.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 15 will run for 3303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= Ci)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0010P2-CTLCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 79 markings, 78 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
lola: time limit reached - aborting
lola:
preliminary result: no unknown no yes no no no no no no yes no yes yes
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA ClientsAndServers-PT-N0010P2-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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-N0010P2"
export BK_EXAMINATION="CTLCardinality"
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-N0010P2.tgz
mv ClientsAndServers-PT-N0010P2 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-N0010P2, 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 r043-smll-152646359400101"
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 ;