fond
Model Checking Contest 2019
9th edition, Prague, Czech Republic, April 7, 2019 (TOOLympics)
Execution of r187-csrt-155344544300071
Last Updated
Apr 15, 2019

About the Execution of 2018-Gold for FamilyReunion-PT-L00100M0010C005P005G002

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
809.910 3600000.00 4355076.00 319.60 F??TTFFT?F?TT?F? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r187-csrt-155344544300071.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is FamilyReunion-PT-L00100M0010C005P005G002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r187-csrt-155344544300071
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 33M
-rw-r--r-- 1 mcc users 4.8K Mar 24 07:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 24 07:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K Mar 24 06:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 24 06:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K Mar 24 06:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Mar 24 06:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 24 06:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K Mar 24 06:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 24 00:18 NewModel
-rw-r--r-- 1 mcc users 4.3K Mar 24 06:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 24 06:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 131 Mar 24 06:28 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 369 Mar 24 06:28 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.7K Mar 24 06:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 24 06:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 24 06:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Mar 24 06:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 00:18 equiv_col

-rw-r--r-- 1 mcc users 24 Mar 24 00:18 instance
-rw-r--r-- 1 mcc users 6 Mar 24 00:18 iscolored
-rw-r--r-- 1 mcc users 32M Mar 24 00:18 model.pnml

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

=== Now, execution of the tool begins

BK_START 1553696825178

