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 556K
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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 13K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 40K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K 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 16K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 14K 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 51K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Referendum-PT-0050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r142-qhx2-152673583900285
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527969290139


BK_STOP 1527969344822

--------------------
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-0050 as instance name.
Using Referendum as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'ReachabilityCardinality', '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': 297, 'Memory': 106.41, 'Tool': 'lola'}, {'Time': 5026, 'Memory': 224.43, 'Tool': 'gspn'}, {'Time': 14076, 'Memory': 419.26, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityCardinality lola Referendum-PT-0050...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Referendum-PT-0050: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityCardinality @ Referendum-PT-0050 @ 3538 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 252/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 151 places, 101 transitions, 101 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 53 transition conflict sets
lola: TASK
lola: reading formula from Referendum-PT-0050-ReachabilityCardinality.task
lola: 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 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 + voted_no_30 + voted_no_31 + voted_no_32 + voted_no_33 + voted_no_34 + voted_no_35 + voted_no_36 + voted_no_37 + voted_no_38 + voted_no_39 + voted_no_40 + voted_no_41 + voted_no_42 + voted_no_43 + voted_no_44 + voted_no_45 + voted_no_46 + voted_no_47 + voted_no_48 + voted_no_49 + voted_no_50 <= ready) OR (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_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_yes_36 + voted_yes_37 + voted_yes_38 + voted_yes_39 + voted_yes_40 + voted_yes_41 + voted_yes_42 + voted_yes_43 + voted_yes_44 + voted_yes_45 + voted_yes_46 + voted_yes_47 + voted_yes_48 + voted_yes_49 + voted_yes_50 + 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 (ready <= 2) OR ((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_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_yes_36 + voted_yes_37 + voted_yes_38 + voted_yes_39 + voted_yes_40 + voted_yes_41 + voted_yes_42 + voted_yes_43 + voted_yes_44 + voted_yes_45 + voted_yes_46 + voted_yes_47 + voted_yes_48 + voted_yes_49 + voted_yes_50 + 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 <= 1) 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_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 + voted_no_30 + voted_no_31 + voted_no_32 + voted_no_33 + voted_no_34 + voted_no_35 + voted_no_36 + voted_no_37 + voted_no_38 + voted_no_39 + voted_no_40 + voted_no_41 + voted_no_42 + voted_no_43 + voted_no_44 + voted_no_45 + voted_no_46 + voted_no_47 + voted_no_48 + voted_no_49 + voted_no_50 + 1 <= ready))))) : E (F ((((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + voting_43 + voting_44 + voting_45 + voting_46 + voting_47 + voting_48 + voting_49 + voting_50 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9) OR (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + voting_43 + voting_44 + voting_45 + voting_46 + voting_47 + voting_48 + voting_49 + voting_50 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= 2)) AND (3 <= ready)))) : A (G (())) : A (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_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_yes_36 + voted_yes_37 + voted_yes_38 + voted_yes_39 + voted_yes_40 + voted_yes_41 + voted_yes_42 + voted_yes_43 + voted_yes_44 + voted_yes_45 + voted_yes_46 + voted_yes_47 + voted_yes_48 + voted_yes_49 + voted_yes_50 + 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 (())) : A (G (())) : A (G (TRUE)) : E (F ((((2 <= ready) OR (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_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + voted_yes_36 + voted_yes_37 + voted_yes_38 + voted_yes_39 + voted_yes_40 + voted_yes_41 + voted_yes_42 + voted_yes_43 + voted_yes_44 + voted_yes_45 + voted_yes_46 + voted_yes_47 + voted_yes_48 + voted_yes_49 + voted_yes_50 + 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 (voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + voting_42 + voting_43 + voting_44 + voting_45 + voting_46 + voting_47 + voting_48 + voting_49 + voting_50 + voting_1 + voting_2 + voting_3 + voting_4 + voting_5 + voting_6 + voting_7 + voting_8 + voting_9 <= ready)) AND (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 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_29 + voted_no_30 + voted_no_31 + voted_no_32 + voted_no_33 + voted_no_34 + voted_no_35 + voted_no_36 + voted_no_37 + voted_no_38 + voted_no_39 + voted_no_40 + voted_no_41 + voted_no_42 + voted_no_43 + voted_no_44 + voted_no_45 + voted_no_46 + voted_no_47 + voted_no_48 + voted_no_49 + voted_no_50)))) : E (F ((2 <= voting_23))) : A (G (((voted_yes_12 <= voted_yes_25) OR (voting_4 <= voting_17)))) : E (F (((2 <= voted_yes_6) AND (((voted_yes_49 <= voted_no_26) AND (1 <= voted_no_42)) OR (voted_yes_27 + 1 <= voting_5))))) : E (F ((3 <= voted_yes_22))) : A (G ((voted_no_17 <= voting_28))) : E (F (((voted_no_1 <= voting_45) AND (2 <= voted_no_49) AND (voting_8 <= voting_37) AND ((1 <= voted_yes_34) OR (2 <= voted_yes_7) OR (voted_yes_24 <= 1))))) : A (G (((voted_yes_31 <= 2) OR (voting_1 + 1 <= voting_19) OR ((voted_no_40 + 1 <= voted_no_20) AND (voting_31 <= 2))))) : A (G ((((1 <= voted_no_37) OR (voting_23 <= voting_15) OR (voted_no_4 <= 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: 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 + voted_no_21 + voted_no_22 + voted_no_23 + voted_no_24 + voted_no_25 + voted_no_26 + voted_no_27 + voted_no_28 + voted_no_... (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 404 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Referendum-PT-0050-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Referendum-PT-0050-ReachabilityCardinality.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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= voting_10 + voting_11 + voting_12 + voting_13 + voting_14 + voting_15 + voting_16 + voting_17 + voting_18 + voting_19 + voting_20 + voting_21 + voting_22 + voting_23 + voting_24 + voting_25 + voting_26 + voting_27 + voting_28 + voting_29 + voting_30 + voting_31 + voting_32 + voting_33 + voting_34 + voting_35 + voting_36 + voting_37 + voting_38 + voting_39 + voting_40 + voting_41 + 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 404 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 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to Referendum-PT-0050-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 151 places; total mentions: 0
lola: closed formula file Referendum-PT-0050-ReachabilityCardinality.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: ========================================
sara: try reading problem file Referendum-PT-0050-ReachabilityCardinality.sara.
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (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_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted_yes_34 + voted_yes_35 + vot... (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 404 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: 5 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 3 rewrites
lola: formula mentions 0 of 151 places; total mentions: 0
lola: closed formula file Referendum-PT-0050-ReachabilityCardinality.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: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 151 places; total mentions: 0
lola: closed formula file Referendum-PT-0050-ReachabilityCardinality.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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 151 places; total mentions: 0

lola: closed formula file Referendum-PT-0050-ReachabilityCardinality.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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= ready) OR (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_21 + voted_yes_22 + voted_yes_23 + voted_yes_24 + voted_yes_25 + voted_yes_26 + voted_yes_27 + voted_yes_28 + voted_yes_29 + voted_yes_30 + voted_yes_31 + voted_yes_32 + voted_yes_33 + voted... (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 404 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 3 conjunctive subformulas
lola: state equation: write sara problem file to Referendum-PT-0050-ReachabilityCardinality-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= voting_23)))
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 404 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
sara: try reading problem file Referendum-PT-0050-ReachabilityCardinality-7.sara.
lola: state equation: write sara problem file to Referendum-PT-0050-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((voted_yes_12 <= voted_yes_25) OR (voting_4 <= voting_17))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: sara: place or transition ordering is non-deterministic
using a bit-perfect encoder (--encoder=bit)
lola: using 404 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: state equation: write sara problem file to Referendum-PT-0050-ReachabilityCardinality-9.sara
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: state equation: calling and running sara
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= voted_yes_6) AND (((voted_yes_49 <= voted_no_26) AND (1 <= voted_no_42)) OR (voted_yes_27 + 1 <= voting_5)))))
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 404 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 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Referendum-PT-0050-ReachabilityCardinality-10.sara
sara: try reading problem file Referendum-PT-0050-ReachabilityCardinality-9.sara.
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4 markings, 3 edges
lola: ========================================

lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= voted_yes_22)))
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 404 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: state equation: write sara problem file to Referendum-PT-0050-ReachabilityCardinality-11.sara
lola: The predicate is unreachable.
lola: 4 markings, 3 edges
sara: place or transition ordering is non-deterministic
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)

