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-167912699200276.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-AN15, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699200276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 68M
-rw-r--r-- 1 mcc users 1.8M Feb 26 10:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 8.2M Feb 26 10:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3M Feb 26 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 11M Feb 26 08:57 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 434K Feb 25 17:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 17:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.4M Feb 25 17:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 5.0M Feb 25 17:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.3M Feb 26 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 5.7M Feb 26 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1M Feb 26 10:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 23M Feb 26 10:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 25K Feb 25 17:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 64K 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.9M 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-AN15-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN15-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679199427927

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-AN15
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 04:17:09] [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 04:17:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 04:17:09] [INFO ] Load time of PNML (sax parser for PT used): 186 ms
[2023-03-19 04:17:09] [INFO ] Transformed 4050 places.
[2023-03-19 04:17:09] [INFO ] Transformed 3375 transitions.
[2023-03-19 04:17:09] [INFO ] Parsed PT model containing 4050 places and 3375 transitions and 13500 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 149 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-PT-AN15-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN15-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 675 out of 4050 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4050/4050 places, 3375/3375 transitions.
Reduce places removed 3375 places and 0 transitions.
Iterating post reduction 0 with 3375 rules applied. Total rules applied 3375 place count 675 transition count 3375
Applied a total of 3375 rules in 65 ms. Remains 675 /4050 variables (removed 3375) and now considering 3375/3375 (removed 0) transitions.
// Phase 1: matrix 3375 rows 675 cols
[2023-03-19 04:17:14] [INFO ] Computed 44 place invariants in 177 ms
[2023-03-19 04:17:14] [INFO ] Implicit Places using invariants in 421 ms returned []
[2023-03-19 04:17:14] [INFO ] Invariant cache hit.
[2023-03-19 04:17:15] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
[2023-03-19 04:17:15] [INFO ] Invariant cache hit.
[2023-03-19 04:17:16] [INFO ] Dead Transitions using invariants and state equation in 1136 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 675/4050 places, 3375/3375 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2445 ms. Remains : 675/4050 places, 3375/3375 transitions.
Support contains 675 out of 675 places after structural reductions.
[2023-03-19 04:17:18] [INFO ] Flatten gal took : 536 ms
[2023-03-19 04:17:20] [INFO ] Flatten gal took : 518 ms
[2023-03-19 04:17:23] [INFO ] Input system was already deterministic with 3375 transitions.
Finished random walk after 197 steps, including 0 resets, run visited all 19 properties in 396 ms. (steps per millisecond=0 )
FORMULA Sudoku-PT-AN15-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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' '!(G(F(p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 29 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 04:17:24] [INFO ] Invariant cache hit.
[2023-03-19 04:17:24] [INFO ] Implicit Places using invariants in 118 ms returned []
[2023-03-19 04:17:24] [INFO ] Invariant cache hit.
[2023-03-19 04:17:25] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 862 ms to find 0 implicit places.
[2023-03-19 04:17:25] [INFO ] Redundant transitions in 204 ms returned []
[2023-03-19 04:17:25] [INFO ] Invariant cache hit.
[2023-03-19 04:17:27] [INFO ] Dead Transitions using invariants and state equation in 1112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2216 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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 195 steps with 0 reset in 53 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-01 finished in 2563 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)||F(G(p1)))))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 6 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 04:17:27] [INFO ] Invariant cache hit.
[2023-03-19 04:17:27] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-19 04:17:27] [INFO ] Invariant cache hit.
[2023-03-19 04:17:28] [INFO ] Implicit Places using invariants and state equation in 728 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
[2023-03-19 04:17:28] [INFO ] Invariant cache hit.
[2023-03-19 04:17:29] [INFO ] Dead Transitions using invariants and state equation in 1015 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1858 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 47400 steps with 239 reset in 10003 ms.
Product exploration timeout after 47080 steps with 237 reset in 10002 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 p0), (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 4 factoid took 130 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN15-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLFireability-02 finished in 27903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 22 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 04:17:55] [INFO ] Invariant cache hit.
[2023-03-19 04:17:55] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-19 04:17:55] [INFO ] Invariant cache hit.
[2023-03-19 04:17:56] [INFO ] Implicit Places using invariants and state equation in 717 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
[2023-03-19 04:17:56] [INFO ] Redundant transitions in 93 ms returned []
[2023-03-19 04:17:56] [INFO ] Invariant cache hit.
[2023-03-19 04:17:57] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1986 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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 194 steps with 0 reset in 42 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-03 finished in 2171 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))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 8 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 04:17:57] [INFO ] Invariant cache hit.
[2023-03-19 04:17:57] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-19 04:17:57] [INFO ] Invariant cache hit.
[2023-03-19 04:17:58] [INFO ] Implicit Places using invariants and state equation in 762 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
[2023-03-19 04:17:58] [INFO ] Invariant cache hit.
[2023-03-19 04:17:59] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1949 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-04 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:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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]]
Product exploration timeout after 31780 steps with 15890 reset in 10002 ms.
Product exploration timeout after 31670 steps with 15835 reset in 10001 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 65 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-AN15-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLFireability-04 finished in 25375 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((F(G((F(p2)||p1)))&&p0)))'
Support contains 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 21 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 04:18:22] [INFO ] Invariant cache hit.
[2023-03-19 04:18:22] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-19 04:18:22] [INFO ] Invariant cache hit.
[2023-03-19 04:18:23] [INFO ] Implicit Places using invariants and state equation in 743 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2023-03-19 04:18:23] [INFO ] Redundant transitions in 142 ms returned []
[2023-03-19 04:18:23] [INFO ] Invariant cache hit.
[2023-03-19 04:18:24] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2079 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 557 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s81 1) (LT s310 1) (LT s606 1)) (OR (LT s185 1) (LT s412 1) (LT s560 1)) (OR (LT s161 1) (LT s376 1) (LT s476 1)) (OR (LT s146 1) (LT s365...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 397 steps with 1 reset in 94 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-05 finished in 2807 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 675 out of 675 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 23 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 04:18:25] [INFO ] Invariant cache hit.
[2023-03-19 04:18:25] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-19 04:18:25] [INFO ] Invariant cache hit.
[2023-03-19 04:18:26] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2023-03-19 04:18:26] [INFO ] Redundant transitions in 140 ms returned []
[2023-03-19 04:18:26] [INFO ] Invariant cache hit.
[2023-03-19 04:18:27] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2099 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 42 ms :[p0]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s81 1) (GEQ s310 1) (GEQ s606 1)) (AND (GEQ s185 1) (GEQ s412 1) (GEQ s560 1)) (AND (GEQ s161 1) (GEQ s376 1) (GEQ s476 1)) (AND (GEQ s14...], 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 48640 steps with 245 reset in 10003 ms.
Product exploration timeout after 48020 steps with 242 reset in 10001 ms.
Computed a total of 675 stabilizing places and 3375 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 675 transition count 3375
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 : [p0, (X p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 3 factoid took 274 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-AN15-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN15-LTLFireability-06 finished in 25517 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(p1)&&X(G(p2))&&p0)))'
Support contains 9 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 167 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 04:18:51] [INFO ] Invariant cache hit.
[2023-03-19 04:18:51] [INFO ] Implicit Places using invariants in 690 ms returned []
[2023-03-19 04:18:51] [INFO ] Invariant cache hit.
[2023-03-19 04:18:55] [INFO ] Implicit Places using invariants and state equation in 3590 ms returned []
Implicit Place search using SMT with State Equation took 4326 ms to find 0 implicit places.
[2023-03-19 04:18:55] [INFO ] Invariant cache hit.
[2023-03-19 04:18:56] [INFO ] Dead Transitions using invariants and state equation in 1409 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5904 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 263 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s84 1) (GEQ s309 1) (GEQ s594 1)), p1:(AND (GEQ s134 1) (GEQ s356 1) (GEQ s629 1)), p2:(AND (GEQ s8 1) (GEQ s232 1) (GEQ s563 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 5 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-08 finished in 6195 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((X(p1)&&p0))) U (G(!p2)&&F(p1))))'
Support contains 6 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 112 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 04:18:57] [INFO ] Invariant cache hit.
[2023-03-19 04:18:58] [INFO ] Implicit Places using invariants in 721 ms returned []
[2023-03-19 04:18:58] [INFO ] Invariant cache hit.
[2023-03-19 04:19:01] [INFO ] Implicit Places using invariants and state equation in 3387 ms returned []
Implicit Place search using SMT with State Equation took 4135 ms to find 0 implicit places.
[2023-03-19 04:19:01] [INFO ] Invariant cache hit.
[2023-03-19 04:19:02] [INFO ] Dead Transitions using invariants and state equation in 1056 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5326 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p1) p2), (OR (NOT p0) (NOT p1)), p2, (NOT p1), true, (AND (NOT p1) p0), (AND p2 p0), (AND p2 p0 (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p0), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 p0), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}], [{ cond=(AND p2 p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 6}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s168 1) (GEQ s391 1) (GEQ s468 1)), p1:(AND (GEQ s202 1) (GEQ s425 1) (GEQ s532 1)), p0:(AND (GEQ s168 1) (GEQ s391 1) (GEQ s468 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 62 steps with 13 reset in 48 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-09 finished in 5692 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 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 122 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 04:19:03] [INFO ] Invariant cache hit.
[2023-03-19 04:19:03] [INFO ] Implicit Places using invariants in 695 ms returned []
[2023-03-19 04:19:03] [INFO ] Invariant cache hit.
[2023-03-19 04:19:07] [INFO ] Implicit Places using invariants and state equation in 3417 ms returned []
Implicit Place search using SMT with State Equation took 4128 ms to find 0 implicit places.
[2023-03-19 04:19:07] [INFO ] Invariant cache hit.
[2023-03-19 04:19:08] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5383 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-11 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 s133 1) (GEQ s348 1) (GEQ s508 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 151 steps with 0 reset in 46 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-11 finished in 5557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((G(p1)||p0)))&&F(p2)))'
Support contains 6 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 126 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 04:19:08] [INFO ] Invariant cache hit.
[2023-03-19 04:19:09] [INFO ] Implicit Places using invariants in 677 ms returned []
[2023-03-19 04:19:09] [INFO ] Invariant cache hit.
[2023-03-19 04:19:12] [INFO ] Implicit Places using invariants and state equation in 3366 ms returned []
Implicit Place search using SMT with State Equation took 4072 ms to find 0 implicit places.
[2023-03-19 04:19:12] [INFO ] Invariant cache hit.
[2023-03-19 04:19:13] [INFO ] Dead Transitions using invariants and state equation in 1042 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5267 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 829 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s120 1) (GEQ s345 1) (GEQ s450 1)), p0:(OR (LT s64 1) (LT s290 1) (LT s529 1)), p1:(AND (OR (LT s120 1) (LT s345 1) (LT s450 1)) (OR (LT s64 ...], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-12 finished in 6124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0&&X(G(p1))) U G(p0)))'
Support contains 6 out of 675 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 675/675 places, 3375/3375 transitions.
Applied a total of 0 rules in 94 ms. Remains 675 /675 variables (removed 0) and now considering 3375/3375 (removed 0) transitions.
[2023-03-19 04:19:14] [INFO ] Invariant cache hit.
[2023-03-19 04:19:15] [INFO ] Implicit Places using invariants in 678 ms returned []
[2023-03-19 04:19:15] [INFO ] Invariant cache hit.
[2023-03-19 04:19:18] [INFO ] Implicit Places using invariants and state equation in 3347 ms returned []
Implicit Place search using SMT with State Equation took 4062 ms to find 0 implicit places.
[2023-03-19 04:19:18] [INFO ] Invariant cache hit.
[2023-03-19 04:19:19] [INFO ] Dead Transitions using invariants and state equation in 1078 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5257 ms. Remains : 675/675 places, 3375/3375 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : Sudoku-PT-AN15-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s26 1) (GEQ s244 1) (GEQ s521 1)), p1:(AND (GEQ s153 1) (GEQ s382 1) (GEQ s558 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 51 steps with 0 reset in 24 ms.
FORMULA Sudoku-PT-AN15-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN15-LTLFireability-14 finished in 5429 ms.
All properties solved by simple procedures.
Total runtime 130738 ms.

BK_STOP 1679199564785

--------------------
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-AN15"
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-AN15, 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-167912699200276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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