About the Execution of Irma.struct for ClientsAndServers-PT-N0500P0
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15901.600 | 629990.00 | 590374.00 | 3262.90 | FTFTF?TFFF?FFFF? | 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 192K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.7K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 8 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 9.1K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is ClientsAndServers-PT-N0500P0, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r043-smll-152646359500164
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-00
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-01
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-02
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-03
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-04
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-05
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-06
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-07
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-08
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-09
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0500P0-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526479788436
BK_STOP 1526480418426
--------------------
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-N0500P0 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': 1368755, 'Memory': 15945.48, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
CTLCardinality lola ClientsAndServers-PT-N0500P0...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
ClientsAndServers-PT-N0500P0: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0500P0: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ ClientsAndServers-PT-N0500P0 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: A (G (A (((1 <= Ci) U (SwG <= MpA))))) : A (((((2 <= StF) AND (SA <= SF)) OR (3 <= StR)) U E (G ((SwA <= CwG))))) : (E (G ((StF <= SwA))) AND ((((1 <= CG) OR ((3 <= Mi) AND (1 <= Uf))) AND E (G ((SR <= MwU)))) OR E (G (((2 <= SpA) AND (1 <= Cb)))))) : (E (((CA <= 0) U (Uf + 1 <= MpG))) OR ((E (G ((1 <= MwU))) AND A (F ((SR <= CR)))) OR (Ci <= SR))) : A (F (A (G (((SG <= StR) OR (Cb <= Ci)))))) : E (F (A (G ((CwG <= MtF))))) : (A ((((StF <= Uf)) U (SpG + 1 <= SwG))) AND (A (((SpA <= SF) U (SR <= CwA))) AND (E (F ((SA <= CG))) AND ((SpG + 1 <= SF) OR (CwG <= 2))))) : A (G ((2 <= Si))) : (A (((SpA <= Si) U (CR + 1 <= SpA))) AND (((2 <= StR) OR (StF <= SwA) OR ((2 <= CA) AND (CR <= Uf)) OR ((SF <= CwG) AND (1 <= StR) AND (3 <= CwG))) OR A (X (TRUE)))) : NOT(A (F ((((3 <= SA) AND (2 <= SA)) OR (1 <= StR))))) : A (F (A (G (((SwA <= SwG) OR (3 <= Uf)))))) : NOT(((((CF <= SF) OR ((MtF <= SpA) AND (StR <= MpA))) AND A (G ((2 <= Mi)))) AND NOT(A (X ((Ci <= SG)))))) : E (X (NOT(E (F ((3 <= CF)))))) : NOT(((E (G ((MpA <= MtF))) AND E (F ((Si <= SwG)))) AND E (F (((2 <= CwG) OR (1 <= Si)))))) : NOT(E (G (A (X ((SA <= MwU)))))) : (E (((CR + 1 <= MpA) U ((SF <= CF) AND (Ci <= CR)))) OR A (F ((1 <= SwG))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((1 <= Ci) U (SwG <= MpA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((1 <= Ci) U (SwG <= MpA)))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 4003 markings, 8005 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((((2 <= StF) AND (SA <= SF)) OR (3 <= StR)) U E (G ((SwA <= CwG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((((2 <= StF) AND (SA <= SF)) OR (3 <= StR)) U NOT(A(TRUE U (CwG + 1 <= SwA))))
lola: processed formula length: 81
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 25001 markings, 25001 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G ((StF <= SwA))) AND ((((1 <= CG) OR ((3 <= Mi) AND (1 <= Uf))) AND E (G ((SR <= MwU)))) OR E (G (((2 <= SpA) AND (1 <= Cb))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((StF <= SwA)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (SwA + 1 <= StF)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 25001 markings, 25000 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= CG) OR ((3 <= Mi) AND (1 <= Uf)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= CG) OR ((3 <= Mi) AND (1 <= Uf)))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((SR <= MwU)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (MwU + 1 <= SR)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 6001 markings, 6000 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= SpA) AND (1 <= Cb))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((SpA <= 1) OR (Cb <= 0))))
lola: processed formula length: 41
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((CA <= 0) U (Uf + 1 <= MpG))) OR ((E (G ((1 <= MwU))) AND A (F ((SR <= CR)))) OR (Ci <= SR)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((CA <= 0) U (Uf + 1 <= MpG)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((CA <= 0) U (Uf + 1 <= MpG))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 21996 markings, 21995 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((SG <= StR) OR (Cb <= Ci))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((SG <= StR) OR (Cb <= Ci))))))
lola: processed formula: A (F (A (G (((SG <= StR) OR (Cb <= Ci))))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 46069 markings, 55091 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((CwG <= MtF)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (MtF + 1 <= CwG))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 2458490 markings, 8521504 edges, 3689329903141912576 markings/sec, 0 secs
lola: 5210998 markings, 18633466 edges, 550502 markings/sec, 5 secs
lola: 7689956 markings, 28521579 edges, 495792 markings/sec, 10 secs
lola: 9984583 markings, 38394943 edges, 458925 markings/sec, 15 secs
lola: 12166526 markings, 48190789 edges, 436389 markings/sec, 20 secs
lola: 14266881 markings, 57624938 edges, 420071 markings/sec, 25 secs
lola: 16536592 markings, 67620918 edges, 453942 markings/sec, 30 secs
lola: 18751738 markings, 76808400 edges, 443029 markings/sec, 35 secs
lola: 20632662 markings, 86180058 edges, 376185 markings/sec, 40 secs
lola: 22506137 markings, 95527663 edges, 374695 markings/sec, 45 secs
lola: 24363154 markings, 104797220 edges, 371403 markings/sec, 50 secs
lola: 26266577 markings, 114300821 edges, 380685 markings/sec, 55 secs
lola: 28599114 markings, 123642843 edges, 466507 markings/sec, 60 secs
lola: 30832450 markings, 132590861 edges, 446667 markings/sec, 65 secs
lola: 32655663 markings, 141658323 edges, 364643 markings/sec, 70 secs
lola: 34483218 markings, 150768713 edges, 365511 markings/sec, 75 secs
lola: 36657095 markings, 160031294 edges, 434775 markings/sec, 80 secs
lola: 38733897 markings, 169353640 edges, 415360 markings/sec, 85 secs
lola: 40792684 markings, 178601387 edges, 411757 markings/sec, 90 secs
lola: 42939326 markings, 188246914 edges, 429328 markings/sec, 95 secs
lola: 44600155 markings, 196297388 edges, 332166 markings/sec, 100 secs
lola: 46407432 markings, 204788063 edges, 361455 markings/sec, 105 secs
lola: 48160475 markings, 213529534 edges, 350609 markings/sec, 110 secs
lola: 49898070 markings, 222200601 edges, 347519 markings/sec, 115 secs
lola: 51615192 markings, 230772434 edges, 343424 markings/sec, 120 secs
lola: 53420716 markings, 239516387 edges, 361105 markings/sec, 125 secs
lola: 55264563 markings, 247311769 edges, 368769 markings/sec, 130 secs
lola: 57274555 markings, 255853227 edges, 401998 markings/sec, 135 secs
lola: 59551308 markings, 264933926 edges, 455351 markings/sec, 140 secs
lola: 61416946 markings, 273577619 edges, 373128 markings/sec, 145 secs
lola: 63074380 markings, 281822424 edges, 331487 markings/sec, 150 secs
lola: 64704127 markings, 289940362 edges, 325949 markings/sec, 155 secs
lola: 66432434 markings, 297965818 edges, 345661 markings/sec, 160 secs
lola: 68674515 markings, 306567159 edges, 448416 markings/sec, 165 secs
lola: 70741834 markings, 315845993 edges, 413464 markings/sec, 170 secs
lola: 72800591 markings, 325093341 edges, 411751 markings/sec, 175 secs
lola: 74900475 markings, 334526800 edges, 419977 markings/sec, 180 secs
lola: 76973634 markings, 343790566 edges, 414632 markings/sec, 185 secs
lola: 78992887 markings, 352855770 edges, 403851 markings/sec, 190 secs
lola: 80999504 markings, 361868795 edges, 401323 markings/sec, 195 secs
lola: 83040447 markings, 371039484 edges, 408189 markings/sec, 200 secs
lola: 84802679 markings, 378993062 edges, 352446 markings/sec, 205 secs
lola: 86378740 markings, 386827036 edges, 315212 markings/sec, 210 secs
lola: 87957746 markings, 394583700 edges, 315801 markings/sec, 215 secs
lola: 89431324 markings, 401896807 edges, 294716 markings/sec, 220 secs
lola: 91140635 markings, 409292920 edges, 341862 markings/sec, 225 secs
lola: 92663259 markings, 416867885 edges, 304525 markings/sec, 230 secs
lola: 94168937 markings, 424369259 edges, 301136 markings/sec, 235 secs
lola: 95642674 markings, 431716057 edges, 294747 markings/sec, 240 secs
lola: 97666712 markings, 439455993 edges, 404808 markings/sec, 245 secs
lola: 99586381 markings, 447637397 edges, 383934 markings/sec, 250 secs
lola: 101040319 markings, 454875289 edges, 290788 markings/sec, 255 secs
lola: 102447941 markings, 461892350 edges, 281524 markings/sec, 260 secs
lola: 104387837 markings, 469403620 edges, 387979 markings/sec, 265 secs
lola: 106446009 markings, 477285727 edges, 411634 markings/sec, 270 secs
lola: 108086703 markings, 485444762 edges, 328139 markings/sec, 275 secs
lola: 109614054 markings, 493054718 edges, 305470 markings/sec, 280 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((StF <= Uf)) U (SpG + 1 <= SwG))) AND (A (((SpA <= SF) U (SR <= CwA))) AND (E (F ((SA <= CG))) AND ((SpG + 1 <= SF) OR (CwG <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((StF <= Uf)) U (SpG + 1 <= SwG)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((StF <= Uf)) U (SpG + 1 <= SwG)))
lola: processed formula: A ((((StF <= Uf)) U (SpG + 1 <= SwG)))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 6001 markings, 6000 edges
lola: ========================================
lola: subprocess 7 will run for 361 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((SpA <= SF) U (SR <= CwA)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((SpA <= SF) U (SR <= CwA)))
lola: processed formula: A (((SpA <= SF) U (SR <= CwA)))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 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 8 will run for 406 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((SA <= CG)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: 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 9 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((SpG + 1 <= SF) OR (CwG <= 2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((SpG + 1 <= SF) OR (CwG <= 2))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 361 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= Si)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: 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-N0500P0-CTLCardinality-7.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1999 markings, 1998 edges
lola: ========================================
lola: subprocess 8 will run for 406 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((SpA <= Si) U (CR + 1 <= SpA))) AND (((2 <= StR) OR (StF <= SwA) OR ((2 <= CA) AND (CR <= Uf)) OR ((SF <= CwG) AND (1 <= StR) AND (3 <= CwG))) OR A (X (TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((SpA <= Si) U (CR + 1 <= SpA)))
lola: processed formula: A (((SpA <= Si) U (CR + 1 <= SpA)))
lola: processed formula length: 35
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 25001 markings, 25001 edges
lola: ========================================
lola: subprocess 9 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((((3 <= SA) AND (2 <= SA)) OR (1 <= StR)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((3 <= SA) AND (2 <= SA)) OR (1 <= StR))))
lola: processed formula length: 57
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 4002 markings, 4001 edges
lola: ========================================
lola: subprocess 10 will run for 541 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((SwA <= SwG) OR (3 <= Uf))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((SwA <= SwG) OR (3 <= Uf))))))
lola: processed formula: A (F (A (G (((SwA <= SwG) OR (3 <= Uf))))))
lola: processed formula length: 44
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 2814881 markings, 4297541 edges, 562976 markings/sec, 0 secs
lola: 5229069 markings, 8099944 edges, 482838 markings/sec, 5 secs
lola: 7329789 markings, 11415931 edges, 420144 markings/sec, 10 secs
lola: 9293290 markings, 14513934 edges, 392700 markings/sec, 15 secs
lola: 11094515 markings, 17382707 edges, 360245 markings/sec, 20 secs
lola: 12892854 markings, 20215899 edges, 359668 markings/sec, 25 secs
lola: 14587710 markings, 22920851 edges, 338971 markings/sec, 30 secs
lola: 16168495 markings, 25473099 edges, 316157 markings/sec, 35 secs
lola: 17701428 markings, 27934889 edges, 306587 markings/sec, 40 secs
lola: 19181835 markings, 30332523 edges, 296081 markings/sec, 45 secs
lola: 20680582 markings, 32747809 edges, 299749 markings/sec, 50 secs
lola: 22132134 markings, 35102234 edges, 290310 markings/sec, 55 secs
lola: 23629541 markings, 37517020 edges, 299481 markings/sec, 60 secs
lola: 25064008 markings, 39833090 edges, 286893 markings/sec, 65 secs
lola: 26461479 markings, 42094028 edges, 279494 markings/sec, 70 secs
lola: 27870593 markings, 44383947 edges, 281823 markings/sec, 75 secs
lola: 29310636 markings, 46724428 edges, 288009 markings/sec, 80 secs
lola: 30735854 markings, 49050918 edges, 285044 markings/sec, 85 secs
lola: 32176702 markings, 51401573 edges, 288170 markings/sec, 90 secs
lola: 33610343 markings, 53739821 edges, 286728 markings/sec, 95 secs
lola: 35062318 markings, 56100882 edges, 290395 markings/sec, 100 secs
lola: 36478309 markings, 58420404 edges, 283198 markings/sec, 105 secs
lola: 37925440 markings, 60779667 edges, 289426 markings/sec, 110 secs
lola: 39359733 markings, 63127682 edges, 286859 markings/sec, 115 secs
lola: 40790261 markings, 65461082 edges, 286106 markings/sec, 120 secs
lola: 42227920 markings, 67803996 edges, 287532 markings/sec, 125 secs
lola: 43665997 markings, 70152493 edges, 287615 markings/sec, 130 secs
lola: 45075545 markings, 72469400 edges, 281910 markings/sec, 135 secs
lola: 46458039 markings, 74737815 edges, 276499 markings/sec, 140 secs
lola: 47920508 markings, 77120505 edges, 292494 markings/sec, 145 secs
lola: 49339855 markings, 79450280 edges, 283869 markings/sec, 150 secs
lola: 50751573 markings, 81769548 edges, 282344 markings/sec, 155 secs
lola: 52134159 markings, 84037351 edges, 276517 markings/sec, 160 secs
lola: 53549135 markings, 86362728 edges, 282995 markings/sec, 165 secs
lola: 54992398 markings, 88732114 edges, 288653 markings/sec, 170 secs
lola: 56421469 markings, 91080774 edges, 285814 markings/sec, 175 secs
lola: 57848432 markings, 93426691 edges, 285393 markings/sec, 180 secs
lola: 59273407 markings, 95774158 edges, 284995 markings/sec, 185 secs
lola: 60662598 markings, 98058297 edges, 277838 markings/sec, 190 secs
lola: 62094032 markings, 100413552 edges, 286287 markings/sec, 195 secs
lola: 63516673 markings, 102745758 edges, 284528 markings/sec, 200 secs
lola: 64932577 markings, 105075592 edges, 283181 markings/sec, 205 secs
lola: 66348107 markings, 107401618 edges, 283106 markings/sec, 210 secs
lola: 67763485 markings, 109731853 edges, 283076 markings/sec, 215 secs
lola: 69171440 markings, 112053874 edges, 281591 markings/sec, 220 secs
lola: 70566313 markings, 114356906 edges, 278975 markings/sec, 225 secs
lola: 71957428 markings, 116646671 edges, 278223 markings/sec, 230 secs
lola: 73358427 markings, 118946344 edges, 280200 markings/sec, 235 secs
lola: 74743746 markings, 121221728 edges, 277064 markings/sec, 240 secs
lola: 76106186 markings, 123458482 edges, 272488 markings/sec, 245 secs
lola: 77468642 markings, 125701952 edges, 272491 markings/sec, 250 secs
lola: 78798376 markings, 127901264 edges, 265947 markings/sec, 255 secs
lola: 80139143 markings, 130112870 edges, 268153 markings/sec, 260 secs
lola: 81469818 markings, 132308316 edges, 266135 markings/sec, 265 secs
lola: 82807625 markings, 134517035 edges, 267561 markings/sec, 270 secs
lola: 84125426 markings, 136694404 edges, 263560 markings/sec, 275 secs
lola: 85423352 markings, 138837748 edges, 259585 markings/sec, 280 secs
lola: lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 591 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((CF <= SF) OR ((MtF <= SpA) AND (StR <= MpA))) AND A (G ((2 <= Mi)))) AND NOT(A (X ((Ci <= SG))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 591 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((SF + 1 <= CF) AND ((SpA + 1 <= MtF) OR (MpA + 1 <= StR)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((SF + 1 <= CF) AND ((SpA + 1 <= MtF) OR (MpA + 1 <= StR)))
lola: processed formula length: 60
lola: 13 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 739 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((Mi <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0500P0-CTLCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file ClientsAndServers-PT-N0500P0-CTLCardinality-12.sara.
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 13 will run for 985 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((Ci <= SG)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((Ci <= SG)))
lola: processed formula: A (X ((Ci <= SG)))
lola: processed formula length: 18
lola: 13 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-CTLCardinality.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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 25001 markings, 25001 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 739 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(E (F ((3 <= CF))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (3 <= CF))))
lola: processed formula length: 28
lola: 6 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 9022 markings, 9021 edges
lola: ========================================
lola: subprocess 13 will run for 985 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((MpA <= MtF))) AND E (F ((Si <= SwG)))) AND E (F (((2 <= CwG) OR (1 <= Si))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 985 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((MtF + 1 <= MpA)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((MtF + 1 <= MpA)))
lola: processed formula: A (F ((MtF + 1 <= MpA)))
lola: processed formula length: 24
lola: 12 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 16017 markings, 16017 edges
lola: ========================================
lola: subprocess 14 will run for 1478 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((SwG + 1 <= Si)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: 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-N0500P0-CTLCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 1501 markings, 1500 edges
lola: ========================================
lola: subprocess 15 will run for 2957 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((CwG <= 1) AND (Si <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: 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-N0500P0-CTLCardinality-15.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1478 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (X ((SA <= MwU))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((MwU + 1 <= SA)))
lola: processed formula length: 29
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 25001 markings, 25000 edges
lola: ========================================
lola: subprocess 15 will run for 2957 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((CR + 1 <= MpA) U ((SF <= CF) AND (Ci <= CR)))) OR A (F ((1 <= SwG))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2957 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((CR + 1 <= MpA) U ((SF <= CF) AND (Ci <= CR))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((CR + 1 <= MpA) U ((SF <= CF) AND (Ci <= CR)))
lola: processed formula length: 48
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0500P0-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: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes no unknown yes no no no unknown no no no no unknown
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0500P0-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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-N0500P0"
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-N0500P0.tgz
mv ClientsAndServers-PT-N0500P0 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is ClientsAndServers-PT-N0500P0, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r043-smll-152646359500164"
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 '
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 ;