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 332K
-rw-r--r-- 1 mcc users 9.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 39K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.1K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 109 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 347 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 21K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Referendum-PT-0020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583900276
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527968613600


BK_STOP 1527969025665

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Referendum-PT-0020 as instance name.
Using Referendum 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': True, 'Extended Free Choice': True, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 1835, 'Memory': 163.96, 'Tool': 'gspn'}, {'Time': 3453, 'Memory': 220.2, 'Tool': 'itstools'}, {'Time': 1485832, 'Memory': 6583.7, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 809.7177111716621x far from the best tool gspn.
CTLCardinality lola Referendum-PT-0020...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Referendum-PT-0020: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ Referendum-PT-0020 @ 3538 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3538 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 102/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 61 places, 41 transitions, 41 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 23 transition conflict sets
lola: TASK
lola: reading formula from Referendum-PT-0020-CTLCardinality.task
lola: E (F (E (F (((3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20) AND (voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9)))))) : A (F (((1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) AND (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= 2)))) : E (F (E (G ((ready + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9))))) : (A (F (((voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) AND ((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) OR (3 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))))) AND NOT(((1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) AND E (F ((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))))) : NOT(A (F ((2 <= ready)))) : E (G (((3 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) OR E (X ((ready <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9)))))) : ((A (G ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + 1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9))) OR ((3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20) OR (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20) OR (2 <= ready))) AND NOT(E (G ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20))))) : E ((E (F ((2 <= ready))) U A (G ((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20))))) : E (((((voted_no_6 <= voted_yes_14) OR (1 <= voted_yes_9)) AND (voted_no_5 <= voted_yes_4)) U E (X ((2 <= voted_no_18))))) : NOT(E (G (((voting_15 <= voting_5) OR (voting_15 <= voted_no_10) OR ((3 <= voted_yes_8) AND (voted_yes_8 <= voted_yes_7)))))) : A (F (((voted_yes_16 <= 2) AND (voting_20 + 1 <= voted_yes_6)))) : (((((3 <= voted_yes_7) AND (3 <= voting_7) AND (3 <= voted_no_16)) OR (2 <= voted_yes_7)) OR E (X ((voting_10 + 1 <= voting_14)))) OR (((1 <= voted_yes_5) OR A (F ((3 <= voting_4)))) AND A (F (((2 <= voted_no_5) AND (voted_yes_17 <= voted_no_16)))))) : ((A (G ((voting_8 <= 1))) AND (((voted_yes_13 <= 0) OR (voted_no_5 + 1 <= voted_yes_13)) OR A (G ((voting_10 <= voting_15))))) AND ((3 <= voted_yes_4) OR E (F ((2 <= voted_no_19))))) : A (G (A (F ((2 <= voted_yes_2))))) : A (F (((1 <= voting_18) AND (voted_yes_5 <= voted_yes_8) AND (3 <= voted_yes_18) AND (3 <= voted_yes_19)))) : A (F (NOT(E (F ((voted_yes_12 <= ready))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20) AND (voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + vo... (shortened)
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 164 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 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) AND (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + vo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) AND (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= 2))))
lola: processed formula: A (F (((1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) AND (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + vo... (shortened)
lola: processed formula length: 605
lola: 0 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 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: 22 markings, 22 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((ready + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= ready))))
lola: processed formula length: 324
lola: 3 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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: 23 markings, 45 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted... (shortened)
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: A (F (((voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) AND ((ready <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) OR (3 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9)))))
lola: processed formula: A (F (((voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_... (shortened)
lola: processed formula length: 1022
lola: 5 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 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: 22 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((2 <= ready))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= ready)))
lola: processed formula length: 27
lola: 5 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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: 22 markings, 21 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9) OR E (X ((ready <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + vot... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9 <= 2) AND NOT(EX((ready <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes... (shortened)
lola: processed formula length: 625
lola: 4 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 41 markings, 57 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + 1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + 1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19... (shortened)
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 164 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20) OR (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20) OR (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 ... (shortened)
lola: processed formula length: 801
lola: 3 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-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 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17 + voted_yes_18 + voted_yes_19 + voted_yes_20 + voted_yes_1 + voted_yes_2 + voted_yes_3 + voted_yes_4 + voted_yes_5 + voted_yes_6 + voted_yes_7 + voted_yes_8 + voted_yes_9)))
lola: processed formula: A (F ((voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 + 1 <= voted_yes_10 + voted_yes_11 + voted_yes_12 + voted_yes_13 + voted_yes_14 + voted_yes_15 + voted_yes_16 + voted_yes_17... (shortened)
lola: processed formula length: 574
lola: 3 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 168 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: 22 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F ((2 <= ready))) U A (G ((1 <= voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U (2 <= ready)) U NOT(E(TRUE U (voted_no_1 + voted_no_2 + voted_no_3 + voted_no_4 + voted_no_5 + voted_no_6 + voted_no_7 + voted_no_8 + voted_no_9 + voted_no_10 + voted_no_11 + voted_no_12 + voted_no_13 + voted_no_14 + voted_no_15 + voted_no_16 + voted_no_17 + voted_no_18 + voted_no_19 + voted_no_20 <= 0))))
lola: processed formula length: 318
lola: 4 rewrites
lola: formula mentions 0 of 61 places; total mentions: 0
lola: closed formula file Referendum-PT-0020-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 164 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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 519360 markings, 4105786 edges, 2314602818352185344 markings/sec, 0 secs
lola: 1003312 markings, 8102450 edges, 96790 markings/sec, 5 secs
lola: 1423068 markings, 11863326 edges, 83951 markings/sec, 10 secs
lola: 1827930 markings, 15598619 edges, 80972 markings/sec, 15 secs
lola: 2270268 markings, 19419529 edges, 88468 markings/sec, 20 secs
lola: 2626551 markings, 22974487 edges, 71257 markings/sec, 25 secs
lola: 3057088 markings, 26712767 edges, 86107 markings/sec, 30 secs
lola: 3391545 markings, 30148937 edges, 66891 markings/sec, 35 secs
lola: 3774502 markings, 33755732 edges, 76591 markings/sec, 40 secs
lola: 4150989 markings, 37293463 edges, 75297 markings/sec, 45 secs
lola: 4467517 markings, 40665240 edges, 63306 markings/sec, 50 secs
lola: 4727675 markings, 43822858 edges, 52032 markings/sec, 55 secs
lola: 5129439 markings, 47496664 edges, 80353 markings/sec, 60 secs
lola: 5568224 markings, 51229673 edges, 87757 markings/sec, 65 secs
lola: 5927634 markings, 54779995 edges, 71882 markings/sec, 70 secs
lola: 6340654 markings, 58477845 edges, 82604 markings/sec, 75 secs
lola: 6707929 markings, 62012661 edges, 73455 markings/sec, 80 secs
lola: 7040053 markings, 65459465 edges, 66425 markings/sec, 85 secs
lola: 7406293 markings, 68824869 edges, 73248 markings/sec, 90 secs
lola: 7706078 markings, 72080533 edges, 59957 markings/sec, 95 secs
lola: 7956633 markings, 75226202 edges, 50111 markings/sec, 100 secs
lola: 8388667 markings, 78961314 edges, 86407 markings/sec, 105 secs
lola: 8745171 markings, 82513754 edges, 71301 markings/sec, 110 secs
lola: 9112307 markings, 86119115 edges, 73427 markings/sec, 115 secs
lola: 9484144 markings, 89570316 edges, 74367 markings/sec, 120 secs
lola: 9794795 markings, 92890982 edges, 62130 markings/sec, 125 secs
lola: 10055923 markings, 96098296 edges, 52226 markings/sec, 130 secs
lola: 10420176 markings, 99554660 edges, 72851 markings/sec, 135 secs
lola: 10779221 markings, 103031671 edges, 71809 markings/sec, 140 secs
lola: 11100157 markings, 106354051 edges, 64187 markings/sec, 145 secs
lola: 11385431 markings, 109596623 edges, 57055 markings/sec, 150 secs
lola: 11704997 markings, 112909849 edges, 63913 markings/sec, 155 secs
lola: 12032404 markings, 116308507 edges, 65481 markings/sec, 160 secs
lola: 12326547 markings, 119625262 edges, 58829 markings/sec, 165 secs
lola: 12639271 markings, 122885100 edges, 62545 markings/sec, 170 secs
lola: 12951386 markings, 126167470 edges, 62423 markings/sec, 175 secs
lola: 13246737 markings, 129396681 edges, 59070 markings/sec, 180 secs
lola: 13502147 markings, 132429133 edges, 51082 markings/sec, 185 secs
lola: 13765563 markings, 135499298 edges, 52683 markings/sec, 190 secs
lola: 14001116 markings, 138484155 edges, 47111 markings/sec, 195 secs
lola: 14217479 markings, 141425350 edges, 43273 markings/sec, 200 secs
lola: 14484270 markings, 144493672 edges, 53358 markings/sec, 205 secs
lola: 14922726 markings, 148292259 edges, 87691 markings/sec, 210 secs
lola: 15312227 markings, 151859746 edges, 77900 markings/sec, 215 secs
lola: 15704680 markings, 155473480 edges, 78491 markings/sec, 220 secs
lola: 16067854 markings, 158994178 edges, 72635 markings/sec, 225 secs
lola: 16443109 markings, 162500233 edges, 75051 markings/sec, 230 secs
lola: 16795864 markings, 165909049 edges, 70551 markings/sec, 235 secs
lola: 17106217 markings, 169138473 edges, 62071 markings/sec, 240 secs
lola: 17392501 markings, 172338032 edges, 57257 markings/sec, 245 secs
lola: 17700857 markings, 175591438 edges, 61671 markings/sec, 250 secs
lola: 18097123 markings, 179197938 edges, 79253 markings/sec, 255 secs
lola: 18454476 markings, 182656003 edges, 71471 markings/sec, 260 secs
lola: 18804985 markings, 186103571 edges, 70102 markings/sec, 265 secs
lola: 19141310 markings, 189417344 edges, 67265 markings/sec, 270 secs
lola: 19426687 markings, 192570774 edges, 57075 markings/sec, 275 secs
lola: 19673353 markings, 195623627 edges, 49333 markings/sec, 280 secs
lola: 20057826 markings, 199168005 edges, 76895 markings/sec, 285 secs
lola: 20425699 markings, 202639127 edges, 73575 markings/sec, 290 secs
lola: 20736286 markings, 205938911 edges, 62117 markings/sec, 295 secs
lola: 21008710 markings, 209169488 edges, 54485 markings/sec, 300 secs
lola: 21343112 markings, 212470545 edges, 66880 markings/sec, 305 secs
lola: 21657273 markings, 215757895 edges, 62832 markings/sec, 310 secs
lola: 21932110 markings, 218974951 edges, 54967 markings/sec, 315 secs
lola: 22248219 markings, 222179769 edges, 63222 markings/sec, 320 secs
lola: 22554911 markings, 225349049 edges, 61338 markings/sec, 325 secs
lola: 22828952 markings, 228444287 edges, 54808 markings/sec, 330 secs
lola: 23082317 markings, 231437125 edges, 50673 markings/sec, 335 secs
lola: 23344473 markings, 234507580 edges, 52431 markings/sec, 340 secs
lola: 23580110 markings, 237492833 edges, 47127 markings/sec, 345 secs
lola: 23792947 markings, 240421868 edges, 42567 markings/sec, 350 secs
lola: 24070771 markings, 243549993 edges, 55565 markings/sec, 355 secs
lola: 24476865 markings, 247248785 edges, 81219 markings/sec, 360 secs
lola: 24840961 markings, 250778857 edges, 72819 markings/sec, 365 secs
lola: 25202346 markings, 254306350 edges, 72277 markings/sec, 370 secs
lola: 25538148 markings, 257682334 edges, 67160 markings/sec, 375 secs
lola: 25836291 markings, 260923450 edges, 59629 markings/sec, 380 secs
lola: 26112094 markings, 264080976 edges, 55161 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA Referendum-PT-0020-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0020-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-PT-0020"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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/Referendum-PT-0020.tgz
mv Referendum-PT-0020 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 mcc4mcc-full"
echo " Input is Referendum-PT-0020, 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 r142-qhx2-152673583900276"
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 ;