About the Execution of ITS-Tools for DES-PT-01a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1554.628 | 33231.00 | 79274.00 | 300.20 | FFFFFFFTFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r042-smll-165252095700404.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-01a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095700404
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 6.0K Apr 29 15:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 15:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 29 15:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 15:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 32K May 10 09:33 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 DES-PT-01a-LTLFireability-00
FORMULA_NAME DES-PT-01a-LTLFireability-01
FORMULA_NAME DES-PT-01a-LTLFireability-02
FORMULA_NAME DES-PT-01a-LTLFireability-03
FORMULA_NAME DES-PT-01a-LTLFireability-04
FORMULA_NAME DES-PT-01a-LTLFireability-05
FORMULA_NAME DES-PT-01a-LTLFireability-06
FORMULA_NAME DES-PT-01a-LTLFireability-07
FORMULA_NAME DES-PT-01a-LTLFireability-08
FORMULA_NAME DES-PT-01a-LTLFireability-09
FORMULA_NAME DES-PT-01a-LTLFireability-10
FORMULA_NAME DES-PT-01a-LTLFireability-11
FORMULA_NAME DES-PT-01a-LTLFireability-12
FORMULA_NAME DES-PT-01a-LTLFireability-13
FORMULA_NAME DES-PT-01a-LTLFireability-14
FORMULA_NAME DES-PT-01a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652708873112
Running Version 202205111006
[2022-05-16 13:47:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 13:47:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 13:47:55] [INFO ] Load time of PNML (sax parser for PT used): 143 ms
[2022-05-16 13:47:55] [INFO ] Transformed 119 places.
[2022-05-16 13:47:55] [INFO ] Transformed 76 transitions.
[2022-05-16 13:47:55] [INFO ] Found NUPN structural information;
[2022-05-16 13:47:55] [INFO ] Parsed PT model containing 119 places and 76 transitions in 378 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-01a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-01a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 62/62 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 118 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 118 transition count 61
Applied a total of 2 rules in 28 ms. Remains 118 /119 variables (removed 1) and now considering 61/62 (removed 1) transitions.
// Phase 1: matrix 61 rows 118 cols
[2022-05-16 13:47:55] [INFO ] Computed 59 place invariants in 16 ms
[2022-05-16 13:47:56] [INFO ] Implicit Places using invariants in 337 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 397 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 117/119 places, 61/62 transitions.
Applied a total of 0 rules in 7 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 117/119 places, 61/62 transitions.
Support contains 40 out of 117 places after structural reductions.
[2022-05-16 13:47:56] [INFO ] Flatten gal took : 58 ms
[2022-05-16 13:47:56] [INFO ] Flatten gal took : 22 ms
[2022-05-16 13:47:56] [INFO ] Input system was already deterministic with 61 transitions.
Incomplete random walk after 10000 steps, including 405 resets, run finished after 617 ms. (steps per millisecond=16 ) properties (out of 24) seen :22
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:47:57] [INFO ] Computed 58 place invariants in 15 ms
[2022-05-16 13:47:57] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2022-05-16 13:47:57] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2022-05-16 13:47:57] [INFO ] After 134ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-16 13:47:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 17 ms returned sat
[2022-05-16 13:47:57] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2022-05-16 13:47:57] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-16 13:47:57] [INFO ] After 101ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2022-05-16 13:47:57] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 5 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 117/117 places, 61/61 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 59
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 117 transition count 58
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 116 transition count 58
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 11 place count 116 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 115 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 114 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 114 transition count 57
Applied a total of 14 rules in 83 ms. Remains 114 /117 variables (removed 3) and now considering 57/61 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 114/117 places, 57/61 transitions.
Finished random walk after 278 steps, including 5 resets, run visited all 1 properties in 3 ms. (steps per millisecond=92 )
FORMULA DES-PT-01a-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 20 stabilizing places and 15 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:47:58] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-16 13:47:58] [INFO ] Implicit Places using invariants in 283 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 285 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 116/117 places, 61/61 transitions.
Stuttering acceptance computed with spot in 374 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-01a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s48 1) (EQ s65 1)), p0:(AND (EQ s7 1) (EQ s26 1))], 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]]
Stuttering criterion allowed to conclude after 26 steps with 0 reset in 2 ms.
FORMULA DES-PT-01a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLFireability-00 finished in 770 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((F(p0) U p0)&&F(G(p1))))&&F(X(F(p2)))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:47:59] [INFO ] Computed 58 place invariants in 5 ms
[2022-05-16 13:47:59] [INFO ] Implicit Places using invariants in 171 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 116/117 places, 61/61 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : DES-PT-01a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s100 1) (EQ s102 1)), p2:(AND (EQ s7 1) (EQ s26 1)), p1:(OR (EQ s100 0) (EQ s102 0))], 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 16 steps with 0 reset in 1 ms.
FORMULA DES-PT-01a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLFireability-01 finished in 487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(G(F(p0))))))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 117 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 60
Applied a total of 2 rules in 19 ms. Remains 116 /117 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 116 cols
[2022-05-16 13:47:59] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 13:47:59] [INFO ] Implicit Places using invariants in 138 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 140 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/117 places, 60/61 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 115/117 places, 60/61 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-01a-LTLFireability-02 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 s41 1) (EQ s58 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 59 steps with 1 reset in 2 ms.
FORMULA DES-PT-01a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLFireability-02 finished in 259 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X(p0)))))'
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 117 transition count 60
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 60
Applied a total of 2 rules in 8 ms. Remains 116 /117 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 116 cols
[2022-05-16 13:47:59] [INFO ] Computed 58 place invariants in 4 ms
[2022-05-16 13:47:59] [INFO ] Implicit Places using invariants in 132 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/117 places, 60/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 115/117 places, 60/61 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-01a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s43 1) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA DES-PT-01a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLFireability-03 finished in 197 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(G(p0)||p1) U (G(p2) U X(p0))))'
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:48:00] [INFO ] Computed 58 place invariants in 10 ms
[2022-05-16 13:48:00] [INFO ] Implicit Places using invariants in 149 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 163 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 116/117 places, 61/61 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p2)]
Running random walk in product with property : DES-PT-01a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (EQ s105 1) (EQ s110 1)), p1:(AND (EQ s19 1) (EQ s33 1)), p0:(AND (EQ s94 1) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 2 ms.
FORMULA DES-PT-01a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLFireability-04 finished in 418 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(F(X(p0)) U G((F(p1)||p2))))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:48:00] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 13:48:00] [INFO ] Implicit Places using invariants in 190 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 116/117 places, 61/61 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR p2 p1), (OR p2 p1), (OR p1 p2), (OR (AND p0 p2) (AND p0 p1)), p1]
Running random walk in product with property : DES-PT-01a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(OR p2 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s19 1), p1:(AND (EQ s19 1) (EQ s20 1)), p0:(AND (EQ s14 1) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4002 reset in 478 ms.
Product exploration explored 100000 steps with 3985 reset in 352 ms.
Computed a total of 15 stabilizing places and 12 stable transitions
Computed a total of 15 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR p2 p1))), true, (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 670 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 192 ms :[(OR p1 (AND p0 p2)), (OR p1 p2), (OR (AND p0 p2) (AND p0 p1)), p1]
Finished random walk after 1162 steps, including 48 resets, run visited all 5 properties in 20 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1))), (X (NOT (OR p2 p1))), true, (X (X (NOT (OR (AND p2 p0) (AND p1 p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p2) p0 (NOT p1))), (F (OR p2 p1)), (F (OR (AND p2 p0) (AND p0 p1))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 9 factoid took 536 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 189 ms :[(OR p1 (AND p0 p2)), (OR p1 p2), (OR (AND p0 p2) (AND p0 p1)), p1]
Stuttering acceptance computed with spot in 285 ms :[(OR p1 (AND p0 p2)), (OR p1 p2), (OR (AND p0 p2) (AND p0 p1)), p1]
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 116 cols
[2022-05-16 13:48:03] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 13:48:03] [INFO ] Implicit Places using invariants in 330 ms returned []
// Phase 1: matrix 61 rows 116 cols
[2022-05-16 13:48:03] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 13:48:04] [INFO ] Implicit Places using invariants and state equation in 489 ms returned [8, 28, 32, 34, 38, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 94, 111]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 827 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/116 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 93/116 places, 61/61 transitions.
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 221 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 13 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p2 p0) (AND p0 p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (OR (AND p2 p0) (AND p0 p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 442 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 184 ms :[(OR p1 (AND p0 p2)), (OR p1 p2), (OR (AND p0 p2) (AND p0 p1)), p1]
Finished random walk after 577 steps, including 26 resets, run visited all 5 properties in 8 ms. (steps per millisecond=72 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (OR (AND p2 p0) (AND p0 p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (OR (AND p2 p0) (AND p0 p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (OR p2 p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p2) p0 (NOT p1))), (F (OR p2 p1)), (F (OR (AND p2 p0) (AND p0 p1))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 10 factoid took 695 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 202 ms :[(OR p1 (AND p0 p2)), (OR p1 p2), (OR (AND p0 p2) (AND p0 p1)), p1]
Stuttering acceptance computed with spot in 166 ms :[(OR p1 (AND p0 p2)), (OR p1 p2), (OR (AND p0 p2) (AND p0 p1)), p1]
Stuttering acceptance computed with spot in 203 ms :[(OR p1 (AND p0 p2)), (OR p1 p2), (OR (AND p0 p2) (AND p0 p1)), p1]
Product exploration explored 100000 steps with 4002 reset in 197 ms.
Product exploration explored 100000 steps with 4010 reset in 241 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 155 ms :[(OR p1 (AND p0 p2)), (OR p1 p2), (OR (AND p0 p2) (AND p0 p1)), p1]
Support contains 4 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 61/61 transitions.
Graph (complete) has 221 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 1 place count 91 transition count 62
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 91 transition count 62
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 25 places in 0 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 26 place count 91 transition count 62
Deduced a syphon composed of 25 places in 0 ms
Applied a total of 26 rules in 15 ms. Remains 91 /93 variables (removed 2) and now considering 62/61 (removed -1) transitions.
[2022-05-16 13:48:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 62 rows 91 cols
[2022-05-16 13:48:07] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-16 13:48:07] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/93 places, 62/61 transitions.
Finished structural reductions, in 1 iterations. Remains : 91/93 places, 62/61 transitions.
Product exploration explored 100000 steps with 5178 reset in 392 ms.
Product exploration explored 100000 steps with 5160 reset in 290 ms.
Built C files in :
/tmp/ltsmin4557587589622747947
[2022-05-16 13:48:08] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4557587589622747947
Running compilation step : cd /tmp/ltsmin4557587589622747947;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 368 ms.
Running link step : cd /tmp/ltsmin4557587589622747947;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin4557587589622747947;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10224500702490138624.hoa' '--buchi-type=spotba'
LTSmin run took 8189 ms.
FORMULA DES-PT-01a-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01a-LTLFireability-05 finished in 16403 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))||F(X(G(p1)))))'
Support contains 4 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:48:16] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 13:48:16] [INFO ] Implicit Places using invariants in 142 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 144 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 116/117 places, 61/61 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-01a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s2 1) (EQ s32 1)), p0:(AND (EQ s14 1) (EQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 18207 reset in 522 ms.
Product exploration explored 100000 steps with 18203 reset in 530 ms.
Computed a total of 15 stabilizing places and 12 stable transitions
Computed a total of 15 stabilizing places and 12 stable transitions
Detected a total of 15/116 stabilizing places and 12/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 4 factoid took 219 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 331 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 61 rows 116 cols
[2022-05-16 13:48:18] [INFO ] Computed 57 place invariants in 1 ms
[2022-05-16 13:48:19] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-05-16 13:48:19] [INFO ] [Real]Absence check using 34 positive and 23 generalized place invariants in 18 ms returned sat
[2022-05-16 13:48:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:48:19] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2022-05-16 13:48:19] [INFO ] Computed and/alt/rep : 58/171/58 causal constraints (skipped 2 transitions) in 12 ms.
[2022-05-16 13:48:19] [INFO ] Added : 0 causal constraints over 0 iterations in 32 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 116 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 116/116 places, 61/61 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 116 cols
[2022-05-16 13:48:19] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-16 13:48:19] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 61 rows 116 cols
[2022-05-16 13:48:19] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-16 13:48:19] [INFO ] Implicit Places using invariants and state equation in 274 ms returned [8, 28, 34, 38, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 94, 111]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 463 ms to find 22 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/116 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 94/116 places, 61/61 transitions.
Computed a total of 14 stabilizing places and 12 stable transitions
Graph (complete) has 225 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 14 stabilizing places and 12 stable transitions
Detected a total of 14/94 stabilizing places and 12/61 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 4 factoid took 328 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 4 factoid took 373 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 61 rows 94 cols
[2022-05-16 13:48:20] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-16 13:48:20] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2022-05-16 13:48:20] [INFO ] [Real]Absence check using 18 positive and 17 generalized place invariants in 12 ms returned sat
[2022-05-16 13:48:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 13:48:20] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2022-05-16 13:48:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 13:48:21] [INFO ] [Nat]Absence check using 18 positive place invariants in 12 ms returned sat
[2022-05-16 13:48:21] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 15 ms returned sat
[2022-05-16 13:48:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 13:48:21] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2022-05-16 13:48:21] [INFO ] Computed and/alt/rep : 59/135/59 causal constraints (skipped 1 transitions) in 11 ms.
[2022-05-16 13:48:21] [INFO ] Added : 21 causal constraints over 5 iterations in 121 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 18168 reset in 257 ms.
Product exploration explored 100000 steps with 18189 reset in 205 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 61/61 transitions.
Graph (complete) has 225 edges and 94 vertex of which 92 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 92 transition count 62
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 92 transition count 62
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 25 place count 92 transition count 62
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 25 rules in 15 ms. Remains 92 /94 variables (removed 2) and now considering 62/61 (removed -1) transitions.
[2022-05-16 13:48:22] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 62 rows 92 cols
[2022-05-16 13:48:22] [INFO ] Computed 34 place invariants in 12 ms
[2022-05-16 13:48:22] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 92/94 places, 62/61 transitions.
Finished structural reductions, in 1 iterations. Remains : 92/94 places, 62/61 transitions.
Product exploration explored 100000 steps with 18171 reset in 598 ms.
Product exploration explored 100000 steps with 18162 reset in 427 ms.
Built C files in :
/tmp/ltsmin1727684136294175778
[2022-05-16 13:48:23] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1727684136294175778
Running compilation step : cd /tmp/ltsmin1727684136294175778;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 208 ms.
Running link step : cd /tmp/ltsmin1727684136294175778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1727684136294175778;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13953927061814103716.hoa' '--buchi-type=spotba'
LTSmin run took 58 ms.
FORMULA DES-PT-01a-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-01a-LTLFireability-07 finished in 6736 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(((G(X(p1))&&p0)||X(p1)))&&X(G(p2))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:48:23] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 13:48:23] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:48:23] [INFO ] Computed 58 place invariants in 7 ms
[2022-05-16 13:48:24] [INFO ] Implicit Places using invariants and state equation in 257 ms returned [9, 29, 33, 35, 39, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 95, 112]
Discarding 23 places :
Implicit Place search using SMT with State Equation took 474 ms to find 23 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 94/117 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 94 /94 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 94/117 places, 61/61 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-01a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(AND (EQ s1 1) (EQ s32 1) (EQ s34 1)), p1:(AND (EQ s16 1) (EQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], 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 DES-PT-01a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLFireability-08 finished in 649 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U !X((F(!p1)||X(X(p2)))))))'
Support contains 7 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:48:24] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 13:48:24] [INFO ] Implicit Places using invariants in 181 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 198 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 116 /116 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 116/117 places, 61/61 transitions.
Stuttering acceptance computed with spot in 773 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), true, (NOT p1), p2, p2, p2, (NOT p1), p2, (AND (NOT p1) p2), p2, p2, p2, p2, (AND (NOT p1) p2), p2]
Running random walk in product with property : DES-PT-01a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 7}, { cond=(AND p0 p1), acceptance={} source=2 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 9}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=p2, acceptance={} source=6 dest: 3}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 10}, { cond=p1, acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 4}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 10}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 12}, { cond=(AND (NOT p0) p1), acceptance={} source=9 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 14}, { cond=(AND p0 p1), acceptance={} source=9 dest: 15}, { cond=(AND p0 p1), acceptance={0} source=9 dest: 16}], [{ cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 3}, { cond=(AND p1 p2), acceptance={} source=10 dest: 4}], [{ cond=p2, acceptance={} source=11 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=12 dest: 3}, { cond=(AND p1 p2), acceptance={} source=12 dest: 4}, { cond=(AND p1 p2), acceptance={} source=12 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 6}, { cond=(AND p1 p2), acceptance={} source=13 dest: 10}, { cond=(AND p1 p2), acceptance={} source=13 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=14 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=14 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=14 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=14 dest: 7}, { cond=(AND p0 p1 p2), acceptance={} source=14 dest: 8}, { cond=(AND p0 p1 p2), acceptance={0} source=14 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=15 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=15 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=15 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=15 dest: 8}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=16 dest: 10}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=16 dest: 12}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=16 dest: 13}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=16 dest: 14}, { cond=(AND p0 p1 p2), acceptance={} source=16 dest: 15}, { cond=(AND p0 p1 p2), acceptance={0} source=16 dest: 16}]], initial=0, aps=[p0:(OR (AND (EQ s2 1) (EQ s32 1)) (AND (EQ s21 1) (EQ s23 1))), p1:(AND (EQ s21 1) (EQ s23 1)), p2:(AND (EQ s24 1) (EQ s29 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DES-PT-01a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLFireability-10 finished in 1005 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||(F(p2)&&p1))))'
Support contains 6 out of 117 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 117 transition count 60
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 60
Applied a total of 2 rules in 12 ms. Remains 116 /117 variables (removed 1) and now considering 60/61 (removed 1) transitions.
// Phase 1: matrix 60 rows 116 cols
[2022-05-16 13:48:25] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 13:48:25] [INFO ] Implicit Places using invariants in 127 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 128 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/117 places, 60/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 115 /115 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 115/117 places, 60/61 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DES-PT-01a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s19 1), p1:(AND (EQ s67 1) (EQ s83 1)), p2:(AND (EQ s15 1) (EQ s25 1) (EQ s27 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, null][true, true]]
Stuttering criterion allowed to conclude after 44 steps with 3 reset in 0 ms.
FORMULA DES-PT-01a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLFireability-13 finished in 230 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&X(F(p1))&&X(p2))))'
Support contains 5 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Applied a total of 0 rules in 1 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:48:25] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 13:48:25] [INFO ] Implicit Places using invariants in 181 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 188 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 116 /116 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 116/117 places, 61/61 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (OR (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-01a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s7 1), p0:(AND (EQ s19 1) (EQ s20 1)), p2:(AND (EQ s12 1) (EQ s96 1))], 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]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA DES-PT-01a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLFireability-14 finished in 352 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(p1))))'
Support contains 3 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 117 /117 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 117 cols
[2022-05-16 13:48:25] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 13:48:25] [INFO ] Implicit Places using invariants in 209 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 210 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 116/117 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 116/117 places, 61/61 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-01a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s19 1), p1:(AND (EQ s34 1) (EQ s97 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], 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 DES-PT-01a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-01a-LTLFireability-15 finished in 386 ms.
All properties solved by simple procedures.
Total runtime 31073 ms.
BK_STOP 1652708906343
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
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="DES-PT-01a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DES-PT-01a, 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 r042-smll-165252095700404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-01a.tgz
mv DES-PT-01a 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 '
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 ;