fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r031-ebro-152646309600437
Last Updated
June 26, 2018

About the Execution of Irma.struct for CSRepetitions-PT-02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
474.600 48533.00 10168.00 383.10 FTFFTFFTFFFFFFFF 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 268K
-rw-r--r-- 1 mcc users 5.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 27K 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.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 9.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 26K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is CSRepetitions-PT-02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r031-ebro-152646309600437
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526841077318


BK_STOP 1526841125851

--------------------
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 CSRepetitions-PT-02 as instance name.
Using CSRepetitions as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': True, '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': False, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 496, 'Memory': 100.29, 'Tool': 'gspn'}, {'Time': 503, 'Memory': 106.68, 'Tool': 'lola'}, {'Time': 660, 'Memory': 106.93, 'Tool': 'lola'}, {'Time': 3763, 'Memory': 162.72, 'Tool': 'gspn'}, {'Time': 16201, 'Memory': 7483.21, 'Tool': 'marcie'}, {'Time': 22332, 'Memory': 7483.77, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0141129032258065x far from the best tool gspn.
CTLCardinality gspn CSRepetitions-PT-02...
LOADING model.pnml ...
MODEL CLASS: P/T NET
PLACES: 23
TRANSITIONS: 28
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 92
LOADING TIME: 0.33

SAVING AS model.(net/def) ...
SAVING TIME: 0.029
SAVING NAME MAP FILE model.id2name ...
TOTAL TIME: 0.736
OK.
Can't open file model.pin for r
GreatSPN/Meddly.
Copyright (C) 1987-2017, University of Torino, Italy.

Based on MEDDLY version 0.14.765
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 45
MODEL NAME: model
23 places, 28 transitions.

ERROR: mcl error!

CANNOT_COMPUTE
CTLCardinality lola CSRepetitions-PT-02...

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


