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.r485-tall-167912699100260.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 itstools
Input is Sudoku-PT-AN13, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699100260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 58M
-rw-r--r-- 1 mcc users 806K Feb 26 09:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.6M Feb 26 09:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6M Feb 26 08:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 26 08:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 399K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 934K Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.5M Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3M Feb 26 09:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21M Feb 26 09:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 49K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 120K Feb 25 17:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.2M Mar 5 18:23 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 Sudoku-PT-AN13-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679196971085

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN13
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 03:36:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 03:36:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 03:36:12] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2023-03-19 03:36:12] [INFO ] Transformed 2704 places.
[2023-03-19 03:36:12] [INFO ] Transformed 2197 transitions.
[2023-03-19 03:36:12] [INFO ] Parsed PT model containing 2704 places and 2197 transitions and 8788 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 97 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN13-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN13-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 507 out of 2704 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2704/2704 places, 2197/2197 transitions.
Reduce places removed 2197 places and 0 transitions.
Iterating post reduction 0 with 2197 rules applied. Total rules applied 2197 place count 507 transition count 2197
Applied a total of 2197 rules in 51 ms. Remains 507 /2704 variables (removed 2197) and now considering 2197/2197 (removed 0) transitions.
// Phase 1: matrix 2197 rows 507 cols
[2023-03-19 03:36:17] [INFO ] Computed 38 place invariants in 116 ms
[2023-03-19 03:36:18] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-19 03:36:18] [INFO ] Invariant cache hit.
[2023-03-19 03:36:18] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
[2023-03-19 03:36:18] [INFO ] Invariant cache hit.
[2023-03-19 03:36:19] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 507/2704 places, 2197/2197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1738 ms. Remains : 507/2704 places, 2197/2197 transitions.
Support contains 507 out of 507 places after structural reductions.
[2023-03-19 03:36:20] [INFO ] Flatten gal took : 341 ms
[2023-03-19 03:36:21] [INFO ] Flatten gal took : 330 ms
[2023-03-19 03:36:23] [INFO ] Input system was already deterministic with 2197 transitions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 1485 ms. (steps per millisecond=6 ) properties (out of 13) seen :12
Interrupted Best-First random walk after 5361 steps, including 1 resets, run timeout after 6112 ms. (steps per millisecond=0 ) properties seen 0
Running SMT prover for 1 properties.
[2023-03-19 03:36:30] [INFO ] Invariant cache hit.
[2023-03-19 03:36:37] [INFO ] After 783ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(p0))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 03:36:38] [INFO ] Invariant cache hit.
[2023-03-19 03:36:38] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 03:36:38] [INFO ] Invariant cache hit.
[2023-03-19 03:36:38] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
[2023-03-19 03:36:38] [INFO ] Invariant cache hit.
[2023-03-19 03:36:39] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1411 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-00 finished in 1691 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(!p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 5 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 03:36:39] [INFO ] Invariant cache hit.
[2023-03-19 03:36:39] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-19 03:36:39] [INFO ] Invariant cache hit.
[2023-03-19 03:36:40] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 659 ms to find 0 implicit places.
[2023-03-19 03:36:40] [INFO ] Invariant cache hit.
[2023-03-19 03:36:41] [INFO ] Dead Transitions using invariants and state equation in 658 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1323 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 121 ms :[p0, p0]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], 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][false, false]]
Product exploration timeout after 45660 steps with 22830 reset in 10001 ms.
Product exploration timeout after 46820 steps with 23410 reset in 10002 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-02 finished in 23055 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((F(p1)||p0))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 24 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 03:37:02] [INFO ] Invariant cache hit.
[2023-03-19 03:37:02] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-19 03:37:02] [INFO ] Invariant cache hit.
[2023-03-19 03:37:03] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-19 03:37:03] [INFO ] Redundant transitions in 121 ms returned []
[2023-03-19 03:37:03] [INFO ] Invariant cache hit.
[2023-03-19 03:37:04] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1479 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s82 1) (GEQ s258 1) (GEQ s485 1)) (AND (GEQ s136 1) (GEQ s302 1) (GEQ s383 1)) (AND (GEQ s116 1) (GEQ s285 1) (GEQ s506 1)) (AND (GEQ s48...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 72180 steps with 486 reset in 10001 ms.
Product exploration timeout after 71140 steps with 479 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-03 finished in 24568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G(F(!p0)))))))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 4 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 03:37:27] [INFO ] Invariant cache hit.
[2023-03-19 03:37:27] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-19 03:37:27] [INFO ] Invariant cache hit.
[2023-03-19 03:37:28] [INFO ] Implicit Places using invariants and state equation in 588 ms returned []
Implicit Place search using SMT with State Equation took 679 ms to find 0 implicit places.
[2023-03-19 03:37:28] [INFO ] Invariant cache hit.
[2023-03-19 03:37:28] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1333 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 227 ms :[false, false, false, false, p0, p0]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 150 steps with 0 reset in 24 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-04 finished in 1639 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(G(!p0)))'
Support contains 507 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 12 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 03:37:29] [INFO ] Invariant cache hit.
[2023-03-19 03:37:29] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-19 03:37:29] [INFO ] Invariant cache hit.
[2023-03-19 03:37:29] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2023-03-19 03:37:29] [INFO ] Invariant cache hit.
[2023-03-19 03:37:30] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1293 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (OR (LT s82 1) (LT s258 1) (LT s485 1)) (OR (LT s136 1) (LT s302 1) (LT s383 1)) (OR (LT s116 1) (LT s285 1) (LT s506 1)) (OR (LT s48 1) (LT s218 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 146 steps with 0 reset in 25 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-06 finished in 1461 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))))'
Support contains 6 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 174 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 03:37:30] [INFO ] Invariant cache hit.
[2023-03-19 03:37:31] [INFO ] Implicit Places using invariants in 481 ms returned []
[2023-03-19 03:37:31] [INFO ] Invariant cache hit.
[2023-03-19 03:37:33] [INFO ] Implicit Places using invariants and state equation in 2557 ms returned []
Implicit Place search using SMT with State Equation took 3040 ms to find 0 implicit places.
[2023-03-19 03:37:33] [INFO ] Invariant cache hit.
[2023-03-19 03:37:34] [INFO ] Dead Transitions using invariants and state equation in 659 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3875 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s125 1) (LT s296 1) (LT s476 1) (LT s117 1) (LT s291 1) (LT s403 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]]
Product exploration timeout after 33080 steps with 1273 reset in 10001 ms.
Product exploration timeout after 33200 steps with 1266 reset in 10001 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-08 finished in 24410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((!p0 U (p1||G(!p0))) U p0))))'
Support contains 6 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 60 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 03:37:54] [INFO ] Invariant cache hit.
[2023-03-19 03:37:55] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-19 03:37:55] [INFO ] Invariant cache hit.
[2023-03-19 03:37:57] [INFO ] Implicit Places using invariants and state equation in 2579 ms returned []
Implicit Place search using SMT with State Equation took 3089 ms to find 0 implicit places.
[2023-03-19 03:37:58] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-19 03:37:58] [INFO ] Invariant cache hit.
[2023-03-19 03:37:58] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3928 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), false, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s95 1) (GEQ s271 1) (GEQ s485 1)), p1:(AND (NOT (AND (GEQ s145 1) (GEQ s324 1) (GEQ s496 1))) (NOT (AND (GEQ s95 1) (GEQ s271 1) (GEQ s485 1)...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 158 steps with 1 reset in 25 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-09 finished in 4097 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 51 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 03:37:58] [INFO ] Invariant cache hit.
[2023-03-19 03:37:59] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-19 03:37:59] [INFO ] Invariant cache hit.
[2023-03-19 03:38:03] [INFO ] Implicit Places using invariants and state equation in 3658 ms returned []
Implicit Place search using SMT with State Equation took 4162 ms to find 0 implicit places.
[2023-03-19 03:38:03] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-19 03:38:03] [INFO ] Invariant cache hit.
[2023-03-19 03:38:03] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4899 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s166 1) (LT s328 1) (LT s387 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 75190 steps with 506 reset in 10001 ms.
Product exploration timeout after 75060 steps with 506 reset in 10003 ms.
Computed a total of 507 stabilizing places and 2197 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 507 transition count 2197
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN13-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN13-LTLFireability-10 finished in 25380 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(G(p0)))'
Support contains 3 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 43 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 03:38:24] [INFO ] Invariant cache hit.
[2023-03-19 03:38:24] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-19 03:38:24] [INFO ] Invariant cache hit.
[2023-03-19 03:38:28] [INFO ] Implicit Places using invariants and state equation in 3760 ms returned []
Implicit Place search using SMT with State Equation took 4257 ms to find 0 implicit places.
[2023-03-19 03:38:28] [INFO ] Invariant cache hit.
[2023-03-19 03:38:29] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4922 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s61 1) (GEQ s233 1) (GEQ s503 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 55 steps with 0 reset in 22 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-12 finished in 5053 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((p0||(p1&&G(F(p2))))))'
Support contains 9 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 43 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 03:38:29] [INFO ] Invariant cache hit.
[2023-03-19 03:38:29] [INFO ] Implicit Places using invariants in 488 ms returned []
[2023-03-19 03:38:29] [INFO ] Invariant cache hit.
[2023-03-19 03:38:33] [INFO ] Implicit Places using invariants and state equation in 3360 ms returned []
Implicit Place search using SMT with State Equation took 3852 ms to find 0 implicit places.
[2023-03-19 03:38:33] [INFO ] Invariant cache hit.
[2023-03-19 03:38:33] [INFO ] Dead Transitions using invariants and state equation in 623 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4520 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s151 1) (GEQ s315 1) (GEQ s385 1)), p1:(OR (AND (GEQ s133 1) (GEQ s305 1) (GEQ s419 1)) (AND (GEQ s52 1) (GEQ s226 1) (GEQ s403 1))), p2:(AND...], nbAcceptance=1, 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]]
Stuttering criterion allowed to conclude after 176 steps with 15 reset in 32 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-13 finished in 4746 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((X(p1)||p0)))'
Support contains 6 out of 507 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 507/507 places, 2197/2197 transitions.
Applied a total of 0 rules in 46 ms. Remains 507 /507 variables (removed 0) and now considering 2197/2197 (removed 0) transitions.
[2023-03-19 03:38:34] [INFO ] Invariant cache hit.
[2023-03-19 03:38:34] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-19 03:38:34] [INFO ] Invariant cache hit.
[2023-03-19 03:38:40] [INFO ] Implicit Places using invariants and state equation in 5625 ms returned []
Implicit Place search using SMT with State Equation took 6118 ms to find 0 implicit places.
[2023-03-19 03:38:40] [INFO ] Invariant cache hit.
[2023-03-19 03:38:40] [INFO ] Dead Transitions using invariants and state equation in 635 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6800 ms. Remains : 507/507 places, 2197/2197 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN13-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s68 1) (LT s240 1) (LT s419 1)), p1:(OR (LT s37 1) (LT s205 1) (LT s479 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN13-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN13-LTLFireability-14 finished in 6909 ms.
All properties solved by simple procedures.
Total runtime 148585 ms.

BK_STOP 1679197122266

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="Sudoku-PT-AN13"
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-5348"
echo " Executing tool itstools"
echo " Input is Sudoku-PT-AN13, 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 r485-tall-167912699100260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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