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.r487-tall-167912702800228.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Sudoku-PT-AN09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912702800228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 277K Feb 26 09:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 09:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 713K Feb 26 08:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.5M Feb 26 08:52 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 154K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 538K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 322K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 633K Feb 26 09:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 3.1M Feb 26 09:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.6M Feb 26 09:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 7.6M Feb 26 09:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 70K Feb 25 17:16 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 416K 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-AN09-LTLFireability-00
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-01
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-02
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-03
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-04
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-05
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-06
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-07
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-08
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-09
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-10
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-11
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-12
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-13
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-14
FORMULA_NAME Sudoku-PT-AN09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679176530188

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-PT-AN09
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 21:55:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 21:55:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:55:31] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2023-03-18 21:55:31] [INFO ] Transformed 972 places.
[2023-03-18 21:55:31] [INFO ] Transformed 729 transitions.
[2023-03-18 21:55:31] [INFO ] Parsed PT model containing 972 places and 729 transitions and 2916 arcs in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 62 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Sudoku-PT-AN09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN09-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 243 out of 972 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 972/972 places, 729/729 transitions.
Reduce places removed 729 places and 0 transitions.
Iterating post reduction 0 with 729 rules applied. Total rules applied 729 place count 243 transition count 729
Applied a total of 729 rules in 24 ms. Remains 243 /972 variables (removed 729) and now considering 729/729 (removed 0) transitions.
// Phase 1: matrix 729 rows 243 cols
[2023-03-18 21:55:32] [INFO ] Computed 26 place invariants in 51 ms
[2023-03-18 21:55:32] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-18 21:55:32] [INFO ] Invariant cache hit.
[2023-03-18 21:55:32] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-18 21:55:32] [INFO ] Invariant cache hit.
[2023-03-18 21:55:33] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/972 places, 729/729 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 714 ms. Remains : 243/972 places, 729/729 transitions.
Support contains 243 out of 243 places after structural reductions.
[2023-03-18 21:55:33] [INFO ] Flatten gal took : 140 ms
[2023-03-18 21:55:34] [INFO ] Flatten gal took : 128 ms
[2023-03-18 21:55:34] [INFO ] Input system was already deterministic with 729 transitions.
Finished random walk after 72 steps, including 0 resets, run visited all 18 properties in 27 ms. (steps per millisecond=2 )
FORMULA Sudoku-PT-AN09-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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(F(p0)))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:55:35] [INFO ] Invariant cache hit.
[2023-03-18 21:55:35] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-18 21:55:35] [INFO ] Invariant cache hit.
[2023-03-18 21:55:35] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-18 21:55:35] [INFO ] Invariant cache hit.
[2023-03-18 21:55:35] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 426 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s49 1) (GEQ s126 1) (GEQ s166 1)) (AND (GEQ s42 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 6223 ms.
Product exploration explored 100000 steps with 50000 reset in 6207 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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), (X (X p0)), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 61 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-AN09-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLFireability-00 finished in 14855 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&G(F(!p0))))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 13 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:55:49] [INFO ] Invariant cache hit.
[2023-03-18 21:55:49] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-18 21:55:49] [INFO ] Invariant cache hit.
[2023-03-18 21:55:50] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-18 21:55:50] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-18 21:55:50] [INFO ] Invariant cache hit.
[2023-03-18 21:55:50] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 500 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), p0, p0]
Running random walk in product with property : Sudoku-PT-AN09-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s49 1) (GEQ s126 1) (GEQ s166 1)) (AND (GEQ s42 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1418 reset in 3961 ms.
Product exploration explored 100000 steps with 1418 reset in 4060 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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), true, (X (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 5 factoid took 117 ms. Reduced automaton from 4 states, 7 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLFireability-01 finished in 10477 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&&F(G(p1)))) U p1)))'
Support contains 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:56:00] [INFO ] Invariant cache hit.
[2023-03-18 21:56:00] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-18 21:56:00] [INFO ] Invariant cache hit.
[2023-03-18 21:56:00] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-18 21:56:00] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 21:56:00] [INFO ] Invariant cache hit.
[2023-03-18 21:56:00] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 478 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p1), (NOT p1), p0, (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN09-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s49 1) (GEQ s126 1) (GEQ s166 1)) (AND (GEQ s42 1) ...], 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 71 steps with 0 reset in 5 ms.
FORMULA Sudoku-PT-AN09-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLFireability-04 finished in 676 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 243 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:56:01] [INFO ] Invariant cache hit.
[2023-03-18 21:56:01] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-18 21:56:01] [INFO ] Invariant cache hit.
[2023-03-18 21:56:01] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2023-03-18 21:56:01] [INFO ] Invariant cache hit.
[2023-03-18 21:56:01] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Sudoku-PT-AN09-LTLFireability-07 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 (AND (GEQ s57 1) (GEQ s143 1) (GEQ s237 1)) (AND (GEQ s6 1) (GEQ s85 1) (GEQ s204 1)) (AND (GEQ s49 1) (GEQ s126 1) (GEQ s166 1)) (AND (GEQ s42 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]]
Stuttering criterion allowed to conclude after 69 steps with 0 reset in 4 ms.
FORMULA Sudoku-PT-AN09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLFireability-07 finished in 569 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||F(!p1)) U X(X(!p2))))'
Support contains 9 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 44 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:56:01] [INFO ] Invariant cache hit.
[2023-03-18 21:56:01] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-18 21:56:01] [INFO ] Invariant cache hit.
[2023-03-18 21:56:02] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
[2023-03-18 21:56:02] [INFO ] Invariant cache hit.
[2023-03-18 21:56:02] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1010 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 270 ms :[p2, p2, (AND p1 p2), p2, (AND p1 p2), (AND p1 p2), p1]
Running random walk in product with property : Sudoku-PT-AN09-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=p1, acceptance={} source=2 dest: 5}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s96 1) (GEQ s219 1)), p1:(AND (GEQ s47 1) (GEQ s134 1) (GEQ s236 1)), p2:(AND (GEQ s3 1) (GEQ s85 1) (GEQ s201 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 4578 reset in 6903 ms.
Product exploration explored 100000 steps with 4522 reset in 6938 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 p1 p2), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Property proved to be true thanks to knowledge :(F (G (NOT p2)))
Knowledge based reduction with 4 factoid took 338 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLFireability-08 finished in 16935 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G((p1 U p2))))'
Support contains 9 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 24 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:56:18] [INFO ] Invariant cache hit.
[2023-03-18 21:56:18] [INFO ] Implicit Places using invariants in 209 ms returned []
[2023-03-18 21:56:18] [INFO ] Invariant cache hit.
[2023-03-18 21:56:19] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2023-03-18 21:56:19] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-18 21:56:19] [INFO ] Invariant cache hit.
[2023-03-18 21:56:19] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 982 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p2), true, (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : Sudoku-PT-AN09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(OR p2 p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s9 1) (GEQ s93 1) (GEQ s189 1)), p0:(AND (GEQ s62 1) (GEQ s135 1) (GEQ s170 1)), p1:(AND (GEQ s51 1) (GEQ s131 1) (GEQ s213 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 63 steps with 0 reset in 8 ms.
FORMULA Sudoku-PT-AN09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLFireability-10 finished in 1179 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(X(!X(p0))) U !X(!p1)))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 23 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:56:19] [INFO ] Invariant cache hit.
[2023-03-18 21:56:19] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-18 21:56:19] [INFO ] Invariant cache hit.
[2023-03-18 21:56:20] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2023-03-18 21:56:20] [INFO ] Invariant cache hit.
[2023-03-18 21:56:20] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 933 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p1), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-PT-AN09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 0}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(AND (GEQ s4 1) (GEQ s84 1) (GEQ s193 1)), p1:(AND (GEQ s79 1) (GEQ s159 1) (GEQ s223 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 81 steps with 36 reset in 11 ms.
FORMULA Sudoku-PT-AN09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLFireability-11 finished in 1105 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((F(p1)&&p0))||(X(X(!p2)) U ((X(X(!p2))&&G(!p1))||X(X(G(!p2))))))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 8 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:56:20] [INFO ] Invariant cache hit.
[2023-03-18 21:56:21] [INFO ] Implicit Places using invariants in 171 ms returned []
[2023-03-18 21:56:21] [INFO ] Invariant cache hit.
[2023-03-18 21:56:21] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2023-03-18 21:56:21] [INFO ] Invariant cache hit.
[2023-03-18 21:56:21] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 890 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 421 ms :[(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (AND (NOT p1) p2), (AND (NOT p0) p1 p2), (AND (NOT p0) p1 p2), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p1) p2), (AND p1 (NOT p0) p2), (OR (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : Sudoku-PT-AN09-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 7}], [{ cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=3 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) p1 p2), acceptance={0, 1} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 9}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 9}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=8 dest: 11}], [{ cond=(NOT p0), acceptance={0, 1} source=9 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(NOT p1), acceptance={0, 1} source=10 dest: 10}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (GEQ s71 1) (GEQ s150 1) (GEQ s224 1)), p1:(AND (GEQ s13 1) (GEQ s90 1) (GEQ s166 1)), p2:(AND (GEQ s71 1) (GEQ s150 1) (GEQ s224 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 103 steps with 15 reset in 10 ms.
FORMULA Sudoku-PT-AN09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN09-LTLFireability-12 finished in 1349 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U !p1))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 24 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:56:22] [INFO ] Invariant cache hit.
[2023-03-18 21:56:22] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-18 21:56:22] [INFO ] Invariant cache hit.
[2023-03-18 21:56:22] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 686 ms to find 0 implicit places.
[2023-03-18 21:56:22] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-18 21:56:22] [INFO ] Invariant cache hit.
[2023-03-18 21:56:23] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 941 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 57 ms :[p1, p0]
Running random walk in product with property : Sudoku-PT-AN09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s29 1) (GEQ s114 1) (GEQ s218 1)), p0:(AND (GEQ s39 1) (GEQ s118 1) (GEQ s174 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1463 reset in 3812 ms.
Product exploration explored 100000 steps with 1461 reset in 3805 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 p1 p0), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 3 factoid took 249 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-AN09-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLFireability-13 finished in 10300 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 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 729/729 transitions.
Applied a total of 0 rules in 15 ms. Remains 243 /243 variables (removed 0) and now considering 729/729 (removed 0) transitions.
[2023-03-18 21:56:32] [INFO ] Invariant cache hit.
[2023-03-18 21:56:32] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-18 21:56:32] [INFO ] Invariant cache hit.
[2023-03-18 21:56:33] [INFO ] Implicit Places using invariants and state equation in 525 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2023-03-18 21:56:33] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-18 21:56:33] [INFO ] Invariant cache hit.
[2023-03-18 21:56:33] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 951 ms. Remains : 243/243 places, 729/729 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s73 1) (LT s156 1) (LT s190 1)), p0:(AND (GEQ s73 1) (GEQ s156 1) (GEQ s190 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3987 reset in 6828 ms.
Product exploration explored 100000 steps with 4010 reset in 6982 ms.
Computed a total of 243 stabilizing places and 729 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 243 transition count 729
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 (NOT p1) p0), true, (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Sudoku-PT-AN09-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Sudoku-PT-AN09-LTLFireability-14 finished in 16646 ms.
All properties solved by simple procedures.
Total runtime 77579 ms.
ITS solved all properties within timeout

BK_STOP 1679176610531

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Sudoku-PT-AN09"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Sudoku-PT-AN09, 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 r487-tall-167912702800228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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