fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r199-smll-167840345700220
Last Updated
May 14, 2023

About the Execution of LoLa+red for GlobalResAllocation-PT-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
369.880 33862.00 54106.00 827.60 FTFFFTTTTTFFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r199-smll-167840345700220.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is GlobalResAllocation-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345700220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 17K Feb 25 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Feb 25 17:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 4.3M Feb 25 17:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 535K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 18:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 25 18:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Feb 25 18:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.6M Feb 25 18:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 5.7M Mar 5 18:22 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 GlobalResAllocation-PT-03-LTLFireability-00
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-01
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-02
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-03
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-04
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-05
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-06
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-07
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-08
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-09
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-10
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-11
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-12
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-13
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-14
FORMULA_NAME GlobalResAllocation-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678496920347

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GlobalResAllocation-PT-03
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 01:08:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 01:08:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 01:08:44] [INFO ] Load time of PNML (sax parser for PT used): 687 ms
[2023-03-11 01:08:44] [INFO ] Transformed 33 places.
[2023-03-11 01:08:44] [INFO ] Transformed 4791 transitions.
[2023-03-11 01:08:44] [INFO ] Parsed PT model containing 33 places and 4791 transitions and 38652 arcs in 863 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 120 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
[2023-03-11 01:08:44] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-11 01:08:44] [INFO ] Reduced 480 identical enabling conditions.
[2023-03-11 01:08:44] [INFO ] Reduced 480 identical enabling conditions.
[2023-03-11 01:08:44] [INFO ] Reduced 480 identical enabling conditions.
[2023-03-11 01:08:44] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-11 01:08:44] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-11 01:08:44] [INFO ] Reduced 480 identical enabling conditions.
Ensure Unique test removed 4080 transitions
Reduce redundant transitions removed 4080 transitions.
FORMULA GlobalResAllocation-PT-03-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 711/711 transitions.
Reduce isomorphic (modulo) transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 33 transition count 693
Applied a total of 36 rules in 77 ms. Remains 33 /33 variables (removed 0) and now considering 693/711 (removed 18) transitions.
// Phase 1: matrix 693 rows 33 cols
[2023-03-11 01:08:44] [INFO ] Computed 12 place invariants in 44 ms
[2023-03-11 01:08:45] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 459 transitions.
Found 459 dead transitions using SMT.
Drop transitions removed 459 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 459 transitions.
// Phase 1: matrix 234 rows 33 cols
[2023-03-11 01:08:45] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-11 01:08:46] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-11 01:08:46] [INFO ] Invariant cache hit.
[2023-03-11 01:08:46] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/33 places, 234/711 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1453 ms. Remains : 33/33 places, 234/711 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-03-11 01:08:46] [INFO ] Flatten gal took : 136 ms
[2023-03-11 01:08:47] [INFO ] Flatten gal took : 109 ms
[2023-03-11 01:08:47] [INFO ] Input system was already deterministic with 234 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 474 ms. (steps per millisecond=21 ) properties (out of 17) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 01:08:47] [INFO ] Invariant cache hit.
[2023-03-11 01:08:47] [INFO ] [Real]Absence check using 7 positive place invariants in 12 ms returned sat
[2023-03-11 01:08:47] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-11 01:08:47] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
FORMULA GlobalResAllocation-PT-03-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 9 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-11 01:08:48] [INFO ] Invariant cache hit.
[2023-03-11 01:08:48] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
[2023-03-11 01:08:48] [INFO ] Invariant cache hit.
[2023-03-11 01:08:48] [INFO ] Implicit Places using invariants in 114 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 122 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 344 ms. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 323 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 2)) (AND (GEQ s2 1) (GEQ s5 2) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s8 2)) (AND (GEQ s2 1) (GEQ s5 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 39325 reset in 2642 ms.
Stack based approach found an accepted trace after 1803 steps with 736 reset with depth 4 and stack size 4 in 50 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-00 finished in 3638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p1)||p0))||G(p2)))'
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-11 01:08:51] [INFO ] Invariant cache hit.
[2023-03-11 01:08:52] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
[2023-03-11 01:08:52] [INFO ] Invariant cache hit.
[2023-03-11 01:08:52] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 01:08:52] [INFO ] Invariant cache hit.
[2023-03-11 01:08:52] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2023-03-11 01:08:52] [INFO ] Invariant cache hit.
[2023-03-11 01:08:52] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 33/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s6 1)) (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (GEQ s1 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s8 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2162 ms.
Product exploration explored 100000 steps with 50000 reset in 1935 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-PT-03-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-PT-03-LTLFireability-01 finished in 5178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-11 01:08:57] [INFO ] Invariant cache hit.
[2023-03-11 01:08:57] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
[2023-03-11 01:08:57] [INFO ] Invariant cache hit.
[2023-03-11 01:08:57] [INFO ] Implicit Places using invariants in 196 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 200 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 477 ms. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s27 4) (LT s28 4) (LT s29 4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-02 finished in 660 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-11 01:08:57] [INFO ] Invariant cache hit.
[2023-03-11 01:08:57] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
[2023-03-11 01:08:57] [INFO ] Invariant cache hit.
[2023-03-11 01:08:57] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-11 01:08:57] [INFO ] Invariant cache hit.
[2023-03-11 01:08:58] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2023-03-11 01:08:58] [INFO ] Invariant cache hit.
[2023-03-11 01:08:58] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 629 ms. Remains : 33/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 2)) (AND (GEQ s2 1) (GEQ s5 2) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s8 2)) (AND (GEQ s2 1) (GEQ s5 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-04 finished in 962 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0) U X(G(p1))) U X(p0)))'
Support contains 24 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-11 01:08:58] [INFO ] Invariant cache hit.
[2023-03-11 01:08:58] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 0 transitions.
[2023-03-11 01:08:58] [INFO ] Invariant cache hit.
[2023-03-11 01:08:59] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-11 01:08:59] [INFO ] Invariant cache hit.
[2023-03-11 01:08:59] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-11 01:08:59] [INFO ] Invariant cache hit.
[2023-03-11 01:08:59] [INFO ] Dead Transitions using invariants and state equation in 286 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 844 ms. Remains : 33/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p0), true, (NOT p0), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 0}, { cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(OR (AND (GEQ s10 2) (GEQ s27 2)) (AND (GEQ s9 1) (GEQ s12 1) (GEQ s28 2)) (AND (GEQ s10 1) (GEQ s14 1) (GEQ s27 2)) (AND (GEQ s12 1) (GEQ s22 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1747 ms.
Product exploration explored 100000 steps with 50000 reset in 1791 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 5 factoid took 330 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-PT-03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-PT-03-LTLFireability-05 finished in 5049 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 9 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-11 01:09:03] [INFO ] Invariant cache hit.
[2023-03-11 01:09:03] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
[2023-03-11 01:09:03] [INFO ] Invariant cache hit.
[2023-03-11 01:09:04] [INFO ] Implicit Places using invariants in 94 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 98 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 300 ms. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 2)) (AND (GEQ s2 1) (GEQ s5 2) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s8 2)) (AND (GEQ s2 1) (GEQ s5 1) (GE...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2161 ms.
Product exploration explored 100000 steps with 50000 reset in 1825 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p1), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-PT-03-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-PT-03-LTLFireability-06 finished in 4634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 25 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-11 01:09:08] [INFO ] Invariant cache hit.
[2023-03-11 01:09:08] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
[2023-03-11 01:09:08] [INFO ] Invariant cache hit.
[2023-03-11 01:09:08] [INFO ] Implicit Places using invariants in 90 ms returned [27, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 92 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/33 places, 234/234 transitions.
Applied a total of 0 rules in 13 ms. Remains 31 /31 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 265 ms. Remains : 31/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 339 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s19 1) (LT s24 1) (LT s29 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 754 reset in 791 ms.
Stack based approach found an accepted trace after 1801 steps with 14 reset with depth 280 and stack size 178 in 12 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-10 finished in 1423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 12 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-11 01:09:09] [INFO ] Invariant cache hit.
[2023-03-11 01:09:09] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
[2023-03-11 01:09:09] [INFO ] Invariant cache hit.
[2023-03-11 01:09:10] [INFO ] Implicit Places using invariants in 75 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 77 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 249 ms. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s3 1) (GEQ s4 1) (GEQ s8 1)), p0:(AND (GEQ s1 1) (GEQ s4 1) (GEQ s5 1) (GEQ s7 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 29 reset in 828 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-11 finished in 1178 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(((X((!p0&&X(F(!p0))))&&G(p1))||G(!p0)))))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-11 01:09:10] [INFO ] Invariant cache hit.
[2023-03-11 01:09:11] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
[2023-03-11 01:09:11] [INFO ] Invariant cache hit.
[2023-03-11 01:09:11] [INFO ] Implicit Places using invariants in 112 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 114 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 265 ms. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 299 ms :[p0, p0, (AND (NOT p1) p0), p0, p0, p0, p0]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={1} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1} source=2 dest: 2}], [{ cond=p0, acceptance={0, 1} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(LT s29 4), p0:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5166 reset in 623 ms.
Stack based approach found an accepted trace after 47 steps with 1 reset with depth 42 and stack size 38 in 1 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-14 finished in 1214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 8 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2023-03-11 01:09:12] [INFO ] Invariant cache hit.
[2023-03-11 01:09:12] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
[2023-03-11 01:09:12] [INFO ] Invariant cache hit.
[2023-03-11 01:09:12] [INFO ] Implicit Places using invariants in 164 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 167 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 365 ms. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 423 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 31 in 0 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-15 finished in 870 ms.
All properties solved by simple procedures.
Total runtime 29626 ms.
ITS solved all properties within timeout

BK_STOP 1678496954209

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="GlobalResAllocation-PT-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# 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-5348"
echo " Executing tool lolaxred"
echo " Input is GlobalResAllocation-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r199-smll-167840345700220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-PT-03.tgz
mv GlobalResAllocation-PT-03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; 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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;