fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r215-smll-152732266900533
Last Updated
June 26, 2018

About the Execution of M4M.struct for SafeBus-PT-10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1511.760 399547.00 401421.00 3028.80 ???????????????? 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 2.4M
-rw-r--r-- 1 mcc users 7.2K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 62K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 209K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 38K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 60K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 193K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.5K 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 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 1.7M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is SafeBus-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r215-smll-152732266900533
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1527501534574


BK_STOP 1527501934121

--------------------
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 SafeBus-PT-10 as instance name.
Using SafeBus as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': None, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1751638, 'Memory': 15922.81, 'Tool': 'itstools'}, {'Time': 1760367, 'Memory': 15927.83, 'Tool': 'itstools'}, {'Time': 1896001, 'Memory': 15947.26, 'Tool': 'lola'}, {'Time': 1924065, 'Memory': 15944.64, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0824160014797577x far from the best tool itstools.
LTLCardinality lola SafeBus-PT-10...

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


checking for too many tokens
===========================================================================================
SafeBus-PT-10: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
LTLCardinality @ SafeBus-PT-10 @ 3540 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 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: 1947/65536 symbol table entries, 197 collisions
lola: preprocessing...
lola: finding significant places
lola: 316 places, 1631 transitions, 261 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 983 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-PT-10-LTLCardinality.task
lola: A (F (F (F (G ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1)))))) : A (G (X (X (G ((PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1 <= cable_free)))))) : A ((X ((Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 <= cable_free)) U X (X ((AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 + AMC_3_8 + AMC_3_9 + AMC_1_10 + AMC_10_10 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_4_7 + AMC_4_8 + AMC_4_9 + AMC_6_10 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_5_7 + AMC_5_8 + AMC_5_9 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_6_7 + AMC_6_8 + AMC_6_9 + AMC_10_1 + AMC_10_2 + AMC_10_3 + AMC_10_4 + AMC_10_5 + AMC_10_6 + AMC_10_7 + AMC_10_8 + AMC_7_1 + AMC_7_2 + AMC_7_3 + AMC_7_4 + AMC_7_5 + AMC_7_6 + AMC_7_7 + AMC_7_8 + AMC_7_9 + AMC_5_10 + AMC_8_1 + AMC_8_2 + AMC_8_3 + AMC_8_4 + AMC_8_5 + AMC_8_6 + AMC_8_7 + AMC_8_8 + AMC_8_9 + AMC_9_8 + AMC_9_7 + AMC_9_6 + AMC_9_5 + AMC_9_4 + AMC_9_1 + AMC_9_2 + AMC_9_3 + AMC_9_9 + AMC_4_10 + AMC_10_9 + AMC_9_10 + AMC_3_10 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10))))) : A (X ((3 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9))) : A (X ((X ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9)) U (3 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1)))) : A ((X (X ((MSG_10 + MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9 <= S_tout))) U X (F ((R_tout <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10))))) : A (X (X (X ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_1_10 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_4_9 + wait_ack_6_10 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_5_9 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_6_9 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_7_1 + wait_ack_7_2 + wait_ack_7_3 + wait_ack_7_4 + wait_ack_7_5 + wait_ack_7_6 + wait_ack_7_8 + wait_ack_7_9 + wait_ack_5_10 + wait_ack_8_1 + wait_ack_8_2 + wait_ack_8_3 + wait_ack_8_4 + wait_ack_8_5 + wait_ack_8_6 + wait_ack_8_7 + wait_ack_8_9 + wait_ack_9_1 + wait_ack_9_2 + wait_ack_9_3 + wait_ack_9_4 + wait_ack_9_5 + wait_ack_9_6 + wait_ack_9_7 + wait_ack_9_8 + wait_ack_8_10 + wait_ack_4_10 + wait_ack_3_10 + wait_ack_9_10 + wait_ack_2_10 <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9))))) : A ((F (F ((FMCb <= listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9))) U F ((FMCb <= cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_used_8 + cable_used_9 + cable_used_10)))) : A (F ((Cpt2_1 <= Cpt1_10))) : A ((cable_used_9 <= AMC_10_2)) : A (X (G (F (X ((wait_msg_4 <= AMC_10_5)))))) : A ((AMC_4_7 <= AMC_10_5)) : A (F (X ((Cpt1_2 <= wait_ack_3_2)))) : A ((X (G ((2 <= ACK))) U F (F ((wait_ack_7_9 <= AMC_3_9))))) : A (G (F (((AMC_5_5 <= wait_ack_9_2) U (PMC_1 <= wait_ack_5_8))))) : A (G (F (F (X ((listen_2 <= PMC_3))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (F (G ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))))
lola: processed formula: A (F (G ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))))
lola: processed formula length: 184
lola: 2 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 144 markings, 145 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (X (G ((PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1 <= cable_free))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (X (G ((PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1 <= cable_free))))))
lola: processed formula: A (G (X (X (G ((PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1 <= cable_free))))))
lola: processed formula length: 114
lola: 0 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 137 markings, 137 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 <= cable_free)) U X (X ((AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (((Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 <= cable_free) U X ((AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 + AMC_3_8 + AMC_3_9 + AMC_1_10 + AMC_10_10 + AMC_4_1 + AMC_4_2 + AMC_4_3 + AMC_4_4 + AMC_4_5 + AMC_4_6 + AMC_4_7 + AMC_4_8 + AMC_4_9 + AMC_6_10 + AMC_5_1 + AMC_5_2 + AMC_5_3 + AMC_5_4 + AMC_5_5 + AMC_5_6 + AMC_5_7 + AMC_5_8 + AMC_5_9 + AMC_6_1 + AMC_6_2 + AMC_6_3 + AMC_6_4 + AMC_6_5 + AMC_6_6 + AMC_6_7 + AMC_6_8 + AMC_6_9 + AMC_10_1 + AMC_10_2 + AMC_10_3 + AMC_10_4 + AMC_10_5 + AMC_10_6 + AMC_10_7 + AMC_10_8 + AMC_7_1 + AMC_7_2 + AMC_7_3 + AMC_7_4 + AMC_7_5 + AMC_7_6 + AMC_7_7 + AMC_7_8 + AMC_7_9 + AMC_5_10 + AMC_8_1 + AMC_8_2 + AMC_8_3 + AMC_8_4 + AMC_8_5 + AMC_8_6 + AMC_8_7 + AMC_8_8 + AMC_8_9 + AMC_9_8 + AMC_9_7 + AMC_9_6 + AMC_9_5 + AMC_9_4 + AMC_9_1 + AMC_9_2 + AMC_9_3 + AMC_9_9 + AMC_4_10 + AMC_10_9 + AMC_9_10 + AMC_3_10 <= loop_em_1 + loop_em_2 + loop_em_3 + loop_em_4 + loop_em_5 + loop_em_6 + loop_em_7 + loop_em_8 + loop_em_9 + loop_em_10)))))
lola: processed formula: A (X (((Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9 <= cable_free) U X ((AMC_8_10 + AMC_2_10 + AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_1_4 + AMC_1_5 + AMC_1_6 + AMC_1_7 + AMC_1_8 + AMC_1_9 + AMC_7_10 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_2_4 + AMC_2_5 + AMC_2_6 + AMC_2_7 + AMC_2_8 + AMC_2_9 + AMC_3_1 + AMC_3_2 + AMC_3_3 + AMC_3_4 + AMC_3_5 + AMC_3_6 + AMC_3_7 +... (shortened)
lola: processed formula length: 1262
lola: 1 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 137 markings, 137 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9)))
lola: processed formula: A (X ((3 <= FMC_10 + FMC_1 + FMC_2 + FMC_3 + FMC_4 + FMC_5 + FMC_6 + FMC_7 + FMC_8 + FMC_9)))
lola: processed formula length: 93
lola: 0 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 137 markings, 137 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9)) U (3 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9)) U (3 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))))
lola: processed formula: A (X ((X ((Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10 <= wait_cable_10 + wait_cable_1 + wait_cable_2 + wait_cable_3 + wait_cable_4 + wait_cable_5 + wait_cable_6 + wait_cable_7 + wait_cable_8 + wait_cable_9)) U (3 <= PMC_10 + PMC_3 + PMC_4 + PMC_9 + PMC_8 + PMC_7 + PMC_6 + PMC_5 + PMC_2 + PMC_1))))
lola: processed formula length: 344
lola: 0 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 201 markings, 201 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((MSG_10 + MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9 <= S_tout))) U X (F ((R_tout <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((MSG_10 + MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9 <= S_tout)) U F ((R_tout <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10)))))
lola: processed formula: A (X ((X ((MSG_10 + MSG_1 + MSG_2 + MSG_3 + MSG_4 + MSG_5 + MSG_6 + MSG_7 + MSG_8 + MSG_9 <= S_tout)) U F ((R_tout <= Cpt1_1 + Cpt1_2 + Cpt1_3 + Cpt1_4 + Cpt1_5 + Cpt1_6 + Cpt1_7 + Cpt1_8 + Cpt1_9 + Cpt1_10)))))
lola: processed formula length: 211
lola: 1 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 11 markings, 10 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_1_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (X ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_1_10 + wait_ack_4_1 + wait_ack_4_2 + wait_ack_4_3 + wait_ack_4_5 + wait_ack_4_6 + wait_ack_4_7 + wait_ack_4_8 + wait_ack_4_9 + wait_ack_6_10 + wait_ack_5_1 + wait_ack_5_2 + wait_ack_5_3 + wait_ack_5_4 + wait_ack_5_6 + wait_ack_5_7 + wait_ack_5_8 + wait_ack_5_9 + wait_ack_6_1 + wait_ack_6_2 + wait_ack_6_3 + wait_ack_6_4 + wait_ack_6_5 + wait_ack_6_7 + wait_ack_6_8 + wait_ack_6_9 + wait_ack_10_1 + wait_ack_10_2 + wait_ack_10_3 + wait_ack_10_4 + wait_ack_10_5 + wait_ack_10_6 + wait_ack_10_7 + wait_ack_10_8 + wait_ack_10_9 + wait_ack_7_1 + wait_ack_7_2 + wait_ack_7_3 + wait_ack_7_4 + wait_ack_7_5 + wait_ack_7_6 + wait_ack_7_8 + wait_ack_7_9 + wait_ack_5_10 + wait_ack_8_1 + wait_ack_8_2 + wait_ack_8_3 + wait_ack_8_4 + wait_ack_8_5 + wait_ack_8_6 + wait_ack_8_7 + wait_ack_8_9 + wait_ack_9_1 + wait_ack_9_2 + wait_ack_9_3 + wait_ack_9_4 + wait_ack_9_5 + wait_ack_9_6 + wait_ack_9_7 + wait_ack_9_8 + wait_ack_8_10 + wait_ack_4_10 + wait_ack_3_10 + wait_ack_9_10 + wait_ack_2_10 <= Cpt2_10 + Cpt2_1 + Cpt2_2 + Cpt2_3 + Cpt2_4 + Cpt2_5 + Cpt2_6 + Cpt2_7 + Cpt2_8 + Cpt2_9)))))
lola: processed formula: A (X (X (X ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_1_4 + wait_ack_1_5 + wait_ack_1_6 + wait_ack_1_7 + wait_ack_1_8 + wait_ack_1_9 + wait_ack_7_10 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_2_4 + wait_ack_2_5 + wait_ack_2_6 + wait_ack_2_7 + wait_ack_2_8 + wait_ack_2_9 + wait_ack_3_1 + wait_ack_3_2 + wait_ack_3_4 + wait_ack_3_5 + wait_ack_3_6 + wait_ack_3_7 + wait_ack_3_8 + wait_ack_3_9 + wait_ack_1_... (shortened)
lola: processed formula length: 1475
lola: 0 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1011 markings, 1100 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((FMCb <= listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9))) U F ((FMCb <= cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_used_8 + cable_used_9 + cable_used_10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((FMCb <= listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9)) U F ((FMCb <= cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_used_8 + cable_used_9 + cable_used_10))))
lola: processed formula: A ((F ((FMCb <= listen_10 + listen_1 + listen_2 + listen_3 + listen_4 + listen_5 + listen_6 + listen_7 + listen_8 + listen_9)) U F ((FMCb <= cable_used_1 + cable_used_2 + cable_used_3 + cable_used_4 + cable_used_5 + cable_used_6 + cable_used_7 + cable_used_8 + cable_used_9 + cable_used_10))))
lola: processed formula length: 293
lola: 1 rewrites
lola: formula mentions 0 of 316 places; total mentions: 0
lola: closed formula file SafeBus-PT-10-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1048 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: 56967 markings, 56966 edges, 11393 markings/sec, 0 secs
lola: 114371 markings, 114370 edges, 11481 markings/sec, 5 secs
lola: 171392 markings, 171392 edges, 11404 markings/sec, 10 secs
lola: 239337 markings, 239336 edges, 13589 markings/sec, 15 secs
lola: 310851 markings, 310850 edges, 14303 markings/sec, 20 secs
lola: 382450 markings, 382449 edges, 14320 markings/sec, 25 secs
lola: 465112 markings, 465111 edges, 16532 markings/sec, 30 secs
lola: 562563 markings, 562562 edges, 19490 markings/sec, 35 secs
lola: 658283 markings, 658282 edges, 19144 markings/sec, 40 secs
lola: 692628 markings, 692627 edges, 6869 markings/sec, 45 secs
lola: 726319 markings, 726318 edges, 6738 markings/sec, 50 secs
lola: 760085 markings, 760084 edges, 6753 markings/sec, 55 secs
lola: 794827 markings, 794826 edges, 6948 markings/sec, 60 secs
lola: 830565 markings, 830564 edges, 7148 markings/sec, 65 secs
lola: 869625 markings, 869625 edges, 7812 markings/sec, 70 secs
lola: 892861 markings, 892860 edges, 4647 markings/sec, 75 secs
lola: 912767 markings, 912766 edges, 3981 markings/sec, 80 secs
lola: 932159 markings, 932158 edges, 3878 markings/sec, 85 secs
lola: 950736 markings, 950735 edges, 3715 markings/sec, 90 secs
lola: 969808 markings, 969807 edges, 3814 markings/sec, 95 secs
lola: 988453 markings, 988452 edges, 3729 markings/sec, 100 secs
lola: 1006356 markings, 1006355 edges, 3581 markings/sec, 105 secs
lola: 1025128 markings, 1025127 edges, 3754 markings/sec, 110 secs
lola: 1043683 markings, 1043682 edges, 3711 markings/sec, 115 secs
lola: 1061260 markings, 1061259 edges, 3515 markings/sec, 120 secs
lola: 1081998 markings, 1081997 edges, 4148 markings/sec, 125 secs
lola: 1106898 markings, 1106897 edges, 4980 markings/sec, 130 secs
lola: 1144133 markings, 1144132 edges, 7447 markings/sec, 135 secs
lola: 1182203 markings, 1182202 edges, 7614 markings/sec, 140 secs
lola: 1219148 markings, 1219147 edges, 7389 markings/sec, 145 secs
lola: 1256494 markings, 1256493 edges, 7469 markings/sec, 150 secs
lola: 1296855 markings, 1296854 edges, 8072 markings/sec, 155 secs
lola: 1333381 markings, 1333380 edges, 7305 markings/sec, 160 secs
lola: 1361598 markings, 1361597 edges, 5643 markings/sec, 165 secs
lola: 1388900 markings, 1388899 edges, 5460 markings/sec, 170 secs
lola: 1416113 markings, 1416112 edges, 5443 markings/sec, 175 secs
lola: 1443658 markings, 1443657 edges, 5509 markings/sec, 180 secs
lola: 1470881 markings, 1470880 edges, 5445 markings/sec, 185 secs
lola: 1497950 markings, 1497949 edges, 5414 markings/sec, 190 secs
lola: 1529512 markings, 1529511 edges, 6312 markings/sec, 195 secs
lola: 1568125 markings, 1568124 edges, 7723 markings/sec, 200 secs
lola: 1602121 markings, 1602120 edges, 6799 markings/sec, 205 secs
lola: 1635636 markings, 1635635 edges, 6703 markings/sec, 210 secs
lola: 1670470 markings, 1670469 edges, 6967 markings/sec, 215 secs
lola: 1705170 markings, 1705169 edges, 6940 markings/sec, 220 secs
lola: 1742844 markings, 1742843 edges, 7535 markings/sec, 225 secs
lola: 1773291 markings, 1773290 edges, 6089 markings/sec, 230 secs
lola: 1799732 markings, 1799731 edges, 5288 markings/sec, 235 secs
lola: 1822252 markings, 1822251 edges, 4504 markings/sec, 240 secs
lola: 1841346 markings, 1841345 edges, 3819 markings/sec, 245 secs
lola: 1859353 markings, 1859352 edges, 3601 markings/sec, 250 secs
lola: 1879356 markings, 1879355 edges, 4001 markings/sec, 255 secs
lola: 1899288 markings, 1899287 edges, 3986 markings/sec, 260 secs
lola: 1916680 markings, 1916679 edges, 3478 markings/sec, 265 secs
lola: 1936624 markings, 1936623 edges, 3989 markings/sec, 270 secs
lola: 1956360 markings, 1956359 edges, 3947 markings/sec, 275 secs
lola: 1974183 markings, 1974182 edges, 3565 markings/sec, 280 secs
lola: 1999500 markings, 1999499 edges, 5063 markings/sec, 285 secs
lola: 2021716 markings, 2021715 edges, 4443 markings/sec, 290 secs
lola: 2043956 markings, 2043956 edges, 4448 markings/sec, 295 secs
lola: 2065780 markings, 2065779 edges, 4365 markings/sec, 300 secs
lola: 2087644 markings, 2087643 edges, 4373 markings/sec, 305 secs
lola: 2108011 markings, 2108010 edges, 4073 markings/sec, 310 secs
lola: 2131180 markings, 2131179 edges, 4634 markings/sec, 315 secs
lola: 2153313 markings, 2153312 edges, 4427 markings/sec, 320 secs
lola: 2175079 markings, 2175078 edges, 4353 markings/sec, 325 secs
lola: 2202521 markings, 2202520 edges, 5488 markings/sec, 330 secs
lola: 2261125 markings, 2261124 edges, 11721 markings/sec, 335 secs
lola: 2320564 markings, 2320563 edges, 11888 markings/sec, 340 secs
lola: 2380304 markings, 2380303 edges, 11948 markings/sec, 345 secs
lola: 2439076 markings, 2439075 edges, 11754 markings/sec, 350 secs
lola: 2498454 markings, 2498453 edges, 11876 markings/sec, 355 secs
lola: 2558238 markings, 2558237 edges, 11957 markings/sec, 360 secs
lola: 2618322 markings, 2618321 edges, 12017 markings/sec, 365 secs
lola: 2675909 markings, 2675908 edges, 11517 markings/sec, 370 secs
lola: 2734853 markings, 2734852 edges, 11789 markings/sec, 375 secs
lola: 2793130 markings, 2793129 edges, 11655 markings/sec, 380 secs
lola: 2850359 markings, 2850358 edges, 11446 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 SafeBus-PT-10-LTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SafeBus-PT-10-LTLCardinality-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 stdout -----
----- Finished stderr -----

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="SafeBus-PT-10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-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/SafeBus-PT-10.tgz
mv SafeBus-PT-10 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-structural"
echo " Input is SafeBus-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r215-smll-152732266900533"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;