lola: ========================================
lola: ...considering subproblem: A (G ((voted_no_17 <= voting_28)))
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 404 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: 4 markings, 3 edges
lola: state equation: write sara problem file to Referendum-PT-0050-ReachabilityCardinality-12.sara
lola: ========================================
sara: try reading problem file Referendum-PT-0050-ReachabilityCardinality-11.sara.
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((voted_no_1 <= voting_45) AND (2 <= voted_no_49) AND (voting_8 <= voting_37) AND ((1 <= voted_yes_34) OR (2 <= voted_yes_7) OR (voted_yes_24 <= 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 404 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 12 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to Referendum-PT-0050-ReachabilityCardinality-13.sara
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((voted_yes_31 <= 2) OR (voting_1 + 1 <= voting_19) OR ((voted_no_40 + 1 <= voted_no_20) AND (voting_31 <= 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 404 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4 markings, 3 edges
lola: state equation: write sara problem file to Referendum-PT-0050-ReachabilityCardinality-14.sara
lola: ========================================
lola: subprocess 15 will run for 3537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((1 <= voted_no_37) OR (voting_23 <= voting_15) OR (voted_no_4 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: sara: place or transition ordering is non-deterministic
using a bit-perfect encoder (--encoder=bit)
lola: using 404 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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 8 markings, 7 edges
lola: state equation: write sara problem file to Referendum-PT-0050-ReachabilityCardinality-15.sara
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no yes yes yes no no no no no no yes yes

FORMULA Referendum-PT-0050-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Referendum-PT-0050-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Referendum-PT-0050"
export BK_EXAMINATION="ReachabilityCardinality"
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-0050.tgz
mv Referendum-PT-0050 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-0050, examination is ReachabilityCardinality"
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-152673583900285"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;