info: Time: 3600 - MCC
===========================================================================================
prep: translating FamilyReunion-PT-L00100M0010C005P005G002 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating FamilyReunion-PT-L00100M0010C005P005G002 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ FamilyReunion-PT-L00100M0010C005P005G002 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 77476/65536 symbol table entries, 23475 collisions
lola: preprocessing...
lola: Size of bit vector: 1299360
lola: finding significant places
lola: 40605 places, 36871 transitions, 31769 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 50103 transition conflict sets
lola: TASK
lola: reading formula from FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= ml1_13_10)
lola: LP says that atomic proposition is always false: (3 <= l2_22_10)
lola: LP says that atomic proposition is always false: (3 <= m9_22_6)
lola: LP says that atomic proposition is always false: (2 <= l7_31_6)
lola: LP says that atomic proposition is always false: (2 <= l2_85_7)
lola: A (X ((X (FALSE) U G ((l5_33_5 <= c6_76_1))))) : A (X (G (G (G ((gl1_83_Y <= p2_43_2)))))) : A ((G (X ((l38_47 <= m2_55_4))) U ((2 <= c3_29_4) U (2 <= p9_76_4)))) : A ((m2_68_8 <= p1_77_1)) : A (X (X (((ml4_23_9 <= m7_67_5) U (ml2_55_1 <= ml0_2_10))))) : A (X (F (F (G (FALSE))))) : A (G ((2 <= p2_82_1))) : A ((ml0_100_10 <= m10_62_2)) : A (G (X (G (F ((m5_61_4 <= p5_29_3)))))) : A (F (((1 <= p5_79_0) U FALSE))) : A (G (X (G (G ((m2_30_7 <= pl0_34_5)))))) : A (F ((lm2_2_0 <= gl0_49_0))) : A ((F (FALSE) U ((3 <= l36_10) U (c5_90_0 <= l5_83_8)))) : A (F (G (G (X ((2 <= c3_6_4)))))) : A (G (X (X (G (FALSE))))) : A (((ml1_66_2 <= ml2_48_2) U G (X ((lm1_60_7 <= lm4_88)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 71 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (m2_68_8 <= p1_77_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (m2_68_8 <= p1_77_1)
lola: processed formula length: 20
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: processed formula with 1 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: ========================================

FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 75 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.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: ========================================

FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 81 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ml0_100_10 <= m10_62_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ml0_100_10 <= m10_62_2)
lola: processed formula length: 24
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: processed formula with 1 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: ========================================

FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 87 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.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: ========================================

FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 94 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.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: ========================================

FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 103 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((gl1_83_Y <= p2_43_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((gl1_83_Y <= p2_43_2))))
lola: processed formula length: 33
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 13920 markings, 22470 edges, 2784 markings/sec, 0 secs
lola: 22611 markings, 46356 edges, 1738 markings/sec, 5 secs
lola: 29631 markings, 70895 edges, 1404 markings/sec, 10 secs
lola: 37268 markings, 94948 edges, 1527 markings/sec, 15 secs
lola: 45343 markings, 119436 edges, 1615 markings/sec, 20 secs
lola: 52286 markings, 143487 edges, 1389 markings/sec, 25 secs
lola: 61645 markings, 167607 edges, 1872 markings/sec, 30 secs
lola: 69728 markings, 191453 edges, 1617 markings/sec, 35 secs
lola: 76627 markings, 215840 edges, 1380 markings/sec, 40 secs
lola: 83553 markings, 240430 edges, 1385 markings/sec, 45 secs
lola: 90335 markings, 264458 edges, 1356 markings/sec, 50 secs
lola: 95831 markings, 288520 edges, 1099 markings/sec, 55 secs
lola: 101820 markings, 312873 edges, 1198 markings/sec, 60 secs
lola: 109823 markings, 337115 edges, 1601 markings/sec, 65 secs
lola: 117127 markings, 361510 edges, 1461 markings/sec, 70 secs
lola: 124762 markings, 385570 edges, 1527 markings/sec, 75 secs
lola: 132081 markings, 409227 edges, 1464 markings/sec, 80 secs
lola: 139098 markings, 433213 edges, 1403 markings/sec, 85 secs
lola: 149427 markings, 457022 edges, 2066 markings/sec, 90 secs
lola: 157333 markings, 480958 edges, 1581 markings/sec, 95 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown yes unknown no unknown yes unknown no unknown unknown unknown unknown no unknown
lola: memory consumption: 155272 KB
lola: time consumption: 2533 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 103 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((l38_47 <= m2_55_4))) U ((2 <= c3_29_4) U (2 <= p9_76_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((l38_47 <= m2_55_4))) U ((2 <= c3_29_4) U (2 <= p9_76_4))))
lola: processed formula length: 69
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 14134 markings, 23077 edges, 2827 markings/sec, 0 secs
lola: 22755 markings, 46761 edges, 1724 markings/sec, 5 secs
lola: 29630 markings, 70890 edges, 1375 markings/sec, 10 secs
lola: 37499 markings, 95766 edges, 1574 markings/sec, 15 secs
lola: 45398 markings, 119596 edges, 1580 markings/sec, 20 secs
lola: 52452 markings, 143908 edges, 1411 markings/sec, 25 secs
lola: 61792 markings, 167965 edges, 1868 markings/sec, 30 secs
lola: 69877 markings, 192026 edges, 1617 markings/sec, 35 secs
lola: 76720 markings, 216162 edges, 1369 markings/sec, 40 secs
lola: 83535 markings, 240338 edges, 1363 markings/sec, 45 secs
lola: 90330 markings, 264432 edges, 1359 markings/sec, 50 secs
lola: 95844 markings, 288574 edges, 1103 markings/sec, 55 secs
lola: 101757 markings, 312705 edges, 1183 markings/sec, 60 secs
lola: 109707 markings, 336635 edges, 1590 markings/sec, 65 secs
lola: 116802 markings, 360605 edges, 1419 markings/sec, 70 secs
lola: 124616 markings, 384989 edges, 1563 markings/sec, 75 secs
lola: 132095 markings, 409254 edges, 1496 markings/sec, 80 secs
lola: 139257 markings, 433807 edges, 1432 markings/sec, 85 secs
lola: 149607 markings, 457566 edges, 2070 markings/sec, 90 secs
lola: 157589 markings, 481967 edges, 1596 markings/sec, 95 secs
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown yes unknown no unknown yes unknown no unknown unknown unknown unknown no unknown
lola: memory consumption: 155436 KB
lola: time consumption: 2636 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 103 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((l5_33_5 <= c6_76_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((l5_33_5 <= c6_76_1))))
lola: processed formula length: 32
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 5785 markings, 5785 edges
lola:
FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 8 will run for 116 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((m2_30_7 <= pl0_34_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((m2_30_7 <= pl0_34_5))))
lola: processed formula length: 33
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 14127 markings, 23049 edges, 2825 markings/sec, 0 secs
lola: 22882 markings, 47144 edges, 1751 markings/sec, 5 secs
lola: 29735 markings, 71182 edges, 1371 markings/sec, 10 secs
lola: 37425 markings, 95529 edges, 1538 markings/sec, 15 secs
lola: 45180 markings, 118983 edges, 1551 markings/sec, 20 secs
lola: 52214 markings, 143308 edges, 1407 markings/sec, 25 secs
lola: 61641 markings, 167592 edges, 1885 markings/sec, 30 secs
lola: 69880 markings, 192041 edges, 1648 markings/sec, 35 secs
lola: 76769 markings, 216318 edges, 1378 markings/sec, 40 secs
lola: 83700 markings, 240913 edges, 1386 markings/sec, 45 secs
lola: 90606 markings, 265405 edges, 1381 markings/sec, 50 secs
lola: 96126 markings, 289855 edges, 1104 markings/sec, 55 secs
lola: 102299 markings, 314218 edges, 1235 markings/sec, 60 secs
lola: 110125 markings, 338177 edges, 1565 markings/sec, 65 secs
lola: 117382 markings, 362211 edges, 1451 markings/sec, 70 secs
lola: 124978 markings, 386404 edges, 1519 markings/sec, 75 secs
lola: 132480 markings, 410299 edges, 1500 markings/sec, 80 secs
lola: 139472 markings, 434616 edges, 1398 markings/sec, 85 secs
lola: 149909 markings, 458425 edges, 2087 markings/sec, 90 secs
lola: 157816 markings, 482775 edges, 1581 markings/sec, 95 secs
lola: 165643 markings, 506920 edges, 1565 markings/sec, 100 secs
lola: 172434 markings, 530552 edges, 1358 markings/sec, 105 secs
lola: 179699 markings, 554438 edges, 1453 markings/sec, 110 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown yes unknown no unknown yes unknown no unknown unknown unknown unknown no unknown
lola: memory consumption: 161076 KB
lola: time consumption: 2753 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 116 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((ml4_23_9 <= m7_67_5) U (ml2_55_1 <= ml0_2_10)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((ml4_23_9 <= m7_67_5) U (ml2_55_1 <= ml0_2_10)))))
lola: processed formula length: 60
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 6263 markings, 11312 edges
lola: ========================================

FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((ml1_66_2 <= ml2_48_2) U X (G ((lm1_60_7 <= lm4_88)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((ml1_66_2 <= ml2_48_2) U X (G ((lm1_60_7 <= lm4_88)))))
lola: processed formula length: 59
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 14310 markings, 23580 edges, 2862 markings/sec, 0 secs
lola: 23030 markings, 47582 edges, 1744 markings/sec, 5 secs
lola: 29777 markings, 71304 edges, 1349 markings/sec, 10 secs
lola: 37299 markings, 95014 edges, 1504 markings/sec, 15 secs
lola: 45206 markings, 119055 edges, 1581 markings/sec, 20 secs
lola: 52215 markings, 143312 edges, 1402 markings/sec, 25 secs
lola: 61595 markings, 167437 edges, 1876 markings/sec, 30 secs
lola: 69842 markings, 191862 edges, 1649 markings/sec, 35 secs
lola: 76644 markings, 215896 edges, 1360 markings/sec, 40 secs
lola: 83432 markings, 239967 edges, 1358 markings/sec, 45 secs
lola: 90226 markings, 264055 edges, 1359 markings/sec, 50 secs
lola: 95742 markings, 288160 edges, 1103 markings/sec, 55 secs
lola: 101568 markings, 312180 edges, 1165 markings/sec, 60 secs
lola: 109587 markings, 336179 edges, 1604 markings/sec, 65 secs
lola: 116683 markings, 360275 edges, 1419 markings/sec, 70 secs
lola: 124485 markings, 384484 edges, 1560 markings/sec, 75 secs
lola: 131916 markings, 408766 edges, 1486 markings/sec, 80 secs
lola: 139135 markings, 433337 edges, 1444 markings/sec, 85 secs
lola: 149432 markings, 457044 edges, 2059 markings/sec, 90 secs
lola: 157369 markings, 481089 edges, 1587 markings/sec, 95 secs
lola: 165006 markings, 505152 edges, 1527 markings/sec, 100 secs
lola: 171886 markings, 529037 edges, 1376 markings/sec, 105 secs
lola: 179350 markings, 553068 edges, 1493 markings/sec, 110 secs
lola: 187838 markings, 576807 edges, 1698 markings/sec, 115 secs
lola: 196318 markings, 600798 edges, 1696 markings/sec, 120 secs
lola: 203006 markings, 624495 edges, 1338 markings/sec, 125 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown yes yes no unknown yes unknown no unknown unknown unknown unknown no unknown
lola: caught signal User defined signal 2 - aborting LoLA
lola:
preliminary result: no unknown unknown yes yes no unknown yes unknown no unknown unknown unknown unknown no unknown
lola: memory consumption: 170840 KB
lola: time consumption: 2891 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 135 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= p2_82_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((2 <= p2_82_1)))
lola: processed formula length: 22
lola: 40 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p2_82_1 <= 1)
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11-0.sara

FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: lola: state equation: calling and running sara
lola: ========================================
subprocess 12 will run for 169 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((lm2_2_0 <= gl0_49_0)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (gl0_49_0 + 1 <= lm2_2_0)
lola: processed formula length: 25
lola: 40 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
sara: try reading problem file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11-0.sara.
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges

FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 13 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((2 <= c3_6_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((2 <= c3_6_4))))
lola: processed formula length: 25
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 4991 markings, 4990 edges, 998 markings/sec, 0 secs
lola: 4998 markings, 4997 edges, 1 markings/sec, 5 secs
lola: 5004 markings, 5003 edges, 1 markings/sec, 10 secs
lola: 5015 markings, 5014 edges, 2 markings/sec, 15 secs
lola: 5021 markings, 5020 edges, 1 markings/sec, 20 secs
lola: 5027 markings, 5026 edges, 1 markings/sec, 25 secs
lola: 5034 markings, 5033 edges, 1 markings/sec, 30 secs
lola: 5042 markings, 5041 edges, 2 markings/sec, 35 secs
lola: 5051 markings, 5050 edges, 2 markings/sec, 40 secs
lola: 5057 markings, 5056 edges, 1 markings/sec, 45 secs
lola: 5064 markings, 5063 edges, 1 markings/sec, 50 secs
lola: 5070 markings, 5069 edges, 1 markings/sec, 55 secs
lola: 5081 markings, 5080 edges, 2 markings/sec, 60 secs
lola: 5093 markings, 5092 edges, 2 markings/sec, 65 secs
lola: 5100 markings, 5099 edges, 1 markings/sec, 70 secs
lola: 5106 markings, 5105 edges, 1 markings/sec, 75 secs
lola: 5117 markings, 5116 edges, 2 markings/sec, 80 secs
lola: 5123 markings, 5122 edges, 1 markings/sec, 85 secs
lola: 5130 markings, 5129 edges, 1 markings/sec, 90 secs
lola: 5136 markings, 5135 edges, 1 markings/sec, 95 secs
lola: 5147 markings, 5146 edges, 2 markings/sec, 100 secs
lola: 5153 markings, 5152 edges, 1 markings/sec, 105 secs
lola: 5160 markings, 5159 edges, 1 markings/sec, 110 secs
lola: 5171 markings, 5170 edges, 2 markings/sec, 115 secs
lola: 5178 markings, 5177 edges, 1 markings/sec, 120 secs
lola: 5189 markings, 5188 edges, 2 markings/sec, 125 secs
lola: 5196 markings, 5195 edges, 1 markings/sec, 130 secs
lola: 5207 markings, 5206 edges, 2 markings/sec, 135 secs
lola: 5216 markings, 5215 edges, 2 markings/sec, 140 secs
lola: 5226 markings, 5225 edges, 2 markings/sec, 145 secs
lola: 5238 markings, 5237 edges, 2 markings/sec, 150 secs
lola: 5249 markings, 5248 edges, 2 markings/sec, 155 secs
lola: 5261 markings, 5260 edges, 2 markings/sec, 160 secs
lola: 5273 markings, 5272 edges, 2 markings/sec, 165 secs
lola: 5285 markings, 5284 edges, 2 markings/sec, 170 secs
lola: 5294 markings, 5293 edges, 2 markings/sec, 175 secs
lola: 5304 markings, 5303 edges, 2 markings/sec, 180 secs
lola: 5318 markings, 5317 edges, 3 markings/sec, 185 secs
lola: 5330 markings, 5329 edges, 2 markings/sec, 190 secs
lola: 5345 markings, 5344 edges, 3 markings/sec, 195 secs
lola: 5357 markings, 5356 edges, 2 markings/sec, 200 secs
lola: 5369 markings, 5368 edges, 2 markings/sec, 205 secs
lola: 5382 markings, 5381 edges, 3 markings/sec, 210 secs
lola: 5396 markings, 5395 edges, 3 markings/sec, 215 secs
lola: 5408 markings, 5407 edges, 2 markings/sec, 220 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown yes yes no no yes unknown no unknown yes unknown unknown no unknown
lola: memory consumption: 111136 KB
lola: time consumption: 3117 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((m5_61_4 <= p5_29_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((m5_61_4 <= p5_29_3))))
lola: processed formula length: 32
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 2060 markings, 2059 edges, 412 markings/sec, 0 secs
lola: 2397 markings, 2396 edges, 67 markings/sec, 5 secs
lola: 2686 markings, 2685 edges, 58 markings/sec, 10 secs
lola: 3003 markings, 3002 edges, 63 markings/sec, 15 secs
lola: 3318 markings, 3317 edges, 63 markings/sec, 20 secs
lola: 3617 markings, 3616 edges, 60 markings/sec, 25 secs
lola: 3927 markings, 3926 edges, 62 markings/sec, 30 secs
lola: 4189 markings, 4188 edges, 52 markings/sec, 35 secs
lola: 4551 markings, 4550 edges, 72 markings/sec, 40 secs
lola: 5059 markings, 5058 edges, 102 markings/sec, 45 secs
lola: 7861 markings, 8735 edges, 560 markings/sec, 50 secs
lola: 14531 markings, 18878 edges, 1334 markings/sec, 55 secs
lola: 20774 markings, 28791 edges, 1249 markings/sec, 60 secs
lola: 26857 markings, 38372 edges, 1217 markings/sec, 65 secs
lola: 33765 markings, 48771 edges, 1382 markings/sec, 70 secs
lola: 40258 markings, 58939 edges, 1299 markings/sec, 75 secs
lola: 46384 markings, 68929 edges, 1225 markings/sec, 80 secs
lola: 51812 markings, 78191 edges, 1086 markings/sec, 85 secs
lola: 58146 markings, 88146 edges, 1267 markings/sec, 90 secs
lola: 64633 markings, 98288 edges, 1297 markings/sec, 95 secs
lola: 70335 markings, 107823 edges, 1140 markings/sec, 100 secs
lola: 75925 markings, 117384 edges, 1118 markings/sec, 105 secs
lola: 80772 markings, 126345 edges, 969 markings/sec, 110 secs
lola: 86757 markings, 136178 edges, 1197 markings/sec, 115 secs
lola: 93640 markings, 146639 edges, 1377 markings/sec, 120 secs
lola: 100693 markings, 157259 edges, 1411 markings/sec, 125 secs
lola: 107485 markings, 167842 edges, 1358 markings/sec, 130 secs
lola: 113335 markings, 177384 edges, 1170 markings/sec, 135 secs
lola: 120491 markings, 188118 edges, 1431 markings/sec, 140 secs
lola: 127499 markings, 198698 edges, 1402 markings/sec, 145 secs
lola: 133841 markings, 208657 edges, 1268 markings/sec, 150 secs
lola: 140017 markings, 218720 edges, 1235 markings/sec, 155 secs
lola: 145604 markings, 228355 edges, 1117 markings/sec, 160 secs
lola: 152125 markings, 238549 edges, 1304 markings/sec, 165 secs
lola: 158739 markings, 248866 edges, 1323 markings/sec, 170 secs
lola: 165047 markings, 259114 edges, 1262 markings/sec, 175 secs
lola: 171136 markings, 269311 edges, 1218 markings/sec, 180 secs
lola: 176744 markings, 278971 edges, 1122 markings/sec, 185 secs
lola: 182644 markings, 288737 edges, 1180 markings/sec, 190 secs
lola: 189085 markings, 299119 edges, 1288 markings/sec, 195 secs
lola: 194804 markings, 308845 edges, 1144 markings/sec, 200 secs
lola: 200533 markings, 318573 edges, 1146 markings/sec, 205 secs
lola: 205918 markings, 328082 edges, 1077 markings/sec, 210 secs
lola: 210724 markings, 337085 edges, 961 markings/sec, 215 secs
lola: 216570 markings, 346868 edges, 1169 markings/sec, 220 secs
lola: local time limit reached - aborting
lola:
preliminary result: no unknown unknown yes yes no no yes unknown no unknown yes unknown unknown no unknown
lola: memory consumption: 304032 KB
lola: time consumption: 3343 seconds
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 226 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= l36_10) U (c5_90_0 <= l5_83_8)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((3 <= l36_10) U (c5_90_0 <= l5_83_8)))
lola: processed formula length: 42
lola: 42 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: A (X (G ((gl1_83_Y <= p2_43_2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((gl1_83_Y <= p2_43_2))))
lola: processed formula length: 33
lola: 38 rewrites
lola: closed formula file FamilyReunion-PT-L00100M0010C005P005G002-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 14111 markings, 22986 edges, 2822 markings/sec, 0 secs
lola: 22690 markings, 46575 edges, 1716 markings/sec, 5 secs
lola: 29582 markings, 70770 edges, 1378 markings/sec, 10 secs
lola: 37251 markings, 94848 edges, 1534 markings/sec, 15 secs
lola: 45317 markings, 119373 edges, 1613 markings/sec, 20 secs
lola: 52505 markings, 144032 edges, 1438 markings/sec, 25 secs
lola: 62042 markings, 168600 edges, 1907 markings/sec, 30 secs
lola: 70269 markings, 193390 edges, 1645 markings/sec, 35 secs
lola: 77275 markings, 218127 edges, 1401 markings/sec, 40 secs
lola: 84281 markings, 242975 edges, 1401 markings/sec, 45 secs
lola: 90918 markings, 266542 edges, 1327 markings/sec, 50 secs
lola: 95982 markings, 289193 edges, 1013 markings/sec, 55 secs
lola: 101902 markings, 313132 edges, 1184 markings/sec, 60 secs
lola: 109695 markings, 336581 edges, 1559 markings/sec, 65 secs
lola: 116879 markings, 360808 edges, 1437 markings/sec, 70 secs
lola: 124543 markings, 384722 edges, 1533 markings/sec, 75 secs
lola: 131510 markings, 407616 edges, 1393 markings/sec, 80 secs
lola: 138276 markings, 430133 edges, 1353 markings/sec, 85 secs
lola: 148335 markings, 454042 edges, 2012 markings/sec, 90 secs
lola: 156601 markings, 478238 edges, 1653 markings/sec, 95 secs
lola: 164019 markings, 502388 edges, 1484 markings/sec, 100 secs
lola: 171010 markings, 526590 edges, 1398 markings/sec, 105 secs
lola: 178707 markings, 550687 edges, 1539 markings/sec, 110 secs
lola: 187135 markings, 575036 edges, 1686 markings/sec, 115 secs
lola: 195900 markings, 599348 edges, 1753 markings/sec, 120 secs
lola: 202866 markings, 623976 edges, 1393 markings/sec, 125 secs
lola: 209446 markings, 647514 edges, 1316 markings/sec, 130 secs
lola: 215655 markings, 669897 edges, 1242 markings/sec, 135 secs
lola: 220595 markings, 692359 edges, 988 markings/sec, 140 secs
lola: 226807 markings, 714768 edges, 1242 markings/sec, 145 secs
lola: 233625 markings, 737102 edges, 1364 markings/sec, 150 secs
lola: 240860 markings, 759423 edges, 1447 markings/sec, 155 secs
lola: 247526 markings, 781758 edges, 1333 markings/sec, 160 secs
lola: 254740 markings, 804141 edges, 1443 markings/sec, 165 secs
lola: 261923 markings, 828577 edges, 1437 markings/sec, 170 secs
lola: 272163 markings, 853081 edges, 2048 markings/sec, 175 secs
lola: 279630 markings, 877960 edges, 1493 markings/sec, 180 secs
lola: 287272 markings, 902081 edges, 1528 markings/sec, 185 secs
lola: 294407 markings, 924396 edges, 1427 markings/sec, 190 secs
lola: 301085 markings, 946777 edges, 1336 markings/sec, 195 secs
lola: 309560 markings, 968998 edges, 1695 markings/sec, 200 secs
lola: 316406 markings, 993185 edges, 1369 markings/sec, 205 secs
lola: 323312 markings, 1018029 edges, 1381 markings/sec, 210 secs
lola: 329833 markings, 1043692 edges, 1304 markings/sec, 215 secs
lola: 335641 markings, 1068452 edges, 1162 markings/sec, 220 secs
lola: time limit reached - aborting
lola:
preliminary result: no unknown unknown yes yes no no yes unknown no unknown yes yes unknown no unknown
lola:
preliminary result: no unknown unknown yes yes no no yes unknown no unknown yes yes unknown no unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola:
preliminary result: no unknown unknown yes yes no no yes unknown no unknown yes yes unknown no unknown
lola: memory consumption: 210892 KB
lola: time consumption: 3569 seconds
lola: memory consumption: 210892 KB
lola: time consumption: 3569 seconds

BK_TIME_CONFINEMENT_REACHED

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

grep: GenericPropertiesVerdict.xml: No such file or directory

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="FamilyReunion-PT-L00100M0010C005P005G002"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is FamilyReunion-PT-L00100M0010C005P005G002, 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 r187-csrt-155344544300071"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FamilyReunion-PT-L00100M0010C005P005G002.tgz
mv FamilyReunion-PT-L00100M0010C005P005G002 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;