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.r201-smll-167840347300100.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 ltsminxred
Input is GPUForwardProgress-PT-28a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347300100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.0K Feb 25 14:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 14:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 14:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 14:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 14:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 202K Feb 25 14:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 44K 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 GPUForwardProgress-PT-28a-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-28a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678547459241

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-28a
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 15:11:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 15:11:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 15:11:02] [INFO ] Load time of PNML (sax parser for PT used): 73 ms
[2023-03-11 15:11:02] [INFO ] Transformed 120 places.
[2023-03-11 15:11:02] [INFO ] Transformed 149 transitions.
[2023-03-11 15:11:02] [INFO ] Found NUPN structural information;
[2023-03-11 15:11:02] [INFO ] Parsed PT model containing 120 places and 149 transitions and 581 arcs in 194 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Ensure Unique test removed 30 transitions
Reduce redundant transitions removed 30 transitions.
FORMULA GPUForwardProgress-PT-28a-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28a-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28a-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28a-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-28a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 120 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 120/120 places, 119/119 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 119 transition count 119
Applied a total of 1 rules in 28 ms. Remains 119 /120 variables (removed 1) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 119 cols
[2023-03-11 15:11:02] [INFO ] Computed 29 place invariants in 11 ms
[2023-03-11 15:11:02] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-11 15:11:02] [INFO ] Invariant cache hit.
[2023-03-11 15:11:03] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 15:11:03] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 703 ms to find 0 implicit places.
[2023-03-11 15:11:03] [INFO ] Invariant cache hit.
[2023-03-11 15:11:03] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/120 places, 119/119 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 929 ms. Remains : 119/120 places, 119/119 transitions.
Support contains 21 out of 119 places after structural reductions.
[2023-03-11 15:11:03] [INFO ] Flatten gal took : 73 ms
[2023-03-11 15:11:03] [INFO ] Flatten gal took : 24 ms
[2023-03-11 15:11:03] [INFO ] Input system was already deterministic with 119 transitions.
Finished random walk after 2191 steps, including 6 resets, run visited all 20 properties in 211 ms. (steps per millisecond=10 )
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 380 edges and 119 vertex of which 90 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.5 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(F(((p0 U (G(p0)||p1)) U (G((p0 U (p1||G(p0))))||(F(p2)&&(p0 U (p1||G(p0))))))))))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Applied a total of 0 rules in 8 ms. Remains 119 /119 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-11 15:11:04] [INFO ] Invariant cache hit.
[2023-03-11 15:11:04] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-11 15:11:04] [INFO ] Invariant cache hit.
[2023-03-11 15:11:04] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 15:11:04] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-11 15:11:04] [INFO ] Invariant cache hit.
[2023-03-11 15:11:04] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 518 ms. Remains : 119/119 places, 119/119 transitions.
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-28a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(AND (EQ s94 1) (EQ s114 1) (EQ s118 1)), p1:(AND (NOT (AND (EQ s18 1) (EQ s87 1))) (EQ s94 1) (EQ s114 1) (EQ s118 1)), p2:(NEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-28a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28a-LTLFireability-00 finished in 1002 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' '!((!p0 U (G(!p0)||((X(p2) U ((p3&&X(p2))||X(G(p2))))&&p1))))'
Support contains 6 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Applied a total of 0 rules in 8 ms. Remains 119 /119 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-11 15:11:05] [INFO ] Invariant cache hit.
[2023-03-11 15:11:05] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-11 15:11:05] [INFO ] Invariant cache hit.
[2023-03-11 15:11:05] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 15:11:05] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2023-03-11 15:11:05] [INFO ] Invariant cache hit.
[2023-03-11 15:11:05] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 527 ms. Remains : 119/119 places, 119/119 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p2), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))]
Running random walk in product with property : GPUForwardProgress-PT-28a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(OR (AND p1 p3 p0) (AND p3 p0 p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND p1 (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p0) p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p3) p0) (AND (NOT p3) p0 p2)), acceptance={} source=2 dest: 3}, { cond=(OR (AND p1 p3 (NOT p0)) (AND p3 (NOT p0) p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=(AND p3 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p3 p0 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p3) p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p3 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 p3 p0), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=5 dest: 3}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}]], initial=5, aps=[p2:(NEQ s99 1), p1:(AND (NEQ s98 1) (NOT (AND (EQ s83 1) (EQ s16 1) (EQ s114 1) (EQ s118 1)))), p0:(AND (EQ s83 1) (EQ s16 1) (EQ s114 1) (EQ s118 1)), p3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 800 ms.
Product exploration explored 100000 steps with 50000 reset in 636 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 380 edges and 119 vertex of which 90 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.3 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0) p3), (X (OR (AND p1 p3 (NOT p0)) (AND p3 (NOT p0) p2))), (X (NOT (AND p1 (NOT p3) p0 (NOT p2)))), (X (NOT (OR (AND p1 p3 p0) (AND p3 p0 p2)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p1 p3 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 (NOT p3) p0))), (X (AND p3 p2)), (X (NOT (OR (AND p1 (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p0) p2)))), (X (NOT (OR (AND p1 (NOT p3) p0) (AND (NOT p3) p0 p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p3 p0 (NOT p2)))), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p3) (NOT p0) (NOT p2)))), (X (NOT (AND p1 p3 p0))), (X (NOT (AND p1 (NOT p3) (NOT p0)))), (X (AND p1 p3 (NOT p0))), (X (X (NOT (AND p1 (NOT p3) p0 (NOT p2))))), (X (X (NOT (OR (AND p1 p3 p0) (AND p3 p0 p2))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), true, (X (X (NOT (AND p1 (NOT p3) p0)))), (X (X (NOT (OR (AND p1 (NOT p3) p0) (AND (NOT p3) p0 p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 p3 p0))))]
False Knowledge obtained : [(X (X (OR (AND p1 p3 (NOT p0)) (AND p3 (NOT p0) p2)))), (X (X (NOT (OR (AND p1 p3 (NOT p0)) (AND p3 (NOT p0) p2))))), (X (X (AND (NOT p3) p2))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (AND p1 p3 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p3 (NOT p0) (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT (AND p3 p2)))), (X (X (OR (AND p1 (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p0) p2)))), (X (X (NOT (OR (AND p1 (NOT p3) (NOT p0)) (AND (NOT p3) (NOT p0) p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p3) (NOT p0)))), (X (X (NOT (AND p1 (NOT p3) (NOT p0))))), (X (X (AND p1 p3 (NOT p0)))), (X (X (NOT (AND p1 p3 (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p2 p1 (NOT p0) p3)
Knowledge based reduction with 32 factoid took 1429 ms. Reduced automaton from 6 states, 23 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-28a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-28a-LTLFireability-02 finished in 3690 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(G(p0))&&G(p1))))'
Support contains 2 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Applied a total of 0 rules in 7 ms. Remains 119 /119 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2023-03-11 15:11:09] [INFO ] Invariant cache hit.
[2023-03-11 15:11:09] [INFO ] Implicit Places using invariants in 134 ms returned []
[2023-03-11 15:11:09] [INFO ] Invariant cache hit.
[2023-03-11 15:11:09] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 15:11:09] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2023-03-11 15:11:09] [INFO ] Invariant cache hit.
[2023-03-11 15:11:09] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 516 ms. Remains : 119/119 places, 119/119 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s94 1), p0:(EQ s90 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28a-LTLFireability-05 finished in 670 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))'
Support contains 3 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Graph (complete) has 380 edges and 119 vertex of which 90 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 27 Pre rules applied. Total rules applied 1 place count 90 transition count 91
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 55 place count 63 transition count 91
Applied a total of 55 rules in 25 ms. Remains 63 /119 variables (removed 56) and now considering 91/119 (removed 28) transitions.
// Phase 1: matrix 91 rows 63 cols
[2023-03-11 15:11:09] [INFO ] Computed 1 place invariants in 9 ms
[2023-03-11 15:11:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-11 15:11:09] [INFO ] Invariant cache hit.
[2023-03-11 15:11:09] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 15:11:09] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-11 15:11:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 15:11:09] [INFO ] Invariant cache hit.
[2023-03-11 15:11:10] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/119 places, 91/119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 ms. Remains : 63/119 places, 91/119 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s59 1) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28a-LTLFireability-06 finished in 345 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((G(!p0)||(!p0&&F(p1))))))'
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Graph (complete) has 380 edges and 119 vertex of which 90 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 27 Pre rules applied. Total rules applied 1 place count 90 transition count 91
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 55 place count 63 transition count 91
Applied a total of 55 rules in 16 ms. Remains 63 /119 variables (removed 56) and now considering 91/119 (removed 28) transitions.
[2023-03-11 15:11:10] [INFO ] Invariant cache hit.
[2023-03-11 15:11:10] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-11 15:11:10] [INFO ] Invariant cache hit.
[2023-03-11 15:11:10] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 15:11:10] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2023-03-11 15:11:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 15:11:10] [INFO ] Invariant cache hit.
[2023-03-11 15:11:10] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/119 places, 91/119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 63/119 places, 91/119 transitions.
Stuttering acceptance computed with spot in 115 ms :[p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : GPUForwardProgress-PT-28a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s36 1), p0:(AND (EQ s49 1) (EQ s59 1) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11992 reset in 701 ms.
Stack based approach found an accepted trace after 2197 steps with 267 reset with depth 20 and stack size 13 in 15 ms.
FORMULA GPUForwardProgress-PT-28a-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GPUForwardProgress-PT-28a-LTLFireability-08 finished in 1118 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))||G(p1)))'
Support contains 4 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Graph (complete) has 380 edges and 119 vertex of which 90 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 26 Pre rules applied. Total rules applied 1 place count 90 transition count 92
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 0 with 52 rules applied. Total rules applied 53 place count 64 transition count 92
Applied a total of 53 rules in 14 ms. Remains 64 /119 variables (removed 55) and now considering 92/119 (removed 27) transitions.
// Phase 1: matrix 92 rows 64 cols
[2023-03-11 15:11:11] [INFO ] Computed 1 place invariants in 6 ms
[2023-03-11 15:11:11] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-11 15:11:11] [INFO ] Invariant cache hit.
[2023-03-11 15:11:11] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 15:11:11] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-11 15:11:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 15:11:11] [INFO ] Invariant cache hit.
[2023-03-11 15:11:11] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 64/119 places, 92/119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 271 ms. Remains : 64/119 places, 92/119 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (NEQ s37 1) (NEQ s60 1) (NEQ s63 1)), p0:(EQ s49 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 213 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-28a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28a-LTLFireability-09 finished in 363 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 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Graph (complete) has 380 edges and 119 vertex of which 90 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 27 Pre rules applied. Total rules applied 1 place count 90 transition count 91
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 0 with 54 rules applied. Total rules applied 55 place count 63 transition count 91
Applied a total of 55 rules in 12 ms. Remains 63 /119 variables (removed 56) and now considering 91/119 (removed 28) transitions.
// Phase 1: matrix 91 rows 63 cols
[2023-03-11 15:11:11] [INFO ] Computed 1 place invariants in 2 ms
[2023-03-11 15:11:11] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-11 15:11:11] [INFO ] Invariant cache hit.
[2023-03-11 15:11:11] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 15:11:11] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2023-03-11 15:11:11] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 15:11:11] [INFO ] Invariant cache hit.
[2023-03-11 15:11:11] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/119 places, 91/119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 63/119 places, 91/119 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-28a-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:(AND (EQ s47 1) (EQ s59 1) (EQ s62 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28a-LTLFireability-10 finished in 352 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(p1)&&F(p2))||p0)))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Applied a total of 0 rules in 7 ms. Remains 119 /119 variables (removed 0) and now considering 119/119 (removed 0) transitions.
// Phase 1: matrix 119 rows 119 cols
[2023-03-11 15:11:11] [INFO ] Computed 29 place invariants in 2 ms
[2023-03-11 15:11:12] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-11 15:11:12] [INFO ] Invariant cache hit.
[2023-03-11 15:11:12] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 15:11:12] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-11 15:11:12] [INFO ] Invariant cache hit.
[2023-03-11 15:11:12] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 481 ms. Remains : 119/119 places, 119/119 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), true]
Running random walk in product with property : GPUForwardProgress-PT-28a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s42 0) (EQ s114 0) (EQ s118 0)), p2:(EQ s46 1), p1:(AND (EQ s112 1) (EQ s114 1) (EQ s118 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 570 ms.
Product exploration explored 100000 steps with 50000 reset in 528 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 380 edges and 119 vertex of which 90 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X (NOT p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-28a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-28a-LTLFireability-14 finished in 1877 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(((p1 U p2)||p0))))'
Support contains 5 out of 119 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 119/119 places, 119/119 transitions.
Graph (complete) has 380 edges and 119 vertex of which 90 are kept as prefixes of interest. Removing 29 places using SCC suffix rule.1 ms
Discarding 29 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 25 Pre rules applied. Total rules applied 1 place count 90 transition count 93
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 0 with 50 rules applied. Total rules applied 51 place count 65 transition count 93
Applied a total of 51 rules in 11 ms. Remains 65 /119 variables (removed 54) and now considering 93/119 (removed 26) transitions.
// Phase 1: matrix 93 rows 65 cols
[2023-03-11 15:11:13] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 15:11:13] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-11 15:11:13] [INFO ] Invariant cache hit.
[2023-03-11 15:11:13] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-11 15:11:13] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-11 15:11:13] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-11 15:11:14] [INFO ] Invariant cache hit.
[2023-03-11 15:11:14] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 65/119 places, 93/119 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 65/119 places, 93/119 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-28a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (NEQ s9 1) (EQ s35 1) (EQ s61 1) (EQ s64 1)), p0:(OR (AND (EQ s35 1) (EQ s61 1) (EQ s64 1)) (AND (EQ s9 1) (EQ s2 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-28a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-28a-LTLFireability-15 finished in 383 ms.
All properties solved by simple procedures.
Total runtime 12076 ms.
ITS solved all properties within timeout

BK_STOP 1678547475066

--------------------
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="GPUForwardProgress-PT-28a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is GPUForwardProgress-PT-28a, 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 r201-smll-167840347300100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-28a.tgz
mv GPUForwardProgress-PT-28a 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 ;