checking for too many tokens
===========================================================================================
CSRepetitions-PT-02: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ CSRepetitions-PT-02 @ 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: 51/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 23 places, 28 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 45 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-PT-02-CTLCardinality.task
lola: NOT(E (X (A (G (TRUE))))) : E (F (A (G ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= 2))))) : A ((((2 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4) OR (1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4)) U E (F ((3 <= Server_Waiting_2 + Server_Waiting_1))))) : E (F ((E (F ((1 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4))) AND (3 <= Server_Waiting_2 + Server_Waiting_1)))) : (E (F (A (G (TRUE)))) AND TRUE) : A (F (E (F (((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= RequestBufferSlots) AND (3 <= Server_Waiting_2 + Server_Waiting_1)))))) : E (F (((Server_Waiting_2 + Server_Waiting_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) AND A (G ((2 <= Server_Waiting_2 + Server_Waiting_1)))))) : ((2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2) OR (A (G ((Server_Waiting_2 + Server_Waiting_1 <= 2))) AND E (((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Server_Waiting_2 + Server_Waiting_1))))) : A (F (E (F ((2 <= Server_Anwering_2_1))))) : A (G (E (F (((1 <= Client_Sending_1) AND (2 <= Client_Sending_4)))))) : (NOT(A (((RequestBuffer_3 <= RequestBuffer_4) U (Server_Anwering_4_2 <= Server_Anwering_2_2)))) OR E (((RequestBuffer_1 <= Server_Anwering_1_1) U ((3 <= Client_Sending_1) AND (Server_Anwering_4_1 <= Client_Sending_1))))) : E (F (A (G (((2 <= RequestBuffer_4) AND (Server_Anwering_3_1 <= RequestBufferSlots)))))) : E ((((Client_Waiting_1 <= 0) OR (Server_Anwering_1_1 <= 0)) U (2 <= Server_Anwering_4_1))) : A (X (E (((Server_Anwering_1_1 <= RequestBuffer_1) U (3 <= Server_Anwering_1_2))))) : (E (F (((3 <= Server_Anwering_3_2) AND (Client_Waiting_1 <= Server_Anwering_3_2) AND ((Server_Anwering_1_2 <= RequestBufferSlots) OR (2 <= Server_Anwering_4_1))))) AND (E (X ((RequestBuffer_3 <= Server_Anwering_1_2))) OR (((Client_Waiting_4 <= 0) AND (Server_Anwering_1_2 <= 0)) OR A (F ((2 <= Server_Anwering_2_2)))))) : A (G (E (F (((Server_Anwering_1_2 <= RequestBuffer_1) AND (3 <= RequestBuffer_2))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 6 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= 2)))))
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 (3 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4))))
lola: processed formula length: 105
lola: 3 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 101 markings, 237 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4) OR (1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4)) U E (F ((3 <= Server_Waiting_2 + Server_Waiting_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((2 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4) OR (1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4)) U E(TRUE U (3 <= Server_Waiting_2 + Server_Waiting_1)))
lola: processed formula length: 221
lola: 2 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 7424 markings, 37096 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F ((1 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4))) AND (3 <= Server_Waiting_2 + Server_Waiting_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (E(TRUE U (1 <= Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4)) AND (3 <= Server_Waiting_2 + Server_Waiting_1)))
lola: processed formula length: 149
lola: 2 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 7424 markings, 45037 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (G (TRUE)))) AND TRUE)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 7 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= RequestBufferSlots) AND (3 <= Server_Waiting_2 + Server_Waiting_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U ((Client_Waiting_1 + Client_Waiting_2 + Client_Waiting_3 + Client_Waiting_4 <= RequestBufferSlots) AND (3 <= Server_Waiting_2 + Server_Waiting_1))))
lola: processed formula length: 166
lola: 2 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 7424 markings, 37096 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Server_Waiting_2 + Server_Waiting_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) AND A (G ((2 <= Server_Waiting_2 + Server_Waiting_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U ((Server_Waiting_2 + Server_Waiting_1 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) AND NOT(E(TRUE U (Server_Waiting_2 + Server_Waiting_1 <= 1)))))
lola: processed formula length: 184
lola: 3 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 1290 markings, 4229 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2) OR (A (G ((Server_Waiting_2 + Server_Waiting_1 <= 2))) AND E (((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Se... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= Server_Anwering_4_1 + Server_Anwering_4_2 + Server_Anwering_2_2 + Server_Anwering_2_1 + Server_Anwering_1_1 + Server_Anwering_1_2 + Server_Anwering_3_1 + Server_Anwering_3_2)
lola: processed formula length: 180
lola: 0 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Server_Waiting_2 + Server_Waiting_1 <= 2)))
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 CSRepetitions-PT-02-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-02-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Server_Waiting_2 + Server_Waiting_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((2 <= RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4) U (RequestBuffer_1 + RequestBuffer_2 + RequestBuffer_3 + RequestBuffer_4 <= Server_Waiting_2 + Server_Waiting_1))
lola: processed formula length: 192
lola: 1 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((2 <= Server_Anwering_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (2 <= Server_Anwering_2_1)))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 1290 markings, 3085 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((1 <= Client_Sending_1) AND (2 <= Client_Sending_4))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((1 <= Client_Sending_1) AND (2 <= Client_Sending_4))))))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 4072 markings, 13696 edges
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (((RequestBuffer_3 <= RequestBuffer_4) U (Server_Anwering_4_2 <= Server_Anwering_2_2)))) OR E (((RequestBuffer_1 <= Server_Anwering_1_1) U ((3 <= Client_Sending_1) AND (Server_Anwering_4_1 <= Client_Sending_1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((RequestBuffer_4 + 1 <= RequestBuffer_3) R (Server_Anwering_2_2 + 1 <= Server_Anwering_4_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((RequestBuffer_3 <= RequestBuffer_4) U (Server_Anwering_4_2 <= Server_Anwering_2_2)))
lola: processed formula length: 91
lola: 7 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((RequestBuffer_1 <= Server_Anwering_1_1) U ((3 <= Client_Sending_1) AND (Server_Anwering_4_1 <= Client_Sending_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((RequestBuffer_1 <= Server_Anwering_1_1) U ((3 <= Client_Sending_1) AND (Server_Anwering_4_1 <= Client_Sending_1)))
lola: processed formula length: 117
lola: 5 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 1198 markings, 2922 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((2 <= RequestBuffer_4) AND (Server_Anwering_3_1 <= RequestBufferSlots))))))
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 ((RequestBuffer_4 <= 1) OR (RequestBufferSlots + 1 <= Server_Anwering_3_1)))))
lola: processed formula length: 101
lola: 3 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 1290 markings, 4413 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((Client_Waiting_1 <= 0) OR (Server_Anwering_1_1 <= 0)) U (2 <= Server_Anwering_4_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((Client_Waiting_1 <= 0) OR (Server_Anwering_1_1 <= 0)) U (2 <= Server_Anwering_4_1))
lola: processed formula length: 88
lola: 1 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 2746 markings, 8038 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (((Server_Anwering_1_1 <= RequestBuffer_1) U (3 <= Server_Anwering_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E((Server_Anwering_1_1 <= RequestBuffer_1) U (3 <= Server_Anwering_1_2)))
lola: processed formula length: 76
lola: 2 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 6956 markings, 31876 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= Server_Anwering_3_2) AND (Client_Waiting_1 <= Server_Anwering_3_2) AND ((Server_Anwering_1_2 <= RequestBufferSlots) OR (2 <= Server_Anwering_4_1))))) AND (E (X ((RequestBuffer_3 <= Server_Anwering_1_2))) OR (((Client_Waiting_4 <= 0) AND (Server_Anwering_1_2 <= 0)) OR A (F ((2 <= Server_Anwering_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= Server_Anwering_3_2) AND (Client_Waiting_1 <= Server_Anwering_3_2) AND ((Server_Anwering_1_2 <= RequestBufferSlots) OR (2 <= Server_Anwering_4_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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CSRepetitions-PT-02-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CSRepetitions-PT-02-CTLCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 5408 markings, 19686 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((Server_Anwering_1_2 <= RequestBuffer_1) AND (3 <= RequestBuffer_2))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((Server_Anwering_1_2 <= RequestBuffer_1) AND (3 <= RequestBuffer_2))))))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 23 places; total mentions: 0
lola: closed formula file CSRepetitions-PT-02-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: 1290 markings, 3072 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no yes no no yes no no no no no no no no
FORMULA CSRepetitions-PT-02-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CSRepetitions-PT-02-CTLCardinality-15 FALSE 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="CSRepetitions-PT-02"
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/CSRepetitions-PT-02.tgz
mv CSRepetitions-PT-02 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 CSRepetitions-PT-02, 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 r031-ebro-152646309600437"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;